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

Erdős Problem #987

Full solution by OpenAI internal model (9 Apr 2026).

問題
Erdős problem #987 (analysis, discrepancy); current status: proved (Lean)
貢献
OpenAI internal model · AI on its own
検証
Listed in Tao's wiki
経緯
First AI contribution 2026-04-09 · 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 x1,x2,…∈(0,1)x_1,x_2,\ldots \in (0,1) be an infinite sequence and let

Ak=lim sup⁡n→∞∣∑j≤ne(kxj)∣,A_k=\limsup_{n\to \infty}\left\lvert \sum_{j\leq n} e(kx_j)\right\rvert,

where e(x)=e2πixe(x)=e^{2\pi ix}.

Is it true that

lim sup⁡k→∞Ak=∞?\limsup_{k\to \infty} A_k=\infty?

Is it possible for Ak=o(k)A_k=o(k)?

Statement quoted from erdosproblems.com/987, maintained by Thomas Bloom. Original source: [Er64b][Er65b][Ha74]. Current status there: proved (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 Outcome
9 Apr, 2026 AI on its own OpenAI internal model 🟢 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.

∎