Greatest common divisor

From Wikipedia, the free encyclopedia

In mathematics, the greatest common divisor (gcd), sometimes known as the greatest common factor (gcf) or highest common factor (hcf), of two non-zero integers, is the largest positive integer that divides both numbers without remainder. Some authors emphasize that "greatest" is not so much a measure of magnitude as a label for the fact that any other common divisor of two numbers divides their gcd. These authors also do not require the gcd to be positive, so that there are two gcds a and b, with a = −b.

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

The greatest common divisor is useful for reducing vulgar fractions to be in lowest terms. Consider for instance

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

where we cancelled 14, the greatest common divisor of 42 and 56.

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

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

1 Calculating the GCD
2 Properties
3 Probabilities and expected value
4 The gcd in commutative rings
5 See also
6 References
7 External links

[edit] Calculating the GCD

Greatest common divisors can in principle be computed by determining the prime factorizations of the two numbers and comparing factors, as in the following example: to compute gcd(18,84), we find the prime factorizations 18 = 2·3² and 84 = 2²·3·7 and notice that the "overlap" of the two expressions is 2·3; so gcd(18,84) = 6. In practice, this method is only feasible for very small numbers; computing prime factorizations in general takes far too long.

A much more efficient method is the Euclidean algorithm: divide 84 by 18 to get a quotient of 4 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.

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

[edit] Properties

Every common divisor of a and b is a divisor of gcd(a, b).

gcd(a, b), 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.

If a divides the product b·c, and gcd(a, b) = d, then a/d divides c.

If m is any integer, then gcd(m·a, m·b) = m·gcd(a, b) and gcd(a + m·b, b) = gcd(a, b). If m is a nonzero common divisor of a and b, then gcd(a/m, b/m) = gcd(a, b)/m.

The gcd is a multiplicative function in the following sense: if a₁ and a₂ are relatively prime, then gcd(a₁·a₂, b) = gcd(a₁, b)·gcd(a₂, b).

The gcd of three numbers can be computed as gcd(a, b, c) = gcd(gcd(a, b), c) = gcd(a, gcd(b, c)). Thus the gcd is an associative operation.

gcd(a, b) is closely related to the least common multiple lcm(a, b): we have

gcd(a, b)·lcm(a, b) = 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(b, c)) = lcm(gcd(a, b), gcd(a, c))

lcm(a, gcd(b, c)) = gcd(lcm(a, b), lcm(a, c)).

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(a, b) can be interpreted as the number of points with integral coordinates on the straight line joining the points (0, 0) and (a, b), excluding (0, 0).

[edit] Probabilities and expected value

The probability that two randomly chosen integers $A$ and $B$ have a given greatest common divisor $d$ is $6\over {\pi^2 d^2}$ . This follows from the characterization of $g c d (A, B)$ as the integer $d$ such that $d | A, B$ and $A / d$ and $B / d$ are coprime. The probability of two integers sharing a factor $d$ is $d - 2$ . The probability that two integers are coprime is $1 / ζ(2) = 6 / π 2$ . (See coprime for a derivation.)

Using this information, the expected value of the greatest common divisor function can be computed. This is

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

This last summation is the Harmonic series, which diverges. Hence the expected value of the greatest common divisor of two variables is not well-defined. This is not the case in general, however. For the greatest common divisor of $k \ge 3$ variables, the expected value is well-defined, and by the above argument, it is

$\mathrm{E}(gcd(X_1, \cdots, X_k)) = \sum_{d=2}^{\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.

[edit] 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 of 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 $1+\sqrt{-3}$ and $2$ 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+\sqrt{-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 $p a + q b$ , where p and q range over the ring. This is the ideal generated by a and b, and is denoted simply $(a, b)$ . 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 $(a, b)$ 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.)

[edit] See also

[edit] References

Donald Knuth. The Art of Computer Programming, Volume 2: Seminumerical Algorithms, Third Edition. Addison-Wesley, 1997. ISBN 0-201-89684-2. Section 4.5.2: The Greatest Common Divisor, pp.333–356.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0-262-03293-7. Section 31.2: Greatest common divisor, pp.856–862.
Saunders MacLane and Garrett Birkhoff. A Survey of Modern Algebra, Fourth Edition. MacMillan Publishing Co., 1977. ISBN 0-02-310070-2. 1-7: "The Euclidean Algorithm."