An upper bound on the size of Sidon sets

03/29/2021

∙

by   József Balogh, et al.

∙

0

∙

share

In this entry point into the subject, combining two elementary proofs, we decrease the gap between the upper and lower bounds by 0.2% in a classical combinatorial number theory problem. We show that the maximum size of a Sidon set of { 1, 2, …, n} is at most √(n)+ 0.998n^1/4 for sufficiently large n.