Erdős problem 32 · problems.science

Does there exist a set $A \subseteq \mathbb{N}$ such that $|A \cap \{1, \ldots, N\}| = o((\log N)^2)$ and every sufficiently large integer can be written as $p + a$ for some prime $p$ and $a \in A$ ?

Sources

Browse retained paths and inspect the exact material available for this Problem.

5 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

32.lean

Retained formal statement2 of 5

Must every additive complement $A$ to the primes satisfy $\liminf_{N \to \infty} \frac{|A \cap \{1, \ldots, N\}|}{\log N} > 1$ ?

FormalConjectures/ErdosProblems/32.leanErdos32.erdos_32.variants.liminf_gt_one3 linesExact file

1∀ (A : Set ℕ),2  Erdos32.IsAdditiveComplementToPrimes A →3    1 < Filter.liminf (fun N => ↑{x ∈ Finset.Icc 1 N | x ∈ A}.card / ↑(Real.log ↑N)) Filter.atTop

SolvedStatement only, no proof

Sources

Search problems.science