Erdős problem 302
Let be the size of the largest such that there are no solutions to with distinct ? Estimate .
Sources
FormalConjectures/ErdosProblems/
302.lean
Retained formal statement
Wouter van Doorn has proved [va25] that
∀ (f : ℕ → ℕ), (∀ (N : ℕ), Erdos302.IsMaxNoTripleCard N (f N)) → ∀ (ε : ℝ), 0 < ε → ∀ᶠ (N : ℕ) in Filter.atTop, ↑(f N) ≤ (9 / 10 + ε) * ↑NSolvedStatement only, no proof