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

Erdős Problem #819

A claim by Yu Leon Liu with GPT-5.5 and Rethlas (15 May 2026) that has not yet been verified: candidate partial result.

問題
Erdős problem #819 (additive combinatorics); current status: open
貢献
Yu Leon Liu with GPT-5.5 and Rethlas · AI working with humans
検証
Listed in Tao's wiki
経緯
First AI contribution 2026-05-15 · 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 f(N)f(N) be maximal such that there exists A⊆{1,…,N}A\subseteq \{1,\ldots,N\} with ∣A∣=⌊N1/2⌋\lvert A\rvert=\lfloor N^{1/2}\rfloor such that ∣(A+A)∩[1,N]∣=f(N)\lvert (A+A)\cap [1,N]\rvert=f(N). Estimate f(N)f(N).

Statement quoted from erdosproblems.com/819, maintained by Thomas Bloom. Original source: [Er91]. 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 Humans Outcome
15 May, 2026 AI working with humans GPT-5.5, Rethlas Yu Leon Liu ⚪ Candidate partial result

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.

∎