2. Integers and Algorithms Euclidean Algorithm. Euclidean Algorithm. Suppose a and b are integers

Transcription

1 2. INTEGERS AND ALGORITHMS Integers and Algorithms 2.1. Euclidean Algorithm. Euclidean Algorithm. Suppose a and b are integers with a b > 0. (1) Apply the division algorithm: a = bq + r, 0 r < b. (2) Rename b as a and r as b and repeat until r = 0. The last nonzero remainder is the greatest common divisor of a and b. The Euclidean Algorithm depends upon the following lemma. Lemma If a = bq + r, then GCD(a, b) = GCD(b, r). Proof. We will show that if a = bq + r, then an integer d is a common divisor of a and b if, and only if, d is a common divisor of b and r. Let d be a common divisor of a and b. Then d a and d b. Thus d (a bq), which means d r, since r = a bq. Thus d is a common divisor of b and r. Now suppose d is a common divisor of b and r. Then d b and d r. Thus d (bq + r), so d a. Therefore, d must be a common divisor of a and b. Thus, the set of common divisors of a and b are the same as the set of common divisors of b and r. It follows that d is the greatest common divisor of a and b if and only if d is the greatest common divisor of b and r. Discussion The fact that the Euclidean algorithm actually gives the greatest common divisor of two integers follows from the division algorithm and the equality in Lemma Applying the division algorithm repeatedly as indicated yields a sequence of remainders r 1 > r 2 > > r n > 0 = r n+1, where r 1 < b. Lemma says that GCD(a, b) = GCD(b, r 1 ) = GCD(r 1, r 2 ) = = GCD(r n 1, r n ). But, since r n+1 = 0, r n divides r n 1, so that GCD(r n 1, r n ) = r n. Thus, the last nonzero remainder is the greatest common divisor of a and b. Example Find GCD (1317, 56).

2 2. INTEGERS AND ALGORITHMS = 56(23) = 29(1) = 27(1) = 2(13) = 1(2) + 0 GCD (1317,56)=1 Example shows how to apply the Euclidean algorithm. Notice that when you proceed from one step to the next you make the new dividend the old divisor (replace a with b) and the new divisor becomes the old remainder (replace b with r). Recall that you can find the quotient q by dividing b into a on your calculator and rounding down to the nearest integer. (That is, q = a/b.) You can then solve for r. Alternatively, if your calculator has a mod operation, then r = mod(a, b) and q = (a r)/b. Since you only need to know the remainders to find the greatest common divisor, you can proceed to find them recursively as follows: Basis. r 1 = a mod b, r 2 = b mod r 1. Recursion. r k+1 = r k 1 mod r k, for k 2. (Continue until r n+1 = 0 for some n. ) 2.2. GCD s and Linear Combinations. Theorem If d = GCD(a, b), then there are integers s and t such that d = as + bt. Moreover, d is the smallest positive integer that can be expressed this way. Discussion Theorem gives one of the most useful characterizations of the greatest common divisor of two integers. Given integers a and b, the expression as + bt, where s and t are also integers, is called a linear combination of a and b. Exercise Prove that if a, b, s, t, and d are integers such that d a and d b, then d (as + bt). The Euclidean Algorithm can, in fact, be used to provide the representation of the greatest common divisor of a and b as a linear combination of a and b. Here is how it would work for the example in Example

3 2. INTEGERS AND ALGORITHMS 157 Example Express 1 = GCD(1317, 56) as a linear combination of 1317 and 56. Solution: We work backwards using the equations derived by applying the Euclidean algorithm in example 2.1.1, expressing each remainder as a linear combination of the associated divisor and dividend: 1 = linear combination of 2 and 27 1 = 27 13( ) substitute 2 = 29 27(1) 1 = linear combination of 27 and 29 1 = 14( ) substitute 27 = = linear combination of 29 and 56 1 = ( ) substitute 29 = = linear combination of 56 and 1317 (The dividends, divisors, and remainders have been underlined.) So GCD(1317, 56) = 1 = 1317( 27) + 56(635). Theorem can be proved by mathematical induction following the idea in the preceding example. Proof of Theorem Suppose a and b are integers. We may assume a and b are positive, since GCD(a, b) = GCD(±a, ±b). The Euclidean algorithm uses the division algorithm to produce a sequence of quotients and remainders as follows: r n 2 a = bq 1 + r 1 b = r 1 q 2 + r 2 r 1 = r 2 q 3 + r 3. = r n 1 q n + r n r n 1 = r n q n where r n is the last nonzero remainder. We will use the second principle of mathematical induction to prove that r k is a linear combination of a and b for 1 k n. 1. Basis Step (k = 1). r 1 = a bq 1 = a(1) + b( q 1 ). 2. Induction Step. Suppose r i is a linear combination of a and b for 1 i k. For 1 k n we have r k+1 = r k 1 r k q k+1

4 2. INTEGERS AND ALGORITHMS 158 (where r 0 = b when k = 1). By the inductive hypothesis r k 1 and r k are linear combinations of a and b. (This works for k = 1, since r 0 = b is trivially a linear combination of a and b.) Write and r k 1 = as 1 + bt 1 r k = as 2 + bt 2 for integers s 1, t 1, s 2, t 2, and substitute into the equation above: r k+1 = (as 1 + bt 1 ) (as 2 + bt 2 )q k+1 = a(s 1 s 2 q k+1 ) + b(t 1 t 2 q k+1 ). Thus, r k+1 is a linear combination of a and b. By the second principle of mathematical induction, r n is a linear combination of a and b. But r n is the greatest common divisor of a and b. This proves the first part of the theorem. Next, we show that d is the smallest positive integer expressible as a linear combination of a and b. Suppose a positive integer c can be expressed as a linear combination of a and b: c = ax + by for integers x and y. Since d a and d b, then d c, which implies d c. Here is an alternative proof of Theorem that does not use the Euclidean algorithm. Second proof of Theorem Let S be the set of all positive integers that can be expressed as a linear combination of the positive integers a and b. Clearly S, since a, b S. By the well-ordering principle S has a least element d. We will prove by contradiction that d a and d b. If d a, then use the division algorithm to get integers q and r such that a = dq + r, where 0 < r < d. Since both a and d are linear combinations of a and b, then r = a dq is also. But this means that r S, contradicting the fact that d is the smallest member of S. Similarly, one shows that d b. If c is a divisor of a and b, then c divides any linear combination of a and b; hence, c d. Thus, d = GCD(a, b). Exercise Prove that if p is a prime number and n is an integer that is not divisible by p, then there are integers s and t such that ps + nt = 1. [First show that GCD(p, n) = 1.]

5 2. INTEGERS AND ALGORITHMS Exercise Prove that if 1 is a linear combination of a and b, then GCD(a, b) = 2.3. Uniqueness of Prime Factorization. Lemma If GCD(a, b) = 1 and a bc, then a c. Proof. Assume GCD(a, b) = 1 and a bc. Write 1 = as + bt for integers s and t. Multiply both sides by c: c = acs + bct. Since a bc, a divides this linear combination of a and bc. a(cs) + (bc)t = c Theorem Suppose a and b are integers and p is a prime number. If p ab, then p a or p b. Proof. We will prove the equivalent statement: if p ab and p a, then p b. (You should convince yourself that the two propositional forms P (Q R) and (P Q) R are equivalent.) Suppose p ab and p a. Then GCD(p, a) = 1. By the Lemma 1, p b. Discussion Theorem is very useful in deciding how prime factors are distributed in a product of two integers. For example, we gave an indirect proof in Module 3.2 that if the product of two integers x and y is even, then either x is even or y is even. As we hinted there, a direct proof is possible, and Theorem provides just the right information to make it work. Exercise Use Theorem to give a direct proof that if the product of two integers x and y is even, then either x is even or y is even. Exercise Use mathematical induction to prove the following generalization of Theorem Suppose a 1, a 2,..., a n are integers and p is a prime number. If p a 1 a 2 a n, then p a i for some i = 1, 2,..., n. [Hint: The induction step has two cases.] Exercise Use Lemma to prove that if k, l, and m are positive integers such that k m, l m, and k and l are relatively prime, then the product kl m.

6 2. INTEGERS AND ALGORITHMS 160 Exercise Suppose a and b are positive integers, d = GCD(a, b), a = dk, and b = dl. Prove that k and l are relatively prime. [Hint: Show that 1 can be expressed as a linear combination of k and l.] We can now give a proof of Theorem 6 of Module 5.1 Integers and Division: If a and b are positive integers, then ab = GCD(a, b) LCM(a, b). Proof of Theorem 6, Module 5.1. Let d = GCD(a, b). Write a = dk, b = dl, where k and l are positive integers, which, by Exercise 2.3.4, are relatively prime. Then ab = (dk)(dl) = d (kld) = GCD(a, b) (kld). We will succeed once we show that kld = LCM(a, b). We will prove this by contradiction. Suppose m = LCM(a, b) and m < kld. Observe that kld = (dk)l = al and kld = (dl)k = bk. That is, both a and b divide kld; hence, their least common multiple m does also. Since k a and l b, k and l both divide m; hence, by Exercise 2.3.3, the product kl m. [Aside: We also know that d divides m, so it is tempting to assert that kld also divides m. But we can t use Exercise to conclude this, since d may not be relatively prime to either k or l. Can you give an example where d divides both k and l?] Thus m = klx for some positive integer x, and x < d, by hypothesis. Since m kld, x d. Write d = xy, where y is an integer > 1. Now: a = dk = xyk m = klx, so y l. b = dl = xyl m = klx, so y k. This implies that k and l are not relatively prime, since y > 1. Thus, the assumption m < kld is false, and so m = kld. This generalization of Theorem can be used to prove the uniqueness of prime factorizations asserted in the Fundamental Theorem of Arithmetic (Module 5.1): If n is a positive integer greater than 1, then n can be written uniquely as a product of prime numbers where the factors appear in nondecreasing order.

7 2. INTEGERS AND ALGORITHMS 161 Proof of uniqueness of prime factorization. We have already shown that we can write any integer n > 1 as a product n = p 1 p 2 p k, where each p i is prime. By reordering the factors, if necessary, we can always assume that p 1 p 2 p k. We will prove by induction on k that if an integer n > 1 has a factorization into k primes, k 1, then the factorization is unique. 1. Basis Step (k = 1). In this case n = p 1 is prime, and so it has no other factorization into primes. 2. Induction Step. Assume that every integer that can be factored into k primes has a unique factorization. Suppose where each p i is prime and n = p 1 p 2 p k p k+1, p 1 p 2 p k p k+1. Suppose n has another prime factorization n = q 1 q 2 q l, where each q j is prime (possibly, l k + 1) and q 1 q 2 q l. By the generalization of Theorem in Exercise 2.3.2, since p 1 n = q 1 q 2 q l, then p 1 q j for some j. But q j is also prime, so p 1 = q j q 1. On the other hand, since q 1 p 1 p 2 p k p k+1, then q 1 p i for some i, and since p i is prime, q 1 = p i p 1. But if p 1 q 1 and q 1 p 1, then p 1 = q 1. Thus we can cancel the first factor from both sides of the equation to get p 1 p 2 p k p k+1 = q 1 q 2 q l p 2 p k p k+1 = q 2 q l. The integer on the left-hand side of this equation has a prime factorization using k primes. By the induction hypothesis, this factorization is unique. This means that l = k + 1 and p 2 = q 2, p 3 = q 3,..., p k+1 = q k+1. Thus, p i = q i for 1 i k + 1, and the factorization of n is unique.

8 2. INTEGERS AND ALGORITHMS 162 By the first principle of mathematical induction, every integer greater than one has a unique prime factorization.