Chapter 12 Sequences; Induction; the Binomial Theorem
Chapter 12 Sequences; Induction; the Binomial Theorem
Chapter 12 Sequences; Induction; the Binomial Theorem
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
<strong>Chapter</strong> <strong>12</strong> Review Exercises<br />
51. I:<br />
11 −<br />
1<br />
n = 1: 2⋅ 3 = 2 and 3 − 1=<br />
2<br />
k−1<br />
II: If 2+ 6+ 18+ + 2⋅ 3 = 3 −1, <strong>the</strong>n<br />
k−<br />
1 k+ 1−1<br />
2+ 6+ 18+ + 2⋅ 3 + 2⋅3<br />
k−1<br />
k<br />
= ⎡2 6 18 23 ⎤<br />
⎣<br />
+ + + + ⋅<br />
⎦<br />
+ 23 ⋅<br />
k k k k+<br />
1<br />
= 3 − 1+ 2⋅ 3 = 3⋅3 − 1= 3 −1<br />
Conditions I and II are satisfied; <strong>the</strong> statement is<br />
true.<br />
11 −<br />
1<br />
52. I: n = 1: 3⋅ 2 = 3and 3( 2 − 1)<br />
= 3<br />
k−1<br />
k<br />
II: If 3+ 6+ <strong>12</strong>+ + 3⋅ 2 = 3( 2 −1)<br />
k<br />
k−<br />
1 k+ 1−1<br />
3+ 6+ <strong>12</strong>+ + 32 ⋅ + 32 ⋅<br />
k−1<br />
= ⎡3 6 <strong>12</strong> 32 ⎤<br />
⎣<br />
+ + + + ⋅<br />
⎦<br />
+ 32 ⋅<br />
= 32 − 1+ 32 ⋅<br />
, <strong>the</strong>n<br />
k<br />
k<br />
( )<br />
k k k k+<br />
1<br />
( ) ( ) ( )<br />
= 3⋅ 2 − 1+ 2 = 3 2⋅2 − 1 = 3 2 −1<br />
Conditions I and II are satisfied; <strong>the</strong> statement is<br />
true.<br />
k<br />
54. I:<br />
1 3 2 2<br />
= ⋅ ⎡6k 6k 9k 9k 2k<br />
2⎤<br />
2 ⎣<br />
+ + + + +<br />
⎦<br />
1 2<br />
= ⋅ ⎡6k ( k+ 1) + 9k( k+ 1) + 2( k+<br />
1)<br />
⎤<br />
2 ⎣<br />
⎦<br />
1 ( 1) 6 2<br />
k ⎡ k <strong>12</strong> k 6 3 k 3 1<br />
= ⋅ + + + − − − ⎤<br />
2 ⎣<br />
⎦<br />
1 2<br />
= ⋅ ( k+ 1) ⎡ 6( k 2 k 1) 3( k 1) 1 ⎤<br />
2 ⎣<br />
+ + − + −<br />
⎦<br />
1 ( 1) 6( 1) 2<br />
= ⋅ k+ ⎡ k+ − 3( k+ 1) − 1 ⎤<br />
2 ⎣<br />
⎦<br />
Conditions I and II are satisfied; <strong>the</strong> statement is<br />
true.<br />
1<br />
n = 1: 1(1 + 2) = 3and ⋅ (1+ 1)(2⋅ 1+ 7) = 3<br />
6<br />
II: If<br />
k<br />
13 ⋅ + 24 ⋅ + + kk ( + 2) = ( k+ 1)(2k+<br />
7) ,<br />
6<br />
<strong>the</strong>n<br />
13 ⋅ + 24 ⋅ + + kk ( + 2) + ( k+ 1)( k+ 1+<br />
2)<br />
= 13 ⋅ + 24 ⋅ + + kk ( + 2) + ( k+ 1)( k+<br />
3)<br />
[ ]<br />
53. I: n = 1:<br />
k<br />
= ( k + 1)(2 k + 7) + ( k + 1)( k + 3)<br />
2 1<br />
6<br />
2<br />
(3⋅1− 2) = 1 and ⋅1(6 ⋅1 −3⋅1− 1) = 1<br />
( k + 1)<br />
2<br />
2<br />
= ( 2 k + 7 k+ 6 k+<br />
18 )<br />
6<br />
II: If<br />
( k + 1) 2<br />
2 2 2 1 2<br />
=<br />
1 + 4 + + (3k− 2) = ⋅k( 6k −3k−1)<br />
,<br />
( 2 k + 13 k+<br />
18 )<br />
6<br />
2<br />
<strong>the</strong>n<br />
( k + 1)<br />
= [( k + 1) + 1][2( k+ 1) + 7]<br />
2 2 2 2<br />
2<br />
1 + 4 + 7 + + (3k− 2) + ( 3( k+ 1) −2<br />
6<br />
)<br />
Conditions I and II are satisfied; <strong>the</strong> statement is<br />
⎡<br />
2 2 2 2 2<br />
= 1 + 4 + 7 + + (3k− 2) ⎤<br />
⎣<br />
<br />
⎦<br />
+ (3k+<br />
1)<br />
true.<br />
1 2 2<br />
= ⋅k( 6k −3k− 1 ) + (3k+<br />
1)<br />
⎛5⎞ 5! 54321 ⋅ ⋅ ⋅ ⋅ 54 ⋅<br />
2<br />
55. ⎜ ⎟= = = = 10<br />
1<br />
⎝2⎠<br />
2!3! 21321 ⋅ ⋅ ⋅ ⋅ 21 ⋅<br />
⎡<br />
3 2 2<br />
= ⋅ 6k −3k − k+ 18k + <strong>12</strong>k+<br />
2⎤<br />
2 ⎣<br />
⎦<br />
⎛8⎞ 1<br />
8! 87654321 ⋅ ⋅ ⋅ ⋅ ⋅ ⋅ ⋅ 87 ⋅<br />
⎡<br />
3 2<br />
= ⋅ 6k + 15k + 11k+<br />
2⎤<br />
56. ⎜ ⎟= = = = 28<br />
2 ⎣<br />
⎦<br />
⎝6⎠<br />
6!2! 65432<strong>12</strong>1 ⋅ ⋅ ⋅ ⋅ ⋅ ⋅ ⋅ 21 ⋅<br />
1 ( 1) 6 2<br />
= ⋅ k+ ⎡ k + 9 k+<br />
2 ⎤<br />
2 ⎣ ⎦<br />
_________________________________________________________________________________________________<br />
57.<br />
⎛5⎞ ⎛5⎞ ⎛5⎞ ⎛5⎞ ⎛5⎞ ⎛5⎞<br />
( x+ 2) = ⎜ ⎟x + ⎜ ⎟x ⋅ 2+ ⎜ ⎟x ⋅ 2 + ⎜ ⎟x ⋅ 2 + ⎜ ⎟x<br />
⋅ 2 + ⎜ ⎟⋅2<br />
⎝0⎠ ⎝1⎠ ⎝2⎠ ⎝3⎠ ⎝4⎠ ⎝5⎠<br />
5 5 4 3 2 2 3 1 4 5<br />
5 4 3 2<br />
= x + 5⋅ 2x + 10⋅ 4x + 10⋅ 8x + 5⋅ 16x+ 1⋅32<br />
5 4 3 2<br />
= x + 10x + 40x + 80x + 80x+<br />
32<br />
<strong>12</strong>77<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.