Dual View Random Solved Random Open
OPEN This is open, and cannot be resolved with a finite computation.
Let $x_1,x_2,\ldots \in (0,1)$ be an infinite sequence and let\[A_k=\limsup_{n\to \infty}\left\lvert \sum_{j\leq n} e(kx_j)\right\rvert,\]where $e(x)=e^{2\pi ix}$.

Is it true that\[\limsup_{k\to \infty} A_k=\infty?\]Is it possible for $A_k=o(k)$?
Disclaimer: The open status of this problem reflects the current belief of the owner of this website. There may be literature on this problem that I am unaware of, which may partially or completely solve the stated problem. Please do your own literature search before expending significant effort on solving this problem. If you find any relevant literature not mentioned here, please add this in a comment.
This is Problem 7.21 in [Ha74], where it is attributed to Erdős.

Erdős [Er64b] remarks it is 'easy to see' that\[\limsup_{k\to \infty}\left(\sup_n\left\lvert \sum_{j\leq n} e(kx_j)\right\rvert\right)=\infty.\]Erdős [Er65b] later found a 'very easy' proof that $A_k\gg \log k$ for infinitely many $k$. Clunie [Cl67] proved that $A_k\gg k^{1/2}$ infinitely often, and that there exist sequences with $A_k\leq k$ for all $k$. Tao has independently found a proof that $A_k\gg k^{1/2}$ infinitely often (see the comment section).

Liu [Li69] showed that, for any $\epsilon>0$, $A_k\gg k^{1-\epsilon}$ infinitely often, under the additional assumption that there are only a finite number of distinct points. Clunie observed in the Mathscinet review of [Li69], however, that under this assumption in fact $A_k=\infty$ infinitely often.

The question of whether $A_k=o(k)$ is possible (repeated in [Er65b] and [Ha74]) seems to still be open.

View the LaTeX source

This page was last edited 29 December 2025.

External data from the database - you can help update this
Formalised statement? No (Create a formalisation here)
Likes this problem None
Interested in collaborating None
Currently working on this problem None
This problem looks difficult None
This problem looks tractable None

Additional thanks to: Terence Tao

When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:

T. F. Bloom, Erdős Problem #987, https://www.erdosproblems.com/987, accessed 2026-01-16