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?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

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:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:a56733d792e1fc6b5b702c81aca74ab5262f3b65e4e1870dd5eda874d7e8f159
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb