Erdős Problem #494

GPT-5 found that the problem had already been solved in the literature (13 Oct 2025).

Problem
Erdős problem #494 (analysis, additive combinatorics); current status: proved
Credit
GPT-5 · Literature search
Checked
Listed in Tao's wiki
Timeline
First AI contribution 2025-10-13 · 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

If A⊂CA\subset \mathbb{C} is a finite set and k≥1k\geq 1 then let

Ak={z1+⋯+zk:zi∈A distinct}.A_k = \{ z_1+\cdots+z_k : z_i\in A\textrm{ distinct}\}.

For k>2k>2 does the multiset AkA_k (together with the size of AA) uniquely determine the set AA?

Statement quoted from erdosproblems.com/494, maintained by Thomas Bloom. Original source: [Er61]. Current status there: proved.

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
13 Oct, 2025 Literature search GPT-5 🟢 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.

∎