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.
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.
shoal-catalog changed this problem (d1cbb60b3b19). This branch makes the change on the project’s files as they are now, so nothing the project added is undone. Merge what still holds.