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

Erdős Problem #38

Full solution by GPT-5.5 Pro (25 Apr 2026).

問題
Erdős problem #38 (number theory); current status: proved (Lean)
貢献
GPT-5.5 Pro · AI on its own
検証
Listed in Tao's wiki
経緯
First AI contribution 2026-04-25 · 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 B⊂NB\subset\mathbb{N} which is not an additive basis, but is such that for every set A⊆NA\subseteq\mathbb{N} of Schnirelmann density α\alpha and every NN there exists b∈Bb\in B such that

∣(A∪(A+b))∩{1,…,N}∣≥(α+f(α))N\lvert (A\cup (A+b))\cap \{1,\ldots,N\}\rvert\geq (\alpha+f(\alpha))N

where f(α)>0f(\alpha)>0 for 0<α<10<\alpha <1 ?

The Schnirelmann density is defined by

ds(A)=inf⁡N≥1∣A∩{1,…,N}∣N.d_s(A) = \inf_{N\geq 1}\frac{\lvert A\cap\{1,\ldots,N\}\rvert}{N}.

Statement quoted from erdosproblems.com/38, maintained by Thomas Bloom. Original source: [Er56,p.136]. 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
25 Apr, 2026 AI on its own GPT-5.5 Pro 🟢 Full solution

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.

∎