Erdős Problem #273 — Covering systems with prime-minus-one moduli
A covering system is a finite collection of residue classes whose union is all of . In the standard convention used here, its moduli are distinct. The question is whether there exist an integer , distinct primes , and integers such that
Equivalently, can finitely many residue classes, each with modulus one less than a prime at least , cover every integer? Erdős Problem #273 On covering systems of integers (arXiv:1705.04372)
Background
Erdős introduced covering systems in 1950. They arose in connection with questions about the distribution of numbers of the form , with prime: by arranging congruence restrictions across a specially chosen arithmetic progression, a covering can force each relevant difference to have a small prime factor. The present question imposes a particular arithmetic form on the moduli, rather than merely asking whether some finite set of moduli can support a cover. On covering systems of integers (arXiv:1705.04372)
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.