Asymptotic behaviour of the first moment of the number of steps in the by-excess and by-deficiency Euclidean algorithms

Abstract

The first moments for the number of steps in different Euclidean algorithms are considered. For these moments asymptotic formulae with new remainder terms are obtained using refined estimates for sums of fractional parts and some ideas in Selberg's elementary proof of the prime number theorem.Bibliography: 12 titles.