Recent content by hilly1

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). any help on this would be appreciated. I'm really lost.