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.
PR
PR 把工作从一条路线带到另一条;合并它就是采纳。
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.
PR 把工作从一条路线带到另一条;合并它就是采纳。