On the size of finite Sidon sequences
On the size of finite Sidon sequences
Let <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="h greater-than-or-equal-to 2"> <mml:semantics> <mml:mrow> <mml:mi>h</mml:mi> <mml:mo>≥<!-- ≥ --></mml:mo> <mml:mn>2</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">h \geq 2</mml:annotation> </mml:semantics> </mml:math> </inline-formula> be an integer. A set of positive integers <italic>B</italic> is called a <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper B Subscript h"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msub> <mml:mi>B</mml:mi> <mml:mi>h</mml:mi> </mml:msub> …