which is the best proof to use for gcd(a, b) = gcd(a, b − a)

59 Views Asked by At

Prove that gcd(a, b) = gcd(a, b − a)

What is the best way to prove this? using induction? or does there exist a more efficient method?

1

There are 1 best solutions below

2
On

The shortest method consists in proving a more general fact: $$\{\text{divisors of }a \text{ and }b\}=\{\text{divisors of }a \text{ and }b-a\}$$