Erdős problem 868 · problems.science

Let $A$ be an additive basis of order $2$ , let $f(n)$ denote the number of ways in which $n$ can be written as the sum of two elements from $A$ . If $f(n) > \epsilon \log n$ for large $n$ and an arbitrary fixed $\epsilon > 0$ , then must $A$ contain a minimal additive basis of order $2$ ?

Sources

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

4 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

868.lean

Retained formal statement3 of 4

Erdős and Nathanson proved that this is true if $f(n) > (\log \frac{4}{3})^{-1} \log n$ for all large $n$ .

FormalConjectures/ErdosProblems/868.leanErdos868.erdos_868.variants.fixed_ε5 linesExact file

1True ↔2  ∀ (A : Set ℕ),3    A.IsAsymptoticAddBasisOfOrder 2 →4      (∀ᶠ (n : ℕ) in Filter.atTop, (Real.log (4 / 3))⁻¹ * Real.log ↑n < ↑(Erdos868.ncard_add_repr A 2 n)) →5        ∃ B ⊆ A, B.IsAsymptoticAddBasisOfOrder 2 ∧ ∀ b ∈ B, ¬(B \ {b}).IsAsymptoticAddBasisOfOrder 2

SolvedStatement only, no proof

Sources

Search problems.science