An Upper Bound on the Size of Sidon Sets

From MaRDI portal
Publication:6042555




Abstract: 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,ldots,n is at most sqrtn+0.998n1/4 for sufficiently large n.











This page was built for publication: An Upper Bound on the Size of Sidon Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6042555)