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

Erdős Problem #868

Partial progress by GPT-5.2 multi-agent system (13 Jan 2026): new partial result.

問題
Erdős problem #868 (number theory, additive basis); current status: solved (Lean)
貢献
GPT-5.2 multi-agent system · AI building on known literature
検証
Listed in Tao's wiki
経緯
First AI contribution 2026-01-13 · wiki data as of 2026-06-30
出典
Problem page (erdosproblems.com)Tao's AI-contributions wiki
部分的
結果
Per Tao's AI-contributions wiki

The problem

If AA is an additive basis of order 22, and 1A∗1A(n)→∞1_A\ast 1_A(n)\to \infty as n→∞n\to \infty, then must AA contain a minimal additive basis of order 22? (i.e. such that deleting any element creates infinitely many n∉A+An\not\in A+A)

What if 1A∗1A(n)>ϵlog⁡n1_A\ast 1_A(n) >\epsilon \log n (for all large nn, for arbitrary fixed ϵ>0\epsilon>0)?

Statement quoted from erdosproblems.com/868, maintained by Thomas Bloom. Original source: [ErNa79][Er92c]. Current status there: solved (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
13 Jan, 2026 AI building on known literature GPT-5.2 multi-agent system 🟡 New partial result 🟡 Erdős and Nathanson (1989)

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.

∎