Abstract
We provide sharp estimates for the probabilistic behaviour of the main parameters of the Euclid algorithm, and we study in particular the distribution of the bit-complexity which involves two main parameters : digit–costs and length of continuants. We perform a “dynamical analysis” which heavily uses the dynamical system underlying the Euclidean algorithm. Baladi and Vallée [2] have recently designed a general framework for “distributional dynamical analysis”, where they have exhibited asymptotic gaussian laws for a large class of digit–costs. However, this family contains neither the bit–complexity cost nor the length of continuants. We first show here that an asymptotic gaussian law also holds for the length of continuants at a fraction of the execution. There exist two gcd algorithms, the standard one which only computes the gcd, and the extended one which also computes the Bezout pair, and is widely used for computing modular inverses. The extended algorithm is more regular than the standard one, and this explains that our results are more precise for the extended algorithm. We prove that the bit–complexity of the extended Euclid algorithm asymptotically follows a gaussian law, and we exhibit the speed of convergence towards the normal law. We describe also conjectures [quite plausible], under which we can obtain an asymptotic gaussian law for the plain bit-complexity, or a sharper estimate of the speed of convergence towards the gaussian law.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akhavi, A., Vallée, B.: Average bit–complexity of Euclidean Algorithms. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 373–387. Springer, Heidelberg (2000)
Baladi, V., Vallée, B.: Euclidean Algorithms are Gaussian. Journal of Number Theory 110(2), 331–386 (2005)
Cesaratto, E., Vallée, B.: Reals with bounded digit averages. In: Drmota, M., et al. (eds.) Proceedings of the Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probability. Trends in Mathematics, pp. 473–490. Birkhauser Verlag, Basel (2004)
Daireaux, B., Vallée, B.: Dynamical analysis of the parameterized Lehmer-Euclid Algorithm, Combinatorics, Probability, Computing, pp. 499–536 (2004)
Dolgopyat, D.: On decay of correlations in Anosov flows. Ann. of Math. 147, 357–390 (1998)
Hensley, D.: The number of steps in the Euclidean algorithm. Journal of Number Theory 49(2), 142–182 (1994)
Lehmer, D.H.: Euclid’s algorithm for large numbers. Am. Math. Mon. 45, 227–233 (1938)
Lhote, L.: Computation of a Class of Continued Fraction Constants. In: Proceedings of Alenex–ANALCO 2004, pp. 199–210 (2004)
Philipp, W.: Some metrical theorems in number theory II. Duke Math. J. 37, 447–488 (1970); Errata. IBID, 788
Vallée, B.: Euclidean Dynamics. To appear in Discrete and Continuous Dynamical Systems (2005), www.info.unicaen.fr/~brigitte
Vallée, B.: Opérateurs de Ruelle-Mayer généralisés et analyse en moyenne des algorithmes de Gauss et d’Euclide. Acta Arithmetica 81(2), 101–144 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lhote, L., Vallée, B. (2006). Sharp Estimates for the Main Parameters of the Euclid Algorithm. In: Correa, J.R., Hevia, A., Kiwi, M. (eds) LATIN 2006: Theoretical Informatics. LATIN 2006. Lecture Notes in Computer Science, vol 3887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11682462_63
Download citation
DOI: https://doi.org/10.1007/11682462_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32755-4
Online ISBN: 978-3-540-32756-1
eBook Packages: Computer ScienceComputer Science (R0)