Multidimensional greatest common divisor and Lehmer algorithms

DOI10.1007/BF01933456zbMath0377.10008MaRDI QIDQ4156838

Michael S. Waterman

Publication date: 1977

Published in: BIT (Search for Journal in Brave)

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Software, source code, etc. for problems pertaining to number theory (11-04) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (1)

Fine and Wilf's theorem for three periods and a generalization of Sturmian words

Cites Work

• F-expansions of rationals
• A Jacobi algorithm and metric theory for greatest common divisors
• The metrical theory of Jacobi-Perron algorithm
• Ergodic computations with continued fractions and Jacobi's algorithm
• A New Version of the Euclidean Algorith
• Euclid's Algorithm for Large Numbers
• Unnamed Item
• Unnamed Item

This page was built for publication: Multidimensional greatest common divisor and Lehmer algorithms