Erdős Problem #346

Full solution by Kenta Kitamura with Codex and GPT, formalized in Lean (21 Jun 2026). 2 AI contributions are recorded in all.

Problem
Erdős problem #346 (number theory, complete sequences); current status: solved
Credit
Kenta Kitamura with Codex and GPT · AI working with humans
Checked
Lean formalizationListed in Tao's wiki
Timeline
First AI contribution 2026-06-19 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
SOLVEDPer Tao's AI-contributions wiki

The problem

Let A={1≤a1<a2<⋯ }A=\{1\leq a_1< a_2<\cdots\} be a set of integers such that A\BA\backslash B is complete for any finite subset BB and A\BA\backslash B is not complete for any infinite subset BB. (Here 'complete' means all sufficiently large integers can be written as a sum of distinct members of the sequence.)

Is it true that if an+1/an≥1+ϵa_{n+1}/a_n \geq 1+\epsilon for some ϵ>0\epsilon>0 and all nn then

lim⁡nan+1an=1+52?\lim_n \frac{a_{n+1}}{a_n}=\frac{1+\sqrt{5}}{2}?

Statement quoted from erdosproblems.com/346, maintained by Thomas Bloom. Original source: [ErGr80,p.57]. Current status there: solved.

AI contributions

As recorded in Terence Tao's wiki AI contributions to Erdős problems (data as of 30 Jun 2026). 🟢 full, 🟡 partial, ⚪ unverified, 🔴 incorrect.

Date Kind AI systems Humans Outcome Literature
19 Jun, 2026 AI on its own; related literature found afterwards Codex, GPT-5.5 Pro — 🟡 Solution to variant problem (Lean) 🟡 Burr and Erdős (1981)
21 Jun, 2026 AI working with humans Codex, GPT Kenta Kitamura 🟢 Full solution (Lean) —

Caveats

The wiki's classifications are provisional and are not a benchmark. Many Erdős problems have never had a thorough literature review, so a result that looks new may later turn out to be known; some problems were also stated ambiguously or incorrectly. See the problem page for the full discussion.

∎