×

zbMATH — the first resource for mathematics

Iterating the division algorithm. (English) Zbl 0621.10008
This article explores some algorithms devised by modifying the Euclidean algorithm, represented in BASIC by iterating the steps \(Q=INT(B/A)\); \(B=A:\) \(A=R\). The modified algorithms are constructed by changing the second line in various ways, for example, replacing the second line by \(B=Q\) gives radix conversion. Another example would be \(A=R:\) \(B=Q\). For those that are non-trivial, the aspect investigated here is the number of steps to termination.
Reviewer: K.E.Hirst

MSC:
11A63 Radix representation; digital problems
11A05 Multiplicative structure; Euclidean algorithm; greatest common divisors
PDF BibTeX XML Cite