← All problems

Erdős Problem #7 — Covering systems with all moduli odd

69 years old · traced to

Many further unsolved problems can be asked about covering systems. Selfridge and I asked: Is there a covering system all whose moduli are odd?

Equivalent formulations
  1. Many further unsolved problems can be asked about covering systems. Selfridge and I asked: Is there a covering system all whose moduli are odd?

    source: P. Erdős, Some of my favourite problems in number theory, combinatorics, and geometry, Resenhas IME-USP 2 (1995), 165-186.

References

P. Erdős, Some of my favourite problems in number theory, combinatorics, and geometry, Resenhas IME-USP 2 (1995), 165-186.

Source: P. Erdős, Some of my favourite problems in number theory, combinatorics, and geometry, Resenhas IME-USP 2 (1995), 165-186.

Progress summary

Refreshed
Open · progress reported

The question remains open: a new computer-checked result only shows that any example would need a very large common period.

Erdős and Selfridge asked whether the integers can be covered by finitely many residue classes with distinct, odd moduli greater than 11. The unrestricted question remains unanswered.

Known results

  • Hough and Nielsen proved that at least one modulus is divisible by 22 or 33.
  • Balister, Bollobás, Morris, Sahasrabudhe, and Tiba ruled out the case of odd squarefree moduli.
  • The same authors showed that any odd covering would have least common multiple divisible by 99 or 1515.
  • McNew and Setty classified covering numbers up to 10610^6.

It verifies known partial mathematics and does not prove nonexistence. A separate repository claims a resolution, but its stated theorem only establishes the same lower bound.

Current status (as of July 2026): The problem is open; the strongest supplied recent progress is a formally verified lower bound exceeding 10410^4 for the least common multiple of any hypothetical covering.

Sources

Solutions 0

No solutions have been posted yet.