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
In particular, is ?
This is false: it is contradicted by Cambie's lower bound of recorded below, since .
∀ (f : ℕ → ℕ), (∀ (N : ℕ), Erdos302.IsMaxNoTripleCard N (f N)) → ¬Filter.Tendsto (fun N => ↑(f N) / ↑N) Filter.atTop (nhds (1 / 2))SolvedStatement only, no proof