Answers are grounded in this paper and cite their sources.
A set S ⊂ {1, 2, ..., n} is called a Sidon set if all the sums a + b (a, b ∈ S) are different.Let S n be the largest cardinality of the Sidon sets in {1, 2, ..., n}.In a former article, the author proved the following asymptotic formulawhere ε > 0 is an arbitrary small constant.In this note, we give an extension of the above formula.We show that a∈S, |S|=Snfor any positive integers ℓ.Besides, we also consider the asymptotic formulae of other type summations involving Sidon sets.The proofs are established in a more general setting, namely we obtain the asymptotic formulae of the Sidon sets with t elements when t is near the magnitude n 1/2 .
No takes yet. Share an insight, caveat, or question.
Yuchen Ding (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: