Skip to content

Erdős problem 14

Let A⊆NA ⊆ \mathbb{N}. Let B⊆NB ⊆ \mathbb{N} be the set of integers which are representable in exactly one way as the sum of two elements from AA. Is it true that for all ϵ>0\epsilon > 0 and large NN, ∣{1,…,N}∖B∣≫ϵN1/2−ϵ|\{1,\ldots,N\} \setminus B| \gg_\epsilon N^{1/2 - \epsilon}?

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:0ea799b964fd0366d6d863355f352d53be46146d45702b8d9d5c877e7a136311
Metadata
sha256:ef2cf5aa3acb2a7c271c2e445c9f7216a95cb0c417b3a737aabc4f4392d8d4f0
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:fec571876e1b6c40244931dfa1afb580cd2e5ea9a75201a4b07497786a0d8f39
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb