Join
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.
Comparing changes
Choose two branches to see what changed, then open a pull request to bring the work across.
Pick two different branches
A pull request can go from any branch into any other.