Published February 28, 2012 | Version v1
Journal article Metadata-only

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

Creators

  • 1. M. V. Lomonosov Moscow State University, Moscow (Russian Federation)

Description

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.

Availability note (English)

Available from http://dx.doi.org/10.1070/SM2012v203n02ABEH004223

Additional details

Identifiers

DOI
10.1070/SM2012v203n02ABEH004223;

Publishing Information

Journal Title
Sbornik. Mathematics
Journal Volume
203
Journal Issue
2
Journal Page Range
p. 288-305
ISSN
1064-5616

INIS

Country of Publication
United States
Country of Input or Organization
International Atomic Energy Agency (IAEA)
INIS RN
43091441
Subject category
S97: MATHEMATICAL METHODS AND COMPUTING;
Descriptors DEI
ALGORITHMS; ASYMPTOTIC SOLUTIONS; EUCLIDEAN SPACE
Descriptors DEC
MATHEMATICAL LOGIC; MATHEMATICAL SOLUTIONS; MATHEMATICAL SPACE; RIEMANN SPACE; SPACE