# Greatest common divisor

The **Greatest common divisor (gcd)** of two numbers, commonly expressed by [math]gcd(a, b)[/math], where [math]a[/math] and [math]b[/math] are positive integers, is the maximum number that divides both [math]a[/math] and [math]b[/math].

We can also define [math]gcd(a, 0) = a[/math] and [math]gcd(a, b) = gcd(|a|, |b|)[/math] thus defining the operations for all integers.

When the greatest common divisor is 1, both numbers are coprime or relatively prime. This does not mean that either of these numbers are prime.

Although the GCD can be readily computed if the prime factors of both numbers are known, in the context of this wiki the numbers are not factored in advance and the GCD helps find a factor of these numbers, so an alternate method is required.

Fortunately Euclid discovered such an algorithm more than 2000 years ago. Expressed in modern notation the algorithm is:

- If [math]b = 0[/math], terminate the algorithm with [math]a = 0[/math] as the answer.
- Set a temporary variable [math]r[/math] to [math]a\,\mathrm{mod}\,b[/math].
- Set the variable [math]a[/math] to [math]b[/math].
- Set the variable [math]b[/math] to [math]r[/math].
- Go back to step 1.

There are faster methods, especially when number of thousands or millions of digits are used, as in GIMPS, but they are much more complex than the one presented above.