Open-access mathematical research insights
About Contact
Home / Erdos Problems / Problem #992

Problem #992: Let $x_1

Let $x_1

Problem Statement

Let $x_1<x_2<\cdots$ be an infinite sequence of integers. Is it true that, for almost all $\alpha \in [0,1]$, the discrepancy\[D(N)=\max_{I\subseteq [0,1]} \lvert \#\{ n\leq N : \{ \alpha x_n\}\in I\} - \lvert I\rvert N\rvert\]satisfies\[D(N) \ll N^{1/2}(\log N)^{o(1)}?\]Or even\[D(N)\ll N^{1/2}(\log\log N)^{O(1)}?\]
Categories: Discrepancy

Progress

Erdős and Koksma [ErKo49] and Cassels [Ca50] independently proved that, for any sequence $x_i$ and almost all $\alpha$, the discrepancy satisfies\[D(N)\ll N^{1/2}(\log N)^{5/2+o(1)}.\]Baker [Ba81] improved this to\[D(N)\ll N^{1/2}(\log N)^{3/2+o(1)}.\]Erdős and Gál (unpublished) proved $D(N) \ll N^{1/2}(\log\log N)^{O(1)}$ for almost all $\alpha$ if the sequence is lacunary - that is, $x_{i+1}/x_i > \lambda>1$ for all $i$.

Source: erdosproblems.com/992 | Last verified: January 19, 2026

Stay Updated

Get weekly digests of new research insights delivered to your inbox.