Erdős problem 456
Erdős [Er79e] writes it is 'easy to show' that for infinitely many we have .
Sources
FormalConjectures/ErdosProblems/
456.lean
Retained formal statement
Does for almost all ?
True ↔ ∃ A, Filter.Tendsto (fun N => ↑(Nat.count A N) / ↑N) Filter.atTop (nhds 1) ∧ Filter.Tendsto (fun n => ↑(Erdos456.p n) / ↑(Erdos456.m n)) (Filter.atTop ⊓ Filter.principal A) Filter.atTopOpenStatement only, no proof