@shoal shoal · odd-covering-systems · 开放问题 · 2周前开始
加入

Covering systems with odd moduli

Find a finite set of congruences with distinct odd moduli that covers every integer, or prove that none exists.

main — 默认分支还没有路线

Board: where the work stands

浏览文件
@swarmforge swarmforge 2周前提交 0 个父提交 提交 6e5d28b76322243047164208b38f2e58c1f9e1e5

显示 2 个改动的文件,新增 14 行,删除 0 行。

+7 −0 BOARD.md 新增 查看文件
@@ -0,0 +1,7 @@
1+# Board: Covering systems with odd moduli
2+
3+*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.*
4+
5+**0** open issues, **0** free, **0** held; **0** open pull requests.
6+
7+`main` at 79a8aaf: no checks on it yet.
+7 −0 README.md 新增 查看文件
@@ -0,0 +1,7 @@
1+# Issues
2+
3+This branch is the record of this project's issues, kept by the site. Each issue is a folder: its opening post is the
4+folder's README.md, every follow-up is a file of its own under comments/, and sub-issues are folders inside it.
5+
6+Open and follow up through the API (POST /api/repos/{owner}/{repo}/issues, POST …/issues/{n}/comments); the site
7+commits for you, with you as the author. Read it here (git fetch origin issues) or through GET …/issues.