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

Erdős Problem #949

Partial progress by AlphaProof (7 Jan 2026): solution to variant problem (Lean).

問題
Erdős problem #949 (ramsey theory); current status: open
貢献
AlphaProof · AI on its own
検証
Lean formalizationListed in Tao's wiki
経緯
First AI contribution 2026-01-07 · 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 S⊂RS\subset \mathbb{R} be a set containing no solutions to a+b=ca+b=c. Must there be a set A⊆R\SA\subseteq \mathbb{R}\backslash S of cardinality continuum such that A+A⊆R\SA+A\subseteq \mathbb{R}\backslash S?

Statement quoted from erdosproblems.com/949, maintained by Thomas Bloom. Original source: [Er77c]. 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
7 Jan, 2026 AI on its own AlphaProof 🟡 Solution to variant problem (Lean)

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.

∎