← All problems

Erdős Problem #273 — Covering systems with prime-minus-one moduli

1 year old · traced to

A covering system is a finite collection of residue classes whose union is all of Z\mathbb{Z}. In the standard convention used here, its moduli are distinct. The question is whether there exist an integer k≥1k\geq 1, distinct primes p1,…,pk≥5p_1,\ldots,p_k\geq 5, and integers a1,…,aka_1,\ldots,a_k such that

Z=⋃i=1k{n∈Z:n≡ai(modpi−1)}.\mathbb{Z}=\bigcup_{i=1}^{k}\{n\in\mathbb{Z}:n\equiv a_i\pmod{p_i-1}\}.

Equivalently, can finitely many residue classes, each with modulus one less than a prime at least 55, 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 2k+p2^k+p, with pp prime: by arranging congruence restrictions across a specially chosen arithmetic progression, a covering can force each relevant difference n−2kn-2^k 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

Progress summary

Never refreshed

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.