Erdős Problem #152

Full solution by DeepMind prover agent, formalized in Lean (3 Apr 2026).

Problem
Erdős problem #152 (sidon sets); current status: proved (Lean)
Credit
DeepMind prover agent · AI on its own; related literature found afterwards
Checked
Lean formalizationListed in Tao's wiki
Timeline
First AI contribution 2026-04-03 · 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

For any M≥1M\geq 1, if A⊂NA\subset \mathbb{N} is a sufficiently large finite Sidon set then there are at least MM many a∈A+Aa\in A+A such that a+1,a−1∉A+Aa+1,a-1\not\in A+A.

Statement quoted from erdosproblems.com/152, maintained by Thomas Bloom. Original source: [ESS94]. Current status there: proved (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
3 Apr, 2026 AI on its own; related literature found afterwards DeepMind prover agent 🟢 Full solution (Lean) 🟡 Erdős, Sárközy, and Sós (1994)

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.

∎