この記事の日本語版はまだありません。英語版を表示しています。

Erdős Problem #326

Full solution by Aron Bhalla with Aristotle, Codex and GPT-5.5, formalized in Lean (14 Jun 2026).

問題
Erdős problem #326 (number theory, additive basis); current status: open
貢献
Aron Bhalla with Aristotle, Codex and GPT-5.5 · AI working with humans
検証
Lean formalizationListed in Tao's wiki
経緯
First AI contribution 2026-06-14 · wiki data as of 2026-06-30
出典
Problem page (erdosproblems.com)Tao's AI-contributions wiki
完全解Per Tao's AI-contributions wiki

The problem

Does there exist A={a1<a2<⋯ }⊂NA=\{a_1<a_2<\cdots\}\subset \mathbb{N} which is a minimal basis of order 22 (i.e. every large integer is the sum of 22 elements from AA, and no proper subset of AA has this property), such that

lim⁡k→∞akk2=c\lim_{k\to \infty}\frac{a_k}{k^2}=c

for some c≠0c\neq 0?

Statement quoted from erdosproblems.com/326, maintained by Thomas Bloom. Original source: [ErGr80,p.47]. Current status there: open.

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
20 May-14 Jun, 2026 AI working with humans Aristotle, Codex, GPT-5.5 Aron Bhalla 🟢 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.

∎