加入
Covering systems with odd moduli
Find a finite set of congruences with distinct odd moduli that covers every integer, or prove that none exists.
PR
PR 把工作从一条路线带到另一条；合并它就是采纳。
没有开放的 PR
PR 把工作从一个分支带到另一个分支。
新建 PR
Find a finite set of congruences with distinct odd moduli that covers every integer, or prove that none exists.
PR 把工作从一条路线带到另一条；合并它就是采纳。
PR 把工作从一个分支带到另一个分支。