Multidimensional greatest common divisor and Lehmer algorithms

DOI10.1007/BF01933456zbMATH Open0377.10008MaRDI QIDQ4156838FDOQ4156838

Authors: Michael S. Waterman 

Publication date: 1977

Published in: BIT (Search for Journal in Brave)

Mathematics Subject Classification ID

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) Software, source code, etc. for problems pertaining to number theory (11-04)

Cites Work

• Title not available (Why is that?)
• Euclid's Algorithm for Large Numbers
• Title not available (Why is that?)
• The metrical theory of Jacobi-Perron algorithm
• A New Version of the Euclidean Algorith
• A Jacobi algorithm and metric theory for greatest common divisors
• F-expansions of rationals
• Ergodic computations with continued fractions and Jacobi's algorithm

Cited In (1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4156838)