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

Erdős Problem #264

Partial progress by Aristotle (18 Dec 2025): new proof of partial result (Lean).

問題
Erdős problem #264 (irrationality); current status: open
貢献
Aristotle · AI building on known literature
検証
Lean formalizationListed in Tao's wiki
経緯
First AI contribution 2025-12-18 · 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 ana_n be a sequence of positive integers such that for every bounded sequence of integers bnb_n (with an+bn≠0a_n+b_n\neq 0 and bn≠0b_n\neq 0 for all nn) the sum

∑1an+bn\sum \frac{1}{a_n+b_n}

is irrational. Are an=2na_n=2^n or an=n!a_n=n! examples of such a sequence?

Statement quoted from erdosproblems.com/264, maintained by Thomas Bloom. Original source: [ErGr80,p.63][Er88c,p.105]. 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
18 Dec, 2025 AI building on known literature Aristotle 🟡 New proof of partial result (Lean) 🟡 Kovač and Tao (2024)

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.

∎