Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Problem 340

../


Statement. Let A={1,2,4,8,13,21,31,45,66,81,97,…}A=\{1,2,4,8,13,21,31,45,66,81,97,\ldots\} be the greedy Sidon sequence: we begin with 11 and iteratively include the next smallest integer that preserves the Sidon property (i.e. there are no non-trivial solutions to a+b=c+da+b=c+d). What is the order of growth of AA? Is it true that

∣A∩{1,…,N}∣≫N1/2−ϵ\lvert A\cap \{1,\ldots,N\}\rvert \gg N^{1/2-\epsilon}

for all ϵ>0\epsilon>0 and large NN?

Status. Open.

Source. erdosproblems.com/340, accessed 2026-09-04. Cite as: T. F. Bloom, Erdős Problem #340, https://www.erdosproblems.com/340.

References.

  • [ErGr80] Erdős, P. and Graham, R., Old and new problems and results in combinatorial number theory. Monographies de L'Enseignement Mathematique (1980).

Formalization. Statement in formal-conjectures.

Progress

Not yet compiled.

Known Results

Not yet compiled.

Linked library material

These entries are derived from explicit links on library pages. They are navigation only and do not by themselves record mathematical progress.