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

Erdős Problem #42

Full solution by Harjas Sandhu with GPT-5.5 Pro (27 Apr 2026). 2 AI contributions are recorded in all.

問題
Erdős problem #42 (number theory, sidon sets, additive combinatorics); current status: solved (Lean)
貢献
Harjas Sandhu with GPT-5.5 Pro · AI working with humans
検証
Lean formalizationListed in Tao's wiki
経緯
First AI contribution 2026-01-19 · 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 M≥1M\geq 1 and NN be sufficiently large in terms of MM. Is it true that for every Sidon set A⊂{1,…,N}A\subset \{1,\ldots,N\} there is another Sidon set B⊂{1,…,N}B\subset \{1,\ldots,N\} of size MM such that (A−A)∩(B−B)={0}(A-A)\cap(B-B)=\{0\}?

Statement quoted from erdosproblems.com/42, maintained by Thomas Bloom. Original source: [Er95,p.5]. Current status there: solved (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
19 Jan, 2026 AI on its own Codex, GPT-5.2, GPT-5.2 Pro — 🟡 Partial result (Lean)
27 Apr, 2026 AI working with humans GPT-5.5 Pro Harjas Sandhu 🟢 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.

∎