Erdős Problem #279 — Coverings by shifted prime progressions
Let . Is there a choice of congruence classes for every prime such that all sufficiently large integers can be written as for some prime and integer ? Equivalently, with the notation of the question, is there a threshold such that every integer admits a prime and an integer with
Here ranges over the primes and denotes the selected congruence class. The original wording uses 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 , contain every sufficiently large integer. The problem page cites its source as [ErGr80, p. 29] and notes that even the case appears difficult. Erdős Problem #279
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.