Erdős problem 375
Is Erdos375Prop true?
Sources
FormalConjectures/ErdosProblems/
375.lean
Retained formal statement
If Erdos375Prop is true, then (n + 1).nth Prime - n.nth Prime < (n.nth Prime) ^ (1 / 2 - c) for some c > 0.
Erdos375.Erdos375Prop → ∃ c > 0, ∀ᶠ (n : ℕ) in Filter.atTop, ↑(Nat.nth Nat.Prime (n + 1)) - ↑(Nat.nth Nat.Prime n) < ↑(Nat.nth Nat.Prime n) ^ (1 / 2 - c)SolvedStatement only, no proof