MATH 307 ASSIGNMENT 7, SPRING 2013 SOLUTIONS

6.4 Assume a, b, n N. Suppose that gcd(a, b) = 1. Prove that gcd(na, nb) = n. Proof. Let d = gcd(na, nb). Since n|na and n|nb, we know n d. On the other hand, since gcd(a, b) = 1, we know there exist x, y Z with ax + by = 1 (Corollary 10.4.5). Thus (na)x +(nb)y = n, which implies d|n (Theorem 11.1.6), which implies d n. Hence d = n as desired.

6.5 Let n N. What is the list of pairs produced when the Euclidean Algorithm is applied to the input (5n, 2n) ? Solution. Heres the algorithm: Input: (5n, 2n) (2n, n) (n, 0). Output: gcd(5n, 2n) = n 5n 2(2n) = n, 2n 2n = 0,

Answer: (5n, 2n), (2n, n), (n, 0).

6.7 Claim 1. 61 is not an integer combination of 9 and 15. Proof. 3|9 and 3|15, so 3 divides any integer combination of 9 and 15. Since 3 61, it follows that 61 is not an integer combination of 9 and 15. Claim 2. 61 is an integer combination of 9 and 16. Proof. 61 = 16 + 5(9).

6.8 For each pair below, use the Euclidean Algorithm to compute the greatest common divisor, and express the greatest common divisor as an integer combination of the two numbers. (a) 126 and 224. Solution. Heres the Euclidean Algorithm: Input: (224, 126) (126, 98) (98, 28) (28, 14) (14, 0). Output: gcd(224, 126) = 14 Now we read the algorithm backwards to write 14 as an integer combination of 126 and 224: 14 = 98 3(28) = 98 3[126 98] = 3(126) + 4(98) = 3(126) + 4[224 126] = 4(224) 7(126) 14 = 4(224) 7(126) 224 126 = 98, 126 98 = 28, 98 3(28) = 14, 28 2(14) = 0,

(b) 221 and 299. Solution. Heres the Euclidean Algorithm: Input: (299, 221) (221, 78) (78, 65) (65, 13) (13, 0). Output: gcd(299, 221) = 13 Now we read the algorithm backwards to write 13 as an integer combination of 221 and 299: 13 = 78 65 = 78 [221 2(78)] = 221 + 3(78) = 221 + 3[299 221] = 3(299) 4(221) 13 = 3(299) 4(221) 299 221 = 78, 221 2(78) = 65, 78 65 = 13, 65 5(13) = 0,

6.9 For each diophantine equation below, nd all solutions, if any exist. (a) 17x + 13y = 200 Solution. Since gcd(17, 13) = 1, we can write 1 as an integer combination of 17 and 13. By either guessing, or using the Euclidean algorithm you can nd 1 = 17(3) + 13(4). Multiply by 200 to get 200 = 17(600) + 13(800). Hence (x, y ) = (600, 800) is one solution. By Theorem 11.4.1, the entire solution set is {(600 + 13k, 800 17k ) : k Z}.

(b) 21x + 15y = 93 Solution. First o, we divide by 3 = gcd(21, 15) to get the following equivalent diophantine equation: 7x + 5y = 31. Now, since gcd(7, 5) = 1, we can write 1 as an integer combination of 7 and 5. By (probably) guessing, or using the Euclidean algorithm you can nd one such integer combination, say 1 = 7(2) + 5(3). Multiply by 31 to get 31 = 7(62) + 5(93). Hence (x, y ) = (62, 93) is one solution. By Theorem 11.4.1, the entire solution set is {(62 + 5k, 93 7k ) : k Z}.

(c) 60x + 42y = 104 Solution. Since 6|60 and 6|42, it follows that 6|(60x +42y ) whenever x, y Z. Since 6 104, there are no integers x and y with 60x + 42y = 104.

(d) 588x + 231y = 63 Solution. First divide by 21 = gcd(588, 231) to get the following equivalent diophantine equation: 28x + 11y = 3. Now, since gcd(28, 11) = 1, we can write 1 as an integer combination of 28 and 11. By guessing, or using the Euclidean algorithm you can nd one such integer combination, say 1 = 28(2) + 11(5). Multiply by 3 to get 3 = 28(6) + 11(15). Hence (x, y ) = (6, 15) is one solution. By Theorem 11.4.1, the entire solution set is {(6 + 11k, 15 28k ) : k Z}.

6.17 Let a, b Z. Prove that gcd(a + b, a b) = gcd(2a, a b) = gcd(a + b, 2b). Proof. Let d = gcd(a + b, a b), d = gcd(2a, a b), and d = gcd(a + b, 2b). To show d = d = d it suces to verify the three inequalities d d d d. Since d|(a + b) and d|(a b), we know d divides their sum (a + b) + (a b) = 2a. Hence d is a common divisor of 2a and a b, which implies d d . Since d |(2a) and d |(a b), we know d divides the following integer combinations: 2a 2(a b) = 2b, 2a (a b) = a + b. Hence d is a common divisor of 2b and a + b, which implies d d . Since d |(a + b) and d |(2b), we know d divides their dierence (a + b) 2b = a b. Hence d is a common divisor of a + b and a b, which implies d d.

6.24 Claim 1. 3 divides 4n 1 for every positive integer n. Proof. (Induct on n) Base case. If n = 1, then 4n 1 = 3 which is divisible by 3. Inductive step. Fix an integer k 1, and assume 3|(4k 1). Then 4k 1 = 3m for some m Z, so that 4k = 3m + 1. Thus 4k+1 1 = 4 4k 1 = 4(3m + 1) 1 = 4(3m) + 3 = 3(4m + 1), which shows 3|(4k+1 1). Claim 2. 6 divides n3 + 5n for every positive integer n. Proof. (Induct on n) Base case. If n = 1, then n3 + 5n = 6 which is divisible by 6. Inductive step. Fix an integer k 1, and assume 6|(k 3 + 5k ). Notice (k + 1)3 + 5(k + 1) = k 3 + 3k 2 + 3k + 1 + 5k + 5 = (k 3 + 5k ) + 3k (k + 1) + 6. ( ) Since one of k and k + 1 must be even, we know 2 divides either k or k + 1. Hence, 2|k (k + 1), which implies 6|3k (k + 1). Hence, using the inductive hypothesis, we see that 6 divides each of the three terms on the right side of ( ). Thus 6 divides (k + 1)3 + 5(k + 1).

6.39 Let n N. Prove that if 2n 1 is prime, then n is prime. Proof. (Contrapositive) Assume n is not prime. Then there exist a, b N such that 1 < a, b < n and n = ab. Hence, by Lemma 6.3.4, we have the following factorization:
b1

2n 1 = (2a )b 1 = (2a 1) (2a 1)|(2n

k=0 a 2

2ak ,

which shows 1). Moreover, 1 < 1 < 2n 1 (since 1 < a < n), a n which shows that 2 1 is a nontrivial divisor of 2 1. Thus 2n 1 is not prime.

6.41 Let an = 22 + 1 for all integers n 0. Claim 1. an divides am 2 whenever n < m. Proof. (Induct on m) Base case. If m = 0, then there are no nonnegative integers strictly less than m, so the statement If n < m, then an |(am 2) is vacuously true. Inductive step. Fix and integer k 0 and assume an |(ak 2) whenever n < k . Notice ak+1 2 = 22
k+1

1 = (22 + 1)(22 1) = ak (ak 2).

Hence ak and ak 2 both divide ak+1 2. Thus ak and all the factors of ak 2 divide ak+1 2. By the inductive hypothesis, this implies ak and all an with n < k divide ak+1 2. In other words, an divides ak+1 2 whenever n < k + 1. Claim 2. an and am are relatively prime whenever n = m. Proof. Let m and n be distinct nonnegative integers, and assume d is a common divisor of an and am . Without loss of generality we may assume n < m. Then, by Claim 1, we know an |(am 2), which implies d|(am 2). Since d also divides am , d must divide the dierence am (am 2) = 2. Hence d {1, 2}. Finally, since n n an = 22 + 1 = 2(22 1 ) + 1 is odd, it follows that d = 2. Hence, gcd(am , an ) = 1 as desired. Claim 3. There are innitely many primes. Proof. Since an > 1 whenever n 0, we know there exist primes p0 , p1 , p2 , p3 , . . . with pn |an for each n 0. By Claim 2, these primes are distinct. Remark. You were not asked to prove the following claim in your homework, but Im adding one to the solutions anyway. Claim 4. Fix an integer N > 2. There are at least log2 (log2 (N )) prime numbers less than N . Proof. First, notice ak N 22 + 1 N 2
2k
k

(denition of ak ) (since N, 22 Z)
k

<N

k < log2 (log2 (N )).

Hence the rst log2 (log2 (N )) numbers in the list a0 , a1 , a2 , . . . are all less than or equal to N . This implies that the corresponding log2 (log2 (N )) prime factors p0 , p1 , p2 , . . . (found in the proof of Claim 3) are also less than or equal to N . Throw in the prime 2, which is not one of the pn s (since each ai is odd), and we have found at least log2 (log2 (N )) primes strictly less than N .

I. Determine the truth value of the following statements, and prove your assertion. (a) m, n Z : gcd(2m + n, m n) gcd(3n, 3m). Answer: True Proof. Set d = gcd(2m + n, m n). Since d|(2m + n) and d|(m n), it follows that d divides the following integer combinations: 3n = (2m + n) 2(m n), Hence, d gcd(3n, 3m) as desired. (b) m, n Z : gcd(2m + n, m n) gcd(3n, 3m). Answer: False Proof. For a counterexample, let m = 2 and n = 1. Then gcd(2m + n, m n) = gcd(5, 1) = 1 3 = gcd(3, 6) = gcd(3n, 3m). 3m = (2m + n) + (m n).