erdős #868
If is an additive basis of order , and as , then must contain a minimal additive basis of order ? (i.e. such that deleting any element creates infinitely many )What if (for all large , for arbitrary fixed )?
Worked, still open.
number theory · solved · formalized (Lean) · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
Write the (unordered) representation function as [ r_A(n):=|\\{(a,a')\in A^2:\ a\le a',\ a+a'=n\\}|. ] Then (1_A*1_A(n)) counts **ordered** pairs, so [ r_A(n)\ \le\ 1_A*1_A(n)\ \le\ 2,r_A(n) ] (up to the diagonal), and in particular “(\to\infty)” and “(\gg \log n)” are unaffected by switching between these two conventi…
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗formal
AMS 5 11 · solved (literature)
theorem erdos_868.parts.i :
answer(False) ↔ ∀ (A : Set ℕ), A.IsAsymptoticAddBasisOfOrder 2 →
atTop.Tendsto (fun n => ncard_add_repr A 2 n) atTop → ∃ B ⊆ A,
B.IsAsymptoticAddBasisOfOrder 2 ∧ ∀ b ∈ B, ¬(B \ {b}).IsAsymptoticAddBasisOfOrder 2formal-conjectures/868.lean ↗links
by Larsen and Larsen · paper
status
solved