The board / number theory / #7
Erdős Problem #7
VERIFIABLEdatabase updated 2025-08-31
Still open — but if it is true, a finite example proves it, so a computer search could in principle prove it. A search can't disprove it.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
Is there a covering system all of whose moduli are odd (and greater than 1)?
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research open. The authoritative wording is on erdosproblems.com/7.Prizenone
Topicsnumber theory, covering systems
Statement in LeanFormal Conjectures
Solution in Leanno
Original pageerdosproblems.com/7
Attempts
submit one →Read our working report →
Live page status “VERIFIABLE - $25”; current workers are listed as duckmerc and Aurelien_Col, so the mandatory no-collision rule forbids an attempt.
SKIPPED