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

Erdős Problem #330

Full solution by David Turturean with GPT-5.5 Pro (24 Apr 2026).

問題
Erdős problem #330 (number theory, additive basis); current status: proved (Lean)
貢献
David Turturean with GPT-5.5 Pro · AI working with humans
検証
Listed in Tao's wiki
経緯
First AI contribution 2025-12-19 · 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 minimal basis with positive density, say A⊂NA\subset\mathbb{N}, such that for any n∈An\in A the (upper) density of integers which cannot be represented without using nn is positive?

Statement quoted from erdosproblems.com/330, maintained by Thomas Bloom. Original source: [Er80,p.100][ErGr80,p.50]. 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 Humans Outcome
19 Dec, 2025 Literature search ChatGPT Deep research, Claude, Gemini Deep Research — 🔴 Partial results found with inaccuracies; literature proof not found
24 Apr, 2026 AI working with humans GPT-5.5 Pro David Turturean 🟢 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.

∎