Precalculus Name___________________________________ ID: 1

Assignment Date________________ Period____

Use mathematical induction to prove that each statement is true for all positive integers.
n
n−1 3 −1
1) 1 + 3 + 9 + … + 3 =
2
2) −1 + 7 + 15 + … + 8n − 9 = n(4n − 5)
n(3n + 13)
3) 8 + 11 + 14 + … + 3n + 5 =
2
4) 35 + 161 + 371 + … + 42n − 7 = 7n (2n + 3)
2 2

2 (2 − 1)
2 2n
2n
5) 4 + 16 + 64 + … + 2 = 2
2 −1
4(4 − 1)
n
n
6) 4 + 16 + 64 + … + 4 =
3
16n(4n − 1)
2
7) 16 + 144 + 400 + … + (8n − 4) =
2
3
n(9n + 25)
8) 17 + 26 + 35 + … + 9n + 8 =
2
9) 9 + 81 + 225 + … + (6n − 3) = 3n(4n − 1)
2 2

10) 30 + 138 + 318 + … + 36n − 6 = 6n (2n + 3)

2 2

11) 6 + 14 + 22 + … + 8n − 2 = n(4n + 2)
12) 5 + 9 + 13 + … + 4n + 1 = n(2n + 3)
13) 25 + 115 + 265 + … + 30n − 5 = 5n (2n + 3)
2 2

14) 17 + 25 + 33 + … + 8n + 9 = n(4n + 13)

4n(4n − 1)
2
15) 4 + 36 + 100 + … + (4n − 2) =
2
3
5(5 − 1)
n
n
16) 5 + 25 + 125 + … + 5 =
4
3n
3n − 3 2 −1
17) 1 + 8 + 64 + … + 2 = 3
2 −1
3(3 − 1)
2n
2n − 1
18) 3 + 27 + 243 + … + 3 = 2
3 −1
n(7n + 19)
19) 13 + 20 + 27 + … + 7n + 6 =
2
20) 5 + 23 + 53 + … + 6n − 1 = n (2n + 3)
2 2

2(2 − 1)
3n
3n − 2
21) 2 + 16 + 128 + … + 2 = 3
2 −1
-1- Worksheet by Kuta Software LLC
©o m2Y0V2p4s oKUuFtka\ sSPoJfHtvwFaartev DLeLqCI.t O vAolalZ LrliDgIhqt^sV ErxedsIeXrbvVe\dP.Y H MMQasdQeX twTiVt_hW \I\nyfmilnoigtReT GP`rEeBcQacldcSuqlmuksL.
 22) 40 + 184 + 424 + … + 48n − 8 = 8n (2n + 3)
2 2

n(9n − 3)
23) 3 + 12 + 21 + … + 9n − 6 =
2
24) −1 + 3 + 7 + … + 4n − 5 = n(2n − 3)
25) 10 + 12 + 14 + … + 2n + 8 = n(n + 9)
26) 20 + 92 + 212 + … + 24n − 4 = 4n (2n + 3)
2 2

2 (2 − 1)
3 2n
2n + 1
27) 8 + 32 + 128 + … + 2 = 2
2 −1
28) −2 + 2 + 6 + … + 4n − 6 = n(2n − 4)
n(5n − 7)
29) −1 + 4 + 9 + … + 5n − 6 =
2
30) 4 + 10 + 16 + … + 6n − 2 = n(3n + 1)
31) 45 + 207 + 477 + … + 54n − 9 = 9n (2n + 3)
2 2

n(4n − 1)
2
32) 1 + 9 + 25 + … + (2n − 1) =
2
3
25n(4n − 1)
2
33) 25 + 225 + 625 + … + (10n − 5) =
2
3
n(3n + 15)
34) 9 + 12 + 15 + … + 3n + 6 =
2
35) 13 + 21 + 29 + … + 8n + 5 = n(4n + 9)
4 (4 − 1)
2 n
n+1
36) 16 + 64 + 256 + … + 4 =
3
37) 15 + 69 + 159 + … + 18n − 3 = 3n (2n + 3)
2 2

= 2 (2 − 1)
n+3 4 n
38) 16 + 32 + 64 + … + 2
39) 10 + 46 + 106 + … + 12n − 2 = 2n (2n + 3)
2 2

n(7n + 17)
40) 12 + 19 + 26 + … + 7n + 5 =
2
n(3n + 7)
41) 5 + 8 + 11 + … + 3n + 2 =
2
42) 36 + 324 + 900 + … + (12n − 6) = 12n(4n − 1)
2 2

n(7n + 11)
43) 9 + 16 + 23 + … + 7n + 2 =
2
44) −5 − 3 − 1 + … + 2n − 7 = n(n − 6)
45) 1 + 7 + 13 + … + 6n − 5 = n(3n − 2)
n(5n + 11)
46) 8 + 13 + 18 + … + 5n + 3 =
2
47) 11 + 17 + 23 + … + 6n + 5 = n(3n + 8)
-2- Worksheet by Kuta Software LLC
©T _2A0L2`4L CKEuStfa\ RSMokf`tywOaCrxeK `LKLDCU.\ Y uAKlYls ArxiigHhgtQsF zrFeksseVrEvHe`de._ t CMjaIdKeK UwuiWtEhZ MIJnCfiidn\iptKeB BPyrqenciaDlDc^uJlJuJsU.
 48) 0 + 6 + 12 + … + 6n − 6 = n(3n − 3)
2 (2 − 1)
3 3n
3n
49) 8 + 64 + 512 + … + 2 = 3
2 −1
50) 11 + 15 + 19 + … + 4n + 7 = n(2n + 9)
2
51) 19n − 9n is divisible by 2
n
52) 5 is a factor of 6 − 1
2
53) 15n + 21n is divisible by 2
2
54) 14n + 18n is divisible by 4
2
55) 11n − 7n is divisible by −2
n
56) 2 is a factor of 3 + 3
n n
57) 11 − 4 is divisible by 7
n n
58) 8 − 3 is divisible by 5
n
59) 2 is a factor of 3 − 1
n
60) 5 is a factor of 6 + 4
n n
61) 11 − 3 is divisible by 8
n n
62) 10 − 3 is divisible by 7
3
63) 3n + 6n is divisible by 9
2
64) 21n + 21n is divisible by −2
3
65) 8n + 10n is divisible by 3
3
66) n + 8n is divisible by 3
3
67) 4n + 8n is divisible by 6
2
68) 17n + n is divisible by 2
n n
69) 9 − 4 is divisible by 5
2
70) 17n + 21n is divisible by 2
3
71) 7n + 5n is divisible by 3
n
72) 3 is a factor of 4 + 5
n n
73) 7 − 4 is divisible by 3
n n
74) 7 − 3 is divisible by 4
3
75) 10n − n is divisible by 3
3
76) 10n + 5n is divisible by 3
3
77) 4n + 2n is divisible by 6
n
78) 2 is a factor of 3 + 5
2
79) 13n + 19n is divisible by −2
-3- Worksheet by Kuta Software LLC
©g V2o0w2K4d VKbujtlaq ASSobfCtRwMaOrNey vL[LSCL.h h yAplJl\ IrNitgLhstzsR brneWs\eerLvjeado.i P TMfamdreB TwGimtFhy YICnafgiQnBiNtJet LPGrteqcHaXlQcKuylSu^sI.
 2
80) 21n + 9n is divisible by 6
n
81) 3 is a factor of 4 − 1
2
82) 17n + 3n is divisible by 2
n n
83) 11 − 2 is divisible by 9
2
84) 19n − n is divisible by −2
n
85) 4 is a factor of 5 + 3
n
86) 2 is a factor of 3 + 1
2
87) 15n + 15n is divisible by 10
3
88) 2n + 7n is divisible by 3
2
89) n + 5n is divisible by 2
n
90) 7 is a factor of 8 − 1
3
91) n + 5n is divisible by 3
n n
92) 5 − 2 is divisible by 3
3
93) 10n − 4n is divisible by 6
2
94) 9n − 7n is divisible by 2
2
95) 20n − 12n is divisible by 8
2
96) 21n + 9n is divisible by 2
3
97) 8n + 4n is divisible by 6
n n
98) 5 − 3 is divisible by 2
3
99) 2n + 10n is divisible by 6
n n
100) 7 − 2 is divisible by 5
n
101) 6 ≥ 3n
n
102) 5 ≥ 3n
n
103) 9 ≥ 9n
n
104) 6 ≥ 2n
n
105) 7 ≥ 6n
n
106) 7 ≥ 7n
n
107) 10 ≥ 10n
n
108) 5 ≥ 2n
n
109) 4 ≥ 4n
n
110) 8 ≥ 7n
n
111) 4 ≥ 2n
n
112) 8 ≥ 3n
-4- Worksheet by Kuta Software LLC
©O V2n0X2y4j vKkumtkay uSKosfNtgwJaPrOed _LrLDC`.X C yALlAlj GrLihgbhftosO ^rLelsUewrLvveId\.M R ^MKajdheP EwxiPtRh] OINnpfOi`nciitKes pPMrpezcPallhcBuylUuGsy.
 n
113) 10 ≥ 6n
n
114) 10 ≥ 9n
n
115) 7 ≥ 3n
n
116) 7 ≥ 2n
n
117) 8 ≥ 6n
n
118) 9 ≥ 5n
n
119) 3 ≥ 3n
n
120) 9 ≥ 2n
n
121) 10 ≥ 8n
n
122) 10 ≥ 3n
n
123) 6 ≥ 4n
n
124) 2 ≥ 2n
n
125) 5 ≥ 4n
n
126) 8 ≥ 5n
n
127) 10 ≥ 7n
n
128) 6 ≥ 5n
n
129) 9 ≥ 3n
n
130) 10 ≥ 5n
n
131) 7 ≥ 4n
n
132) 8 ≥ 8n
n
133) 8 ≥ 4n
n
134) 6 ≥ 6n
n
135) 8 ≥ 2n
n
136) 3 ≥ 2n
n
137) 9 ≥ 8n
n
138) 9 ≥ 7n
n
139) 5 ≥ 5n
n
140) 10 ≥ 4n
n
141) 4 ≥ 3n
n
142) 10 ≥ 2n
n
143) 9 ≥ 6n
n
144) 9 ≥ 4n
n
145) 7 ≥ 5n
-5- Worksheet by Kuta Software LLC
©^ Q2m0l2o4M YKBuTtCaC GSOoefIttwmaercej jLGL[CX.F S yAYlAlT PrDihgihrtisE \r[eDsveWrIvTezd]._ s YMMaDdOej Ww^iZtQhQ `IxndfYiYnUiZtgeY `PDrjejcmaYlicyuClLuJs^.
 Answers to Assignment (ID: 1)
n
n−1 3 −1
1) Let Pn be the statement 1 + 3 + 9 + … + 3 =
2
Anchor Step
1−1 3−1
P1 is true since 3 =
2
Inductive Hypothesis
k
k−1 3 −1
Assume that Pk is true: 1 + 3 + 9 + … + 3 =
2
Inductive Step
We now show that Pk + 1 is true:
k
k−1 k+1−1 3 −1 k+1−1
1+3+9+…+3 +3 = +3
2
3 (3 − 1)
0 k
k+1−1
+3
2
3 (3 − 1) 3 ⋅ 3 (3 − 1)
0 k k 0
+
2 2
3 (3 − 1 + 3 )
0 k k+1 k
−3
2
k+1
3 −1
2
Conclusion
By induction Pn is true for all n ≥ 1.
2) Let Pn be the statement −1 + 7 + 15 + … + 8n − 9 = n(4n − 5)
Anchor Step
P1 is true since 8 − 9 = 4 − 5
Inductive Hypothesis
Assume that Pk is true: −1 + 7 + 15 + … + 8k − 9 = k(4k − 5)
Inductive Step
We now show that Pk + 1 is true:
−1 + 7 + 15 + … + 8k − 9 + 8(k + 1) − 9 = k(4k − 5) + 8(k + 1) − 9
2
4k − 5k + 8k + 8 − 9
2
4k + 3k − 1
2
4k + 8k + 4 − 5k − 5
4(k + 2k + 1) − 5(k + 1)
2

4(k + 1) − 5(k + 1)
2

(k + 1)(4(k + 1) − 5)
Conclusion
By induction Pn is true for all n ≥ 1.

-6- Worksheet by Kuta Software LLC

©[ E2D0u2R4y zKIuQtwaJ DS\olfstCwxa_rSez SLwLBCz.F _ tAVlClS jrpiDgphItZsg LrseDsWefrKvpeGdJ.` C kMMa`dce_ LwmiRtPhP fIinyfxiWnciAtUeL YPjrXeFczajlCcEuRlFugsV.
 n(3n + 13)
3) Let Pn be the statement 8 + 11 + 14 + … + 3n + 5 =
2
Anchor Step
3 + 13
P1 is true since 3 + 5 =
2
Inductive Hypothesis
k(3k + 13)
Assume that Pk is true: 8 + 11 + 14 + … + 3k + 5 =
2
Inductive Step
We now show that Pk + 1 is true:
k(3k + 13)
8 + 11 + 14 + … + 3k + 5 + 3(k + 1) + 5 = + 3(k + 1) + 5
2
2
3k + 13k
+ 3k + 3 + 5
2
2
3k + 13k 6k + 16
+
2 2
2
3k + 19k + 16
2
2
3k + 6k + 3 + 13k + 13
2
3(k + 2k + 1) + 13(k + 1)
2

2
3(k + 1) + 13(k + 1)
2

2
(k + 1)(3(k + 1) + 13)
2
Conclusion
By induction Pn is true for all n ≥ 1.

-7- Worksheet by Kuta Software LLC

©v q2Q0D2e4X dKAu[ttaS vSqo^fitPwoa[rget eLjLZCt.i ] ZA]lZlV FrrilgfhItQst grOersfe[rSvbendJ.j R kMgacdVeO vwMiKtjhk rIWnEfEi]ngiLtneQ wPerTewc[aVlLc^uPlruTse.
 4) Let Pn be the statement 35 + 161 + 371 + … + 42n − 7 = 7n (2n + 3)
2 2

Anchor Step
P1 is true since 42 ⋅ 1 − 7 = 7 ⋅ 1 (2 + 3)
2 2

Inductive Hypothesis
Assume that Pk is true: 35 + 161 + 371 + … + 42k − 7 = 7k (2k + 3)
2 2

Inductive Step
We now show that Pk + 1 is true:
35 + 161 + 371 + … + 42k − 7 + 42(k + 1) − 7 = 7k (2k + 3) + 42(k + 1) − 7
2 2 2 2

14k + 21k + 42(k + 2k + 1) − 7

3 2 2

3 2 2
14k + 21k + 42k + 84k + 42 − 7
3 2
14k + 63k + 84k + 35
7(2k + 6k + 6k + 2 + 3k + 6k + 3)
3 2 2

7(2(k + 3k + 3k + 1) + 3(k + 2k + 1))

3 2 2

7(2(k + 1) + 3(k + 1) )
3 2

7(k + 1) (2(k + 1) + 3)
2

Conclusion
By induction Pn is true for all n ≥ 1.
2 (2 − 1)
2 2n
2n
5) Let Pn be the statement 4 + 16 + 64 + … + 2 = 2
2 −1
Anchor Step
2 (2 − 1)
2 2
2
P1 is true since 2 = 2
2 −1
Inductive Hypothesis
2 (2 − 1)
2 2k
2k
Assume that Pk is true: 4 + 16 + 64 + … + 2 = 2
2 −1
Inductive Step
We now show that Pk + 1 is true:
4(2 − 1)
2k
2k 2(k + 1) 2(k + 1)
4 + 16 + 64 + … + 2 + 2 = +2
3
2 (2 − 1)
2 2k
2k + 2
+2
3
2 (2 − 1) 2 ⋅ 2 (2 − 1)
2 2k 2k 2 2
+
3 3
2 (2 − 1 + 2 )
2 2k 2k + 2 2k
−2
3
4(2 − 1)
2(k + 1)

3
Conclusion
By induction Pn is true for all n ≥ 1.

-8- Worksheet by Kuta Software LLC

©t u2V0R2_4p XK_u^tBae USYokfCt]wGaurjeZ WLiLHCl.] U CAvlXl` DrXiAglhctms` JrceFsAeFr[vaeidi.f f DMdaRdWeD owIiot`hX uI[nEfwiQnjiPtYeW dPfrLeAcYaElCc]ualyuws`.
 4(4 − 1)
n
n
6) Let Pn be the statement 4 + 16 + 64 + … + 4 =
3
Anchor Step
4(4 − 1)
P1 is true since 4 =
3
Inductive Hypothesis
4(4 − 1)
k
k
Assume that Pk is true: 4 + 16 + 64 + … + 4 =
3
Inductive Step
We now show that Pk + 1 is true:
4(4 − 1)
k
k k+1 k+1
4 + 16 + 64 + … + 4 + 4 = +4
3
4(4 − 1)
k
k+1
+4
3
4(4 − 1) 4 ⋅ 4(4 − 1)
k k
+
3 3
4(4 − 1 + 4 )
k k+1 k
−4
3
4(4 − 1)
k+1

3
Conclusion
By induction Pn is true for all n ≥ 1.

-9- Worksheet by Kuta Software LLC

©n _2z0M2E4U AKfuZt[aI TSioKfutxwpasrAek iLmLHCJ.j \ [AqlUlP FrIiAgxhFtJsH Wr]edsheHrXvHeJdE.p H oMmatdQej Tw]iVtBhE XIhnJfziWnmi^tDea aPqrEe]craclUcruvlju`s`.
 16n(4n − 1)
2
7) Let Pn be the statement 16 + 144 + 400 + … + (8n − 4) =
2
3
Anchor Step
16(4 ⋅ 1 − 1)
2
P1 is true since (8 − 4) =
2
3
Inductive Hypothesis
16k(4k − 1)
2
Assume that Pk is true: 16 + 144 + 400 + … + (8k − 4) =
2
3
Inductive Step
We now show that Pk + 1 is true:
16k(4k − 1)
2
16 + 144 + 400 + … + (8k − 4) + (8(k + 1) − 4) = + (8(k + 1) − 4)
2 2 2
3
16k(4k − 1)
2
+ (8k + 4)
2
3
64k − 16k 3(64k + 64k + 16)
3 2
+
3 3
3 2
64k − 16k 192k + 192k + 48
+
3 3
3 2
64k + 192k + 176k + 48
3
16(4k + 12k + 12k + 4 − k − 1)
3 2

3
16(4(k + 3k + 3k + 1) − (k + 1))
3 2

3
16(4(k + 1) − (k + 1))
3

3
16(k + 1)(4(k + 1) − 1)
2

3
Conclusion
By induction Pn is true for all n ≥ 1.

-10- Worksheet by Kuta Software LLC

©c K2F0X2X4t ^KmuQtCaj bSVolfatnwTaRrgen `LfLYC_.l ` BAClPlJ HrpibgRhNtHsR LrKe]sHecr]vFeidY.Q L eMkasdpej Twsi[tWhD UIUnOfgiAnPiUtheX KPdraeAcbaPl`cuuvlRudsx.
 n(9n + 25)
8) Let Pn be the statement 17 + 26 + 35 + … + 9n + 8 =
2
Anchor Step
9 + 25
P1 is true since 9 + 8 =
2
Inductive Hypothesis
k(9k + 25)
Assume that Pk is true: 17 + 26 + 35 + … + 9k + 8 =
2
Inductive Step
We now show that Pk + 1 is true:
k(9k + 25)
17 + 26 + 35 + … + 9k + 8 + 9(k + 1) + 8 = + 9(k + 1) + 8
2
2
9k + 25k
+ 9k + 9 + 8
2
2
9k + 25k 18k + 34
+
2 2
2
9k + 43k + 34
2
2
9k + 18k + 9 + 25k + 25
2
9(k + 2k + 1) + 25(k + 1)
2

2
9(k + 1) + 25(k + 1)
2

2
(k + 1)(9(k + 1) + 25)
2
Conclusion
By induction Pn is true for all n ≥ 1.

-11- Worksheet by Kuta Software LLC

©D s2v0`2b4h TKYujtwah XSSoWfttrwpa`rGeB KL[LqC\.b ` IAQlIlx Yr`ixgKhotUs[ erPehsUevrKvmeIdz.a i MMla_dte[ hwjiQtBhT XItngfwilnmietNei WPErreYcQaIlPc[uTlSuxs].
 9) Let Pn be the statement 9 + 81 + 225 + … + (6n − 3) = 3n(4n − 1)
2 2

Anchor Step
P1 is true since (6 − 3) = 3(4 ⋅ 1 − 1)
2 2

Inductive Hypothesis
Assume that Pk is true: 9 + 81 + 225 + … + (6k − 3) = 3k(4k − 1)
2 2

Inductive Step
We now show that Pk + 1 is true:
9 + 81 + 225 + … + (6k − 3) + (6(k + 1) − 3) = 3k(4k − 1) + (6(k + 1) − 3)
2 2 2 2

12k − 3k + (6k − 3)
3 2

3 2
12k − 3k + 36k + 36k + 9
3 2
12k + 36k + 33k + 9
3(4k + 12k + 11k + 3)
3 2

3(4k + 12k + 12k + 4 − k − 1)

3 2

3(4(k + 3k + 3k + 1) − (k + 1))
3 2

3(4(k + 1) − (k + 1))
3

3(k + 1)(4(k + 1) − 1)
2

Conclusion
By induction Pn is true for all n ≥ 1.
10) Let Pn be the statement 30 + 138 + 318 + … + 36n − 6 = 6n (2n + 3)
2 2

Anchor Step
P1 is true since 36 ⋅ 1 − 6 = 6 ⋅ 1 (2 + 3)
2 2

Inductive Hypothesis
Assume that Pk is true: 30 + 138 + 318 + … + 36k − 6 = 6k (2k + 3)
2 2

Inductive Step
We now show that Pk + 1 is true:
30 + 138 + 318 + … + 36k − 6 + 36(k + 1) − 6 = 6k (2k + 3) + 36(k + 1) − 6
2 2 2 2

12k + 18k + 36(k + 2k + 1) − 6

3 2 2

3 2 2
12k + 18k + 36k + 72k + 36 − 6
3 2
12k + 54k + 72k + 30
6(2k + 6k + 6k + 2 + 3k + 6k + 3)
3 2 2

6(2(k + 3k + 3k + 1) + 3(k + 2k + 1))

3 2 2

6(2(k + 1) + 3(k + 1) )
3 2

6(k + 1) (2(k + 1) + 3)
2

Conclusion
By induction Pn is true for all n ≥ 1.

-12- Worksheet by Kuta Software LLC

©i J2l0s2U4C sKmuGt^av FSzoofYt]wPaErNeI SLuL_Cb.E J GAQlmlo pruikgFhYt[s[ RrVegsAeTrOveeVdm.y r IMaaNdDem twUiJtZhj qIWnNfoi^nVivtZeG WPsrCesc\axllcTuOlNuYsx.
 11) Let Pn be the statement 6 + 14 + 22 + … + 8n − 2 = n(4n + 2)
Anchor Step
P1 is true since 8 − 2 = 4 + 2
Inductive Hypothesis
Assume that Pk is true: 6 + 14 + 22 + … + 8k − 2 = k(4k + 2)
Inductive Step
We now show that Pk + 1 is true:
6 + 14 + 22 + … + 8k − 2 + 8(k + 1) − 2 = k(4k + 2) + 8(k + 1) − 2
2
4k + 2k + 8k + 8 − 2
2
4k + 10k + 6
2
4k + 8k + 4 + 2k + 2
4(k + 2k + 1) + 2(k + 1)
2

4(k + 1) + 2(k + 1)
2

(k + 1)(4(k + 1) + 2)
Conclusion
By induction Pn is true for all n ≥ 1.
12) Let Pn be the statement 5 + 9 + 13 + … + 4n + 1 = n(2n + 3)
Anchor Step
P1 is true since 4 + 1 = 2 + 3
Inductive Hypothesis
Assume that Pk is true: 5 + 9 + 13 + … + 4k + 1 = k(2k + 3)
Inductive Step
We now show that Pk + 1 is true:
5 + 9 + 13 + … + 4k + 1 + 4(k + 1) + 1 = k(2k + 3) + 4(k + 1) + 1
2
2k + 3k + 4k + 4 + 1
2
2k + 7k + 5
2
2k + 4k + 2 + 3k + 3
2(k + 2k + 1) + 3(k + 1)
2

2(k + 1) + 3(k + 1)
2

(k + 1)(2(k + 1) + 3)
Conclusion
By induction Pn is true for all n ≥ 1.

-13- Worksheet by Kuta Software LLC

©g C2x0F2k4V GKuuPtvat vSJoJfBtnwyaErPeJ sL]LwCw.y ^ FAElbl^ lrOijgjhDtIsz irqeJsFe]rrvHeadr.A v GMLaKdKeh QwviUtnhn oIKnafZiQnxi]tXex LPrrVeBcHaFlGcDuClBuqsg.
 13) Let Pn be the statement 25 + 115 + 265 + … + 30n − 5 = 5n (2n + 3)
2 2

Anchor Step
P1 is true since 30 ⋅ 1 − 5 = 5 ⋅ 1 (2 + 3)
2 2

Inductive Hypothesis
Assume that Pk is true: 25 + 115 + 265 + … + 30k − 5 = 5k (2k + 3)
2 2

Inductive Step
We now show that Pk + 1 is true:
25 + 115 + 265 + … + 30k − 5 + 30(k + 1) − 5 = 5k (2k + 3) + 30(k + 1) − 5
2 2 2 2

10k + 15k + 30(k + 2k + 1) − 5

3 2 2

3 2 2
10k + 15k + 30k + 60k + 30 − 5
3 2
10k + 45k + 60k + 25
5(2k + 6k + 6k + 2 + 3k + 6k + 3)
3 2 2

5(2(k + 3k + 3k + 1) + 3(k + 2k + 1))

3 2 2

5(2(k + 1) + 3(k + 1) )
3 2

5(k + 1) (2(k + 1) + 3)
2

Conclusion
By induction Pn is true for all n ≥ 1.
14) Let Pn be the statement 17 + 25 + 33 + … + 8n + 9 = n(4n + 13)
Anchor Step
P1 is true since 8 + 9 = 4 + 13
Inductive Hypothesis
Assume that Pk is true: 17 + 25 + 33 + … + 8k + 9 = k(4k + 13)
Inductive Step
We now show that Pk + 1 is true:
17 + 25 + 33 + … + 8k + 9 + 8(k + 1) + 9 = k(4k + 13) + 8(k + 1) + 9
2
4k + 13k + 8k + 8 + 9
2
4k + 21k + 17
2
4k + 8k + 4 + 13k + 13
4(k + 2k + 1) + 13(k + 1)
2

4(k + 1) + 13(k + 1)
2

(k + 1)(4(k + 1) + 13)
Conclusion
By induction Pn is true for all n ≥ 1.

-14- Worksheet by Kuta Software LLC

©M E2Q0l2J4X _KRuKtEa[ cSuovf^tMwVaTrCes JLnLlCb.q Q QAqlklu crlifgThPtmsh qrGexs[eyr^vaeUdE.C m rMEa^dfey qwbi]tuh\ BIin[fbi`nSiDtMeR mPvrNezcXaul[ctullUunsh.
 4n(4n − 1)
2
15) Let Pn be the statement 4 + 36 + 100 + … + (4n − 2) =
2
3
Anchor Step
4(4 ⋅ 1 − 1)
2
P1 is true since (4 − 2) =
2
3
Inductive Hypothesis
4k(4k − 1)
2
Assume that Pk is true: 4 + 36 + 100 + … + (4k − 2) =
2
3
Inductive Step
We now show that Pk + 1 is true:
4k(4k − 1)
2
4 + 36 + 100 + … + (4k − 2) + (4(k + 1) − 2) = + (4(k + 1) − 2)
2 2 2
3
4k(4k − 1)
2
+ (4k + 2)
2
3
16k − 4k 3(16k + 16k + 4)
3 2
+
3 3
3 2
16k − 4k 48k + 48k + 12
+
3 3
3 2
16k + 48k + 44k + 12
3
4(4k + 12k + 12k + 4 − k − 1)
3 2

3
4(4(k + 3k + 3k + 1) − (k + 1))
3 2

3
4(4(k + 1) − (k + 1))
3

3
4(k + 1)(4(k + 1) − 1)
2

3
Conclusion
By induction Pn is true for all n ≥ 1.

-15- Worksheet by Kuta Software LLC

©B F2O0R2\4Z kKQuStQaQ USIoVfMt]wha\rfef gL[LZCJ.B S bAolLlE erSirgkhUtksq urVeysveGrpvZenda.\ U gMzaTdaex pwhigtIhw ZITnafSiJnBimtke] TPorMeNchaOlqcguhlDuXs_.
 5(5 − 1)
n
n
16) Let Pn be the statement 5 + 25 + 125 + … + 5 =
4
Anchor Step
5(5 − 1)
P1 is true since 5 =
4
Inductive Hypothesis
5(5 − 1)
k
k
Assume that Pk is true: 5 + 25 + 125 + … + 5 =
4
Inductive Step
We now show that Pk + 1 is true:
5(5 − 1)
k
k k+1 k+1
5 + 25 + 125 + … + 5 + 5 = +5
4
5(5 − 1)
k
k+1
+5
4
5(5 − 1) 5 ⋅ 5(5 − 1)
k k
+
4 4
5(5 − 1 + 5 )
k k+1 k
−5
4
5(5 − 1)
k+1

4
Conclusion
By induction Pn is true for all n ≥ 1.

-16- Worksheet by Kuta Software LLC

©M Q2j0Y2s4G LKiuFtZaI ^S\oWfItawnaXryev [LeLZC[.M X [AKlxlI rrLixgIhutysU mr]erskeGrEvye`d[.g D MMfagdke` PwriJtLhP EIgnxfDiVnHibtLeY mPxrCejcMaVlxcCujlIuKsS.
 3n
3n − 3 2 −1
17) Let Pn be the statement 1 + 8 + 64 + … + 2 = 3
2 −1
Anchor Step
3
3−3 2 −1
P1 is true since 2 = 3
2 −1
Inductive Hypothesis
3k
3k − 3 2 −1
Assume that Pk is true: 1 + 8 + 64 + … + 2 = 3
2 −1
Inductive Step
We now show that Pk + 1 is true:
3k
3k − 3 3(k + 1) − 3 2 −1 3(k + 1) − 3
1 + 8 + 64 + … + 2 +2 = +2
7
2 (2 − 1)
0 3k
3k + 3 − 3
+2
7
2 (2 − 1) 2 ⋅ 2 (2 − 1)
0 3k 3k 0 3
+
7 7
2 (2 − 1 + 2 )
0 3k 3k + 3 3k
−2
7
3(k + 1)
2 −1
7
Conclusion
By induction Pn is true for all n ≥ 1.

-17- Worksheet by Kuta Software LLC

©k a2Y0S2L4k PKfuptdar aSqo\fgt[wuaOrYeF tLkLhCP.R [ YArlElR irIiRgVhDtGsh srBevs[ekr\vBeTdp.f Y sMsaXdBeS ewli[tThA DIlnFfyijnziOtZeR RPsrfeec]ailgciuPlIuwsK.
 3(3 − 1)
2n
2n − 1
18) Let Pn be the statement 3 + 27 + 243 + … + 3 = 2
3 −1
Anchor Step
3(3 − 1)
2
2−1
P1 is true since 3 = 2
3 −1
Inductive Hypothesis
3(3 − 1)
2k
2k − 1
Assume that Pk is true: 3 + 27 + 243 + … + 3 = 2
3 −1
Inductive Step
We now show that Pk + 1 is true:
3(3 − 1)
2k
2k − 1 2(k + 1) − 1 2(k + 1) − 1
3 + 27 + 243 + … + 3 +3 = +3
8
3(3 − 1)
2k
2k + 2 − 1
+3
8
3(3 − 1) 3 ⋅ 3(3 − 1)
2k 2k 2
+
8 8
3(3 − 1 + 3 )
2k 2k + 2 2k
−3
8
3(3 − 1)
2(k + 1)

8
Conclusion
By induction Pn is true for all n ≥ 1.

-18- Worksheet by Kuta Software LLC

©l _2p0S2A4F sK`uut\aC wSroGfVt\wia]rjeU qL_LtCh.d L lAwlVlW srCiognhvtxsa ^rMeIsbemrzvLezdw.\ e hMTaKdgec Xw[iZtnhH sIknbfKihnhiDtJeg iPwrGePcRaXlAcwuOlPuYsn.
 n(7n + 19)
19) Let Pn be the statement 13 + 20 + 27 + … + 7n + 6 =
2
Anchor Step
7 + 19
P1 is true since 7 + 6 =
2
Inductive Hypothesis
k(7k + 19)
Assume that Pk is true: 13 + 20 + 27 + … + 7k + 6 =
2
Inductive Step
We now show that Pk + 1 is true:
k(7k + 19)
13 + 20 + 27 + … + 7k + 6 + 7(k + 1) + 6 = + 7(k + 1) + 6
2
2
7k + 19k
+ 7k + 7 + 6
2
2
7k + 19k 14k + 26
+
2 2
2
7k + 33k + 26
2
2
7k + 14k + 7 + 19k + 19
2
7(k + 2k + 1) + 19(k + 1)
2

2
7(k + 1) + 19(k + 1)
2

2
(k + 1)(7(k + 1) + 19)
2
Conclusion
By induction Pn is true for all n ≥ 1.

-19- Worksheet by Kuta Software LLC

©a E2P0v2I4F xKQuhtUac ISqonf[tHwfavrNeW zLRLjCP.b q lA]lKlf drEiigchit]sC xrKeEsieYrQvoeEdS.s X pMqasdxev GwRiRtUhc FIEnnfriPnAiwtHek kPsr]eMckaylvciuBlSuMsc.
 20) Let Pn be the statement 5 + 23 + 53 + … + 6n − 1 = n (2n + 3)
2 2

Anchor Step
P1 is true since 6 ⋅ 1 − 1 = 1 (2 + 3)
2 2

Inductive Hypothesis
Assume that Pk is true: 5 + 23 + 53 + … + 6k − 1 = k (2k + 3)
2 2

Inductive Step
We now show that Pk + 1 is true:
5 + 23 + 53 + … + 6k − 1 + 6(k + 1) − 1 = k (2k + 3) + 6(k + 1) − 1
2 2 2 2

2k + 3k + 6(k + 2k + 1) − 1
3 2 2

3 2 2
2k + 3k + 6k + 12k + 6 − 1
3 2
2k + 9k + 12k + 5
3 2 2
2k + 6k + 6k + 2 + 3k + 6k + 3
2(k + 3k + 3k + 1) + 3(k + 2k + 1)
3 2 2

2(k + 1) + 3(k + 1)
3 2

(k + 1) 2(2(k + 1) + 3)
Conclusion
By induction Pn is true for all n ≥ 1.
2(2 − 1)
3n
3n − 2
21) Let Pn be the statement 2 + 16 + 128 + … + 2 = 3
2 −1
Anchor Step
2(2 − 1)
3
3−2
P1 is true since 2 = 3
2 −1
Inductive Hypothesis
2(2 − 1)
3k
3k − 2
Assume that Pk is true: 2 + 16 + 128 + … + 2 = 3
2 −1
Inductive Step
We now show that Pk + 1 is true:
2(2 − 1)
3k
3k − 2 3(k + 1) − 2 3(k + 1) − 2
2 + 16 + 128 + … + 2 +2 = +2
7
2(2 − 1)
3k
3k + 3 − 2
+2
7
2(2 − 1) 2 ⋅ 2(2 − 1)
3k 3k 3
+
7 7
2(2 − 1 + 2 )
3k 3k + 3 3k
−2
7
2(2 − 1)
3(k + 1)

7
Conclusion
By induction Pn is true for all n ≥ 1.

-20- Worksheet by Kuta Software LLC

©o X2V0O2n4t vKbustba` fSaoCfctvwsaPrXeL eLLLOCW.Z s qANlilZ or_iLgjhrtIsg orLeWskeJrQvqeSdQ.V j qMhakdWeA Mw[iNtThI nIQnMfLiNnUiktsen KPArpeqcNamlFclu\liufsB.
 22) Let Pn be the statement 40 + 184 + 424 + … + 48n − 8 = 8n (2n + 3)
2 2

Anchor Step
P1 is true since 48 ⋅ 1 − 8 = 8 ⋅ 1 (2 + 3)
2 2

Inductive Hypothesis
Assume that Pk is true: 40 + 184 + 424 + … + 48k − 8 = 8k (2k + 3)
2 2

Inductive Step
We now show that Pk + 1 is true:
40 + 184 + 424 + … + 48k − 8 + 48(k + 1) − 8 = 8k (2k + 3) + 48(k + 1) − 8
2 2 2 2

16k + 24k + 48(k + 2k + 1) − 8

3 2 2

3 2 2
16k + 24k + 48k + 96k + 48 − 8
3 2
16k + 72k + 96k + 40
8(2k + 6k + 6k + 2 + 3k + 6k + 3)
3 2 2

8(2(k + 3k + 3k + 1) + 3(k + 2k + 1))

3 2 2

8(2(k + 1) + 3(k + 1) )
3 2

8(k + 1) (2(k + 1) + 3)
2

Conclusion
By induction Pn is true for all n ≥ 1.

-21- Worksheet by Kuta Software LLC

©V d2w0a2q4J EKeuAtTad TSeoffjtLwsaqroe[ VLuLNCR.H J ZAElelf SrtiggmhHt_sW Tr^egs]eNrTvIeId\.a c eMraqdTez fwmigtHhl JIPnqfHiDnSirtvej gPFrQedcVaQlUcSuAliuns].
 n(9n − 3)
23) Let Pn be the statement 3 + 12 + 21 + … + 9n − 6 =
2
Anchor Step
9−3
P1 is true since 9 − 6 =
2
Inductive Hypothesis
k(9k − 3)
Assume that Pk is true: 3 + 12 + 21 + … + 9k − 6 =
2
Inductive Step
We now show that Pk + 1 is true:
k(9k − 3)
3 + 12 + 21 + … + 9k − 6 + 9(k + 1) − 6 = + 9(k + 1) − 6
2
2
9k − 3k
+ 9k + 9 − 6
2
2
9k − 3k 18k + 6
+
2 2
2
9k + 15k + 6
2
2
9k + 18k + 9 − 3k − 3
2
9(k + 2k + 1) − 3(k + 1)
2

2
9(k + 1) − 3(k + 1)
2

2
(k + 1)(9(k + 1) − 3)
2
Conclusion
By induction Pn is true for all n ≥ 1.

-22- Worksheet by Kuta Software LLC

©T y2f0X2L4W [Ktuxttar tSSo\fktEwQa\rqe[ ELILkCp.Q B GAiloln `r]iCgJhKtwsa arhexs\eMrZvLeOdd.J D PM^axdyeg awmirtohC UIinQfsiJnwiBtXeV OPHrVePc_a\lTcLuFlVumsj.
 24) Let Pn be the statement −1 + 3 + 7 + … + 4n − 5 = n(2n − 3)
Anchor Step
P1 is true since 4 − 5 = 2 − 3
Inductive Hypothesis
Assume that Pk is true: −1 + 3 + 7 + … + 4k − 5 = k(2k − 3)
Inductive Step
We now show that Pk + 1 is true:
−1 + 3 + 7 + … + 4k − 5 + 4(k + 1) − 5 = k(2k − 3) + 4(k + 1) − 5
2
2k − 3k + 4k + 4 − 5
2
2k + k − 1
2
2k + 4k + 2 − 3k − 3
2(k + 2k + 1) − 3(k + 1)
2

2(k + 1) − 3(k + 1)
2

(k + 1)(2(k + 1) − 3)
Conclusion
By induction Pn is true for all n ≥ 1.
25) Let Pn be the statement 10 + 12 + 14 + … + 2n + 8 = n(n + 9)
Anchor Step
P1 is true since 2 + 8 = 1 + 9
Inductive Hypothesis
Assume that Pk is true: 10 + 12 + 14 + … + 2k + 8 = k(k + 9)
Inductive Step
We now show that Pk + 1 is true:
10 + 12 + 14 + … + 2k + 8 + 2(k + 1) + 8 = k(k + 9) + 2(k + 1) + 8
2
k + 9k + 2k + 2 + 8
2
k + 11k + 10
2
k + 2k + 1 + 9k + 9
k + 2k + 1 + 9(k + 1)
2

(k + 1) 2 + 9(k + 1)
(k + 1)(k + 1 + 9)
Conclusion
By induction Pn is true for all n ≥ 1.

-23- Worksheet by Kuta Software LLC

©\ ^2A0g2G4H hKEuGthaT WSwoKfht\wZaYreeE yLmLaCy.i n _ADlJle [rqiygJhnt[sv drVeCsDe_rjvDeKdy.[ n jM`aSdAeZ Ywuiettht pITnYfJiAn^iptWeZ ePUryelc]aJlPcNuQlhuwsK.
 26) Let Pn be the statement 20 + 92 + 212 + … + 24n − 4 = 4n (2n + 3)
2 2

Anchor Step
P1 is true since 24 ⋅ 1 − 4 = 4 ⋅ 1 (2 + 3)
2 2

Inductive Hypothesis
Assume that Pk is true: 20 + 92 + 212 + … + 24k − 4 = 4k (2k + 3)
2 2

Inductive Step
We now show that Pk + 1 is true:
20 + 92 + 212 + … + 24k − 4 + 24(k + 1) − 4 = 4k (2k + 3) + 24(k + 1) − 4
2 2 2 2

8k + 12k + 24(k + 2k + 1) − 4
3 2 2

3 2 2
8k + 12k + 24k + 48k + 24 − 4
3 2
8k + 36k + 48k + 20
4(2k + 6k + 6k + 2 + 3k + 6k + 3)
3 2 2

4(2(k + 3k + 3k + 1) + 3(k + 2k + 1))

3 2 2

4(2(k + 1) + 3(k + 1) )
3 2

4(k + 1) (2(k + 1) + 3)
2

Conclusion
By induction Pn is true for all n ≥ 1.
2 (2 − 1)
3 2n
2n + 1
27) Let Pn be the statement 8 + 32 + 128 + … + 2 = 2
2 −1
Anchor Step
2 (2 − 1)
3 2
2+1
P1 is true since 2 = 2
2 −1
Inductive Hypothesis
2 (2 − 1)
3 2k
2k + 1
Assume that Pk is true: 8 + 32 + 128 + … + 2 = 2
2 −1
Inductive Step
We now show that Pk + 1 is true:
8(2 − 1)
2k
2k + 1 2(k + 1) + 1 2(k + 1) + 1
8 + 32 + 128 + … + 2 +2 = +2
3
2 (2 − 1)
3 2k
2k + 2 + 1
+2
3
2 (2 − 1) 2 ⋅ 2 (2 − 1)
3 2k 2k 3 2
+
3 3
2 (2 − 1 + 2 )
3 2k 2k + 2 2k
−2
3
8(2 − 1)
2(k + 1)

3
Conclusion
By induction Pn is true for all n ≥ 1.

-24- Worksheet by Kuta Software LLC

©d M2L0E2E4f NKMuWtCaw MSEoMfItiwiaerBeB NLBLjCx.b J VAjlWln VrAiygLhmtnsl TrOe]sUeMr[vDeVdx.S e NMNa\d^ev WwQibtphX NIGnOfaiyniiRtYeq XPBr\eZc]aylacouJlguysS.
 28) Let Pn be the statement −2 + 2 + 6 + … + 4n − 6 = n(2n − 4)
Anchor Step
P1 is true since 4 − 6 = 2 − 4
Inductive Hypothesis
Assume that Pk is true: −2 + 2 + 6 + … + 4k − 6 = k(2k − 4)
Inductive Step
We now show that Pk + 1 is true:
−2 + 2 + 6 + … + 4k − 6 + 4(k + 1) − 6 = k(2k − 4) + 4(k + 1) − 6
2
2k − 4k + 4k + 4 − 6
2
2k − 2
2
2k + 4k + 2 − 4k − 4
2(k + 2k + 1) − 4(k + 1)
2

2(k + 1) − 4(k + 1)
2

(k + 1)(2(k + 1) − 4)
Conclusion
By induction Pn is true for all n ≥ 1.

-25- Worksheet by Kuta Software LLC

©s k2i0o2m4f RKguVtuax AScoRfntawratrbeC rLnLXCr.n T KAplllT WrYiVgWhgtMsh Frne`sxeCrwvSejdS.n f lMaaodlet jw^iStdhs UI`ntfSiunvijtZe^ XPfrterc[aYl]cdukllu^s^.
 n(5n − 7)
29) Let Pn be the statement −1 + 4 + 9 + … + 5n − 6 =
2
Anchor Step
5−7
P1 is true since 5 − 6 =
2
Inductive Hypothesis
k(5k − 7)
Assume that Pk is true: −1 + 4 + 9 + … + 5k − 6 =
2
Inductive Step
We now show that Pk + 1 is true:
k(5k − 7)
−1 + 4 + 9 + … + 5k − 6 + 5(k + 1) − 6 = + 5(k + 1) − 6
2
2
5k − 7k
+ 5k + 5 − 6
2
2
5k − 7k 10k − 2
+
2 2
2
5k + 3k − 2
2
2
5k + 10k + 5 − 7k − 7
2
5(k + 2k + 1) − 7(k + 1)
2

2
5(k + 1) − 7(k + 1)
2

2
(k + 1)(5(k + 1) − 7)
2
Conclusion
By induction Pn is true for all n ≥ 1.

-26- Worksheet by Kuta Software LLC

©z x2T0s2n4M eK_uQtJaT QSkobfztnwKaurCee [L_LNCd.k b `AwlllC YrqizgkhhtJsn prGens`eJrPvpeJd[.w T TMkaldPec Uwriotdhx \IsnwfziFnPiStoef rPYrieAcnaMlEchuDlTuBsp.
 30) Let Pn be the statement 4 + 10 + 16 + … + 6n − 2 = n(3n + 1)
Anchor Step
P1 is true since 6 − 2 = 3 + 1
Inductive Hypothesis
Assume that Pk is true: 4 + 10 + 16 + … + 6k − 2 = k(3k + 1)
Inductive Step
We now show that Pk + 1 is true:
4 + 10 + 16 + … + 6k − 2 + 6(k + 1) − 2 = k(3k + 1) + 6(k + 1) − 2
2
3k + k + 6k + 6 − 2
2
3k + 7k + 4
2
3k + 6k + 3 + k + 1
3(k + 2k + 1) + k + 1
2

3(k + 1) + k + 1
2

(k + 1)(3(k + 1) + 1)
Conclusion
By induction Pn is true for all n ≥ 1.
31) Let Pn be the statement 45 + 207 + 477 + … + 54n − 9 = 9n (2n + 3)
2 2

Anchor Step
P1 is true since 54 ⋅ 1 − 9 = 9 ⋅ 1 (2 + 3)
2 2

Inductive Hypothesis
Assume that Pk is true: 45 + 207 + 477 + … + 54k − 9 = 9k (2k + 3)
2 2

Inductive Step
We now show that Pk + 1 is true:
45 + 207 + 477 + … + 54k − 9 + 54(k + 1) − 9 = 9k (2k + 3) + 54(k + 1) − 9
2 2 2 2

18k + 27k + 54(k + 2k + 1) − 9

3 2 2

3 2 2
18k + 27k + 54k + 108k + 54 − 9
3 2
18k + 81k + 108k + 45
9(2k + 6k + 6k + 2 + 3k + 6k + 3)
3 2 2

9(2(k + 3k + 3k + 1) + 3(k + 2k + 1))

3 2 2

9(2(k + 1) + 3(k + 1) )
3 2

9(k + 1) (2(k + 1) + 3)
2

Conclusion
By induction Pn is true for all n ≥ 1.

-27- Worksheet by Kuta Software LLC

©i K2q0d2n4V AKPuWtkaB RSQoVfKtPwLaDrPeO FL^LpC^.G F _AklHlh GrqiDglhDtNsv arlebsweBrmvyemdP.U n pM]ardleL Lw[ilteh^ qIonofwijn]i_tteY mPIrUetcOaKl\cOuql[uFsK.
 n(4n − 1)
2
32) Let Pn be the statement 1 + 9 + 25 + … + (2n − 1) =
2
3
Anchor Step
2
4⋅1 −1
P1 is true since (2 − 1) =
2
3
Inductive Hypothesis
k(4k − 1)
2
Assume that Pk is true: 1 + 9 + 25 + … + (2k − 1) =
2
3
Inductive Step
We now show that Pk + 1 is true:
k(4k − 1)
2
1 + 9 + 25 + … + (2k − 1) + (2(k + 1) − 1) = + (2(k + 1) − 1)
2 2 2
3
k(4k − 1)
2
+ (2k + 1)
2
3
4k − k 3(4k + 4k + 1)
3 2
+
3 3
3 2
4k − k 12k + 12k + 3
+
3 3
3 2
4k + 12k + 11k + 3
3
3 2
4k + 12k + 12k + 4 − k − 1
3
4(k + 3k + 3k + 1) − (k + 1)
3 2

3
4(k + 1) − (k + 1)
3

3
(k + 1)(4(k + 1) 2 − 1)
3
Conclusion
By induction Pn is true for all n ≥ 1.

-28- Worksheet by Kuta Software LLC

©O a2W0X2U4\ UK]urtYab uSCoofTtswmaWrXex gLoLNCu.^ I _AOlulG yrciUgZhktkse zrYezsTeDrdvieDdK.O E yMYaedTep uwHiJtSh_ iILnTfYiwnpistSeA rPerAeCcva\lRcfudlCucs_.
 25n(4n − 1)
2
33) Let Pn be the statement 25 + 225 + 625 + … + (10n − 5) =
2
3
Anchor Step
25(4 ⋅ 1 − 1)
2
P1 is true since (10 − 5) =
2
3
Inductive Hypothesis
25k(4k − 1)
2
Assume that Pk is true: 25 + 225 + 625 + … + (10k − 5) =
2
3
Inductive Step
We now show that Pk + 1 is true:
25k(4k − 1)
2
25 + 225 + 625 + … + (10k − 5) + (10(k + 1) − 5) = + (10(k + 1) − 5)
2 2 2
3
25k(4k − 1)
2
+ (10k + 5)
2
3
100k − 25k 3(100k + 100k + 25)
3 2
+
3 3
3 2
100k − 25k 300k + 300k + 75
+
3 3
3 2
100k + 300k + 275k + 75
3
25(4k + 12k + 12k + 4 − k − 1)
3 2

3
25(4(k + 3k + 3k + 1) − (k + 1))
3 2

3
25(4(k + 1) − (k + 1))
3

3
25(k + 1)(4(k + 1) − 1)
2

3
Conclusion
By induction Pn is true for all n ≥ 1.

-29- Worksheet by Kuta Software LLC

©R I2x0j2L4s jKgueteab CSyoEfTtRwkaFrgeu JL[L^C_.B S CAzlclf FrQiYgdhRtEsY MrteEskeYrVv[eidK.B N ]MmaMdAeU hwpiJtvh^ sItnhfTilnTiWtWeU ePHrdepcIaHlXcWuOlSuos`.
 n(3n + 15)
34) Let Pn be the statement 9 + 12 + 15 + … + 3n + 6 =
2
Anchor Step
3 + 15
P1 is true since 3 + 6 =
2
Inductive Hypothesis
k(3k + 15)
Assume that Pk is true: 9 + 12 + 15 + … + 3k + 6 =
2
Inductive Step
We now show that Pk + 1 is true:
k(3k + 15)
9 + 12 + 15 + … + 3k + 6 + 3(k + 1) + 6 = + 3(k + 1) + 6
2
2
3k + 15k
+ 3k + 3 + 6
2
2
3k + 15k 6k + 18
+
2 2
2
3k + 21k + 18
2
2
3k + 6k + 3 + 15k + 15
2
3(k + 2k + 1) + 15(k + 1)
2

2
3(k + 1) + 15(k + 1)
2

2
(k + 1)(3(k + 1) + 15)
2
Conclusion
By induction Pn is true for all n ≥ 1.

-30- Worksheet by Kuta Software LLC

©_ ^2]0e2_4D fKUupt\aq eSNoufJtfwgairyeI wLqLYCp.W H MASlrlm \rSiSgPhEtlsF ^r^eMsHeNryvuewdy.Q z aMuacdXeA HwhintchD [Iinuf]iknri[tBei `PZrkedcfaQlGcWublquYsN.
 35) Let Pn be the statement 13 + 21 + 29 + … + 8n + 5 = n(4n + 9)
Anchor Step
P1 is true since 8 + 5 = 4 + 9
Inductive Hypothesis
Assume that Pk is true: 13 + 21 + 29 + … + 8k + 5 = k(4k + 9)
Inductive Step
We now show that Pk + 1 is true:
13 + 21 + 29 + … + 8k + 5 + 8(k + 1) + 5 = k(4k + 9) + 8(k + 1) + 5
2
4k + 9k + 8k + 8 + 5
2
4k + 17k + 13
2
4k + 8k + 4 + 9k + 9
4(k + 2k + 1) + 9(k + 1)
2

4(k + 1) + 9(k + 1)
2

(k + 1)(4(k + 1) + 9)
Conclusion
By induction Pn is true for all n ≥ 1.
4 (4 − 1)
2 n
n+1
36) Let Pn be the statement 16 + 64 + 256 + … + 4 =
3
Anchor Step
4 (4 − 1)
2
1+1
P1 is true since 4 =
3
Inductive Hypothesis
4 (4 − 1)
2 k
… k+1
Assume that Pk is true: 16 + 64 + 256 + +4 =
3
Inductive Step
We now show that Pk + 1 is true:
16(4 − 1)
k
k+1 k+1+1 k+1+1
16 + 64 + 256 + … + 4 +4 = +4
3
4 (4 − 1)
2 k
k+1+1
+4
3
4 (4 − 1) 4 ⋅ 4 (4 − 1)
2 k k 2
+
3 3
4 (4 − 1 + 4 )
2 k k+1 k
−4
3
16(4 − 1)
k+1

3
Conclusion
By induction Pn is true for all n ≥ 1.

-31- Worksheet by Kuta Software LLC

©p S2K0q2s4^ OKvuqtRa_ VSjoKfxtvwraBreeT ]LcLBCR.N D FAZlil] LrBiEgthPtMsL VrOeEsAe`rvvVeydA.x X EMBaxdqeS DwDiot^h[ RIAnSf_ijnhiAtse^ UPUrheycEallAcmu`lruYsk.
 37) Let Pn be the statement 15 + 69 + 159 + … + 18n − 3 = 3n (2n + 3)
2 2

Anchor Step
P1 is true since 18 ⋅ 1 − 3 = 3 ⋅ 1 (2 + 3)
2 2

Inductive Hypothesis
Assume that Pk is true: 15 + 69 + 159 + … + 18k − 3 = 3k (2k + 3)
2 2

Inductive Step
We now show that Pk + 1 is true:
15 + 69 + 159 + … + 18k − 3 + 18(k + 1) − 3 = 3k (2k + 3) + 18(k + 1) − 3
2 2 2 2

6k + 9k + 18(k + 2k + 1) − 3
3 2 2

3 2 2
6k + 9k + 18k + 36k + 18 − 3
3 2
6k + 27k + 36k + 15
3(2k + 6k + 6k + 2 + 3k + 6k + 3)
3 2 2

3(2(k + 3k + 3k + 1) + 3(k + 2k + 1))

3 2 2

3(2(k + 1) + 3(k + 1) )
3 2

3(k + 1) (2(k + 1) + 3)
2

Conclusion
By induction Pn is true for all n ≥ 1.
= 2 (2 − 1)
n+3 4 n
38) Let Pn be the statement 16 + 32 + 64 + … + 2
Anchor Step
= 2 (2 − 1)
1+3 4
P1 is true since 2
Inductive Hypothesis
= 2 (2 − 1)
k+3 4 k
Assume that Pk is true: 16 + 32 + 64 + … + 2
Inductive Step
We now show that Pk + 1 is true:
= 16(2 − 1) + 2
k+3 k+1+3 k k+1+3
16 + 32 + 64 + … + 2 +2
2 (2 − 1) + 2
4 k k+1+3

2 (2 − 1) + 2 ⋅ 2 (2 − 1)
4 k k 4

2 (2 − 1 + 2 )
4 k k+1 k
−2
16(2 − 1)
k+1

Conclusion
By induction Pn is true for all n ≥ 1.

-32- Worksheet by Kuta Software LLC

©` y2c0Q2W4D iKAuxtNaU tSVoRfrtUwvaCraeX vLaLuCH.J T ]A\lRlN broiSgrhnt`sv ^rZeespekrkvzeUdI.X U oMZaEdkes JwTimt[he _IrnYfmiwnViDteeI uPXrleicnaulccVuUllupst.
 39) Let Pn be the statement 10 + 46 + 106 + … + 12n − 2 = 2n (2n + 3)
2 2

Anchor Step
P1 is true since 12 ⋅ 1 − 2 = 2 ⋅ 1 (2 + 3)
2 2

Inductive Hypothesis
Assume that Pk is true: 10 + 46 + 106 + … + 12k − 2 = 2k (2k + 3)
2 2

Inductive Step
We now show that Pk + 1 is true:
10 + 46 + 106 + … + 12k − 2 + 12(k + 1) − 2 = 2k (2k + 3) + 12(k + 1) − 2
2 2 2 2

4k + 6k + 12(k + 2k + 1) − 2
3 2 2

3 2 2
4k + 6k + 12k + 24k + 12 − 2
3 2
4k + 18k + 24k + 10
2(2k + 6k + 6k + 2 + 3k + 6k + 3)
3 2 2

2(2(k + 3k + 3k + 1) + 3(k + 2k + 1))

3 2 2

2(2(k + 1) + 3(k + 1) )
3 2

2(k + 1) (2(k + 1) + 3)
2

Conclusion
By induction Pn is true for all n ≥ 1.

-33- Worksheet by Kuta Software LLC

©w g2G0a2Q4m JKNuLtHaw dSZoZfCtRwCadrfeH NLXLUCs.y ` FAcl`lj trdiWgehWtIs] rrDe[soe\rqvKeCdl.z a iMcaDdHeE Uw[iDtOhe ]I]n`fmiUnaiJtAeR NP`rSevcPa]lWcEuGlKuysW.
 n(7n + 17)
40) Let Pn be the statement 12 + 19 + 26 + … + 7n + 5 =
2
Anchor Step
7 + 17
P1 is true since 7 + 5 =
2
Inductive Hypothesis
k(7k + 17)
Assume that Pk is true: 12 + 19 + 26 + … + 7k + 5 =
2
Inductive Step
We now show that Pk + 1 is true:
k(7k + 17)
12 + 19 + 26 + … + 7k + 5 + 7(k + 1) + 5 = + 7(k + 1) + 5
2
2
7k + 17k
+ 7k + 7 + 5
2
2
7k + 17k 14k + 24
+
2 2
2
7k + 31k + 24
2
2
7k + 14k + 7 + 17k + 17
2
7(k + 2k + 1) + 17(k + 1)
2

2
7(k + 1) + 17(k + 1)
2

2
(k + 1)(7(k + 1) + 17)
2
Conclusion
By induction Pn is true for all n ≥ 1.

-34- Worksheet by Kuta Software LLC

©x o2E0M2p4Y AKiuytHa[ uSqoef^tswGatrteQ ELZLlCd.M ^ aAQlPls mrAifg\hnt\sA \reeIs_eRryvieBd\.S p vMSa`dLeW qwoiptRhU HIknafaiPnQiStkeX YPWrBelcCaClAcbuXllugso.
 n(3n + 7)
41) Let Pn be the statement 5 + 8 + 11 + … + 3n + 2 =
2
Anchor Step
3+7
P1 is true since 3 + 2 =
2
Inductive Hypothesis
k(3k + 7)
Assume that Pk is true: 5 + 8 + 11 + … + 3k + 2 =
2
Inductive Step
We now show that Pk + 1 is true:
k(3k + 7)
5 + 8 + 11 + … + 3k + 2 + 3(k + 1) + 2 = + 3(k + 1) + 2
2
2
3k + 7k
+ 3k + 3 + 2
2
2
3k + 7k 6k + 10
+
2 2
2
3k + 13k + 10
2
2
3k + 6k + 3 + 7k + 7
2
3(k + 2k + 1) + 7(k + 1)
2

2
3(k + 1) + 7(k + 1)
2

2
(k + 1)(3(k + 1) + 7)
2
Conclusion
By induction Pn is true for all n ≥ 1.

-35- Worksheet by Kuta Software LLC

©O B2m0b2T4f TK_uCtUaa wSqoOfEt]wraqrZeR yLCLOCt.C x QATlflc ArgikgehhtasS DrvejsfeMrTvUe[dI.e V bMyaMdfe\ iwIiKtCha yIonNfZiknyiwtMeO GPPrLeJclaclMciurluuXsD.
 42) Let Pn be the statement 36 + 324 + 900 + … + (12n − 6) = 12n(4n − 1)
2 2

Anchor Step
P1 is true since (12 − 6) = 12(4 ⋅ 1 − 1)
2 2

Inductive Hypothesis
Assume that Pk is true: 36 + 324 + 900 + … + (12k − 6) = 12k(4k − 1)
2 2

Inductive Step
We now show that Pk + 1 is true:
36 + 324 + 900 + … + (12k − 6) + (12(k + 1) − 6) = 12k(4k − 1) + (12(k + 1) − 6)
2 2 2 2

48k − 12k + (12k − 6)

3 2

3 2
48k − 12k + 144k + 144k + 36
3 2
48k + 144k + 132k + 36
12(4k + 12k + 11k + 3)
3 2

12(4k + 12k + 12k + 4 − k − 1)

3 2

12(4(k + 3k + 3k + 1) − (k + 1))
3 2

12(4(k + 1) − (k + 1))
3

12(k + 1)(4(k + 1) − 1)
2

Conclusion
By induction Pn is true for all n ≥ 1.

-36- Worksheet by Kuta Software LLC

©b b2h0D2H4B [KduCtray JSdoqf[tbwGazrgey gLjLcCG.m E aAelklU uryiEgkhutvso WryeTsRetrtvueldr.K f wMXazdPew \wXietShR cIvnefYiendintzev gPdrgeRcmaZlHcYuRlkuxsj.
 n(7n + 11)
43) Let Pn be the statement 9 + 16 + 23 + … + 7n + 2 =
2
Anchor Step
7 + 11
P1 is true since 7 + 2 =
2
Inductive Hypothesis
k(7k + 11)
Assume that Pk is true: 9 + 16 + 23 + … + 7k + 2 =
2
Inductive Step
We now show that Pk + 1 is true:
k(7k + 11)
9 + 16 + 23 + … + 7k + 2 + 7(k + 1) + 2 = + 7(k + 1) + 2
2
2
7k + 11k
+ 7k + 7 + 2
2
2
7k + 11k 14k + 18
+
2 2
2
7k + 25k + 18
2
2
7k + 14k + 7 + 11k + 11
2
7(k + 2k + 1) + 11(k + 1)
2

2
7(k + 1) + 11(k + 1)
2

2
(k + 1)(7(k + 1) + 11)
2
Conclusion
By induction Pn is true for all n ≥ 1.

-37- Worksheet by Kuta Software LLC

©o g2e0v2m4k _K]uUtka] gSboNfDtswGadrEe_ QLzLfC].W E HAQlelb arciZgQhXt]sn bryeVsXeHrCvaevdN.I [ dMqawdNeK ]wKiktzhZ IIRnqf^iCnNiutJeG bP]rjeWczaZlmcluplJurso.
 44) Let Pn be the statement −5 − 3 − 1 + … + 2n − 7 = n(n − 6)
Anchor Step
P1 is true since 2 − 7 = 1 − 6
Inductive Hypothesis
Assume that Pk is true: −5 − 3 − 1 + … + 2k − 7 = k(k − 6)
Inductive Step
We now show that Pk + 1 is true:
−5 − 3 − 1 + … + 2k − 7 + 2(k + 1) − 7 = k(k − 6) + 2(k + 1) − 7
2
k − 6k + 2k + 2 − 7
2
k − 4k − 5
2
k + 2k + 1 − 6k − 6
k + 2k + 1 − 6(k + 1)
2

(k + 1) 2 − 6(k + 1)
(k + 1)(k + 1 − 6)
Conclusion
By induction Pn is true for all n ≥ 1.
45) Let Pn be the statement 1 + 7 + 13 + … + 6n − 5 = n(3n − 2)
Anchor Step
P1 is true since 6 − 5 = 3 − 2
Inductive Hypothesis
Assume that Pk is true: 1 + 7 + 13 + … + 6k − 5 = k(3k − 2)
Inductive Step
We now show that Pk + 1 is true:
1 + 7 + 13 + … + 6k − 5 + 6(k + 1) − 5 = k(3k − 2) + 6(k + 1) − 5
2
3k − 2k + 6k + 6 − 5
2
3k + 4k + 1
2
3k + 6k + 3 − 2k − 2
3(k + 2k + 1) − 2(k + 1)
2

3(k + 1) − 2(k + 1)
2

(k + 1)(3(k + 1) − 2)
Conclusion
By induction Pn is true for all n ≥ 1.

-38- Worksheet by Kuta Software LLC

©O t2c0p2]4_ SKfuNtOat ASAoffStMwmagrzey ULfLpCv.p a vArlGlm drNiqgnhjtysi rrye[s\ecrbv]e\dI.A _ aM]aXdQeF WwOiUtNhK yIHn[feiYn`iZteea UP^rremcMatlwcXuHliupsj.
 n(5n + 11)
46) Let Pn be the statement 8 + 13 + 18 + … + 5n + 3 =
2
Anchor Step
5 + 11
P1 is true since 5 + 3 =
2
Inductive Hypothesis
k(5k + 11)
Assume that Pk is true: 8 + 13 + 18 + … + 5k + 3 =
2
Inductive Step
We now show that Pk + 1 is true:
k(5k + 11)
8 + 13 + 18 + … + 5k + 3 + 5(k + 1) + 3 = + 5(k + 1) + 3
2
2
5k + 11k
+ 5k + 5 + 3
2
2
5k + 11k 10k + 16
+
2 2
2
5k + 21k + 16
2
2
5k + 10k + 5 + 11k + 11
2
5(k + 2k + 1) + 11(k + 1)
2

2
5(k + 1) + 11(k + 1)
2

2
(k + 1)(5(k + 1) + 11)
2
Conclusion
By induction Pn is true for all n ≥ 1.

-39- Worksheet by Kuta Software LLC

©h Y2I0W2K4p NKmuotXaS hSroVfNtxw_aRrUeH vLKL[C_.D D HAslXlq CrZiMgPhbtHsr IrhejsyeirSvweHdB.c X AMQaidAep NwjiOtshU eIgnKfqiKnsiPtveD `PKr\ezcXaMltcnuBl[ulsF.
 47) Let Pn be the statement 11 + 17 + 23 + … + 6n + 5 = n(3n + 8)
Anchor Step
P1 is true since 6 + 5 = 3 + 8
Inductive Hypothesis
Assume that Pk is true: 11 + 17 + 23 + … + 6k + 5 = k(3k + 8)
Inductive Step
We now show that Pk + 1 is true:
11 + 17 + 23 + … + 6k + 5 + 6(k + 1) + 5 = k(3k + 8) + 6(k + 1) + 5
2
3k + 8k + 6k + 6 + 5
2
3k + 14k + 11
2
3k + 6k + 3 + 8k + 8
3(k + 2k + 1) + 8(k + 1)
2

3(k + 1) + 8(k + 1)
2

(k + 1)(3(k + 1) + 8)
Conclusion
By induction Pn is true for all n ≥ 1.
48) Let Pn be the statement 0 + 6 + 12 + … + 6n − 6 = n(3n − 3)
Anchor Step
P1 is true since 6 − 6 = 3 − 3
Inductive Hypothesis
Assume that Pk is true: 6 + 12 + … + 6k − 6 = k(3k − 3)
Inductive Step
We now show that Pk + 1 is true:
6 + 12 + … + 6k − 6 + 6(k + 1) − 6 = k(3k − 3) + 6(k + 1) − 6
2
3k − 3k + 6k + 6 − 6
2
3k + 3k
2
3k + 6k + 3 − 3k − 3
3(k + 2k + 1) − 3(k + 1)
2

3(k + 1) − 3(k + 1)
2

(k + 1)(3(k + 1) − 3)
Conclusion
By induction Pn is true for all n ≥ 1.

-40- Worksheet by Kuta Software LLC

©W q2F0h2S4f jKGuctjay BSdo^fntkwbaOrke_ HL]L_C[.l j \ASlWlh UriiYgNhWtwsw OrdeFsZeTravoeXdQ.V o nMOapdVea EwTiQt[hV fIzn]fliZnPiBtUe\ DPTr^eXcvaulFcfuGljuusI.
 2 (2 − 1)
3 3n
3n
49) Let Pn be the statement 8 + 64 + 512 + … + 2 = 3
2 −1
Anchor Step
2 (2 − 1)
3 3
3
P1 is true since 2 = 3
2 −1
Inductive Hypothesis
2 (2 − 1)
3 3k
3k
Assume that Pk is true: 8 + 64 + 512 + … + 2 = 3
2 −1
Inductive Step
We now show that Pk + 1 is true:
8(2 − 1)
3k
3k 3(k + 1) 3(k + 1)
8 + 64 + 512 + … + 2 + 2 = +2
7
2 (2 − 1)
3 3k
3k + 3
+2
7
2 (2 − 1) 2 ⋅ 2 (2 − 1)
3 3k 3k 3 3
+
7 7
2 (2 − 1 + 2 )
3 3k 3k + 3 3k
−2
7
8(2 − 1)
3(k + 1)

7
Conclusion
By induction Pn is true for all n ≥ 1.
50) Let Pn be the statement 11 + 15 + 19 + … + 4n + 7 = n(2n + 9)
Anchor Step
P1 is true since 4 + 7 = 2 + 9
Inductive Hypothesis
Assume that Pk is true: 11 + 15 + 19 + … + 4k + 7 = k(2k + 9)
Inductive Step
We now show that Pk + 1 is true:
11 + 15 + 19 + … + 4k + 7 + 4(k + 1) + 7 = k(2k + 9) + 4(k + 1) + 7
2
2k + 9k + 4k + 4 + 7
2
2k + 13k + 11
2
2k + 4k + 2 + 9k + 9
2(k + 2k + 1) + 9(k + 1)
2

2(k + 1) + 9(k + 1)
2

(k + 1)(2(k + 1) + 9)
Conclusion
By induction Pn is true for all n ≥ 1.

-41- Worksheet by Kuta Software LLC

©U g2P0i2[4T \KGuwthaP BSAobf[tXwqaprAeY PLnLRC_.P K WAylSlS DrhibgthQtcsW Srfeus\ezrIvRezdz.B Q wMwazdDeg UwGietchB pIvnIfniinXiPtqeg xPlr\eAcCallicuuhlju_sV.
 2
51) Let Pn be the statement 19n − 9n is divisible by 2
Anchor Step
2
P1 is true: 19 ⋅ 1 − 9 is divisible by 2
Inductive Hypothesis
2 2
Assume that 19k − 9k is divisible by 2. Therefore, 19k − 9k = 2r for some integer r.
Inductive Step
19(k + 1) − 9(k + 1) is divisible by 2
2
We now show that Pk + 1 is true:
2
19k + 38k + 19 − 9k − 9
2
19k − 9k + 38k + 10
2r + 38k + 10
2(r + 19k + 5)
Conclusion
By induction Pn is true for all n ≥ 1.
n
52) Let Pn be the statement 5 is a factor of 6 − 1
Anchor Step
1
P1 is true: 5 is a factor of 6 − 1
Inductive Hypothesis
k k
Assume that 5 is a factor of 6 − 1. Therefore, 6 − 1 = 5r for some integer r.
Inductive Step
(k + 1)
We now show that Pk + 1 is true: 5 is a factor of 6 −1
k
6⋅6 −1
(5 + 1) ⋅ 6 k − 1
k k
5⋅6 +6 −1
k
5 ⋅ 6 + 5r
5(6 + r)
k

Conclusion
By induction Pn is true for all n ≥ 1.
2
53) Let Pn be the statement 15n + 21n is divisible by 2
Anchor Step
2
P1 is true: 15 ⋅ 1 + 21 is divisible by 2
Inductive Hypothesis
2 2
Assume that 15k + 21k is divisible by 2. Therefore, 15k + 21k = 2r for some integer r.
Inductive Step
15(k + 1) + 21(k + 1) is divisible by 2
2
We now show that Pk + 1 is true:
2
15k + 30k + 15 + 21k + 21
2
15k + 21k + 30k + 36
2r + 30k + 36
2(r + 15k + 18)
Conclusion
By induction Pn is true for all n ≥ 1.

-42- Worksheet by Kuta Software LLC

©e E2M0S2g4h `KlustVaI QSnoWfmttwdatr^eQ mLALFCM.u j KABljle irCiwgrhltnsS KrteJsDeKr]v_eRdl.b X RMDaHdOem IwziptYhK hI_nEf`i[nsiTtteH ePVrKewcCa`l_cKuClBuMsG.
 2
54) Let Pn be the statement 14n + 18n is divisible by 4
Anchor Step
2
P1 is true: 14 ⋅ 1 + 18 is divisible by 4
Inductive Hypothesis
2 2
Assume that 14k + 18k is divisible by 4. Therefore, 14k + 18k = 4r for some integer r.
Inductive Step
14(k + 1) + 18(k + 1) is divisible by 4
2
We now show that Pk + 1 is true:
2
14k + 28k + 14 + 18k + 18
2
14k + 18k + 28k + 32
4r + 28k + 32
4(r + 7k + 8)
Conclusion
By induction Pn is true for all n ≥ 1.
2
55) Let Pn be the statement 11n − 7n is divisible by −2
Anchor Step
2
P1 is true: 11 ⋅ 1 − 7 is divisible by −2
Inductive Hypothesis
2 2
Assume that 11k − 7k is divisible by −2. Therefore, 11k − 7k = −2r for some integer r.
Inductive Step
11(k + 1) − 7(k + 1) is divisible by −2
2
We now show that Pk + 1 is true:
2
11k + 22k + 11 − 7k − 7
2
11k − 7k + 22k + 4
−2r + 22k + 4
−2(r − 11k − 2)
Conclusion
By induction Pn is true for all n ≥ 1.
n
56) Let Pn be the statement 2 is a factor of 3 + 3
Anchor Step
1
P1 is true: 2 is a factor of 3 + 3
Inductive Hypothesis
k k
Assume that 2 is a factor of 3 + 3. Therefore, 3 + 3 = 2r for some integer r.
Inductive Step
(k + 1)
We now show that Pk + 1 is true: 2 is a factor of 3 +3
k
3⋅3 +3
(2 + 1) ⋅ 3 k + 3
k k
2⋅3 +3 +3
k
2 ⋅ 3 + 2r
2(3 + r)
k

Conclusion
By induction Pn is true for all n ≥ 1.

-43- Worksheet by Kuta Software LLC

©q t2_0R2O4j zKpugtta^ QS[o\f]tiwIaLraeV jLOLPCf.H K HA\lzlo jraiBgkhEtOsK HrYeUsheorjvRecdL.S d PMBasdge` awAiPtth[ DIKnxfQiwnxidtues YPtrjeAcXallPcauClTu_sw.
 n n
57) Let Pn be the statement 11 − 4 is divisible by 7
Anchor Step
1 1
P1 is true: 11 − 4 is divisible by 7
Inductive Hypothesis
k k k k
Assume that 11 − 4 is divisible by 7. Therefore, 11 − 4 = 7r for some integer r.
Inductive Step
(k + 1) (k + 1)
We now show that Pk + 1 is true: 11 −4 is divisible by 7
k k
11 ⋅ 11 − 4 ⋅ 4
k k k k k k k k k
7 ⋅ 11 + 11 + 11 + 11 + 11 − 4 − 4 − 4 − 4
k k k k k k k k k
7 ⋅ 11 + 11 − 4 + 11 − 4 + 11 − 4 + 11 − 4
k
7 ⋅ 11 + 7r + 7r + 7r + 7r
7(11 + r + r + r + r)
k

Conclusion
By induction Pn is true for all n ≥ 1.
n n
58) Let Pn be the statement 8 − 3 is divisible by 5
Anchor Step
1 1
P1 is true: 8 − 3 is divisible by 5
Inductive Hypothesis
k k k k
Assume that 8 − 3 is divisible by 5. Therefore, 8 − 3 = 5r for some integer r.
Inductive Step
(k + 1) (k + 1)
We now show that Pk + 1 is true: 8 −3 is divisible by 5
k k
8⋅8 −3⋅3
k k k k k k k
5⋅8 +8 +8 +8 −3 −3 −3
k k k k k k k
5⋅8 +8 −3 +8 −3 +8 −3
k
5 ⋅ 8 + 5r + 5r + 5r
5(8 + r + r + r)
k

Conclusion
By induction Pn is true for all n ≥ 1.
n
59) Let Pn be the statement 2 is a factor of 3 − 1
Anchor Step
1
P1 is true: 2 is a factor of 3 − 1
Inductive Hypothesis
k k
Assume that 2 is a factor of 3 − 1. Therefore, 3 − 1 = 2r for some integer r.
Inductive Step
(k + 1)
We now show that Pk + 1 is true: 2 is a factor of 3 −1
k
3⋅3 −1
(2 + 1) ⋅ 3 k − 1
k k
2⋅3 +3 −1
k
2 ⋅ 3 + 2r
2(3 + r)
k

Conclusion
By induction Pn is true for all n ≥ 1.

-44- Worksheet by Kuta Software LLC

©A x2B0m2p4q lKGubtmaN LSkoEfVtIwXawrver ULQLUC].Z u `AXlclW XrDiygwh^tXsZ YrEeLsQe_ravme_dC.h Q RMMapdxen Yw\iOtrhM jIinjfliknliPtTeO `PkrVeLcQaMlRcvuylVu\sa.
 n
60) Let Pn be the statement 5 is a factor of 6 + 4
Anchor Step
1
P1 is true: 5 is a factor of 6 + 4
Inductive Hypothesis
k k
Assume that 5 is a factor of 6 + 4. Therefore, 6 + 4 = 5r for some integer r.
Inductive Step
(k + 1)
We now show that Pk + 1 is true: 5 is a factor of 6 +4
k
6⋅6 +4
(5 + 1) ⋅ 6 k + 4
k k
5⋅6 +6 +4
k
5 ⋅ 6 + 5r
5(6 + r)
k

Conclusion
By induction Pn is true for all n ≥ 1.
n n
61) Let Pn be the statement 11 − 3 is divisible by 8
Anchor Step
1 1
P1 is true: 11 − 3 is divisible by 8
Inductive Hypothesis
k k k k
Assume that 11 − 3 is divisible by 8. Therefore, 11 − 3 = 8r for some integer r.
Inductive Step
(k + 1) (k + 1)
We now show that Pk + 1 is true: 11 −3 is divisible by 8
k k
11 ⋅ 11 − 3 ⋅ 3
k k k k k k k
8 ⋅ 11 + 11 + 11 + 11 − 3 − 3 − 3
k k k k k k k
8 ⋅ 11 + 11 − 3 + 11 − 3 + 11 − 3
k
8 ⋅ 11 + 8r + 8r + 8r
8(11 + r + r + r)
k

Conclusion
By induction Pn is true for all n ≥ 1.
n n
62) Let Pn be the statement 10 − 3 is divisible by 7
Anchor Step
1 1
P1 is true: 10 − 3 is divisible by 7
Inductive Hypothesis
k k k k
Assume that 10 − 3 is divisible by 7. Therefore, 10 − 3 = 7r for some integer r.
Inductive Step
(k + 1) (k + 1)
We now show that Pk + 1 is true: 10 −3 is divisible by 7
k k
10 ⋅ 10 − 3 ⋅ 3
k k k k k k k
7 ⋅ 10 + 10 + 10 + 10 − 3 − 3 − 3
k k k k k k k
7 ⋅ 10 + 10 − 3 + 10 − 3 + 10 − 3
k
7 ⋅ 10 + 7r + 7r + 7r
7(10 + r + r + r)
k

Conclusion
By induction Pn is true for all n ≥ 1.

-45- Worksheet by Kuta Software LLC

©[ K2D0x2T4w tKFuUtGaQ mSLoxfktSwzatrGeV tL]LuC_.X O `AKlglr CrXizgZhttesa dryePsFeqrUvNecdz.k q VMNapdVex Dweiktmh` YI[nAfriTn[iXtGeg SPXrKeJcqawlJcMuWleuLsy.
 3
63) Let Pn be the statement 3n + 6n is divisible by 9
Anchor Step
3
P1 is true: 3 ⋅ 1 + 6 is divisible by 9
Inductive Hypothesis
3 3
Assume that 3k + 6k is divisible by 9. Therefore, 3k + 6k = 9r for some integer r.
Inductive Step
3(k + 1) + 6(k + 1) is divisible by 9
3
We now show that Pk + 1 is true:
3(k + 3k + 3k + 1) + 6k + 6
3 2

3 2
3k + 9k + 9k + 3 + 6k + 6
3 2
3k + 6k + 9k + 9k + 9
2
9r + 9k + 9k + 9
9(r + k + k + 1)
2

Conclusion
By induction Pn is true for all n ≥ 1.
2
64) Let Pn be the statement 21n + 21n is divisible by −2
Anchor Step
2
P1 is true: 21 ⋅ 1 + 21 is divisible by −2
Inductive Hypothesis
2 2
Assume that 21k + 21k is divisible by −2. Therefore, 21k + 21k = −2r for some integer r.
Inductive Step
21(k + 1) + 21(k + 1) is divisible by −2
2
We now show that Pk + 1 is true:
2
21k + 42k + 21 + 21k + 21
2
21k + 21k + 42k + 42
−2r + 42k + 42
−2(r − 21k − 21)
Conclusion
By induction Pn is true for all n ≥ 1.
3
65) Let Pn be the statement 8n + 10n is divisible by 3
Anchor Step
3
P1 is true: 8 ⋅ 1 + 10 is divisible by 3
Inductive Hypothesis
3 3
Assume that 8k + 10k is divisible by 3. Therefore, 8k + 10k = 3r for some integer r.
Inductive Step
8(k + 1) + 10(k + 1) is divisible by 3
3
We now show that Pk + 1 is true:
8(k + 3k + 3k + 1) + 10k + 10
3 2

3 2
8k + 24k + 24k + 8 + 10k + 10
3 2
8k + 10k + 24k + 24k + 18
2
3r + 24k + 24k + 18
3(r + 8k + 8k + 6)
2

Conclusion
By induction Pn is true for all n ≥ 1.

-46- Worksheet by Kuta Software LLC

©D v2F0K2x4K SKIuztaaN lSVoyfHtZw\aArdeO SL`LmCS.K V sAzlHlT nrxijg^hEtCsi Trjeas\eorgviesdU.M v kMEaJdBei TwuiFtJhu ZIWnrfxiqnViItteB OPVrmeLcratlsc^uMlNuYsv.
 3
66) Let Pn be the statement n + 8n is divisible by 3
Anchor Step
3
P1 is true: 1 + 8 is divisible by 3
Inductive Hypothesis
3 3
Assume that k + 8k is divisible by 3. Therefore, k + 8k = 3r for some integer r.
Inductive Step
We now show that Pk + 1 is true: (k + 1) 3 + 8(k + 1) is divisible by 3
(k 3 + 3k 2 + 3k + 1) + 8k + 8
3 2
k + 3k + 3k + 1 + 8k + 8
3 2
k + 8k + 3k + 3k + 9
2
3r + 3k + 3k + 9
3(r + k + k + 3)
2

Conclusion
By induction Pn is true for all n ≥ 1.
3
67) Let Pn be the statement 4n + 8n is divisible by 6
Anchor Step
3
P1 is true: 4 ⋅ 1 + 8 is divisible by 6
Inductive Hypothesis
3 3
Assume that 4k + 8k is divisible by 6. Therefore, 4k + 8k = 6r for some integer r.
Inductive Step
4(k + 1) + 8(k + 1) is divisible by 6
3
We now show that Pk + 1 is true:
4(k + 3k + 3k + 1) + 8k + 8
3 2

3 2
4k + 12k + 12k + 4 + 8k + 8
3 2
4k + 8k + 12k + 12k + 12
2
6r + 12k + 12k + 12
6(r + 2k + 2k + 2)
2

Conclusion
By induction Pn is true for all n ≥ 1.
2
68) Let Pn be the statement 17n + n is divisible by 2
Anchor Step
2
P1 is true: 17 ⋅ 1 + 1 is divisible by 2
Inductive Hypothesis
2 2
Assume that 17k + k is divisible by 2. Therefore, 17k + k = 2r for some integer r.
Inductive Step
17(k + 1) + k + 1 is divisible by 2
2
We now show that Pk + 1 is true:
2
17k + 34k + 17 + k + 1
2
17k + k + 34k + 18
2r + 34k + 18
2(r + 17k + 9)
Conclusion
By induction Pn is true for all n ≥ 1.

-47- Worksheet by Kuta Software LLC

©D o2W0m2Q4I cK[ujtTae TSEoMfet_wZarrNeG PLILxCt.i c EA]lfli LrDiigZhotOsq vrJeksCeLrUvxeZdh.p ^ WM^aidree Mw\iNtKhm _IQnafwijnYiktKeW gPdrCeUc`aSlVcRuxlXuUsn.
 n n
69) Let Pn be the statement 9 − 4 is divisible by 5
Anchor Step
1 1
P1 is true: 9 − 4 is divisible by 5
Inductive Hypothesis
k k k k
Assume that 9 − 4 is divisible by 5. Therefore, 9 − 4 = 5r for some integer r.
Inductive Step
(k + 1) (k + 1)
We now show that Pk + 1 is true: 9 −4 is divisible by 5
k k
9⋅9 −4⋅4
k k k k k k k k k
5⋅9 +9 +9 +9 +9 −4 −4 −4 −4
k k k k k k k k k
5⋅9 +9 −4 +9 −4 +9 −4 +9 −4
k
5 ⋅ 9 + 5r + 5r + 5r + 5r
5(9 + r + r + r + r)
k

Conclusion
By induction Pn is true for all n ≥ 1.
2
70) Let Pn be the statement 17n + 21n is divisible by 2
Anchor Step
2
P1 is true: 17 ⋅ 1 + 21 is divisible by 2
Inductive Hypothesis
2 2
Assume that 17k + 21k is divisible by 2. Therefore, 17k + 21k = 2r for some integer r.
Inductive Step
17(k + 1) + 21(k + 1) is divisible by 2
2
We now show that Pk + 1 is true:
2
17k + 34k + 17 + 21k + 21
2
17k + 21k + 34k + 38
2r + 34k + 38
2(r + 17k + 19)
Conclusion
By induction Pn is true for all n ≥ 1.
3
71) Let Pn be the statement 7n + 5n is divisible by 3
Anchor Step
3
P1 is true: 7 ⋅ 1 + 5 is divisible by 3
Inductive Hypothesis
3 3
Assume that 7k + 5k is divisible by 3. Therefore, 7k + 5k = 3r for some integer r.
Inductive Step
7(k + 1) + 5(k + 1) is divisible by 3
3
We now show that Pk + 1 is true:
7(k + 3k + 3k + 1) + 5k + 5
3 2

3 2
7k + 21k + 21k + 7 + 5k + 5
3 2
7k + 5k + 21k + 21k + 12
2
3r + 21k + 21k + 12
3(r + 7k + 7k + 4)
2

Conclusion
By induction Pn is true for all n ≥ 1.

-48- Worksheet by Kuta Software LLC

©U W2i0[2e4L iKZuttHa^ VSwojfHtEwZatrvex QLgLeCR.x x qARlRlZ xrpiHgqh\tCsX krGebs_eurrvze_dJ.Z U sMaasdCeE BwRixtVhv uIJn_fKiHnBiTt\ev qP]rqeNcragl_cwublVuwst.
 n
72) Let Pn be the statement 3 is a factor of 4 + 5
Anchor Step
1
P1 is true: 3 is a factor of 4 + 5
Inductive Hypothesis
k k
Assume that 3 is a factor of 4 + 5. Therefore, 4 + 5 = 3r for some integer r.
Inductive Step
(k + 1)
We now show that Pk + 1 is true: 3 is a factor of 4 +5
k
4⋅4 +5
(3 + 1) ⋅ 4 k + 5
k k
3⋅4 +4 +5
k
3 ⋅ 4 + 3r
3(4 + r)
k

Conclusion
By induction Pn is true for all n ≥ 1.
n n
73) Let Pn be the statement 7 − 4 is divisible by 3
Anchor Step
1 1
P1 is true: 7 − 4 is divisible by 3
Inductive Hypothesis
k k k k
Assume that 7 − 4 is divisible by 3. Therefore, 7 − 4 = 3r for some integer r.
Inductive Step
(k + 1) (k + 1)
We now show that Pk + 1 is true: 7 −4 is divisible by 3
k k
7⋅7 −4⋅4
k k k k k k k k k
3⋅7 +7 +7 +7 +7 −4 −4 −4 −4
k k k k k k k k k
3⋅7 +7 −4 +7 −4 +7 −4 +7 −4
k
3 ⋅ 7 + 3r + 3r + 3r + 3r
3(7 + r + r + r + r)
k

Conclusion
By induction Pn is true for all n ≥ 1.
n n
74) Let Pn be the statement 7 − 3 is divisible by 4
Anchor Step
1 1
P1 is true: 7 − 3 is divisible by 4
Inductive Hypothesis
k k k k
Assume that 7 − 3 is divisible by 4. Therefore, 7 − 3 = 4r for some integer r.
Inductive Step
(k + 1) (k + 1)
We now show that Pk + 1 is true: 7 −3 is divisible by 4
k k
7⋅7 −3⋅3
k k k k k k k
4⋅7 +7 +7 +7 −3 −3 −3
k k k k k k k
4⋅7 +7 −3 +7 −3 +7 −3
k
4 ⋅ 7 + 4r + 4r + 4r
4(7 + r + r + r)
k

Conclusion
By induction Pn is true for all n ≥ 1.

-49- Worksheet by Kuta Software LLC

©g E2y0e2J4i VKru^t]aD HSBoRfstcwAanrqeN LLfLuCp.[ r oAXlplR prmiQgMhotEsB grgensoePrTvMeodU.^ A jMCamdceK VwqiQtWhy KImnDfHipnaijtyej nPPrKeQcJaalLcPuslOu]sP.
 3
75) Let Pn be the statement 10n − n is divisible by 3
Anchor Step
3
P1 is true: 10 ⋅ 1 − 1 is divisible by 3
Inductive Hypothesis
3 3
Assume that 10k − k is divisible by 3. Therefore, 10k − k = 3r for some integer r.
Inductive Step
10(k + 1) − (k + 1) is divisible by 3
3
We now show that Pk + 1 is true:
10(k + 3k + 3k + 1) − k − 1
3 2

3 2
10k + 30k + 30k + 10 − k − 1
3 2
10k − k + 30k + 30k + 9
2
3r + 30k + 30k + 9
3(r + 10k + 10k + 3)
2

Conclusion
By induction Pn is true for all n ≥ 1.
3
76) Let Pn be the statement 10n + 5n is divisible by 3
Anchor Step
3
P1 is true: 10 ⋅ 1 + 5 is divisible by 3
Inductive Hypothesis
3 3
Assume that 10k + 5k is divisible by 3. Therefore, 10k + 5k = 3r for some integer r.
Inductive Step
10(k + 1) + 5(k + 1) is divisible by 3
3
We now show that Pk + 1 is true:
10(k + 3k + 3k + 1) + 5k + 5
3 2

3 2
10k + 30k + 30k + 10 + 5k + 5
3 2
10k + 5k + 30k + 30k + 15
2
3r + 30k + 30k + 15
3(r + 10k + 10k + 5)
2

Conclusion
By induction Pn is true for all n ≥ 1.
3
77) Let Pn be the statement 4n + 2n is divisible by 6
Anchor Step
3
P1 is true: 4 ⋅ 1 + 2 is divisible by 6
Inductive Hypothesis
3 3
Assume that 4k + 2k is divisible by 6. Therefore, 4k + 2k = 6r for some integer r.
Inductive Step
4(k + 1) + 2(k + 1) is divisible by 6
3
We now show that Pk + 1 is true:
4(k + 3k + 3k + 1) + 2k + 2
3 2

3 2
4k + 12k + 12k + 4 + 2k + 2
3 2
4k + 2k + 12k + 12k + 6
2
6r + 12k + 12k + 6
6(r + 2k + 2k + 1)
2

Conclusion
By induction Pn is true for all n ≥ 1.

-50- Worksheet by Kuta Software LLC

©t c2r0j2L4H KKouotgaY OSloQfitcwKaLrzex DLcLmCL.x p NATlQlE lrCi]gBh`tms[ BrseEsEeFrJvsetdP.q n xMpavdFei aw_i\tghw eIen[fkiGnRiQt`e_ iPprWekcJanl[cxuAlOuJsV.
 n
78) Let Pn be the statement 2 is a factor of 3 + 5
Anchor Step
1
P1 is true: 2 is a factor of 3 + 5
Inductive Hypothesis
k k
Assume that 2 is a factor of 3 + 5. Therefore, 3 + 5 = 2r for some integer r.
Inductive Step
(k + 1)
We now show that Pk + 1 is true: 2 is a factor of 3 +5
k
3⋅3 +5
(2 + 1) ⋅ 3 k + 5
k k
2⋅3 +3 +5
k
2 ⋅ 3 + 2r
2(3 + r)
k

Conclusion
By induction Pn is true for all n ≥ 1.
2
79) Let Pn be the statement 13n + 19n is divisible by −2
Anchor Step
2
P1 is true: 13 ⋅ 1 + 19 is divisible by −2
Inductive Hypothesis
2 2
Assume that 13k + 19k is divisible by −2. Therefore, 13k + 19k = −2r for some integer r.
Inductive Step
13(k + 1) + 19(k + 1) is divisible by −2
2
We now show that Pk + 1 is true:
2
13k + 26k + 13 + 19k + 19
2
13k + 19k + 26k + 32
−2r + 26k + 32
−2(r − 13k − 16)
Conclusion
By induction Pn is true for all n ≥ 1.
2
80) Let Pn be the statement 21n + 9n is divisible by 6
Anchor Step
2
P1 is true: 21 ⋅ 1 + 9 is divisible by 6
Inductive Hypothesis
2 2
Assume that 21k + 9k is divisible by 6. Therefore, 21k + 9k = 6r for some integer r.
Inductive Step
21(k + 1) + 9(k + 1) is divisible by 6
2
We now show that Pk + 1 is true:
2
21k + 42k + 21 + 9k + 9
2
21k + 9k + 42k + 30
6r + 42k + 30
6(r + 7k + 5)
Conclusion
By induction Pn is true for all n ≥ 1.

-51- Worksheet by Kuta Software LLC

©D g2L0a2U4b GKGu_tbaT QSfoZfDtTwla\rpeg [LdLUCK.^ _ dAXltlM xrJikgth\tnsL LrzeNsZekrdvierd^.S r pMTagdoeC cwzi\tvhv yIAnMfDiynJiPtjev iPxrMe^czajlCc\u^luuasl.
 n
81) Let Pn be the statement 3 is a factor of 4 − 1
Anchor Step
1
P1 is true: 3 is a factor of 4 − 1
Inductive Hypothesis
k k
Assume that 3 is a factor of 4 − 1. Therefore, 4 − 1 = 3r for some integer r.
Inductive Step
(k + 1)
We now show that Pk + 1 is true: 3 is a factor of 4 −1
k
4⋅4 −1
(3 + 1) ⋅ 4 k − 1
k k
3⋅4 +4 −1
k
3 ⋅ 4 + 3r
3(4 + r)
k

Conclusion
By induction Pn is true for all n ≥ 1.
2
82) Let Pn be the statement 17n + 3n is divisible by 2
Anchor Step
2
P1 is true: 17 ⋅ 1 + 3 is divisible by 2
Inductive Hypothesis
2 2
Assume that 17k + 3k is divisible by 2. Therefore, 17k + 3k = 2r for some integer r.
Inductive Step
17(k + 1) + 3(k + 1) is divisible by 2
2
We now show that Pk + 1 is true:
2
17k + 34k + 17 + 3k + 3
2
17k + 3k + 34k + 20
2r + 34k + 20
2(r + 17k + 10)
Conclusion
By induction Pn is true for all n ≥ 1.
n n
83) Let Pn be the statement 11 − 2 is divisible by 9
Anchor Step
1 1
P1 is true: 11 − 2 is divisible by 9
Inductive Hypothesis
k k k k
Assume that 11 − 2 is divisible by 9. Therefore, 11 − 2 = 9r for some integer r.
Inductive Step
(k + 1) (k + 1)
We now show that Pk + 1 is true: 11 −2 is divisible by 9
k k
11 ⋅ 11 − 2 ⋅ 2
k k k k k
9 ⋅ 11 + 11 + 11 − 2 − 2
k k k k k
9 ⋅ 11 + 11 − 2 + 11 − 2
k
9 ⋅ 11 + 9r + 9r
9(11 + r + r)
k

Conclusion
By induction Pn is true for all n ≥ 1.

-52- Worksheet by Kuta Software LLC

©I e2t0V2G4i BKnuot_a] GSHocfBtBwhaerreH \LsLvCh.[ U rAHlYlx _rEiFgmhgtisH [rpe\sVeerLvDeQdh.x _ TMDaQdieW nwoirtxht EIlnJfViDn^iPtgeE bPkr_e\cuawlbcRuHlWuEsh.
 2
84) Let Pn be the statement 19n − n is divisible by −2
Anchor Step
2
P1 is true: 19 ⋅ 1 − 1 is divisible by −2
Inductive Hypothesis
2 2
Assume that 19k − k is divisible by −2. Therefore, 19k − k = −2r for some integer r.
Inductive Step
19(k + 1) − (k + 1) is divisible by −2
2
We now show that Pk + 1 is true:
2
19k + 38k + 19 − k − 1
2
19k − k + 38k + 18
−2r + 38k + 18
−2(r − 19k − 9)
Conclusion
By induction Pn is true for all n ≥ 1.
n
85) Let Pn be the statement 4 is a factor of 5 + 3
Anchor Step
1
P1 is true: 4 is a factor of 5 + 3
Inductive Hypothesis
k k
Assume that 4 is a factor of 5 + 3. Therefore, 5 + 3 = 4r for some integer r.
Inductive Step
(k + 1)
We now show that Pk + 1 is true: 4 is a factor of 5 +3
k
5⋅5 +3
(4 + 1) ⋅ 5 k + 3
k k
4⋅5 +5 +3
k
4 ⋅ 5 + 4r
4(5 + r)
k

Conclusion
By induction Pn is true for all n ≥ 1.
n
86) Let Pn be the statement 2 is a factor of 3 + 1
Anchor Step
1
P1 is true: 2 is a factor of 3 + 1
Inductive Hypothesis
k k
Assume that 2 is a factor of 3 + 1. Therefore, 3 + 1 = 2r for some integer r.
Inductive Step
(k + 1)
We now show that Pk + 1 is true: 2 is a factor of 3 +1
k
3⋅3 +1
(2 + 1) ⋅ 3 k + 1
k k
2⋅3 +3 +1
k
2 ⋅ 3 + 2r
2(3 + r)
k

Conclusion
By induction Pn is true for all n ≥ 1.

-53- Worksheet by Kuta Software LLC

©u Z2r0i2o4h TKzuatAaz pSTobfFtzwBaqrbet MLuLuC].S N vAplzlC grhivgsh`tpsv xrXeysHeZrOvHeldJ.r Z zMWaWdbek lwKiEtZhJ sIanEfIihnWiHtne\ zPur`eocNaolBc^ullWubsd.
 2
87) Let Pn be the statement 15n + 15n is divisible by 10
Anchor Step
2
P1 is true: 15 ⋅ 1 + 15 is divisible by 10
Inductive Hypothesis
2 2
Assume that 15k + 15k is divisible by 10. Therefore, 15k + 15k = 10r for some integer r.
Inductive Step
15(k + 1) + 15(k + 1) is divisible by 10
2
We now show that Pk + 1 is true:
2
15k + 30k + 15 + 15k + 15
2
15k + 15k + 30k + 30
10r + 30k + 30
10(r + 3k + 3)
Conclusion
By induction Pn is true for all n ≥ 1.
3
88) Let Pn be the statement 2n + 7n is divisible by 3
Anchor Step
3
P1 is true: 2 ⋅ 1 + 7 is divisible by 3
Inductive Hypothesis
3 3
Assume that 2k + 7k is divisible by 3. Therefore, 2k + 7k = 3r for some integer r.
Inductive Step
2(k + 1) + 7(k + 1) is divisible by 3
3
We now show that Pk + 1 is true:
2(k + 3k + 3k + 1) + 7k + 7
3 2

3 2
2k + 6k + 6k + 2 + 7k + 7
3 2
2k + 7k + 6k + 6k + 9
2
3r + 6k + 6k + 9
3(r + 2k + 2k + 3)
2

Conclusion
By induction Pn is true for all n ≥ 1.
2
89) Let Pn be the statement n + 5n is divisible by 2
Anchor Step
2
P1 is true: 1 + 5 is divisible by 2
Inductive Hypothesis
2 2
Assume that k + 5k is divisible by 2. Therefore, k + 5k = 2r for some integer r.
Inductive Step
We now show that Pk + 1 is true: (k + 1) 2 + 5(k + 1) is divisible by 2
2
k + 2k + 1 + 5k + 5
2
k + 5k + 2k + 6
2r + 2k + 6
2(r + k + 3)
Conclusion
By induction Pn is true for all n ≥ 1.

-54- Worksheet by Kuta Software LLC

©v J2N0U2W4y `KvuqtvaT YSkoffAtGwUaFrWeb HLLLsCL.N G PAXlllc jrving[hPtpsG grqebsnePrHvreAdw.v U qMjacdwen YwbistLhv _IAngfUiNnKiZtwee LPsrbeacQaKlicducl_u\sv.
 n
90) Let Pn be the statement 7 is a factor of 8 − 1
Anchor Step
1
P1 is true: 7 is a factor of 8 − 1
Inductive Hypothesis
k k
Assume that 7 is a factor of 8 − 1. Therefore, 8 − 1 = 7r for some integer r.
Inductive Step
(k + 1)
We now show that Pk + 1 is true: 7 is a factor of 8 −1
k
8⋅8 −1
(7 + 1) ⋅ 8 k − 1
k k
7⋅8 +8 −1
k
7 ⋅ 8 + 7r
7(8 + r)
k

Conclusion
By induction Pn is true for all n ≥ 1.
3
91) Let Pn be the statement n + 5n is divisible by 3
Anchor Step
3
P1 is true: 1 + 5 is divisible by 3
Inductive Hypothesis
3 3
Assume that k + 5k is divisible by 3. Therefore, k + 5k = 3r for some integer r.
Inductive Step
We now show that Pk + 1 is true: (k + 1) 3 + 5(k + 1) is divisible by 3
(k 3 + 3k 2 + 3k + 1) + 5k + 5
3 2
k + 3k + 3k + 1 + 5k + 5
3 2
k + 5k + 3k + 3k + 6
2
3r + 3k + 3k + 6
3(r + k + k + 2)
2

Conclusion
By induction Pn is true for all n ≥ 1.
n n
92) Let Pn be the statement 5 − 2 is divisible by 3
Anchor Step
1 1
P1 is true: 5 − 2 is divisible by 3
Inductive Hypothesis
k k k k
Assume that 5 − 2 is divisible by 3. Therefore, 5 − 2 = 3r for some integer r.
Inductive Step
(k + 1) (k + 1)
We now show that Pk + 1 is true: 5 −2 is divisible by 3
k k
5⋅5 −2⋅2
k k k k k
3⋅5 +5 +5 −2 −2
k k k k k
3⋅5 +5 −2 +5 −2
k
3 ⋅ 5 + 3r + 3r
3(5 + r + r)
k

Conclusion
By induction Pn is true for all n ≥ 1.

-55- Worksheet by Kuta Software LLC

©] q2i0]2x4q vKIu`tRaw aSZo\fqtAwiatrhel qL[LTCq.t u rAElKlh Hrui_gkhCtssX ]roessTejrQvieAdX.L k PMXaMd]ew pwgiDtyhG GIEnQfvisnFiItEeI HPQrBeFc]aFl`cZunlZuAsY.
 3
93) Let Pn be the statement 10n − 4n is divisible by 6
Anchor Step
3
P1 is true: 10 ⋅ 1 − 4 is divisible by 6
Inductive Hypothesis
3 3
Assume that 10k − 4k is divisible by 6. Therefore, 10k − 4k = 6r for some integer r.
Inductive Step
10(k + 1) − 4(k + 1) is divisible by 6
3
We now show that Pk + 1 is true:
10(k + 3k + 3k + 1) − 4k − 4
3 2

3 2
10k + 30k + 30k + 10 − 4k − 4
3 2
10k − 4k + 30k + 30k + 6
2
6r + 30k + 30k + 6
6(r + 5k + 5k + 1)
2

Conclusion
By induction Pn is true for all n ≥ 1.
2
94) Let Pn be the statement 9n − 7n is divisible by 2
Anchor Step
2
P1 is true: 9 ⋅ 1 − 7 is divisible by 2
Inductive Hypothesis
2 2
Assume that 9k − 7k is divisible by 2. Therefore, 9k − 7k = 2r for some integer r.
Inductive Step
9(k + 1) − 7(k + 1) is divisible by 2
2
We now show that Pk + 1 is true:
2
9k + 18k + 9 − 7k − 7
2
9k − 7k + 18k + 2
2r + 18k + 2
2(r + 9k + 1)
Conclusion
By induction Pn is true for all n ≥ 1.
2
95) Let Pn be the statement 20n − 12n is divisible by 8
Anchor Step
2
P1 is true: 20 ⋅ 1 − 12 is divisible by 8
Inductive Hypothesis
2 2
Assume that 20k − 12k is divisible by 8. Therefore, 20k − 12k = 8r for some integer r.
Inductive Step
20(k + 1) − 12(k + 1) is divisible by 8
2
We now show that Pk + 1 is true:
2
20k + 40k + 20 − 12k − 12
2
20k − 12k + 40k + 8
8r + 40k + 8
8(r + 5k + 1)
Conclusion
By induction Pn is true for all n ≥ 1.

-56- Worksheet by Kuta Software LLC

©A H2]0Z2l4J XK_uQtFaz vSXoifFtCwkayrgey rLsLpCy.I x KAWlzlJ lrHifgNhhtdsV xrMePsseYrUvOe\d`.g D KMnaSdZem WwViItZhU mIBnJfIicnPidtWep cPxrBepc]awl^cguvlWufsn.
 2
96) Let Pn be the statement 21n + 9n is divisible by 2
Anchor Step
2
P1 is true: 21 ⋅ 1 + 9 is divisible by 2
Inductive Hypothesis
2 2
Assume that 21k + 9k is divisible by 2. Therefore, 21k + 9k = 2r for some integer r.
Inductive Step
21(k + 1) + 9(k + 1) is divisible by 2
2
We now show that Pk + 1 is true:
2
21k + 42k + 21 + 9k + 9
2
21k + 9k + 42k + 30
2r + 42k + 30
2(r + 21k + 15)
Conclusion
By induction Pn is true for all n ≥ 1.
3
97) Let Pn be the statement 8n + 4n is divisible by 6
Anchor Step
3
P1 is true: 8 ⋅ 1 + 4 is divisible by 6
Inductive Hypothesis
3 3
Assume that 8k + 4k is divisible by 6. Therefore, 8k + 4k = 6r for some integer r.
Inductive Step
8(k + 1) + 4(k + 1) is divisible by 6
3
We now show that Pk + 1 is true:
8(k + 3k + 3k + 1) + 4k + 4
3 2

3 2
8k + 24k + 24k + 8 + 4k + 4
3 2
8k + 4k + 24k + 24k + 12
2
6r + 24k + 24k + 12
6(r + 4k + 4k + 2)
2

Conclusion
By induction Pn is true for all n ≥ 1.
n n
98) Let Pn be the statement 5 − 3 is divisible by 2
Anchor Step
1 1
P1 is true: 5 − 3 is divisible by 2
Inductive Hypothesis
k k k k
Assume that 5 − 3 is divisible by 2. Therefore, 5 − 3 = 2r for some integer r.
Inductive Step
(k + 1) (k + 1)
We now show that Pk + 1 is true: 5 −3 is divisible by 2
k k
5⋅5 −3⋅3
k k k k k k k
2⋅5 +5 +5 +5 −3 −3 −3
k k k k k k k
2⋅5 +5 −3 +5 −3 +5 −3
k
2 ⋅ 5 + 2r + 2r + 2r
2(5 + r + r + r)
k

Conclusion
By induction Pn is true for all n ≥ 1.

-57- Worksheet by Kuta Software LLC

©I A2i0C2f4p rKHuvtoae kSZoIfWtCwwaQrAeq GLsL]Cs.t h dALlYlX srdiwgWhbtKse BrIe]sCe`rAvAeKdu.] d iMOaIdxeG Sw`imtWh] VIHnYfTignkistIeF lPurJeZcGa]lhcbuOlhu[sx.
 3
99) Let Pn be the statement 2n + 10n is divisible by 6
Anchor Step
3
P1 is true: 2 ⋅ 1 + 10 is divisible by 6
Inductive Hypothesis
3 3
Assume that 2k + 10k is divisible by 6. Therefore, 2k + 10k = 6r for some integer r.
Inductive Step
2(k + 1) + 10(k + 1) is divisible by 6
3
We now show that Pk + 1 is true:
2(k + 3k + 3k + 1) + 10k + 10
3 2

3 2
2k + 6k + 6k + 2 + 10k + 10
3 2
2k + 10k + 6k + 6k + 12
2
6r + 6k + 6k + 12
6(r + k + k + 2)
2

Conclusion
By induction Pn is true for all n ≥ 1.
n n
100) Let Pn be the statement 7 − 2 is divisible by 5
Anchor Step
1 1
P1 is true: 7 − 2 is divisible by 5
Inductive Hypothesis
k k k k
Assume that 7 − 2 is divisible by 5. Therefore, 7 − 2 = 5r for some integer r.
Inductive Step
(k + 1) (k + 1)
We now show that Pk + 1 is true: 7 −2 is divisible by 5
k k
7⋅7 −2⋅2
k k k k k
5⋅7 +7 +7 −2 −2
k k k k k
5⋅7 +7 −2 +7 −2
k
5 ⋅ 7 + 5r + 5r
5(7 + r + r)
k

Conclusion
By induction Pn is true for all n ≥ 1.
n
101) Let Pn be the statement 6 ≥ 3n
Anchor Step
1
P1is true: 6 ≥ 3 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 6 ≥ 3k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
6 ≥ 3k k≥1
k
6 ⋅ 6 ≥ 6 ⋅ 3k 15k ≥ 15 ≥ 3
k+1
6 ≥ 18k
k+1
6 ≥ 3k + 15k
k+1
6 ≥ 3k + 3
≥ 3(k + 1)
k+1
6
Conclusion
By induction Pn is true for all n ≥ 1.
-58- Worksheet by Kuta Software LLC
©z F2l0a2y4^ `KNuHt`aM ESRoafNtvwFasrLeZ WL`LcCo.e b kArlwlo orPipgwhbtHs[ irNeAsme_rGvIeDdb.o a PMjaGdeeP ^wqiataho ]ISn]f^irnMiRtDeg tPkrKescKaMlOcOuzlquSsF.
 n
102) Let Pn be the statement 5 ≥ 3n
Anchor Step
1
P1is true: 5 ≥ 3 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 5 ≥ 3k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
5 ≥ 3k k≥1
k
5 ⋅ 5 ≥ 5 ⋅ 3k 12k ≥ 12 ≥ 3
k+1
5 ≥ 15k
k+1
5 ≥ 3k + 12k
k+1
5 ≥ 3k + 3
≥ 3(k + 1)
k+1
5
Conclusion
By induction Pn is true for all n ≥ 1.
n
103) Let Pn be the statement 9 ≥ 9n
Anchor Step
1
P1is true: 9 ≥ 9 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 9 ≥ 9k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
9 ≥ 9k k≥1
k
9 ⋅ 9 ≥ 9 ⋅ 9k 72k ≥ 72 ≥ 9
k+1
9 ≥ 81k
k+1
9 ≥ 9k + 72k
k+1
9 ≥ 9k + 9
≥ 9(k + 1)
k+1
9
Conclusion
By induction Pn is true for all n ≥ 1.

-59- Worksheet by Kuta Software LLC

©k S2N0b2T4W OKpuUtzaZ lSBo]fit[wGanrZep eL[LFCH.P C _Amlolr wrKiwgNhpt`sd Er]eQsKeerjvWeEdE.J i yMSavd_eD Jw^iBtyhK rInnbfli^nuiOtmej FPcrgexcZaBlTcuuwlgues^.
 n
104) Let Pn be the statement 6 ≥ 2n
Anchor Step
1
P1is true: 6 ≥ 2 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 6 ≥ 2k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
6 ≥ 2k k≥1
k
6 ⋅ 6 ≥ 6 ⋅ 2k 10k ≥ 10 ≥ 2
k+1
6 ≥ 12k
k+1
6 ≥ 2k + 10k
k+1
6 ≥ 2k + 2
≥ 2(k + 1)
k+1
6
Conclusion
By induction Pn is true for all n ≥ 1.
n
105) Let Pn be the statement 7 ≥ 6n
Anchor Step
1
P1is true: 7 ≥ 6 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 7 ≥ 6k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
7 ≥ 6k k≥1
k
7 ⋅ 7 ≥ 7 ⋅ 6k 36k ≥ 36 ≥ 6
k+1
7 ≥ 42k
k+1
7 ≥ 6k + 36k
k+1
7 ≥ 6k + 6
≥ 6(k + 1)
k+1
7
Conclusion
By induction Pn is true for all n ≥ 1.

-60- Worksheet by Kuta Software LLC

©r `2K0l2p4b QKhuQtUaX tScobfbtSwvakrdeL xLkLYC`.\ B bAllrlO erTiegLhftts\ brqeVsOelrHvPewdj.Q a lMqatdael Dwkitt]hh CINngfWiTngiGtRey mPnr\ewcuaOlhcGuWl]umsS.
 n
106) Let Pn be the statement 7 ≥ 7n
Anchor Step
1
P1is true: 7 ≥ 7 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 7 ≥ 7k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
7 ≥ 7k k≥1
k
7 ⋅ 7 ≥ 7 ⋅ 7k 42k ≥ 42 ≥ 7
k+1
7 ≥ 49k
k+1
7 ≥ 7k + 42k
k+1
7 ≥ 7k + 7
≥ 7(k + 1)
k+1
7
Conclusion
By induction Pn is true for all n ≥ 1.
n
107) Let Pn be the statement 10 ≥ 10n
Anchor Step
1
P1is true: 10 ≥ 10 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 10 ≥ 10k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
10 ≥ 10k k≥1
k
10 ⋅ 10 ≥ 10 ⋅ 10k 90k ≥ 90 ≥ 10
k+1
10 ≥ 100k
k+1
10 ≥ 10k + 90k
k+1
10 ≥ 10k + 10
≥ 10(k + 1)
k+1
10
Conclusion
By induction Pn is true for all n ≥ 1.

-61- Worksheet by Kuta Software LLC

©] j2U0X2u4U GKcuPtZao SSDoQfDtHw_aLrWeo DLaLCCI.f F lAhl[ld krgibgzh`tTsQ NrOeqsneArovzehd^.V P rMIaOdRez Fwzistchr CIbnXfyiMnMiotjeq yPKrveGcFaJl]csuulkuesV.
 n
108) Let Pn be the statement 5 ≥ 2n
Anchor Step
1
P1is true: 5 ≥ 2 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 5 ≥ 2k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
5 ≥ 2k k≥1
k
5 ⋅ 5 ≥ 5 ⋅ 2k 8k ≥ 8 ≥ 2
k+1
5 ≥ 10k
k+1
5 ≥ 2k + 8k
k+1
5 ≥ 2k + 2
≥ 2(k + 1)
k+1
5
Conclusion
By induction Pn is true for all n ≥ 1.
n
109) Let Pn be the statement 4 ≥ 4n
Anchor Step
1
P1is true: 4 ≥ 4 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 4 ≥ 4k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
4 ≥ 4k k≥1
k
4 ⋅ 4 ≥ 4 ⋅ 4k 12k ≥ 12 ≥ 4
k+1
4 ≥ 16k
k+1
4 ≥ 4k + 12k
k+1
4 ≥ 4k + 4
≥ 4(k + 1)
k+1
4
Conclusion
By induction Pn is true for all n ≥ 1.

-62- Worksheet by Kuta Software LLC

©A E2r0H2B4J LKVuatkaa ySBoefVtKwlafrzeI _LPLOCM.n a fAklKl_ grdisgyhdtist RrLeLsseCr\vyeYd].^ s WMwaDdCec OwDiQt`hS HIznmfziMnOiDtne[ YPhrxejcmailJcUudldutsD.
 n
110) Let Pn be the statement 8 ≥ 7n
Anchor Step
1
P1is true: 8 ≥ 7 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 8 ≥ 7k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
8 ≥ 7k k≥1
k
8 ⋅ 8 ≥ 8 ⋅ 7k 49k ≥ 49 ≥ 7
k+1
8 ≥ 56k
k+1
8 ≥ 7k + 49k
k+1
8 ≥ 7k + 7
≥ 7(k + 1)
k+1
8
Conclusion
By induction Pn is true for all n ≥ 1.
n
111) Let Pn be the statement 4 ≥ 2n
Anchor Step
1
P1is true: 4 ≥ 2 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 4 ≥ 2k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
4 ≥ 2k k≥1
k
4 ⋅ 4 ≥ 4 ⋅ 2k 6k ≥ 6 ≥ 2
k+1
4 ≥ 8k
k+1
4 ≥ 2k + 6k
k+1
4 ≥ 2k + 2
≥ 2(k + 1)
k+1
4
Conclusion
By induction Pn is true for all n ≥ 1.

-63- Worksheet by Kuta Software LLC

©L T2u0K2y4q QKeumtoaH fSuovfntEwfaZrzeq nLYLOCd.o F nA]l^l` KrIiQgKh`tEsY ur[eRslePrYv_e^de.o s sMUaadfes Twtirtghr UIinRfviznOibtqec gPxrJeSclaSlqcBuGlquUsh.
 n
112) Let Pn be the statement 8 ≥ 3n
Anchor Step
1
P1is true: 8 ≥ 3 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 8 ≥ 3k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
8 ≥ 3k k≥1
k
8 ⋅ 8 ≥ 8 ⋅ 3k 21k ≥ 21 ≥ 3
k+1
8 ≥ 24k
k+1
8 ≥ 3k + 21k
k+1
8 ≥ 3k + 3
≥ 3(k + 1)
k+1
8
Conclusion
By induction Pn is true for all n ≥ 1.
n
113) Let Pn be the statement 10 ≥ 6n
Anchor Step
1
P1is true: 10 ≥ 6 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 10 ≥ 6k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
10 ≥ 6k k≥1
k
10 ⋅ 10 ≥ 10 ⋅ 6k 54k ≥ 54 ≥ 6
k+1
10 ≥ 60k
k+1
10 ≥ 6k + 54k
k+1
10 ≥ 6k + 6
≥ 6(k + 1)
k+1
10
Conclusion
By induction Pn is true for all n ≥ 1.

-64- Worksheet by Kuta Software LLC

©] X2r0d2N4j tKMuHtrav lSgonfPt`wNavrAer QLHLdCg.O \ kAslBlx _rWiNgxhQtusY Gr\eWsUeyrYv^eOdN.B p cM]aSduex rw`iRt\hA VIunkfniRn[istyeX \Psrte^cQaplfcquxlcuqsE.
 n
114) Let Pn be the statement 10 ≥ 9n
Anchor Step
1
P1is true: 10 ≥ 9 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 10 ≥ 9k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
10 ≥ 9k k≥1
k
10 ⋅ 10 ≥ 10 ⋅ 9k 81k ≥ 81 ≥ 9
k+1
10 ≥ 90k
k+1
10 ≥ 9k + 81k
k+1
10 ≥ 9k + 9
≥ 9(k + 1)
k+1
10
Conclusion
By induction Pn is true for all n ≥ 1.
n
115) Let Pn be the statement 7 ≥ 3n
Anchor Step
1
P1is true: 7 ≥ 3 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 7 ≥ 3k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
7 ≥ 3k k≥1
k
7 ⋅ 7 ≥ 7 ⋅ 3k 18k ≥ 18 ≥ 3
k+1
7 ≥ 21k
k+1
7 ≥ 3k + 18k
k+1
7 ≥ 3k + 3
≥ 3(k + 1)
k+1
7
Conclusion
By induction Pn is true for all n ≥ 1.

-65- Worksheet by Kuta Software LLC

©\ t2F0w2y4i `KyuntLav [Sso^fQtlwbaVrZeD ZLtLfCm.q ` RAolylr vrFidgBhht`sz prBeNsKefrtvtePd`.I s eMKaTdBeh JwDilt]hb _IZnjffiznfiHtmeC DPNrHedcCarlXciuIlouGsn.
 n
116) Let Pn be the statement 7 ≥ 2n
Anchor Step
1
P1is true: 7 ≥ 2 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 7 ≥ 2k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
7 ≥ 2k k≥1
k
7 ⋅ 7 ≥ 7 ⋅ 2k 12k ≥ 12 ≥ 2
k+1
7 ≥ 14k
k+1
7 ≥ 2k + 12k
k+1
7 ≥ 2k + 2
≥ 2(k + 1)
k+1
7
Conclusion
By induction Pn is true for all n ≥ 1.
n
117) Let Pn be the statement 8 ≥ 6n
Anchor Step
1
P1is true: 8 ≥ 6 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 8 ≥ 6k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
8 ≥ 6k k≥1
k
8 ⋅ 8 ≥ 8 ⋅ 6k 42k ≥ 42 ≥ 6
k+1
8 ≥ 48k
k+1
8 ≥ 6k + 42k
k+1
8 ≥ 6k + 6
≥ 6(k + 1)
k+1
8
Conclusion
By induction Pn is true for all n ≥ 1.

-66- Worksheet by Kuta Software LLC

©Q v2X0J2N4O kKHuStlau tShoOfTtnwPaMrJei KLyLrCf.C i NANlyl\ WrSikgMhXttsz wrmeisReGrCvMeDdW.s ] XMjaMdYeh ZwviFtShk eIVnyfEiQnKiqtXeh rPmrUehcOahloc^uPl]uFsG.
 n
118) Let Pn be the statement 9 ≥ 5n
Anchor Step
1
P1is true: 9 ≥ 5 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 9 ≥ 5k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
9 ≥ 5k k≥1
k
9 ⋅ 9 ≥ 9 ⋅ 5k 40k ≥ 40 ≥ 5
k+1
9 ≥ 45k
k+1
9 ≥ 5k + 40k
k+1
9 ≥ 5k + 5
≥ 5(k + 1)
k+1
9
Conclusion
By induction Pn is true for all n ≥ 1.
n
119) Let Pn be the statement 3 ≥ 3n
Anchor Step
1
P1is true: 3 ≥ 3 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 3 ≥ 3k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
3 ≥ 3k k≥1
k
3 ⋅ 3 ≥ 3 ⋅ 3k 6k ≥ 6 ≥ 3
k+1
3 ≥ 9k
k+1
3 ≥ 3k + 6k
k+1
3 ≥ 3k + 3
≥ 3(k + 1)
k+1
3
Conclusion
By induction Pn is true for all n ≥ 1.

-67- Worksheet by Kuta Software LLC

©y B2p0j2C4O XKOuitQaR ^SMogfBtQwla\rBe] wL\LyCa.K z UAYlml\ prziigUhotEsG arEeUsKeSrBvXeUdz.p V BMMaJdmeO JwpimtuhX JIunQfWi`nLiitlej jPLrjeRcVaxlPcburlNuQsc.
 n
120) Let Pn be the statement 9 ≥ 2n
Anchor Step
1
P1is true: 9 ≥ 2 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 9 ≥ 2k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
9 ≥ 2k k≥1
k
9 ⋅ 9 ≥ 9 ⋅ 2k 16k ≥ 16 ≥ 2
k+1
9 ≥ 18k
k+1
9 ≥ 2k + 16k
k+1
9 ≥ 2k + 2
≥ 2(k + 1)
k+1
9
Conclusion
By induction Pn is true for all n ≥ 1.
n
121) Let Pn be the statement 10 ≥ 8n
Anchor Step
1
P1is true: 10 ≥ 8 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 10 ≥ 8k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
10 ≥ 8k k≥1
k
10 ⋅ 10 ≥ 10 ⋅ 8k 72k ≥ 72 ≥ 8
k+1
10 ≥ 80k
k+1
10 ≥ 8k + 72k
k+1
10 ≥ 8k + 8
≥ 8(k + 1)
k+1
10
Conclusion
By induction Pn is true for all n ≥ 1.

-68- Worksheet by Kuta Software LLC

©W e2b0V2x4i xKnuKtZap OSco]fztkwOaEr\eM _LZLvCh.H a AABl_lj erRiFgWhItKsl Orzets_enrGvyewdL.g c tMDa`dZeu NwxivtJh] mIbnbfQiJnJiBtIeJ WPRrFevcqaXlNcnugl[uDsx.
 n
122) Let Pn be the statement 10 ≥ 3n
Anchor Step
1
P1is true: 10 ≥ 3 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 10 ≥ 3k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
10 ≥ 3k k≥1
k
10 ⋅ 10 ≥ 10 ⋅ 3k 27k ≥ 27 ≥ 3
k+1
10 ≥ 30k
k+1
10 ≥ 3k + 27k
k+1
10 ≥ 3k + 3
≥ 3(k + 1)
k+1
10
Conclusion
By induction Pn is true for all n ≥ 1.
n
123) Let Pn be the statement 6 ≥ 4n
Anchor Step
1
P1is true: 6 ≥ 4 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 6 ≥ 4k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
6 ≥ 4k k≥1
k
6 ⋅ 6 ≥ 6 ⋅ 4k 20k ≥ 20 ≥ 4
k+1
6 ≥ 24k
k+1
6 ≥ 4k + 20k
k+1
6 ≥ 4k + 4
≥ 4(k + 1)
k+1
6
Conclusion
By induction Pn is true for all n ≥ 1.

-69- Worksheet by Kuta Software LLC

©X L2x0z2L4k VKluCtVaP FSComfJtowmafrneK KLxLxC`.x z fAAlMlR WrbidgLh]tZsh erHeasceFrLvJeVdy.c g cMWaBdrej mwQiEtBhu kImnQfMilnjiHt]eD dP_raeDcGaTlucquAl\uUsL.
 n
124) Let Pn be the statement 2 ≥ 2n
Anchor Step
1
P1is true: 2 ≥ 2 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 2 ≥ 2k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
2 ≥ 2k k≥1
k
2 ⋅ 2 ≥ 2 ⋅ 2k 2k ≥ 2
k+1
2 ≥ 4k
k+1
2 ≥ 2k + 2k
k+1
2 ≥ 2k + 2
≥ 2(k + 1)
k+1
2
Conclusion
By induction Pn is true for all n ≥ 1.
n
125) Let Pn be the statement 5 ≥ 4n
Anchor Step
1
P1is true: 5 ≥ 4 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 5 ≥ 4k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
5 ≥ 4k k≥1
k
5 ⋅ 5 ≥ 5 ⋅ 4k 16k ≥ 16 ≥ 4
k+1
5 ≥ 20k
k+1
5 ≥ 4k + 16k
k+1
5 ≥ 4k + 4
≥ 4(k + 1)
k+1
5
Conclusion
By induction Pn is true for all n ≥ 1.

-70- Worksheet by Kuta Software LLC

©h C2P0A2E4l uKmuntNac NSXobfOtFw^arrEeH EL[LtCZ.` p JAVlslf crRi]gYhptisF nroefswePrDvbeRdm.B H qMKaQd]es OwxiztThD dIgnsfciznnigtOeK DP^rVeMcAatlTc]u\lOudsi.
 n
126) Let Pn be the statement 8 ≥ 5n
Anchor Step
1
P1is true: 8 ≥ 5 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 8 ≥ 5k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
8 ≥ 5k k≥1
k
8 ⋅ 8 ≥ 8 ⋅ 5k 35k ≥ 35 ≥ 5
k+1
8 ≥ 40k
k+1
8 ≥ 5k + 35k
k+1
8 ≥ 5k + 5
≥ 5(k + 1)
k+1
8
Conclusion
By induction Pn is true for all n ≥ 1.
n
127) Let Pn be the statement 10 ≥ 7n
Anchor Step
1
P1is true: 10 ≥ 7 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 10 ≥ 7k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
10 ≥ 7k k≥1
k
10 ⋅ 10 ≥ 10 ⋅ 7k 63k ≥ 63 ≥ 7
k+1
10 ≥ 70k
k+1
10 ≥ 7k + 63k
k+1
10 ≥ 7k + 7
≥ 7(k + 1)
k+1
10
Conclusion
By induction Pn is true for all n ≥ 1.

-71- Worksheet by Kuta Software LLC

©D N2o0]2X4y eKBuutBaw gS]oQfFtdwJaCrheB mLRLRC`.W C eAWlvlZ urBi\grhTtCsb lroe\sUeCrevAeRdO.j T eMNaUdleu ywoiOtqhS ]IEnrfjiYnAiFtfeE fPyryetciaQlFcQuLlguTsC.
 n
128) Let Pn be the statement 6 ≥ 5n
Anchor Step
1
P1is true: 6 ≥ 5 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 6 ≥ 5k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
6 ≥ 5k k≥1
k
6 ⋅ 6 ≥ 6 ⋅ 5k 25k ≥ 25 ≥ 5
k+1
6 ≥ 30k
k+1
6 ≥ 5k + 25k
k+1
6 ≥ 5k + 5
≥ 5(k + 1)
k+1
6
Conclusion
By induction Pn is true for all n ≥ 1.
n
129) Let Pn be the statement 9 ≥ 3n
Anchor Step
1
P1is true: 9 ≥ 3 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 9 ≥ 3k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
9 ≥ 3k k≥1
k
9 ⋅ 9 ≥ 9 ⋅ 3k 24k ≥ 24 ≥ 3
k+1
9 ≥ 27k
k+1
9 ≥ 3k + 24k
k+1
9 ≥ 3k + 3
≥ 3(k + 1)
k+1
9
Conclusion
By induction Pn is true for all n ≥ 1.

-72- Worksheet by Kuta Software LLC

©X A2g0[2l4b ^KOuftlaY VSLoyfqtNwKazrPeo PLLLtCr.[ W tABlVlz VrciPgehUtBsr jreeJsveQr[voetdU.M T YMsaudmeU nwUiPtXhP NI\nkfliUnUixt]ex dPMrAexcnaUlCcCuElYuLsU.
 n
130) Let Pn be the statement 10 ≥ 5n
Anchor Step
1
P1is true: 10 ≥ 5 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 10 ≥ 5k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
10 ≥ 5k k≥1
k
10 ⋅ 10 ≥ 10 ⋅ 5k 45k ≥ 45 ≥ 5
k+1
10 ≥ 50k
k+1
10 ≥ 5k + 45k
k+1
10 ≥ 5k + 5
≥ 5(k + 1)
k+1
10
Conclusion
By induction Pn is true for all n ≥ 1.
n
131) Let Pn be the statement 7 ≥ 4n
Anchor Step
1
P1is true: 7 ≥ 4 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 7 ≥ 4k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
7 ≥ 4k k≥1
k
7 ⋅ 7 ≥ 7 ⋅ 4k 24k ≥ 24 ≥ 4
k+1
7 ≥ 28k
k+1
7 ≥ 4k + 24k
k+1
7 ≥ 4k + 4
≥ 4(k + 1)
k+1
7
Conclusion
By induction Pn is true for all n ≥ 1.

-73- Worksheet by Kuta Software LLC

©F g2P0u2v4O fKXuOtUaR `SRo`f`tVwZaLrmeM BLELlCX.L \ gAVlSlZ nrriLgqhttMsT erweDsdekrFvKeGdP.P L qMRaRdoeh ewLiPtLh] iIcnif`iVnEiAtFeX ZPFrdeYcUallHc^uHlhu[sZ.
 n
132) Let Pn be the statement 8 ≥ 8n
Anchor Step
1
P1is true: 8 ≥ 8 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 8 ≥ 8k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
8 ≥ 8k k≥1
k
8 ⋅ 8 ≥ 8 ⋅ 8k 56k ≥ 56 ≥ 8
k+1
8 ≥ 64k
k+1
8 ≥ 8k + 56k
k+1
8 ≥ 8k + 8
≥ 8(k + 1)
k+1
8
Conclusion
By induction Pn is true for all n ≥ 1.
n
133) Let Pn be the statement 8 ≥ 4n
Anchor Step
1
P1is true: 8 ≥ 4 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 8 ≥ 4k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
8 ≥ 4k k≥1
k
8 ⋅ 8 ≥ 8 ⋅ 4k 28k ≥ 28 ≥ 4
k+1
8 ≥ 32k
k+1
8 ≥ 4k + 28k
k+1
8 ≥ 4k + 4
≥ 4(k + 1)
k+1
8
Conclusion
By induction Pn is true for all n ≥ 1.

-74- Worksheet by Kuta Software LLC

©] i2s0W2l4n pKku]tias CSUo\fFtcw[aLrOeL LL\LDCb.j Q aA^ljl] RrJiFgihYtBsY trGevsrezrlvDeFdT.L t vMNacdHeE SwJiQtihH eIfnnfsiwnTiZtNeW nPQrceocUaTlSclu]lFujss.
 n
134) Let Pn be the statement 6 ≥ 6n
Anchor Step
1
P1is true: 6 ≥ 6 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 6 ≥ 6k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
6 ≥ 6k k≥1
k
6 ⋅ 6 ≥ 6 ⋅ 6k 30k ≥ 30 ≥ 6
k+1
6 ≥ 36k
k+1
6 ≥ 6k + 30k
k+1
6 ≥ 6k + 6
≥ 6(k + 1)
k+1
6
Conclusion
By induction Pn is true for all n ≥ 1.
n
135) Let Pn be the statement 8 ≥ 2n
Anchor Step
1
P1is true: 8 ≥ 2 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 8 ≥ 2k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
8 ≥ 2k k≥1
k
8 ⋅ 8 ≥ 8 ⋅ 2k 14k ≥ 14 ≥ 2
k+1
8 ≥ 16k
k+1
8 ≥ 2k + 14k
k+1
8 ≥ 2k + 2
≥ 2(k + 1)
k+1
8
Conclusion
By induction Pn is true for all n ≥ 1.

-75- Worksheet by Kuta Software LLC

©M m2Q0d2M4b vK^u]tmak LSkobfqtdwoaVrces aLpLyCk.U u sAIltlx dr]iGgNhttSsX orTelsoeQrhvpeUdI.q w HMBaKdReq lwFiLtyhx ^IknvfYicnniotYex SPhroeZcTaelwcWuPl_uZs].
 n
136) Let Pn be the statement 3 ≥ 2n
Anchor Step
1
P1is true: 3 ≥ 2 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 3 ≥ 2k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
3 ≥ 2k k≥1
k
3 ⋅ 3 ≥ 3 ⋅ 2k 4k ≥ 4 ≥ 2
k+1
3 ≥ 6k
k+1
3 ≥ 2k + 4k
k+1
3 ≥ 2k + 2
≥ 2(k + 1)
k+1
3
Conclusion
By induction Pn is true for all n ≥ 1.
n
137) Let Pn be the statement 9 ≥ 8n
Anchor Step
1
P1is true: 9 ≥ 8 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 9 ≥ 8k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
9 ≥ 8k k≥1
k
9 ⋅ 9 ≥ 9 ⋅ 8k 64k ≥ 64 ≥ 8
k+1
9 ≥ 72k
k+1
9 ≥ 8k + 64k
k+1
9 ≥ 8k + 8
≥ 8(k + 1)
k+1
9
Conclusion
By induction Pn is true for all n ≥ 1.

-76- Worksheet by Kuta Software LLC

©i Q2Z0A2t4a fKJuAtaaZ wS`oKfWtLwPaTrpeE ULsL]Ck.H [ JA\ljlw OruiVg[hRtrsG jrRejsReJrzvJeXdD.S f yM_ajdReL ew_iXthh` SIFnqfViAnxiOtlew cPfrfeKciaplAcyuMlPuAsN.
 n
138) Let Pn be the statement 9 ≥ 7n
Anchor Step
1
P1is true: 9 ≥ 7 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 9 ≥ 7k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
9 ≥ 7k k≥1
k
9 ⋅ 9 ≥ 9 ⋅ 7k 56k ≥ 56 ≥ 7
k+1
9 ≥ 63k
k+1
9 ≥ 7k + 56k
k+1
9 ≥ 7k + 7
≥ 7(k + 1)
k+1
9
Conclusion
By induction Pn is true for all n ≥ 1.
n
139) Let Pn be the statement 5 ≥ 5n
Anchor Step
1
P1is true: 5 ≥ 5 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 5 ≥ 5k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
5 ≥ 5k k≥1
k
5 ⋅ 5 ≥ 5 ⋅ 5k 20k ≥ 20 ≥ 5
k+1
5 ≥ 25k
k+1
5 ≥ 5k + 20k
k+1
5 ≥ 5k + 5
≥ 5(k + 1)
k+1
5
Conclusion
By induction Pn is true for all n ≥ 1.

-77- Worksheet by Kuta Software LLC

©g ]2\0n2u4t WKluvtoai GSAosfTt[wvaTrCeq sLELcCr.O N KArlYlz MraiHgphftWsD MrRegsgelrdvWeFdv.u c rMwaSdheU jwdiUtFhF rIpnlflignCiItEeA ZPUrdercraRlYcZuAlFuxsk.
 n
140) Let Pn be the statement 10 ≥ 4n
Anchor Step
1
P1is true: 10 ≥ 4 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 10 ≥ 4k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
10 ≥ 4k k≥1
k
10 ⋅ 10 ≥ 10 ⋅ 4k 36k ≥ 36 ≥ 4
k+1
10 ≥ 40k
k+1
10 ≥ 4k + 36k
k+1
10 ≥ 4k + 4
≥ 4(k + 1)
k+1
10
Conclusion
By induction Pn is true for all n ≥ 1.
n
141) Let Pn be the statement 4 ≥ 3n
Anchor Step
1
P1is true: 4 ≥ 3 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 4 ≥ 3k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
4 ≥ 3k k≥1
k
4 ⋅ 4 ≥ 4 ⋅ 3k 9k ≥ 9 ≥ 3
k+1
4 ≥ 12k
k+1
4 ≥ 3k + 9k
k+1
4 ≥ 3k + 3
≥ 3(k + 1)
k+1
4
Conclusion
By induction Pn is true for all n ≥ 1.

-78- Worksheet by Kuta Software LLC

©w P2b0o2S4j YKnult^al _SDoYfNt]wcadrhed hLOLZCW.` J CAzlwlj Orai_g]hTtjsb grWeKsJeErdvEeydc.P v xMlahdWeI swzi^tphM kIYnCfyi^nDintnep kPUrgebchaWl]cpujleuusa.
 n
142) Let Pn be the statement 10 ≥ 2n
Anchor Step
1
P1is true: 10 ≥ 2 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 10 ≥ 2k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
10 ≥ 2k k≥1
k
10 ⋅ 10 ≥ 10 ⋅ 2k 18k ≥ 18 ≥ 2
k+1
10 ≥ 20k
k+1
10 ≥ 2k + 18k
k+1
10 ≥ 2k + 2
≥ 2(k + 1)
k+1
10
Conclusion
By induction Pn is true for all n ≥ 1.
n
143) Let Pn be the statement 9 ≥ 6n
Anchor Step
1
P1is true: 9 ≥ 6 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 9 ≥ 6k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
9 ≥ 6k k≥1
k
9 ⋅ 9 ≥ 9 ⋅ 6k 48k ≥ 48 ≥ 6
k+1
9 ≥ 54k
k+1
9 ≥ 6k + 48k
k+1
9 ≥ 6k + 6
≥ 6(k + 1)
k+1
9
Conclusion
By induction Pn is true for all n ≥ 1.

-79- Worksheet by Kuta Software LLC

©_ N2f0K2g4X BKIurt[a\ YSyoRfyttwaairJer WLFL^Cd.Q f kAxlWlm zrfiYgAhctVsz DrTeqsJeXrAvEeTdr.p I `Maaidpec Fw^iEtshI jINnRfBiNnwiwtSeu YPjr_ebcKabllcKuzlZu^sc.
 n
144) Let Pn be the statement 9 ≥ 4n
Anchor Step
1
P1is true: 9 ≥ 4 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 9 ≥ 4k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
9 ≥ 4k k≥1
k
9 ⋅ 9 ≥ 9 ⋅ 4k 32k ≥ 32 ≥ 4
k+1
9 ≥ 36k
k+1
9 ≥ 4k + 32k
k+1
9 ≥ 4k + 4
≥ 4(k + 1)
k+1
9
Conclusion
By induction Pn is true for all n ≥ 1.
n
145) Let Pn be the statement 7 ≥ 5n
Anchor Step
1
P1is true: 7 ≥ 5 ⋅ 1
Inductive Hypothesis
k
Assume that Pk is true: 7 ≥ 5k for some integer k ≥ 1
Inductive Step
We now show that Pk + 1 is true:
k
7 ≥ 5k k≥1
k
7 ⋅ 7 ≥ 7 ⋅ 5k 30k ≥ 30 ≥ 5
k+1
7 ≥ 35k
k+1
7 ≥ 5k + 30k
k+1
7 ≥ 5k + 5
≥ 5(k + 1)
k+1
7
Conclusion
By induction Pn is true for all n ≥ 1.

-80- Worksheet by Kuta Software LLC

©` c2j0i2n4[ GKEuUthaK KSKorfStpwLayrweX iL]LNCy.z r NAmldlc MrSiigDhhtmsz `rceTs_eyrOv[eIdq.Q E pMyaudXeH cwSi`t^hV OINn[fCiFnJirtoeI sPbrkehcaaIlacbuolluqsy.