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

Erdős Problem #635

Partial progress by Aristotle and GPT-5.2 Pro (30 Jan 2026): solution to one part of problem (Lean).

問題
Erdős problem #635 (number theory); current status: open
貢献
Aristotle and GPT-5.2 Pro · AI on its own; related literature found afterwards
検証
Lean formalizationListed in Tao's wiki
経緯
First AI contribution 2026-01-30 · 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 t≥1t\geq 1 and A⊆{1,…,N}A\subseteq \{1,\ldots,N\} be such that whenever a,b∈Aa,b\in A with b−a≥tb-a\geq t we have b−a∤bb-a\nmid b. How large can ∣A∣\lvert A\rvert be? Is it true that

∣A∣≤(12+ot(1))N?\lvert A\rvert \leq \left(\frac{1}{2}+o_t(1)\right)N?

Statement quoted from erdosproblems.com/635, maintained by Thomas Bloom. Original source: [Gu83][Ru99]. 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
30 Jan, 2026 AI on its own; related literature found afterwards Aristotle, GPT-5.2 Pro 🟡 Solution to one part of problem (Lean) 🟡 Elliott (1979) (reduces one part of problem to a much simpler one)

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.

∎