In mathematics, the greatest common divisor (gcd), also known as the greatest common denominator, greatest common factor (gcf), or highest common factor (hcf), of two or more non-zero integers, is the largest positive integer that divides the numbers without a remainder. For example, the GCD of 8 and 12 is 4.

This notion can be extended to polynomials, see greatest common divisor of two polynomials.

## Overview

The greatest common divisor is useful for reducing fractions to be in lowest terms. For example, gcd(42, 56) = 14, therefore,

${42 \over 56}={3 \cdot 14 \over 4 \cdot 14}={3 \over 4}.$

The greatest common divisor of a and b is written as gcd(ab), or sometimes simply as (ab). For example, gcd(12, 18) = 6, gcd(−4, 14) = 2. Two numbers are called coprime or relatively prime if their greatest common divisor equals 1. For example, 9 and 28 are relatively prime.

## Calculating the gcd

lol

### Using Euclid's algorithm

A much more efficient method is the Euclidean algorithm, which uses the division algorithm in combination with the observation that the gcd of two numbers also divides their difference: divide 48 by 18 to get a quotient of 2 and a remainder of 12. Then divide 18 by 12 to get a quotient of 1 and a remainder of 6. Then divide 12 by 6 to get a remainder of 0, which means that 6 is the gcd. Formally, it can be described as:

$\operatorname{gcd}(a,0) = a$
$\operatorname{gcd}(a,b) = \operatorname{gcd}(b,a - b \left\lfloor {a \over b} \right\rfloor).$

Which also could be written as

$\operatorname{gcd}(a,0) = a$
$\operatorname{gcd}(a,b) = \operatorname{gcd}(b, a \mbox{ mod } b).$

The series of quotients generated by the Euclidean algorithm composes a continued fraction.

### Other methods

If a and b are not both zero, the greatest common divisor of a and b can be computed by using least common multiple (lcm) of a and b:

$\operatorname{gcd}(a,b)=\frac{a\cdot b}{\operatorname{lcm}(a,b)}.$

Keith Slavin has shown that for odd a ≥ 1:

$\operatorname{gcd}(a,b)=\log_2\prod_{k=0}^{a-1} (1+e^{-2i\pi k b/a})$

which is a function that can be evaluated for complex b [1] and Wolfgang Schramm has shown that

$\operatorname{gcd}(a,b)=\sum\limits_{k=1}^a {\exp (2\pi ikb/a)} \cdot \sum\limits_{d\left| a\right.} {\frac{c_d (k)}{d}}$

is an entire function in the variable b for all positive integers a where cd(k) is Ramanujan's sum.[2] Marcelo Polezzi has shown that:

$\operatorname{gcd}(a,b)=2\sum_{k=1}^{a-1} \lfloor k b/a\rfloor+a+b-a b$

for positive integers a and b.[3] Donald Knuth proved the following reduction:

$\operatorname{gcd}(2^a-1,2^b-1)=2^{\operatorname{gcd}(a,b)}-1$

for non-negative integers a and b, where a and b are not both zero.[4]

### Complexity

The existence of the Euclidean algorithm places the (decision problem version of) the greatest common divisor problem in P, the class of problems solvable in polynomial time. The GCD problem is not known to be in NC, and so there is no known way to parallelize its computation across many processors; nor is it known to be P-complete, which would imply that it is unlikely to be possible to parallelize GCD computation. In this sense the GCD problem is analogous to e.g. the integer factorization problem, which has no known polynomial-time algorithm, but is not known to be NP-complete. Shallcross et al. showed that a related problem (EUGCD, determining the remainder sequence arising during the Euclidean algorithm) is NC-equivalent to the problem of integer linear programming with two variables; if either problem is in NC or is P-complete, the other is as well.[5] Since NC contains NL, it is also unknown whether a space-efficient algorithm for computing the GCD exists, even for nondeterministic Turing machines.

Although the problem is not known to be in NC, parallel algorithms with time superior to the Euclidean algorithm exist; the best known deterministic algorithm is by Chor and Goldreich, which (in the CRCW-PRAM model) can solve the problem in O(n/log n) time with n1+ε processors.[6] Randomized algorithms can solve the problem in O((log n)2) time on $\exp[O(\sqrt{n \log n})]$ processors (note this is superpolynomial).[7]

## Properties

• Every common divisor of a and b is a divisor of gcd(ab).
• gcd(ab), where a and b are not both zero, may be defined alternatively and equivalently as the smallest positive integer d which can be written in the form d = a·p + b·q where p and q are integers. This expression is called Bézout's identity. Numbers p and q like this can be computed with the extended Euclidean algorithm.
• gcd(a, 0) = |a|, for a ≠ 0, since any number is a divisor of 0, and the greatest divisor of a is |a|. This is usually used as the base case in the Euclidean algorithm.
• If a divides the product b·c, and gcd(ab) = d, then a/d divides c.
• If m is a non-negative integer, then gcd(m·am·b) = m·gcd(ab).
• If m is any integer, then gcd(a + m·bb) = gcd(ab).
• If m is a nonzero common divisor of a and b, then gcd(a/mb/m) = gcd(ab)/m.
• The gcd is a multiplicative function in the following sense: if a1 and a2 are relatively prime, then gcd(a1·a2b) = gcd(a1b)·gcd(a2b).
• The gcd is a commutative function: gcd(a, b) = gcd(b, a).
• The gcd is an associative function: gcd(a, gcd(b, c)) = gcd(gcd(a, b), c).
• The gcd of three numbers can be computed as gcd(abc) = gcd(gcd(ab), c), or in some different way by applying commutativity and associativity. This can be extended to any number of numbers.
• gcd(ab) is closely related to the least common multiple lcm(ab): we have
gcd(ab)·lcm(ab) = a·b.
This formula is often used to compute least common multiples: one first computes the gcd with Euclid's algorithm and then divides the product of the given numbers by their gcd. The following versions of distributivity hold true:
gcd(a, lcm(bc)) = lcm(gcd(ab), gcd(ac))
lcm(a, gcd(bc)) = gcd(lcm(ab), lcm(ac)).
• It is useful to define gcd(0, 0) = 0 and lcm(0, 0) = 0 because then the natural numbers become a complete distributive lattice with gcd as meet and lcm as join operation. This extension of the definition is also compatible with the generalization for commutative rings given below.
• In a Cartesian coordinate system, gcd(ab) can be interpreted as the number of points with integral coordinates on the straight line joining the points (0, 0) and (ab), excluding (0, 0).

## Probabilities and expected value

In 1972, J. E. Nymann showed that the probability that k independently chosen integers are coprime is 1/ζ(k).[8] (See coprime for a derivation.) This result was extended in 1987 to show that the probability that k random integers has greatest common divisor d is d-k/ζ(k).[9]

Using this information, the expected value of the greatest common divisor function can be seen (informally) to not exist when k = 2. In this case the probability that the gcd equals d is d−2/ζ(2), and since ζ(2) = π2/6 we have

$\mathrm{E}( \mathrm{2} ) = \sum_{d=1}^\infty d \frac{6}{\pi^2 d^2} = \frac{6}{\pi^2} \sum_{d=1}^\infty \frac{1}{d}.$

This last summation is the harmonic series, which diverges. However, when k ≥ 3, the expected value is well-defined, and by the above argument, it is

$\mathrm{E}(k) = \sum_{d=1}^\infty d^{1-k} \zeta(k)^{-1} = \frac{\zeta(k-1)}{\zeta(k)}.$

For k = 3, this is approximately equal to 1.3684. For k = 4, it is approximately 1.1106.

## The gcd in commutative rings

The greatest common divisor can more generally be defined for elements of an arbitrary commutative ring.

If R is a commutative ring, and a and b are in R, then an element d of R is called a common divisor of a and b if it divides both a and b (that is, if there are elements x and y in R such that d·x = a and d·y = b). If d is a common divisor of a and b, and every common divisor of a and b divides d, then d is called a greatest common divisor of a and b.

Note that with this definition, two elements a and b may very well have several greatest common divisors, or none at all. But if R is an integral domain then any two gcd's of a and b must be associate elements. Also, if R is a unique factorization domain, then any two elements have a gcd. If R is a Euclidean domain then a form of the Euclidean algorithm can be used to compute greatest common divisors.

The following is an example of an integral domain with two elements that do not have a gcd:

$R = \mathbb{Z}\left[\sqrt{-3}\,\,\right],\quad a = 4 = 2\cdot 2 = \left(1+\sqrt{-3}\,\,\right)\left(1-\sqrt{-3}\,\,\right),\quad b = \left(1+\sqrt{-3}\,\,\right)\cdot 2.$

The elements 2 and 1 + √(−3) are two "maximal common divisors" (i.e. any common divisor which is a multiple of 2 is associated to 2, the same holds for 1 + √(−3)), but they are not associated, so there is no greatest common divisor of a and b.

Corresponding to the Bezout property we may, in any commutative ring, consider the collection of elements of the form pa + qb, where p and q range over the ring. This is the ideal generated by a and b, and is denoted simply (ab). In a ring all of whose ideals are principal (a principal ideal domain or PID), this ideal will be identical with the set of multiples of some ring element d; then this d is a greatest common divisor of a and b. But the ideal (ab) can be useful even when there is no greatest common divisor of a and b. (Indeed, Ernst Kummer used this ideal as a replacement for a gcd in his treatment of Fermat's Last Theorem, although he envisioned it as the set of multiples of some hypothetical, or ideal, ring element d, whence the ring-theoretic term.)

## Notes

1. Slavin, Keith R. (2008). "Q-Binomials and the Greatest Common Divisor". Integers Electronic Journal of Combinatorial Number Theory (University of West Georgia, Charles University in Prague) 8: A5. Retrieved 2008-05-26.
2. Schramm, Wolfgang (2008). "The Fourier transform of functions of the greatest common divisor". Integers Electronic Journal of Combinatorial Number Theory (University of West Georgia, Charles University in Prague) 8: A50. Retrieved 2008-11-25.
3. Polezzi, Marcelo (1997). "A Geometrical Method for Finding an Explicit Formula for the Greatest Common Divisor". Amer. Math. Monthly (Mathematical Association of America) 104 (5): 445–446. doi:10.2307/2974739.
4. Knuth, Donald E.; R. L. Graham, O. Patashnik (March 1994). Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley. ISBN 0-201-55802-5.
5. D. Shallcross, V. Pan, and Y. Lin-Kriz. The NC equivalence of planar integer linear programming and Euclidean GCD. 34th IEEE Symp. Foundations of Computer Science, 1993, pp. 557-564. (PDF of technical report)
6. B. Chor and O. Goldreich. An improved parallel algorithm for integer GCD. Algorithmica, 5:1–10, 1990.
7. L. M. Adleman and K. Kompella. Using smoothness to achieve parallelism. In 20th Annual ACM Symposium on Theory of Computing, pages 528–538, 1988.
8. J. E. Nymann, On the probability that k positive integers are relatively prime. Journal of Number Theory, 4:469–473, 1972.
9. J. Chidambaraswamy and R. Sitarmachandrarao. On the probability that the values of m polynomials have a given g.c.d. Journal of Number Theory, 26:237–245, 1987.