An alternative to the Euclidean algorithm uses subtraction rather than division to
Chapter 4, Problem 24(choose chapter or problem)
An alternative to the Euclidean algorithm uses subtraction rather than division to compute greatest common divisors. (After all, division is repeated subtraction.) It is based on the following lemma: Lemma 4.8.3 If a b > 0, then gcd(a, b) = gcd(b, a b).
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer