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

Erdős Problem #351

Full solution by Kevin Barreto and Liam Price with GPT-5.5 Pro (3 May 2026).

問題
Erdős problem #351 (number theory, complete sequences); current status: proved (Lean)
貢献
Kevin Barreto and Liam Price with GPT-5.5 Pro · AI working with humans
検証
Listed in Tao's wiki
経緯
First AI contribution 2026-05-03 · 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 p(x)∈Q[x]p(x)\in \mathbb{Q}[x] with positive leading coefficient. Is it true that

A={p(n)+1/n:n∈N}A=\{ p(n)+1/n : n\in \mathbb{N}\}

is strongly complete, in the sense that, for any finite set BB,

{∑n∈Xn:X⊆A\B finite }\left\{\sum_{n\in X}n : X\subseteq A\backslash B\textrm{ finite }\right\}

contains all sufficiently large integers?

Statement quoted from erdosproblems.com/351, maintained by Thomas Bloom. Original source: [ErGr80,p.58]. 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
3 May, 2026 AI working with humans GPT-5.5 Pro Kevin Barreto, Liam Price 🟢 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.

∎