150 Chapter 5 Induction and Recursion d) For the indnctive step, we want to show for each & > 1 that P(‘) implies P(k +1). In other words, we want to show that assuming the inductive hypothesis (see part (c)) we can show 2 (k+1 2)(2k + 3) Pak g ee eer? CAVEATS) | e) The left-hand side of the equation in part (d) equals, by the inductive hypothesis, k(k + 1)(2k + 1)/6 + (&+1)?. We neod only do a bit of algebrale manipnlation to get this expression into the desired form: factor ont (k+1)/6 and then factor the rest. In detail (P42? +--+) + (b+ IP = REED OEEY (k+1)? (by the inductive hypothesis) 6 1 (wan +1) + 60+) = 22 an? +1 +6) (e+ Ik + 22k +3) 6 f) We have completed both the basis step and the inductive step, so by the principle of mathematical induetion, tthe statement is trne for every positive integer n. u 4 1 +2)(2k +3) = ae off e4. a) Plugging in n = 1 we have that P(1) is the statement 1° = [1 - (1 +1)/2|*. b) Both sides of P(1) shown in part (a) equal 1. c) The inductive hypothesis is the statement that any? 134234. += ( d) For the inductive step, we want to show for each k > 1 that P(k) implies P(k +1). In other words, v want to show that assuming the inductive hypothesis (see part (c)) we can prove 2 P42 + FREER = (oe?) . ¢) Replacing the quantity in brackets on the left-hand side of part (d) by what it equals by virtue of th inductive hypothesis, we have (BY ss 8 =(k+1)? (E40 :) =(k+1)? (a) = (eoneeeay” . 4 2 as desired, £) We have completed both the basis step and the indnetive step, so by the principle of mathematical indi Han. the etatement $e tne fier en. is true, since 1? = 1+1-3/3. For the inductive step assume We proceed by induction. The basis step, n == the inductive hypothesis that 174324574. + (Qk 4 IP = (Et UGK+ DOF S) We want to show that OPES Ho (2k +1)? + O43)? = OES) (the right-hand side is the same formnla with k+1 plugged in for n). Now the left-hand side equals, by the indnetive hypothesis, (k+1)(2k + 1)(2k-+3)/3-+ (2k-+3)2. We need only do « bit of algebraic manipulation 10 get this expression into the desired form: factor out (2k + 3)/3 and then factor the rest. In detail, (1? +3? +5? +--+ (2h + 1)?) + (2k +3)? A+ 1(2k+ YQk +3) 3 2((k+1)(2k +1) +3(2k +3) = 23 i? +98 +10) 94 emake) +(2k+3)? (by the inductive hypothesis) ae +3 (b+ 2)(2k +5) =6. The basis step ince 1-1! =2!—1. Assuming the inductive hypothesis, we then have LU 2-84 tk RE (RAL) (+1)! = (+1)! -14 (B41) -(R +0)! =(k+1)(1+k+1)—1=(k+2)! as desired.Let P(n) be the proposition 343-5 + 3-5? +--.+3-5" = 3(5"* ~ 1)/4. To prove that this is true for all nonnegative integers n, we proceed by mathematical induction. First we verify P(0), namely that 3 =3(5 —1)/4, which is certainly tne, Next we assume that P(x) is true and try to derive P(k +1). Now P(k-+1) is the formula hea 4 All but the last term of the left-hand side of this equation is exactly the left-hand side of P(k), so by the induetive hypothesis, it equals 3(5**! — 1)/4. Thus we have Dy g.gttt ) B43-543-82 + 0-43-56 43-5 = gett SHS 543-B7 4. +3-5 43-541 1+ The proposition to be proved is P(n): 2aDTHD TP 42-7) Chapter 5 Induction and Recursion In order to prove this for all integers n> 0, we first prove the basis step P(O) and then prove the inductive step, that P(A) implies P(k-+ 1). Now in P(0), the lefchand side has just one term, namely 2, and the right-hand side is (1—(~7)!)/4 = 8/4 = 2. Since 2=2, we have verified that P(0) is true. For the inductive step, we assume that P(k) is true (ie, the displayed equation above), and derive from it the truth of P(k+1) whieh is the equation ‘To prove an equation like this, its usually best to start with the more complicated side and manipulate it until ‘we arrive at the other side. In this case we start on the left. Note that all but the last term constitute precisely the left-hand side of P(k) and therefore by the inductive hypothesis, we eau replace it by the right-hand side of P{k). The rest is algebra went [2-2-742- 72 ---.+2-(-7h] +2: (—7)M tenera) We can obtain a formula for the sum of the first even positive integers from the formula for the sun. of the first positive integers, since 24+4+64+--+2n=204+243+----+n). ‘Therefore, using the result of Example 1, the sum of the first n even positive integers is 2(n(n + 1)/2) = n(n +1) b) We want to prove the proposition P(n) : 2+44+6+-+-+2n=n(n-+1). The basis step, n= 1, says that 2=1-(1+1), which is certainly true. For the inductive step, we assume that P(k) is true, nately that QEAFG 4-4 R= KKH), and try to prove from this assumption that P(k +1) is true, namely that 2HAE 6H F2K4 AEF = (k+INK +). (Note that the left-hand side consists of the sum of the first k +1 even positive integers.) We have DEAF OH $24 K+) = (QHAFGH + 2h) HEFL =k(k+1)+2(k+1) (by the inductive hypothesis) =(k+1)(E+2), as desired, and our proof by mathematical induction is complete.The base case of the statement P(n) : 1-2+2-34---+n(n+1) = n(n+ 1)(n + 2)/3, when n = 1, is 1-2 = 1-2-3/3, which is certainly true. We assume the indnetive hypothesis P(k), and try to derive P(k+1): 1242-84 + MRED SRE NELD) = AEDES IETS Starting with the left-hand side of P(k-+1), we have (L-242-34---4+k(R4 1) + (K+ 16 +2) tk = Hee nes +(k+1)(k+2) (by the inductive hypothesis) = (B+ 1)E+2) G + 1) EG: Die T eee) the right-hand side of P(k +1).a) Plugging in n = 2, we see that P(2) is the statement 2! < 2. b) Since 2! =2, this is the trne statement 2< 4. c) The inductive hypothesis is the statement that kl < k* 4) For the inductive step, we want to show for each k > 2 that P(k) implies P(k +1). In other words, we want to show that assuming the inductive hypothesis (see part (c)) we can prove that (k+ 1)! < (k+1)F+!, e) (k+ 1! = (k+ I)kI < (kh + 1)k* < (e+ 1(k +:1)* = (kh 4 1)AEThis is easy to prove without mathematical induction, because we can observe that n? +n = n(n +1), and either n or n-+ 1 is even. If we want to use the principle of mathematical induction, we can proceed as follows, The basis step is the observation that 1? +1 = 2 is divisible by 2. Assume the inductive hypothesis, that k? +k is divisible by 2; we must show that (« +1)? + (k +1) is divisible by 2. But (k+ 1)? + (K+1) =k? + 2k+14+k41 = (k? +k) +2(k+1). But now k? +k is divisible by 2 by the inductive hypothesis, and 2(k + 1) is divisible by 2 by definition, so this sum of two multiples of 2 must be divisible by 2.a) P(8) is true, because we can form 8 cents of postage with one 3-cent stamp and one 5-cent stamp. P(9) is true, because we can form 9 cents of postage with three 3-cent stamps. P(10) is true, because we can form 10 cents of postage with two 5-cent stamps. b) The indnetive hypothesis is the statement that using just 3-cent and 5-cent stamps we can form j cents postage for all j with 8 10. c) In the inductive step we must show, assuming the inductive hypothesis, that we can form k +1 cents postage using just 3-cent and 5-cent stamps. d) We want to form k +1 cents of postage. Since & > 10, we know that P(k —2) is truc, that is, that we can form k~2 vents of postage. Put one more 3-cent stamp on the envelope, and we have formed k +1 cents of postage, as desired. 162 Chapter 5 Induction and Recursion e) We have completed bath the basis step and the iiductive step, so hy the principle of stroug induction, the statement is true for every integer m greater than or equal to 8.a) P(18) is true, because we can form 18 cents of postage with one 4-cent stamp and two 7-cent stamps. P(19) is true, because we can form 19 cents of postage with three 4-cent stamps and one 7-cent stamp. P(20) is true, because we can form 20 cents of postage with five 4-cent stamps. P(2L) is true, because we can form 20 cents of postage with three 7-cent stamps. b) The inductive hypothesis is the statement that using just d-cent and 7-cent stamps we can form j cents postage for all j with 18 21. c) In the inductive step we must show, assuming the inductive hypothesis, that we can form k +1 cents postage using just 4-cent and 7-cent stamps. d) We want to form k +1 cents of postage. Since k > 21, we know that P(k — 3) is true, that is, that we can form k—3 cents of postage. Put one more 4-cent stamp on the envelope, and we have formed k +1 cents of postage, as desired. e) We have completed both the basis step and the inductive step, so by the principle of strong induction, the statement is true for every integer n greater than or equal to 18.