Erdős Problem 7 asks whether residue classes modulo finitely many distinct odd integers greater than one can cover the integers. The conjecture asserts that they cannot. The problem also appears in Wikipedia’s list of conjectures by Paul Erdős.
Status as of 2026-11-20
Hough and Nielsen prove that some modulus of every distinct covering system is divisible by 2 or 3. Balister, Bollobás, Morris, Sahasrabudhe and Tiba prove that the least common multiple is divisible by one of 2, 9 or 15, and their squarefree theorem rules out all-odd distinct systems with squarefree moduli. Dai, Li, Li and Yi strengthen the all-odd condition to divisibility of the least common multiple by 45 and show that some modulus is at most 9. Their least-common-multiple result permits the factors 9 and 5 to come from different moduli.
- Hough and Nielsen, Covering systems with restricted divisibility
- Balister et al., On the Erdős covering problem: the density of the uncovered set
- Balister et al., The Erdős covering problem for squarefree moduli
- Dai et al., On the moduli of distinct covering systems
The published odd coverings in which a modulus repeats fall outside the conjecture. The recent rank and prime-divisor exclusions have support restrictions. The detailed research ledger also identifies a gap in the global nonexistence claim on Zenodo involving passage from local coverage to reuse of prime powers. I found no proof of the unrestricted statement in these sources.
- Bispels et al., Odd covering systems with one repeated modulus
- Schroeder, Odd distinct covering systems require at least nine prime divisors
- Research ledger and assessment of the global nonexistence claim
- Global nonexistence claim
Removing the moduli divisible by 45 from the comparison
Use the CRT space of the prime-power factors of the least common multiple. At each prime , delete the pure -power classes from the reference measure on that coordinate. Their union has uniform measure at most . The resulting measure has density at most relative to uniform. A mixed class with largest prime and fixed earlier coordinates therefore covers at most of the new reference fiber. Let count the mixed classes at that stage whose earlier-coordinate conditions are active.
For a distortion threshold with , Dai et al.'s conditional probability and convex comparison lemmas give a stage loss at most
Here the independent comparison exponent at each previous prime has tail for , where . The variable counts the eligible predecessor cofactors other than 1 with all exponents within . Indeed, the union bound on the new fiber gives , and the one-coordinate nesting inequality for the hinge loss allows each required earlier residue to be replaced by the corresponding nested condition on . The pure power case gives and .
If every modulus avoids divisibility by 45, then . The choice gives no comparison loss at 5 and . For the eligible powers of 3 and 5 have either no factor of 5 or at most one factor of 3. Thus
where the product is over primes. This gives an explicit comparison for the proposed restriction, including arbitrary prime-power heights. The mean of the first factor is under the stated thresholds. With , the comparison loss at 7 alone is therefore .
A trial with fixed small-prime thresholds and approximately thereafter used up the full comparison budget before reaching the tail. This trial does not bound the optimum over threshold choices. It also discards the actual residue compatibility between cofactors. In particular, a single cofactor containing 3 but no 9 can be assigned to only one of the two residue branches left when a class modulo 3 is removed. The comparison assigns the full divisor count to both branches separately. Using one joint choice across these branches and the 5-coordinate could improve the bound. The current estimate proves neither that an individual modulus must be divisible by 45 nor the conjecture.