Erdős Problem #788

Partial progress by GPT-5.2 Pro (20 Jan 2026): new partial result.

Problem
Erdős problem #788 (additive combinatorics); current status: open
Credit
GPT-5.2 Pro · AI building on known literature
Checked
Listed in Tao's wiki
Timeline
First AI contribution 2025-10-14 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
PARTIALPer Tao's AI-contributions wiki

The problem

Let f(n)f(n) be maximal such that if B⊂(2n,4n)∩NB\subset (2n,4n)\cap \mathbb{N} there exists some C⊂(n,2n)∩NC\subset (n,2n)\cap \mathbb{N} such that c1+c2∉Bc_1+c_2\not\in B for all c1≠c2∈Cc_1\neq c_2\in C and ∣C∣+∣B∣≥f(n)\lvert C\rvert+\lvert B\rvert \geq f(n).

Estimate f(n)f(n). In particular is it true that f(n)≤n1/2+o(1)f(n)\leq n^{1/2+o(1)}?

Statement quoted from erdosproblems.com/788, maintained by Thomas Bloom. Original source: [Er73]. Current status there: open.

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 Literature
14 Oct, 2025 Literature search GPT-5 🟡 Partial results found —
20 Jan, 2026 AI building on known literature GPT-5.2 Pro 🟡 New partial result 🟡 Hunter (2025)

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.

∎