Erdős Problem #847

GPT-5.2 Pro found that the problem had already been solved in the literature (19 Jan 2026).

Problem
Erdős problem #847 (additive combinatorics); current status: disproved (Lean)
Credit
GPT-5.2 Pro · Literature search
Checked
Listed in Tao's wiki
Timeline
First AI contribution 2026-01-19 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
PRIOR
ART
Per Tao's AI-contributions wiki

The problem

Let A⊂NA\subset \mathbb{N} be an infinite set for which there exists some ϵ>0\epsilon>0 such that in any subset of AA of size nn there is a subset of size at least ϵn\epsilon n which contains no three-term arithmetic progression.

Is it true that AA is the union of a finite number of sets which contain no three-term arithmetic progression?

Statement quoted from erdosproblems.com/847, maintained by Thomas Bloom. Original source: [Er92b]. Current status there: disproved (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
19 Jan, 2026 Literature search GPT-5.2 Pro 🟢 Full solution found

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.

∎