SOLUTION: what does euclids algorithm do for a pair of numbers in which the first number is smaller than the second number?

Algebra ->  Divisibility and Prime Numbers  -> Lessons -> SOLUTION: what does euclids algorithm do for a pair of numbers in which the first number is smaller than the second number?       Log On


   

Question 934231: what does euclids algorithm do for a pair of numbers in which the first number is smaller than the second number?
Answer by richard1234(7193) About Me  (Show Source):
You can put this solution on YOUR website!
If a < b, then GCD(a,b) = GCD(a, b-a).