Spring 2012 Math 446 Test 2 Take 1 solutions

(1) Find ALL solutions to the LDE 67x 52y = 1. Perform the Eucildean Algorithm on 67 and 52: 67 = 52 + 15 52 = 3(15) + 7 15 = 2(7) + 1 Solve for the remainders: 1 = 15 2(7) 7 = 52 3(15) 15 = 67 52 Substitute back, and collect like terms: 1 = 7(15) 2(52) 1 = 7(67) 9(52) So x = 7, y = 9 is a solution. Hence {(7 + 52k, 9 + 67k ) | k Z} is the complete solutions set. (2) Find ALL pairs a, b of natural numbers such that gcd(a, b) = 15 and lcm(a, b) = 360. (You do NOT need to prove that your answer is correct.) Take the prime factorizations of a and b: en 1 a = pe 1 . . . pn fn 1 b = pf 1 . . . pn Let cj = min(ej , fj ) and dj = max(ej , fj ) for j = 1, . . . , n. Then cn 0 1 1 1 15 = gcd(a, b) = pc 1 . . . pn = 2 3 5 , and dn 3 2 1 1 360 = gcd(a, b) = pd 1 . . . pn = 2 3 5 , and So p1 = 2, p2 = 3, p3 = 5, c1 = 0, c2 = 1, c3 = 1, d1 = 3, d2 = 2, d3 = 1. So e1 and f1 are 0 and 1, in some order. And e2 and f2 are 1 and 2, in some order. And e3 = f3 = 1. So there are four possibilities: a = 20 31 51 , b = 21 32 51 a = 21 31 51 , b = 20 32 51 a = 20 32 51 , b = 21 31 51 a = 21 32 51 , b = 20 31 51 (3) Find ALL pairs of nonnegative integers r, s such that the LDE 900x + (2r 3s )y = 12 has a solution. We must have gcd(22 32 52 2r 3s )|12 = 22 31 . So min(r, 2) 2 and min(s, 2) 1. So s = 0 or s = 1. But r is arbitrary. So 900x + (2r 3s )y = 12 has a solution i (r, s) is of the form (r, 0) or (r, 1). (4) Please make sure that your cell phone is turned o. Partial credit: Put it on vibrate. (5i) NOTE: Do this problem or (5ii), but NOT both. Let a be an even integer. Prove that the Diophantine equation ax + (a + 2)y = 1 does not have a solution. Both a and a + 2 are divisible by 2. Therefore gcd(a, a + 2) 2. So the Diophantine equation ax + (a + 2)y = 1 does not have a solution.

(5ii) NOTE: Do this problem or (5i), but NOT both. Let a, b, c N. Let d = gcd(a, b). Prove that if c|a and c|b, then c|d. We know that ax + by = d for some integers x, y . So by the Linear Combo Lemma, c|d. (6i) NOTE: Do this problem or (6ii), but NOT both. Let a, b, k N. Prove that gcd(lcm(k, a), lcm(k, b)) = lcm(k, gcd(a, b)). See the solution to Problem 32 from Section 6-2. Change max to min and min to max. (6ii) NOTE: Do this problem or (6i), but NOT both. We say that an integer x is a perfect square if there exists y Z such that x = y 2 . Prove that if a and b are relatively prime natural numbers such that ab is a perfect square, then a and b are both perfect squares. f1 fr en 1 By FTA, the prime factorizations a = pe 1 . . . pn and b = q1 . . . qr have no primes in common, fr en f 1 1 because they are relatively prime. (In other words, ei = fj for all i, j .) So ab = pe 1 . . . p n q1 . . . q r . Because ab is a perfect square, we must have that ab = y 2 for some y . Considering the prime factorization of y and using the uniqueness of prime factorizations, we see that each ei and each fj e /2 e /2 f /2 f /2 e /2 e /2 f /2 f /2 must be even, and y = p11 . . . pnn q11 . . . qr r . So a = (p11 . . . pnn )2 and b = (q11 . . . qr r )2 . Hence a and b are perfect squares. Math Club events are Wednesdays from 3:15-4:15 p.m. in ST-F213. Upcoming Math Dept. events: Wed., May 23, Lynn Cevallos, President, The College Bridge Wed., May 30, Judith Grabiner, Pitzer College, Lagrange, Symmetry, and Space