Erdős Problem a Daythe open tracker

Erdős Problem #947

PROVED LEANdatabase updated 2026-02-02

The statement as posed is true, and a proof exists. 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).

There is no exact covering system - that is, a finite collection of congruence classes \(a_i\pmod{n_i}\) with distinct \(n_i\) such that every integer satisfies exactly one of these congruence classes. This is true, and was proved independently by Mirsky and Newman and by Davenport and Rado; the Mirsky–Newman proof first appeared in [Er50]. See also [Er77c]. A `StrictCoveringSystem ℤ` is a finite family of congruence classes with distinct moduli \(n_i \geq 2\) covering \(\mathbb{Z}\); the trivial exact covering system consisting of the single class \(0 \pmod 1\) is therefore excluded.
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved. The authoritative wording is on erdosproblems.com/947.
Prizenone
Topicsnumber theory, covering systems
Statement in LeanFormal Conjectures
Solution in Leanyes
Original pageerdosproblems.com/947
NOBODY HAS SENT US AN ATTEMPT YET

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.