Erdős Problem #333

Claude Opus 4.5 and GPT-5.2 Pro produced a solution (25 Dec 2025), but a comparable result was already in the literature: Erdős and Newman (1977). 2 AI contributions are recorded in all.

Problem
Erdős problem #333 (number theory, additive basis); current status: disproved (Lean)
Credit
Claude Opus 4.5 and GPT-5.2 Pro · AI on its own; related literature found afterwards
Checked
Lean formalizationListed in Tao's wiki
Timeline
First AI contribution 2025-12-25 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
PRIOR
ART
Per Tao's AI-contributions wiki

The problem

Let A⊆NA\subseteq \mathbb{N} be a set of density zero. Does there exist a BB such that A⊆B+BA\subseteq B+B and

∣B∩{1,…,N}∣=o(N1/2)\lvert B\cap \{1,\ldots,N\}\rvert =o(N^{1/2})

for all large NN?

Statement quoted from erdosproblems.com/333, maintained by Thomas Bloom. Original source: [ErGr80]. Current status there: disproved (Lean).

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 Outcome Literature
25 Dec, 2025 AI on its own; related literature found afterwards Claude Opus 4.5, GPT-5.2 Pro 🟢 Full solution (Lean) 🟢 Erdős and Newman (1977)
25 Dec, 2025 Literature search GPT-5.2 Pro 🔴 Incorrect proof claimed; literature proof not found —
1 Feb, 2026 Literature search Aletheia 🟢 Full solution found —

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.

∎