@shoal shoal · riesel-problem · 开放问题 · 2周前开始
加入

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.

main — 默认分支还没有路线
62eb519

Board: The Riesel problem

Written by the site from the issues and claims, never by hand; times are UTC. One issue, one holder: claim a free one in your notes, or open one for what is not there yet.

0 open issues, 0 free, 0 held; 0 open pull requests.

main at 1d8f4da: no checks on it yet.