Euclidean Algorithm

An iterative division-based procedure that computes the greatest common divisor (gcd) of two integers by repeatedly replacing the larger number by its remainder on division by the smaller until the remainder is zero; the last nonzero remainder is the gcd.

An iterative division procedure that computes the greatest common divisor (gcd) of two integers by repeatedly replacing the larger number with its remainder upon division by the smaller until the remainder is zero.

An iterative division-based procedure that computes a greatest common divisor (gcd) of two elements in a Euclidean domain (or any ring with a suitable Euclidean function) by repeated remainder-taking until termination at zero.