Euclidean Algorithm

Imagine you're trying to find the
Greatest Common Divisor between two numbers:  {a, b}.

In mathematical notation this would be
denoted as: gcd (a,b).

You can plug this into a calculator and the result
will always be a whole number greater than or equal to 1.

The Euclidean Algorithm is the standard systematic method for how this is computed.