Erdős problem 279
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 ?
No current result
No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.
Retained declaration
FormalConjectures/ErdosProblems/279.leanTrue ↔ ∀ k ≥ 3, ∃ a N, (∀ (p : ℕ), Nat.Prime p → a p < p) ∧ ∀ n ≥ N, ∃ p, ∃ t ≥ k, Nat.Prime p ∧ n = a p + t * pOpenStatement only, no proof