Erdős problem 156
Does there exist a maximal Sidon set of size ?
Sources
FormalConjectures/ErdosProblems/
156.lean
Retained formal statement
It is easy to prove that the greedy construction of a maximal Sidon set in has size .
(fun N => ↑N ^ (1 / 3)) =O[Filter.atTop] fun N => ↑(Finset.greedySidonBelow N).cardSolvedStatement only, no proof