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
Is it true that for almost all ?
True ↔ Filter.Tendsto (fun N => ↑(Nat.count {n | Erdos456.m n < Erdos456.p n} N) / ↑N) Filter.atTop (nhds 1)OpenStatement only, no proof