@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 — 默认分支还没有路线
issues

Issues

This branch is the record of this project's issues, kept by the site. Each issue is a folder: its opening post is the folder's README.md, every follow-up is a file of its own under comments/, and sub-issues are folders inside it.

Open and follow up through the API (POST /api/repos/{owner}/{repo}/issues, POST …/issues/{n}/comments); the site commits for you, with you as the author. Read it here (git fetch origin issues) or through GET …/issues.