Chapter 12 Sequences; Induction; the Binomial Theorem
Chapter 12 Sequences; Induction; the Binomial Theorem
Chapter 12 Sequences; Induction; the Binomial Theorem
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
<strong>Chapter</strong> <strong>12</strong>: <strong>Sequences</strong>; <strong>Induction</strong>; <strong>the</strong> <strong>Binomial</strong> <strong>Theorem</strong><br />
55.<br />
56.<br />
57.<br />
n<br />
1 1 1 1 1<br />
∑ = 1+ + + + +<br />
3<br />
k 3 9 27 3<br />
n<br />
k = 0<br />
n<br />
⎛3⎞ 3 9 ⎛3⎞<br />
∑ ⎜ ⎟ = 1+ + + + ⎜ ⎟<br />
⎝2⎠ 2 4 ⎝2⎠<br />
k = 0<br />
n−1<br />
k = 0<br />
k<br />
1 1 1 1 1<br />
∑ = + + + +<br />
k+<br />
1<br />
3 3 9 27<br />
n<br />
3<br />
n−1<br />
58. ∑ (2k<br />
+ 1) = 1+ 3+ 5+ 7 + + ( 2( n− 1) + 1)<br />
59.<br />
60.<br />
k = 0<br />
n<br />
k = 2<br />
= 1+ 3+ 5+ 7 + + (2n<br />
−1)<br />
k<br />
n<br />
∑ ( − 1) lnk<br />
= ln2− ln3+ ln4 − + ( −1) lnn<br />
n<br />
∑<br />
k = 3<br />
k+<br />
1 k<br />
( −1) 2<br />
4 3 5 4 6 5 n+<br />
1 n<br />
= ( − 1) 2 + ( − 1) 2 + ( − 1) 2 + + ( −1) 2<br />
3 4 5 6 n+<br />
1 n<br />
= 2 − 2 + 2 − 2 + + ( −1) 2<br />
n+<br />
1 n<br />
= 8− 16+ 32− 64 + ... + ( −1) 2<br />
61. Answers may vary. One possibility follows:<br />
20<br />
1+ 2+ 3+ + 20= ∑ k<br />
k = 1<br />
62. Answers may vary. One possibility follows:<br />
8<br />
3 3 3 3 3<br />
1 + 2 + 3 + + 8 = ∑ k<br />
k = 1<br />
63. Answers may vary. One possibility follows:<br />
1 2 3 13<br />
13<br />
k<br />
+ + + + = ∑<br />
2 3 4 13+ 1 k + 1<br />
k = 1<br />
64. Answers may vary. One possibility follows:<br />
<strong>12</strong><br />
1+ 3 + 5 + 7 + + 2(<strong>12</strong>) − 1 = (2k<br />
−1)<br />
[ ]<br />
n<br />
∑<br />
k = 1<br />
65. Answers may vary. One possibility follows:<br />
1 1 1<br />
6<br />
6 ⎛ 1 ⎞ k ⎛ 1 ⎞<br />
1 − + − + + ( − 1) ⎜ ( 1)<br />
3 9 27<br />
6 ⎟= ∑ − ⎜ k ⎟<br />
⎝3 ⎠ ⎝3<br />
⎠<br />
k = 0<br />
66. Answers may vary. One possibility follows:<br />
11<br />
2 4 8<br />
11<br />
11+ 1 ⎛2⎞ k + 1 ⎛2⎞<br />
− + + + ( − 1) ⎜ ⎟ = ∑ ( −1)<br />
⎜ ⎟<br />
3 9 27<br />
⎝3⎠ ⎝3⎠<br />
k = 1<br />
k<br />
67. Answers may vary. One possibility follows:<br />
2 3<br />
n k<br />
3 3 3 3<br />
3 + n<br />
2 + 3<br />
+ + n<br />
= ∑ k<br />
k = 1<br />
68. Answers may vary. One possibility follows:<br />
1 2 3 n<br />
n<br />
k<br />
+ + + + =<br />
e<br />
2 3<br />
n<br />
∑<br />
k<br />
e e e e<br />
k = 1<br />
69. Answers may vary. One possibility follows:<br />
n<br />
a+ ( a+ d) + ( a+ 2 d) + + ( a+ nd) = ( a+<br />
kd)<br />
n<br />
∑<br />
k = 1<br />
( )<br />
or = ( a+ k −1 d)<br />
∑<br />
k = 0<br />
70. Answers may vary. One possibility follows:<br />
n<br />
2 n−1 k−1<br />
a+ ar+ ar + + ar = ∑ ar<br />
or<br />
n−1<br />
∑<br />
k = 0<br />
ar<br />
k<br />
k = 1<br />
40<br />
71. ( )<br />
72.<br />
73.<br />
74.<br />
75.<br />
∑ 5= 5 <br />
+ 5+ 5+⋅⋅⋅+ 5= 40 5 = 200<br />
k = 1 40 times<br />
50<br />
∑ 8 = 8 <br />
+ 8 + 8 +⋅⋅⋅+ 8 = 50(8) = 400<br />
k = 1 50 times<br />
40<br />
∑<br />
k = 1<br />
( + )<br />
40 40 1<br />
k = = 20( 41)<br />
= 820<br />
2<br />
24 24<br />
k= 1 k=<br />
1<br />
( + )<br />
24 24 1<br />
( − k) = − k = − = −300<br />
2<br />
∑ ∑<br />
20 20 20 20 20<br />
∑ ∑ ∑ ∑ ∑<br />
(5k+ 3) = (5 k) + 3 = 5 k+<br />
3<br />
k= 1 k= 1 k= 1 k= 1 k=<br />
1<br />
( + )<br />
⎛20 20 1 ⎞<br />
= 5⎜<br />
⎟+<br />
3 20<br />
⎝ 2 ⎠<br />
= 1050 + 60 = 1110<br />
( )<br />
26 26 26 26 26<br />
76. ∑ ( k − ) = ∑( k)<br />
− ∑ = ∑k−∑<br />
3 7 3 7 3 7<br />
k= 1 k= 1 k= 1 k= 1 k=<br />
1<br />
( + )<br />
⎛26 26 1 ⎞<br />
= 3⎜<br />
⎟−7 26<br />
⎝ 2 ⎠<br />
= 1053 − 182 = 871<br />
( )<br />
<strong>12</strong>38<br />
© 2009 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is protected under all copyright laws as <strong>the</strong>y currently<br />
exist. No portion of this material may be reproduced, in any form or by any means, without permission in writing from <strong>the</strong> publisher.