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
Let be the size of the largest such that there are no solutions to with distinct ? Estimate .
The colouring version of this is [303], which was solved by Brown and Rödl [BrRo91].
∀ (f : ℕ → ℕ), (∀ (N : ℕ), Erdos302.IsMaxNoTripleCard N (f N)) → Filter.Tendsto (fun N => ↑(f N) / ↑N) Filter.atTop (nhds sorry)OpenStatement only, no proof