Skip to content

Erdős problem 32

Does there exist a set A⊆NA \subseteq \mathbb{N} such that ∣A∩{1,…,N}∣=o((log⁡N)2)|A \cap \{1, \ldots, N\}| = o((\log N)^2) and every sufficiently large integer can be written as p+ap + a for some prime pp and a∈Aa \in A?

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:86730df05dd2135cc5855e1724723c569cd4eece65dbad032488c037e279247b
Metadata
sha256:eb769149eaa7de379ead196e1aacf1a091700863040b185d2eedb85a4a4d23c2
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:cb10b99d2da8faa4f5d175f3df4d0698cacd9150620a4b28bd9352a405a14c45
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb