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 - The Fusion of Science and Community**

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

Loading...

Similar Threads - Euclidean algorithm Proof | Date |
---|---|

Euclidean Algorithm Gaussian Integers | Aug 6, 2014 |

Extended Euclidean Algorithm | May 17, 2011 |

Efficiency and the Euclidean Algorithm | Feb 10, 2011 |

Euclidean algorithm congruences | May 7, 2009 |

**Physics Forums - The Fusion of Science and Community**