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

Erdős Problem #12

Partial progress by DeepMind prover agent (7 Apr 2026): partial result (Lean) (solutions to first part and second part). 2 AI contributions are recorded in all.

問題
Erdős problem #12 (number theory); current status: open
貢献
DeepMind prover agent · AI building on known literature
検証
Lean formalizationListed in Tao's wiki
経緯
First AI contribution 2026-04-07 · wiki data as of 2026-06-30
出典
Problem page (erdosproblems.com)Tao's AI-contributions wiki
部分的
結果
Per Tao's AI-contributions wiki

The problem

Let AA be an infinite set such that there are no distinct a,b,c∈Aa,b,c\in A such that a∣(b+c)a\mid (b+c) and b,c>ab,c>a. Is there such an AA with

lim inf⁡∣A∩{1,…,N}∣N1/2>0?\liminf \frac{\lvert A\cap\{1,\ldots,N\}\rvert}{N^{1/2}}>0?

Does there exist some absolute constant c>0c>0 such that there are always infinitely many NN with

∣A∩{1,…,N}∣<N1−c?\lvert A\cap\{1,\ldots,N\}\rvert<N^{1-c}?

Is it true that

∑n∈A1n<∞?\sum_{n\in A}\frac{1}{n}<\infty?

Statement quoted from erdosproblems.com/12, maintained by Thomas Bloom. Original source: [ErSa70][Er73][Er75b][Er77c][Er80,p.113][Er92c][Er95c][Er97][Er97b][Er97e][Er98]. 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 Literature
7 Apr, 2026 AI building on known literature DeepMind prover agent — 🟡 Partial result (Lean) (solutions to first part and second part) 🟡 Erdős and Sárközy (1970)
7 Apr, 2026 AI working with humans GPT-5.4 Thinking Nat Sothanaphan, Terence Tao 🟡 Partial result —

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.

∎