Erdős problem 3
If has , then must A contain arbitrarily long arithmetic progressions?
Sources
FormalConjectures/ErdosProblems/
3.lean
Retained formal statement
If has , then must A contain arbitrarily long arithmetic progressions?
True ↔ ∀ (A : Set ℕ), (¬Summable fun a => 1 / ↑↑a) → ∃ᶠ (k : ℕ) in Filter.atTop, ∃ S ⊆ A, S.IsAPOfLength ↑kOpenStatement only, no proof