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 />
50.<br />
8<br />
<strong>12</strong>! = 479,001,600 = 4.790016×<br />
10<br />
18<br />
20! ≈ 2.432902008×<br />
10<br />
25<br />
25! ≈ 1.551<strong>12</strong>1004×<br />
10<br />
⎛<strong>12</strong> ⎞ ⎛ 1 ⎞<br />
<strong>12</strong>! ≈ 2⋅<strong>12</strong>π ⎜ ⎟ ⎜1+<br />
⎟<br />
⎝ e ⎠ ⎝ <strong>12</strong> ⋅ <strong>12</strong> − 1 ⎠<br />
≈ 479,013,972.4<br />
⎛20 ⎞ ⎛ 1 ⎞<br />
20! ≈ 2⋅20π ⎜ ⎟ ⎜1+<br />
⎟<br />
⎝ e ⎠ ⎝ <strong>12</strong> ⋅ 20 − 1 ⎠<br />
18<br />
≈ 2.43292403×<br />
10<br />
⎛25 ⎞ ⎛ 1 ⎞<br />
25! ≈ 2⋅25π ⎜ ⎟ ⎜1+<br />
⎟<br />
⎝ e ⎠ ⎝ <strong>12</strong> ⋅ 25 − 1 ⎠<br />
25<br />
≈ 1.551<strong>12</strong>9917×<br />
10<br />
<strong>Chapter</strong> <strong>12</strong> Review Exercises<br />
1.<br />
2.<br />
3.<br />
4.<br />
<strong>12</strong><br />
20<br />
25<br />
11+ 3 4 2 2+<br />
3 5<br />
a1 = ( − 1) =− , a2<br />
= ( − 1) = ,<br />
1+ 2 3 2+<br />
2 4<br />
3 3+ 3 6 4 4+<br />
3 7<br />
a3 = ( − 1) =− , a4<br />
= ( − 1) = ,<br />
3+ 2 5 4+<br />
2 6<br />
5 5+<br />
3 8<br />
a5<br />
= ( − 1) =− 5 + 2 7<br />
11 +<br />
b1<br />
= ( −1) (2 ⋅ 1+ 3) = 5,<br />
2+<br />
1<br />
b2<br />
= ( −1) (2⋅ 2+ 3) =−7,<br />
3+<br />
1<br />
b3<br />
= ( −1) (2⋅ 3+ 3) = 9,<br />
4+<br />
1<br />
b4<br />
= ( −1) (2⋅ 4+ 3) =−11,<br />
5+<br />
1<br />
b = ( −1) (2⋅ 5+ 3) = 13<br />
5<br />
1 2 3<br />
1 2 2 2 3 2<br />
2 2 2 4 2 8<br />
c = = = 2, c = = = 1, c = = ,<br />
1 1 2 4 3 9<br />
4 5<br />
2 16 2 32<br />
c4 = = = 1, c<br />
2 5 = =<br />
2<br />
4 16 5 25<br />
1 2 3 4 5<br />
1 = e = , 2 = e , 3 = e , e 4 = ,<br />
e<br />
5 =<br />
d e d d d d<br />
1 2 3 4 5<br />
2 2 4<br />
a = 3, a = ⋅ 3 = 2, a = ⋅ 2 = ,<br />
3 3 3<br />
2 4 8 2 8 16<br />
a4 = ⋅ = , a5<br />
= ⋅ =<br />
3 3 9 3 9 27<br />
5. 1 2 3<br />
1 1 1<br />
= 4, =− ⋅ 4 =− 1, =− ⋅− 1 = ,<br />
4 4 4<br />
1 1 1 1 1 1<br />
a4 =− ⋅ =− , a5<br />
=− ⋅− =<br />
4 4 16 4 16 64<br />
6. a1 a2 a3<br />
a = 2, a = 2 − 2 = 0, a = 2 − 0 = 2,<br />
7. 1 2 3<br />
a<br />
= 2− 2= 0, a = 2− 0=<br />
2<br />
4 5<br />
8. a1 a2 a3<br />
9.<br />
a<br />
= − 3, = 4 + ( − 3) = 1, = 4 + 1 = 5,<br />
= 4+ 5= 9, a = 4+ 9=<br />
13<br />
4 5<br />
4<br />
∑<br />
k = 1<br />
(4k<br />
+ 2)<br />
( 4 1 2) ( 4 2 2) ( 4 3 2) ( 4 4 2)<br />
( 6) ( 10) ( 14) ( 18)<br />
= ⋅ + + ⋅ + + ⋅ + + ⋅ +<br />
= + + +<br />
= 48<br />
3<br />
2 2 2 2<br />
10. ∑ (3 − k ) = ( 3 − 1 ) + ( 3 − 2 ) + ( 3 −3<br />
)<br />
k = 1<br />
( 2) ( 1) ( 6)<br />
= + − + −<br />
=−5<br />
1 1 1 1 k + 1 ⎛1⎞<br />
− + − +⋅⋅⋅+ = − ⎜ ⎟<br />
2 3 4 13<br />
⎝k<br />
⎠<br />
11. 1 ∑ ( 1)<br />
13<br />
k = 1<br />
2 3 4 n+ 1 n 1<br />
2 2 2 2 ⎛<br />
k+<br />
2 ⎞<br />
<strong>12</strong>. 2 + + + +⋅⋅⋅+ =<br />
2 3<br />
n ∑<br />
k<br />
3 3 3 3 ⎜<br />
k = 0 3 ⎟<br />
⎝ ⎠<br />
n+<br />
1⎛<br />
k<br />
2 ⎞<br />
= ∑<br />
⎜ k −1<br />
k = 1 3 ⎟<br />
⎝ ⎠<br />
13. { a } { n 5}<br />
n<br />
= + Arithmetic<br />
d = ( n+ 1+ 5) − ( n+ 5) = n+ 6−n− 5=<br />
1<br />
n<br />
n<br />
Sn<br />
= [ 6+ n+ 5 ] = ( n+<br />
11)<br />
2 2<br />
14. { b } { 4n<br />
3}<br />
n<br />
= + Arithmetic<br />
d = (4( n+ 1) + 3) − (4n+<br />
3)<br />
= 4n+ 4+ 3−4n− 3=<br />
4<br />
n<br />
Sn<br />
= + +<br />
2<br />
n<br />
= (4n<br />
+ 10)<br />
2<br />
= n +<br />
[ 7 4n<br />
3]<br />
( 2n<br />
5)<br />
<strong>12</strong>73<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.