Template:AotD

Revision as of 15:28, 21 January 2008 by Temperal (talk | contribs) (more link)

Euclidean algorithm

The Euclidean algorithm (also known as the Euclidean division algorithm or Euclid's algorithm) is an algorithm that finds the greatest common divisor (GCD) of two elements of a Euclidean domain, the most common of which is the nonnegative integers $\mathbb{Z}{\geq 0}$, without factoring... [more]