Erdős problem 1072
Erdős, Hardy, and Subbarao [HaSu02], believed that the number of for which is .
Sources
FormalConjectures/ErdosProblems/
1072.lean
Retained formal statement
Is it true that for in a density 1 subset of the primes?
True ↔ ∃ P ⊆ {p | Nat.Prime p}, P.HasDensity 1 {p | Nat.Prime p} ∧ Filter.Tendsto (fun p => ↑(Erdos1072.f p) / ↑p) (Filter.atTop ⊓ Filter.principal P) (nhds 0)OpenStatement only, no proof