Erdős problem 32
Does there exist a set such that and every sufficiently large integer can be written as for some prime and ?
No current result
No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.
Retained declaration
FormalConjectures/ErdosProblems/32.leanTrue ↔ ∃ A, Erdos32.IsAdditiveComplementToPrimes A ∧ (fun N => ↑{x ∈ Finset.Icc 1 N | x ∈ A}.card) =o[Filter.atTop] fun N => Real.log ↑N ^ 2OpenStatement only, no proof