Scribd Logo
Importer

Bienvenue sur Scribd !

  • HW #5, Section 4.4 Solutions

    Transféré par

    Antonio Hernandez
    14 vues15 pages
    epp solutions

    Titre original

    (550534830) hw-5-sec-4.4-epp-solns

    Copyright

    © © All Rights Reserved

    Formats disponibles

    DOCX, PDF ou lisez en ligne sur Scribd

    Avez-vous trouvé ce document utile ?

    Ce contenu est-il inapproprié ?

    Signaler ce document
    epp solutions

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme DOCX, PDF ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    14 vues15 pages

    HW #5, Section 4.4 Solutions

    Transféré par

    Antonio Hernandez
    epp solutions

    Droits d'auteur :

    © All Rights Reserved
    Téléchargez comme DOCX, PDF ou lisez en ligne sur Scribd
    Signaler comme contenu inapproprié
    sur 15
    HW#5, Section 4.4 Solutions 2.q=8r=6 4. q=0,r=3 6 q=-4,r=5 10. a. 158.0 11. 6. When today is Sunday, 7 days from today is Sunday also. Hence DayN should be 0. Substituting Day’ = 0 (Sunday) and n = 7 into the formula gives DayN = (DayT + N) mod 7 = (0 +7)mod 7 =0, which agrees. ¢. When today is Thursday, twelve days from today is one week (whieh is Thursday) plus five days (which is Tuesday). Hence DaylV should be 2. Substituting DayT = 4 (Thursday) and N = 12 into the formula gives the correct result: DayN = (DayT + N)mod 7 = (4412)mod 7 = 16mod 7 = 12. Let the days of the week be mumbered from 0) (Sunday) through 6 (Saturday) and let Day’ and DayN be variables representing the day of the week today and the day of the week N’ days from today. By the quotient-remainder theorem, there exist unique integers q and r such that: DayT +N =%q+r and 0 3. By the quotient-remainder theorem with d= 3, we know that 1» = 3g, or n = 3¢ + 1, or n = 39 +2 for some integer q. Note that because n is greater than 3, either q is greater than 1 or q = 1 and n = 4 = 3q+1orq=1 and n=5=3q+2. Case 1 (q > 1 and n= 3q): In this case, 1 is not prime because it is a product of 3 and qand both 3 and q are greater than 1. Case 2 (q>1 and n = q+ 1): In this case, n4+2 = (3q41)+2__ by substimtion 3q+3 3(q+1) by algebra. So n +2 is not prime because it is a product: of 3 and q +1 and both 3 and q + 1 are greater than 1. Case 3 (q >1 and n = 8q +2): In this case, nt+4 = (3g+2)44 by substitution 3g +6 3(q+2) by algebra. Son +4 is not prime because it is a product of 3 and q +2 and both 3 and q +2 are greater than 1 Conclusion: In all three cases, at least one of n or n +2 or n +4 is not prime. 35. Proof: Suppose n is any integer. By the quotient-remainder theorem with d= 2, n = 2g or n= 2q +1 for some integer 4. Case 1 (n = 2q for some integer q): In this case, by substitution, nt = (2q)* = 1694 = 8(24%). Let m = 2g". Then m is an integer because it is a product of integers. Hence n4 = 8m where ‘mis an integer. Case 2 (n= 2q +1 for some integer q): In this case, by substitution, nt = (2g+1)! by substitution (29+ 129+ 1)? (4g? + dq + 1)(4q + 4q + 1) 16y! + 1693 + 4q? + 1643 + 16g? + 49 + 4g? 4+ 4q 41 16 + 32g? + 24g? + 8g +1 8(2q! + 4g? + 3q? +4) 41 by algebra, Lot m = 2q* + 4g" +34 +4. Then m is an integer because products and sums of integers are integers. Hence n‘ = 8m +1 where m is an integer. Conclusion: In both cases n* = 8m or n# = 8m +1 for some integer m. Note: If Theorem 4.4.3 is used, it can be shown that for any integer n, nt = 16m or n* = 16m +1 for some integer m. Sce the solntion to exercise 43 for a. partial proof of this result. 36. Proof: 37. Proof: Let n be any integer. (We must show that n? = 4k orn? = 4k +1 for some integer k.] By the quotient-remainder theorem, n = 2q or n = 2q +1 for some integer 4. Case 1 (n = 2g for some integer q): In this ease, we (2g)? by substitusion dq? by algebra. Let k= q?. Then & is an integer because it is a product of integers. Hence n? = 4k for some integer k. Case 2 (n = 2q +1 for some integer q): In this case, nw? = (g4+1) by substitution = 4g? 4 4q4 AG? +q) +1 by algebra. Lot k = q? +g. Then & is an integer because it is a sum of products of integers. Hence n2 = dk + 1 for some integer k. Conclusion: It follows that in both possible cases, there is an integer k such that n? = dk or n? = 4k +1 [as was to be shown]. n(n tm +2)(n 43) = (Ab+2)(46+3)(4k +4445) by substitution 8[(2k + 1)(4k +3)(k+1)(4k+5)] by algebra, and this is divisible by 8 (because k is an integer and sums and products of integers are integors). Case 4 (n = 4k +3 for some integer k): In this case, n(n + 1(n+2)(n+3) (4h + 3)(4k + 4)(4k +5)(4e +6) by substitution Si(dk + 3)(k + 1)(4k +5)(2k-+3)] by algebra, and this is divisible by 8 (because k is an integer and sums and products of integers are integers). Conclusion: In all four possible cases, 8 | n(n + 1)(n +2)(n +3) fas was to be shoun). Note: One can make use of exercise 17 to produce a proof that only requires two cases: 1 is even and n is odd. ‘Then, since both n(n +1) and (n +2)(n +3) are products of consecutive integers, by the result of exercise 17, both products are even and hence contain a factor of 2. Mnltiplying those two factors shows that there is a factor of 4 in n(n+1)(m-+2)(n +3) 38. Proof: Let n be any integer. [We must show that n® +5 is not divisible by 4 for any integer k.] 39. Prout Cousider any four consecutive integers. Call the siuallest n. ‘Then the sum of the four integers is nt (n 41) +(n+2)4 (a +3) =4n46=d(n 41) +2. Let k =n +1. Then k is an integer because it is a sum of integers. Hence n can be written im the required form. Let k = q? +1. Then k is an integer because it is a product of integers, and thus n? +5 has the form 4k +1 for some integer k. So, by the uniqueness part of the quotient-remainder theorem, the remainder obtained when n? +5 is divided by 4 is 1, not 0, and so n? +5 is not divisible by 4 Case 2 (n is add): In this ease, n = 2q +1 for some integer g. Then n2+5 (2q+ 1)? +5 by substitution (4g? + 4g +1) +5 (49? + 4q-+4) +2 A? +q41)4+2 by algebra, Let k = q? +4 +1. Then k is an integer because it is a product of integers, and thus n? +5 has the form 4k +2 for some integer k. So, by the uniqueness part of the quotient-remainder theorem, the remainder obtained when n? +5 is divided by 4 is 2, not 0, and so n? +5 is not divisible by 4. Conclusion: In both possible cases n? +5 is not divisible by 4. Note: The proof of the uniqueness part of the quotient-remainder theorem is asked for in Exercise 18 of Section 4.6, Example 4.5.2 and exercise 16n in Section 4.6 provide experience that leads up to this proof. 40. Proof: Let m be any integer and observe that n(n? = 1)(n +2) = (n= 1n(nt Lin +2), which is a product of four conscentive integers. By exercise 36, this product is divisible by 8, and hence by transitivity of divisibility (Theorem 4.3.3) the product is divisible by 4 [as was to be shown}. Note: ‘The statement ean also be proved directly without using exercise 36 by dividing into four cases as is done in the proof for exercise 36. Another way to prove it is by using Theorem 4.4.3 and dividing into two eases, as was done in the proof given in the solution for exercise 38, sk or m® = 5k +1, or m? = 5k+4 41. Proof: Let m be any integer./We must show that m? Tar ehsia devtdaar iT Tit thin swintint-eomnaindan theca 42. Proof: Let p be any prime number except 2 or 3. By the quotient-remainder theorem, there is ‘an integer so that p can be written as p= 8k or p=Gk+1 or p=6k+2 or p=Gk+3 or p=Gk+4 or p=6k+5. Since p is prime and p # 2, p is not divisible by 2. Consequently, p # 6k, p # 6k +2, and p 76k +4 for any integer k [because all of these numbers are divisible by 2). Furthermore, since p is prime and p #3, p is not divisible by 3. Thus p # 6-43 [because this number is divisible by 3). ‘Therefore, p = 6k +1 or p= 6k +5 for some integer k 43. Proof: Let n be any odd integer. By Theorem 4.4.3, n? = 8m + 1 for some integer m. Then nt (8m+1)? by substitution 4m? 4 16m +1 16(4m? +m) +1 by algebra But 4m? +m is an integer (because it is a sum of products of integers), and so by the quotient- remainder theorem, the remainder obtained when n* is divided by 16 is 1. Hence by definition of mod, nt mod 16 = 1. = Bat +Wa+4 44, Proof: Let zr and y be any real numbers. Case 1 (x and y are both nonnegative): In this case | nonnegative. So |ry| = zy = || - |v]. Case 2 (« is nonnegative and y is negative): In this case So |ry| = ~(ry) = 2(—y) = |= Ia}. Case 3 (x is negative and y is nonnegative): In this case (ry) = (—2)y = |] - Iu}. |yl = y, and ary is also =, |y| =—y and ay <0. lyl =y and zy <0. : In this case |x| = —x, |y| =—y, and cy > 0. So | |y| [as was to be shown). ence m* = a8 +4 108 some mteger x. Case 5 (m = 5q +4 for some integer q): In this case, (5q+ 4)? by substitution 25q? + 40q + 16 25q? + 40q +15 +1 5(5q? +8q+3)+1 by algebra, Let k = 5q? +8q +3. Then k is an integer because it is a sum of products of integers, and hence m? = 5k +1 for some integer k. Conclusion: In all cases m? has one of the required forms, 45. Proof: Let ¢ be any positive real number and let r be any real immber. Suppose that —¢ < i (BN thin feichinbrerrelrar here ‘Avenemaitie Ay TAG’ either eS fewer nefl 46. Proof: Suppose that |r| < .(**) By the trichotomy law, either r > 0 or r <0. Case 1 (r > 0): In this case |r| =r, and so by substitution into (**), r <¢. Since r > 0 and ¢ > r, then ¢ > 0 by transitivity of order (Appendix A, T18). Then, by property T24 of Appendix A, 0 > —c, and, again by transitivity of order, r > —e. Hence —e —c. Also since r < Oand 0 <¢, then r 0 or r < 0, we have that —c

    Vous aimerez peut-être aussi