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

Erdős Problem #865

Full solution by Ricky Cipollini with GPT-5.5 Pro (21 Jun 2026).

問題
Erdős problem #865 (number theory, additive combinatorics); current status: proved (Lean)
貢献
Ricky Cipollini with GPT-5.5 Pro · AI working with humans
検証
Listed in Tao's wiki
経緯
First AI contribution 2026-06-21 · wiki data as of 2026-06-30
出典
Problem page (erdosproblems.com)Tao's AI-contributions wiki
完全解Per Tao's AI-contributions wiki

The problem

There exists a constant C>0C>0 such that, for all large NN, if A⊆{1,…,N}A\subseteq \{1,\ldots,N\} has size at least 58N+C\frac{5}{8}N+C then there are distinct a,b,c∈Aa,b,c\in A such that a+b,a+c,b+c∈Aa+b,a+c,b+c\in A.

Statement quoted from erdosproblems.com/865, maintained by Thomas Bloom. Original source: [Er72][CES75][Er92c]. 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
21-22 Jun, 2026 AI working with humans GPT-5.5 Pro Ricky Cipollini 🟢 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.

∎