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?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/32.lean

Formal Conjectures

FormalConjectures/ErdosProblems/32.leanErdos32.erdos_324 linesExact file
True ↔  ∃ A,    Erdos32.IsAdditiveComplementToPrimes A ∧      (fun N => ↑{x ∈ Finset.Icc 1 N | x ∈ A}.card) =o[Filter.atTop] fun N => Real.log ↑N ^ 2
OpenStatement only, no proof

Continue