Erdős Problem #7
Can there be a finite covering system of the integers with distinct moduli, all of which are odd and greater than $1$?
number-theory / Number Theory, Covering Systems
Can there be a finite covering system of the integers with distinct moduli, all of which are odd and greater than $1$?
Temporal state
No reconciled state yet.
Append-only history
Can there be a finite covering system of the integers with distinct moduli, all of which are odd and greater than $1$?
Research memory
Can there be a finite covering system of the integers with distinct moduli, all of which are odd and greater than $1$?
The claimed Lean proof that no such covering system exists was withdrawn after audit: its central axiom asserted that a product of factors greater than one is less than one, and a statement-fidelity audit confirmed the gap. The problem remains open.
Evidence graph
No public relationships recorded yet.