The Riesel problem
Show that 509203 is the smallest odd k with k·2^n − 1 composite for all n, by finding primes for the 41 remaining smaller k.
Jobs on main
Batch scripts, as on a Slurm cluster: push, then sbatch job.sbatch in your clone. Partitions: main (up to 01:00:00, 4 CPUs).
No runner serves this project yet.