1-21-2018

Greatest Common Divisors

Definition. If m and n are integers, not both 0, the greatest common divisor (m, n) of m and n is
the largest integer which divides m and n. (0, 0) is undefined. I’ll often get lazy and abbreviate “greatest
common divisor” to “gcd”.

Example. (Greatest common divisors for small integers) Find by direct computation (4, 6), (−6, 15),
(0, 42), and (24, 25).

The largest integer which divides 4 and 6 is 2:

(4, 6) = 2.

The largest integer which divides −6 and 15 is 3:

(−6, 15) = 3.

The largest integer which divides 42 and 0 is 42:

(0, 42) = 42.

Finally, the largest integer which divides 24 and 25 is 1:

(24, 25) = 1.

Here are some easy properties of the greatest common divisor.

Proposition. Let a, b ∈ Z, and suppose a and b aren’t both 0.

(a) (a, b) | a and (a, b) | b.

(b) (a, b) exists, and (a, b) ≥ 1.

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

(d) If a 6= 0, then (a, 0) = |a|.

(e) (a, b) = (|a|, |b|).

(f) (a, 1) = 1.

Proof. (a) That (a, b) | a and (a, b) | b follows directly from the definition of (a, b). (I’m singling this out
even though it’s easy, because it’s a property that is often used.)

(b) On the one hand, the set of common divisors is finite (because a common divisor can’t be larger than
|a| or |b|), so it must have a largest element.
Now 1 | a and 1 | b, so 1 is a common divisor of a and b. Hence, the greatest common divisor (a, b) must
be at least as big as 1 — that is, (a, b) ≥ 1.

(c) The largest integer which divides both a and b is the same as the largest integer which divides both b
and a.

1
(d) |a| | a, since (±1)|a| = a, and |a| | 0, since |a| · 0 = 0. Thus, |a| is a common divisor of a and 0, so
|a| ≤ (a, 0).
But (a, 0) | a | |a|, so (a, 0) ≤ |a|. Hence, (a, 0) = |a|.

(e) (a, b) divides a, so it divides |a|. Likewise, (a, b) divides |b|. Since (a, b) is a common divisor of |a| and
|b|, I have (a, b) ≤ (|a|, |b|).
In similar fashion, (|a|, |b|) is a common divisor of a and b, so (|a|, |b|) ≤ (a, b).
Therefore, (a, b) = (|a|, |b|).

(f) (a, 1) | 1, but (a, 1) ≥ 1. The only positive integer that divides 1 is 1. Hence, (a, 1) = 1.

I’ll use the Division Algorithm to derive a method for computing the greatest common divisor of two
numbers. The idea is to perform the Division Algorithm repeatedly until you get a remainder of 0. First, I
need a lemma which is useful in its own right.

Lemma. If a and b are integers, not both 0, and k is an integer, then

(a, b) = (a + kb, b).

Proof. If d divides a and b, then d divides kb, so d divides a + kb. Thus, d is a common divisor of a + kb
and b.
If d divides a + kb and b, then d divides kb, so d divides (a + kb) − kb = a. Thus, d is a common divisor
of a and b.
I’ve proved that the set of common divisors of a and b is the same as the set of common divisors of a + kb
and b. Since the two sets are the same, they must have the same largest element — that is, (a, b) = (a+kb, b).

The lemma says that the greatest common divisor of two numbers is not changed if I change one of the
numbers by adding or subtracting an integer multiple of the other. This can be useful by itself in determining
greatest common divisors.

Example. Prove that if n is an integer, then

(2n2 + 5n + 5, n2 + 2n + 2) = 1.

The idea is to subtract multiples of one number from the other to reduce the powers until I get an
expression which is clearly equal to 1.

(2n2 + 5n + 5, n2 + 2n + 2) = (2n2 + 5n + 5 − 2(n2 + 2n + 2), n2 + 2n + 2)

= (n + 1, n2 + 2n + 2)
= (n + 1, n2 + 2n + 2 − n(n + 1))
= (n + 1, n + 2)
= (n + 1, n + 2 − (n + 1)
= (n + 1, 1)
=1

Theorem. (The Euclidean Algorithm) Let a0 , a1 ∈ Z+ , and suppose a0 ≥ a1 . Define q1 , q2 , . . . and a2 ,

2
a3 , . . . by recursively applying the Division Algorithm:

a 0 = a 1 q1 + a 2 , where 0 ≤ a2 < a1
a 1 = a 2 q2 + a 3 , where 0 ≤ a3 < a2

..
.
ak = ak+1 qk+1 + ak+2 , where 0 ≤ ak+2 < ak+1
..
.

Then:

(a) The process will terminate with an+1 = 0 for some n.

(b) At the point when the process terminates, (a0 , a1 ) = an .

Proof. There is no question that I can apply the Division Algorithm as described above, as long as ak 6= 0.
First, I’ll show that the process terminates with an+1 = 0 for some n.
Note that a1 > a2 > a3 > · · · is a decreasing sequence of nonnegative integers. The well-ordering
principle implies that this sequence cannot be infinite. Since the only way the process can stop is if a
remainder is 0, I must have an+1 = 0 for some n.
Suppose an+1 is the first remainder that is 0. I want to show (a0 , a1 ) = an .
At any stage, I’m starting with ak and ak+1 and producing qk+1 and ak+2 using the Division Algorithm:

ak = ak+1 qk+1 + ak+2 , where 0 ≤ ak+2 < ak+1 .

Since ak+2 = ak − ak+1 qk+1 , the previous lemma implies that

(ak , ak+1 ) = (ak − ak+1 qk+1 , ak+1 ) = (ak+2 , ak+1 ) = (ak+1 , ak+2 ).

This means that

(a0 , a1 ) = (a1 , a2 ) = · · · = (an , an+1 ) = (an , 0) = an .
In other words, each step leaves the greatest common divisor of the pair of a’s unchanged. Thus,
(a0 , a1 ) = an .

Example. (Using the Euclidean algorithm to find a greatest common divisor) Use the Euclidean
algorithm to compute (51, 36).

Write
51 = 1 · 36 + 15
36 = 2 · 15 + 6
15 = 2·6 + 3
6 = 2·3 + 0
To save writing — and to anticipate the setup I’ll use for the Extended Euclidean Algorithm later —
I’ll arrange the computation in a table:
51 -
36 1
15 2
6 2
3 2

3
 The greatest common divisor is the last nonzero remainder (3). Hence, (51, 36) = 3.

Definition. If a and b are things, a linear combination of a and b is something of the form sa + tb, where
s and t are numbers. (The kind of “number” depends on the context.)

The next result is a key fact about greatest common divisors.

Theorem. (Extended Euclidean Algorithm) (a, b) is a linear combination of a and b: (a, b) = sa + tb

for some integers s and t.

Note: s and t are not unique.

Proof. The proof will actually give an algorithm which constructs a linear combination. It is called a
backward recurrence, and it appears in a paper by S. P. Glasby [2]. It will look a little complicated, but
you’ll see that it’s really easy to use in practice.
(a, b) is only defined if at least one of a, b is nonzero. If a 6= 0, (a, 0) = a and a = 1 · a + 0 · 0. This
proves the result if one of the numbers is 0, so I may as well assume both are nonzero. Moreover, since
(a, b) = (|a|, |b|), I can assume both numbers are positive.
Suppose a ≥ b. Apply the Euclidean Algorithm to a0 = a and a1 = b, and suppose that an is the last
nonzero remainder:
a0 = a1 q1 + a2 , where 0 ≤ a2 < a1
a 1 = a 2 q2 + a 3 , where 0 ≤ a3 < a2

..
.
ak = ak+1 qk+1 + ak+2 , where 0 ≤ ak+2 < ak+1
..
.
an−1 = an qn + 0.
I’m going to define a sequence of numbers yn , yn−1 , . . . y1 , y0 . They will be constructed recursively,
starting with yn , yn−1 and working downward to y0 . (This is why this is called a backward recurrence.)
Define yn = 0 and yn−1 = 1. Then define

yk−1 = qk yk + yk+1 for k = n − 2, . . . , 2, 1.

Now I claim that

(−1)n+k+1 ak−1 yk + (−1)n+k ak yk−1 = an for 1 ≤ k ≤ n.

I will prove this by downward induction, starting with k = n and working downward to k = 1.
For k = n, I have

(−1)2n+1 an−1 yn + (−1)2n an yn−1 = −an−1 yn + an yn−1 = −an−1 · 0 + an · 1 = an .

The result holds for k = n.

Next, suppose 1 < k < n. Suppose the result holds for k + 1, i.e.

(−1)n+k+2 ak yk+1 + (−1)n+k+1 ak+1 yk = an .

I want to prove the result for k. Substitute yk+1 = yk−1 − qk yk in the preceding equation and simplify:

an = (−1)n+k+2 ak yk+1 + (−1)n+k+1 ak+1 yk = (−1)n+k+2 ak (yk−1 − qk yk ) + (−1)n+k+1 ak+1 yk =

(−1)n+k ak (yk−1 − qk yk ) + (−1)n+k+1 ak+1 yk = (−1)n+k ak yk−1 + (−1)n+k+1 ak qk yk + (−1)n+k+1 ak+1 yk =

4
 (−1)n+k ak yk−1 + (ak qk + ak+1 )(−1)n+k+1 yk = (−1)n+k ak yk−1 + (−1)n+k+1 ak−1 yk .
This proves the result for k, so the result holds for 1 ≤ k ≤ n, by downward induction.
In particular, for k = 1, the result says

an = (−1)n+1 a1 y0 + (−1)n+2 a0 y1 = (−1)n+1 a1 y0 + (−1)n a0 y1 = ((−1)n y1 ) a0 + (−1)n+1 y0 a1 .

Since an = (a0 , a1 ), I’ve expressed (a0 , a1 ) as a linear combination of a0 and a1 .

Remark. There are many algorithms (like the one in the proof) which produce a linear combination. This
one is pretty good for small computations which you’re doing by hand.
One drawback of this algorithm is that you need to know all of the quotients (the q’s) in order to work
backwards to get the linear combination. This isn’t bad for small numbers, but if you’re using large numbers
on a computer, you’ll need to store all the intermediate results. There are algorithms which are better if
you’re doing large computations on a computer (see [1], page 300).

It’s difficult to overemphasize the importance of this result! It has many applications — from proving
results about greatest common divisors, to solving Diophantine equations. I’ll give some examples which
illustrate the result, then discuss how you use the algorithm in the theorem.
Before I give examples of the algorithm, I’ll look at some other ways of finding a linear combination.

Definition. Let a, b ∈ Z. a and b are relatively prime if (a, b) = 1.

Example. (A linear combination for a greatest common divisor) Show that 12 and 25 are relatively
prime. Write their greatest common divisor as as linear combination with integer coefficients of 12 and 25.
In some cases, the numbers are nice enough that you can figure out a linear combination by trial and error.
In this case, it’s clear that 12 = 22 · 3 and 25 = 52 are relatively prime. So (12, 25) = 1; to get a linear
combination, I need multiples of 12 and 25 which differ by 1. Here’s an easy one:

(−2) · 2 + 1 · 25 = 1.

Note that 23 · 12 + (−11) · 25 = 1, so the linear combination is not unique.

Example. (Finding a linear combination by algebra) Use the Division Algorithm computations in the
Euclidean algorithm to find an integer linear combination of 51 and 36 that is equal to (51, 36) = 3.

It’s possible — but tedious — to use the computations in the Euclidean algorithm to find linear combi-
nations. For (51, 36), I have
51 = 1 · 36 + 15
36 = 2 · 15 + 6
15 = 2 · 6 + 3
6=2·3+0
The third equation says 3 = 15 − 2 · 6.
By the second equation, 6 = 36 − 2 · 15, so

3 = 15 − 2 · (36 − 2 · 15) = 5 · 15 − 2 · 36.

The first equation says 15 = 51 − 36, so

3 = 5 · (51 − 36) − 2 · 36 = 5 · 51 − 7 · 36.

I’ve expressed the greatest common divisor 3 as a linear combination of the original numbers 51 and 36.
I don’t recommend this approach, since the proof of the Extended Euclidean Algorithm gives a method
which is much easier and less error-prone.

5
Example. (Finding a linear combination using the backward recursion) Find (187, 102) and express
it as a linear combination with integer coefficients of 187 and 102.

In this example, I’ll show how you can use the bakcward recursion to obtain a linear combination. I’ll
arrange the computations in the form of a table; the table is simply an extension of the table I used for the
Euclidean algorithm.
In this example only, I’m labelling the columns with the variable names a, q, and y from the proof so
you can see the correspondence. Normally, I’ll omit them.
Here’s how you start:

a q y

187 -

102

(You can save a step by putting the larger number first.)

The a and q columns are filled in using the Euclidean algorith, i.e. by successive division: Divide the
next-to-the-last a by the last a. The quotient goes into the q-column, and the remainder goes into the
a-column.
a q y a q y

187 - 187 -

102 1 102 1

85 85 1

17

Divide 187 by 102; Divide 102 by 85;

Quotient 1, remainder 85. Quotient 1, remainder 17.
When the division comes out evenly, you stop adding rows to the table. In this case, 85 divided by 17
is 5, and the remainder is 0.

a q y

187 -

102 1

85 1

17 5

The last entry in the a-column is the greatest common divisor. Thus, (187, 102) = 17.

6
 Having filled in the a and q columns, you now fill in the y-column from bottom to top. You always start
in the same way: The last y is always 0 and the next-to-the-last y is always 1:

a q y

187 -

102 1

85 1 1

17 5 0

Then, working from bottom to top, fill in the y’s using the rule

(next y) = (last q) · (last y) + (next-to-last y).

This comes from the recursion formula in the Extended Euclidean Algorithm Theorem:

ak = ak+1 qk+1 + ak+2 .

It’s probably easier to show than it is to explain:

a q y a q y

187 - 187 - 2

102 1 1 102 1 1

85 1 1 85 1 1

17 5 0 17 5 0

1·1+0=1 1·1+1=2

To get the linear combination, form the products of the top two a’s and y’s diagonally and subtract one
from the other:
a q y

187 - 2

102 1 1

85 1 1

17 5 0

Thus,
17 = (187, 102) = (2)(102) − (1)(187).

7
 How do you know the order for the subtraction? The proof gives a formula, but the easiest thing is to
pick one of the two ways, then fix it if it isn’t right. If you subtract “the wrong way”, you’ll get a negative
number. For example,
(1)(187) − (2)(102) = −17.

Since I know the greatest common divisor should be 17 — it’s the last number in the a-column — I just
multiply this equation by −1:
(−1)(187) + (2)(102) = 17.

This way, you don’t need to memorize the exact formula.

Example. (Finding a linear combination using the backward recursion) Compute (246, 194) and
express it as an integer linear combination of 246 and 194.

246 - 52
194 1 41
52 3 11
38 1 8
14 2 3
10 1 2
4 2 1
2 2 0

Thus,
2 = (246, 194) = 52 · 194 − 41 · 246.

Example. (The converse of the linear combination result) Give specific numbers a, b, m, n and d
such that
am + bn = d but (m, n) 6= d.

The converse of the linear combination result is not always true. That is, if sa+tb = z for some numbers
s and t, it’s not necessarily true that z = (a, b).
For example, 15 = 1 · 51 + (−1) · 36. But (51, 36) = 3 6= 15.

There’s an important situation in which the linear combination result does work backwards: namely,
when the greatest common divisor is 1. The next result makes this precise, and also shows how you can use
the linear combination rule to prove results about greatest common divisors.

Proposition. Let a, b ∈ Z. Then (a, b) = 1 if and only if

sa + tb = 1 for some s, t ∈ Z.

Proof. The greatest common divisor of a and b can be written as a linear combination of a and b. Therefore,
if (a, b) = 1, then
1 = (a, b) = sa + tb for some s, t ∈ Z.

8
 Conversely, suppose that sa + tb = 1 for some s, t ∈ Z. (a, b) divides a and (a, b) divides b, so (a, b)
divides sa+tb = 1. But (a, b) is a positive integer, and the only positive integer that divides 1 is 1. Therefore,
(a, b) = 1.

Example. (Using a linear combination to prove relative primality) Prove that if k is any integer,
10k + 6
then the fraction is in lowest terms.
12k + 7
116
For example, if k = 11, the fraction is , which is in lowest terms.
139
A fraction is in lowest terms if the numerator and denominator are relatively prime. So I want to show
that 10k + 6 and 12k + 7 are relatively prime.
I’ll use the previous result, noting that

6(10k + 6) + (−5)(12k + 7) = 1.

I found the coefficients by playing with numbers, trying to make the k-terms cancel.
Since a linear combination of 10k + 6 and 12k + 7 equals 1, the last proposition shows that 10k + 6 and
12k + 7 are relatively prime.

The linear combination rule is often useful in proofs involving greatest common divisors. If you’re
proving a result about a greatest common divisor, consider expressing the greatest common divisor as a linear
combination of the two numbers.

Proposition. Let a and b be integers, not both 0. If c | a and c | b, then c | (a, b).

Proof.(a, b) is a linear combination of a and b, so

(a, b) = sa + tb for some s, t ∈ Z.

Now c | a and c | b, so c | sa + tb = (a, b).

(a, b) was defined to be the greatest common divisor of a and b, in the sense that it was the largest
common divisor of a and b. The last lemma shows that you can take greatest in a different sense — namely,
that (a, b) must be divisible by any other common divisor of a and b.

Example. (Using the linear combination result to prove a greatest common divisor property)
Prove that if (a, b) = 1 and k > 0, then (ka, kb) = k.

Since (a, b) = 1,
ma + nb = 1 for some m, n ∈ Z.
Multiplying by k, I get
kma + knb = k.
(ka, kb) | ka and (ka, kb) | kb, so (ka, kb) | kma + knb = k.
On the other hand, k | ka and k | kb, so k | (ka, kb).
Since k and (ka, kb) are positive integers, (ka, kb) = k.

9
[1] Alfred Aho, John Hopcroft, and Jeffrey Ullman, The Design and Analysis of Computer Algorithms.
Reading, Massachusetts: Addison-Wesley Publishing Company, 1974.

[2] S. P. Glasby, Extended Euclid’s algorithm via backward recurrence relations, Mathematics Magazine,
72(3)(1999), 228–230.

c 2018 by Bruce Ikenaga 10