A Jacobi algorithm and metric theory for greatest common divisors

DOI10.1016/0022-247X(77)90109-3zbMath0353.10022MaRDI QIDQ1236134

Michael S. Waterman

Publication date: 1977

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Continued fractions and generalizations (11J70) Radix representation; digital problems (11A63) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Algorithms in computer science (68W99)

Related Items

The Brun gcd algorithm in high dimensions is almost always subtractive, Multidimensional greatest common divisor and Lehmer algorithms, Approach to equilibrium for locally expanding maps in \({\mathbb{R}}^ k\)

Cites Work

• Unnamed Item
• F-expansions of rationals
• The metrical theory of Jacobi-Perron algorithm
• The Jacobi-Perron algorithm its theory and application
• Some remarks on Kuzmin's theorem for F-expansions
• Some ergodic properties of multi-dimensional f-expansions