Prove that the number of steps of the euclidean algorithm needed to find gcd(km,kn) is exactly the same as the number of steps needed to find gcd(m,n).(adsbygoogle = window.adsbygoogle || []).push({});

any help on this would be appreciated. I'm really lost.

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Euclidean algorithm Proof

**Physics Forums | Science Articles, Homework Help, Discussion**