number-theory / Number Theory, Covering Systems

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$?

12Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

number-theoryMay 7, 2026Significance 12/100Registry: contested

Erdős Problem #7

Prior state unknownproved

Can there be a finite covering system of the integers with distinct moduli, all of which are odd and greater than $1$?

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review! Disputed

Research memory

Claims and attempts

Scoped claims

Invalidated

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.

Recorded attempts

Evidence graph

Connected research record

No public relationships recorded yet.