Erdős Problem #495 — The Littlewood conjecture
For a real number , let , its distance to the nearest integer. The question is whether, for every pair , the following holds, with ranging over the positive integers:
Background
This is Littlewood’s conjecture, a central problem in simultaneous Diophantine approximation, formulated around 1930. The issue is most significant when both numbers are badly approximable: that is, when each satisfies . For almost every real number this individual lower limit is zero, which already implies the conjecture for almost every pair; the difficult cases therefore include pairs whose coordinates are both badly approximable. On a lower bound of the number of integers in Littlewood’s conjecture
A dynamical formulation connects the problem to diagonal actions on the space of unimodular lattices. For the lattice associated with , the conjecture is equivalent to unboundedness of a corresponding positive diagonal semigroup orbit. This translates the search for simultaneous small fractional parts into a question about how lattice vectors behave under diagonal rescaling. Einsiedler, Katok, and Lindenstrauss (2006)
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.