Search results

Jump to navigation Jump to search
  • ...from the larger number, until one number is reduced to zero. The remaining number is the GCD.]] ...il one of them is zero. When that occurs, the GCD is the remaining nonzero number. By [[extended Euclidean algorithm|reversing the steps in the Euclidean al ...
    106 KB (16,093 words) - 04:55, 13 June 2010