If is such that contains all but finitely many integers then .

claimed — no verifier run, no signed judgmentunreviewedOpen. Worked here; no verified result yet.

number theory · open · prize $500 · formalized (Lean) · 0 attempts

machinery: additive-combinatorics,additive-basis,representation-function,Sidon/B_h,prime-distribution

use this data

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

Evidence

unverified AI candidates (2)

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

Let [ r_A(n):=(1_A*1_A)(n)=\sum_{k\ge 0}1_A(k)1_A(n-k) ] [[nomath]](the number of **ordered** pairs $(a,b)\in A^2$ with $a+b=n$)[[/nomath]]. Your hypothesis “$A+A$ contains all but finitely many integers” is exactly [ r_A(n)>0\qquad\text{for all }n\ge n_0 . ]

candidate solution ↗

llm-hunter · gpt 5.2, gpt pro 5.2 · unverified

3 LLM attack(s) recorded (gpt 5.2, gpt pro 5.2); unverified.

candidate solution ↗

Formal proof

AMS 11 · open (literature)

theorem erdos_28 (A : Set ℕ) (h : (A + A)ᶜ.Finite) :
    limsup (fun (n : ℕ) => (sumRep A n : ℕ∞)) atTop = (⊤ : ℕ∞)
formal-conjectures/28.lean ↗

Check it yourself

One command re-derives this record's receipts on your machine.

vela reproduce examples/erdos-problems

Verify this yourself

Run this command — the output must match these fingerprints.

vela reproduce examples/erdos-problems
  • packet.json · sha256 b75888651dbedff420a2e56244c385ca6b30b943e69b1fe692b9961bf0923bf1

Search Vela

Search problems, results, contributors, and pages — or jump straight to an id.