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$ ?

No current result

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

Retained declaration

FormalConjectures/ErdosProblems/868.lean

Formal Conjectures

FormalConjectures/ErdosProblems/868.leanErdos868.erdos_868.parts.i5 linesExact file

1False ↔2  ∀ (A : Set ℕ),3    A.IsAsymptoticAddBasisOfOrder 2 →4      Filter.Tendsto (fun n => Erdos868.ncard_add_repr A 2 n) Filter.atTop Filter.atTop →5        ∃ B ⊆ A, B.IsAsymptoticAddBasisOfOrder 2 ∧ ∀ b ∈ B, ¬(B \ {b}).IsAsymptoticAddBasisOfOrder 2

SolvedStatement only, no proof

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

AI building on literature
Erdős AI contributions wiki · 13 Jan, 2026
Machine
GPT-5.2 multi-agent system
Open the source record

Continue

Start a contribution Browse the source files Open the collection entry

No current result

Reported activity

Continue

Search problems.science