Erdős Problem 30: Sidon sets in {1,…,N} have size √N + O(N^ε)Open Problem
A set of integers is a Sidon set if all of its pairwise sums () are different. Sidon, in connection with Fourier analysis, asked how dense such sets can be, and the question became one of the standard problems of additive combinatorics. Let