Another note on “Euclidean algorithms are Gaussian” by V. Baladi and B. Vallée
Volume 188 / 2019
Acta Arithmetica 188 (2019), 241-251
MSC: Primary 37A30; Secondary 11Y16.
DOI: 10.4064/aa170418-6-3
Published online: 7 March 2019
Abstract
We record two remarks on the work of Baladi–Vallée [J. Number Theory 110 (2005), 331–386]. They proved the asymptotic Gaussian distribution of the length of continued fractions as a random variable on the set of rational numbers whose denominators are less than or equal to a fixed positive integer with uniform probability. We give a direct proof of that result without the smoothing process by applying Perron’s formula with error terms, and further derive an equivalent result on a thinner probability space.
