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.
Pull requests
Pull requests bring work from one route into another; merging one adopts it.
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.
Pull requests bring work from one route into another; merging one adopts it.