Erdős problem 30
How large can a Sidon set be?
A Sidon set is a set of integers whose pairwise sums a + b are all different. If h(N) is the largest size of a Sidon set inside {1, ..., N}, is h(N) = √N + O(N^ε) for every ε > 0?
Erdős's prize: $1,000 (history)Open on erdosproblems.com