Skip to content

Erdős problem 340

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ε|A \cap \{1, \ldots, N\}| \gg N^{1/2 - \varepsilon} for all ε>0\varepsilon > 0 and large NN?

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:85e8386d4400894ff0fe0150c5481bcb22c47fe0cbe9aa2be921d8c156abb73c
Metadata
sha256:33623f15b7ef8412747bafc4922ccfe80f7dcb5cf7728eb2ce54ff79ed589ded
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:a56733d792e1fc6b5b702c81aca74ab5262f3b65e4e1870dd5eda874d7e8f159
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page