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

Erdős Problem #992

Aletheia found that the problem had already been solved in the literature (1 Feb 2026).

問題
Erdős problem #992 (discrepancy); current status: disproved
貢献
Aletheia · Literature search
検証
Listed in Tao's wiki
経緯
First AI contribution 2026-02-01 · 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<⋯x_1<x_2<\cdots be an infinite sequence of integers. Is it true that, for almost all α∈[0,1]\alpha \in [0,1], the discrepancy

D(N)=max⁡I⊆[0,1]∣#{n≤N:{αxn}∈I}−∣I∣N∣D(N)=\max_{I\subseteq [0,1]} \lvert \#\{ n\leq N : \{ \alpha x_n\}\in I\} - \lvert I\rvert N\rvert

satisfies

D(N)≪N1/2(log⁡N)o(1)?D(N) \ll N^{1/2}(\log N)^{o(1)}?

Or even

D(N)≪N1/2(log⁡log⁡N)O(1)?D(N)\ll N^{1/2}(\log\log N)^{O(1)}?

Statement quoted from erdosproblems.com/992, maintained by Thomas Bloom. Original source: [Er64b,p.56]. Current status there: disproved.

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
1 Feb, 2026 Literature search Aletheia 🟢 Full solution found

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.

∎