← All problems

Erdős Problem #279 — Coverings by shifted prime progressions

46 years old · traced to

Let k≥3k\geq 3. Is there a choice of congruence classes ap(modp)a_p\pmod{p} for every prime pp such that all sufficiently large integers can be written as ap+tpa_p+tp for some prime pp and integer t≥kt\geq k? Equivalently, with the notation of the question, is there a threshold NN such that every integer n≥Nn\geq N admits a prime pp and an integer t≥kt\geq k with

n=ap+tp?n=a_p+tp?

Erdős Problem #279

Here pp ranges over the primes and ap(modp)a_p\pmod p denotes the selected congruence class. The original wording uses apa_p in the equality without specifying a representative convention for that class; the question is retained in its original notation. Erdős Problem #279

Background

This is a covering-congruence question: one selects a residue class for each prime and asks whether the resulting progressions, with the additional lower bound on the coefficient tt, contain every sufficiently large integer. The problem page cites its source as [ErGr80, p. 29] and notes that even the case k=3k=3 appears difficult. Erdős Problem #279

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.