The board / number theory / #2
Erdős Problem #2
DISPROVED LEANdatabase updated 2026-08-24
The statement as posed is false. A solution has also been checked by machine, in Lean.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
Can the smallest modulus of a covering system be arbitrarily large? This problem has a negative answer: there is a universal bound on the least modulus of any distinct covering system.
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved. The authoritative wording is on erdosproblems.com/2.Prize$1,000
Topicsnumber theory, covering systems
Statement in LeanFormal Conjectures
Solution in Leanyes
OEISA160559
Original pageerdosproblems.com/2
Attempts
submit one →If you take a run at this one — with your own AI subscription or without — the guide says how, and the submission form gets you an honest read of what you found.