Erdős problem 454
Is it true that limsup (fun n => (f n - 2 * n.nth Prime : ℕ∞)) atTop = ⊤?
Sources
FormalConjectures/ErdosProblems/
454.lean
Retained formal statement
limsup (fun n => (f n - 2 * n.nth Prime : ℕ∞)) atTop ≥ 2, and this is proved in [Po79].
2 ≤ Filter.limsup (fun n => ↑(Erdos454.f n) - 2 * ↑(Nat.nth Prime n)) Filter.atTopSolvedStatement only, no proof