C H A P T E R 9

Sequences, Series, and Probability

Section 9.1 Sequences and Series . . . . . . . . . . . . . . . . . . . . 819

Section 9.2 Arithmetic Sequences and Partial Sums . . . . . . . . . . 831

Section 9.3 Geometric Sequences and Series . . . . . . . . . . . . . . 840

Section 9.4 Mathematical Induction . . . . . . . . . . . . . . . . . . 852

Section 9.5 The Binomial Theorem . . . . . . . . . . . . . . . . . . . 868

Section 9.6 Counting Principles . . . . . . . . . . . . . . . . . . . . . 877

Section 9.7 Probability . . . . . . . . . . . . . . . . . . . . . . . . . 882

Review Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 888

Problem Solving . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 898

Practice Test . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 902

C H A P T E R 9
Sequences, Series, and Probability
Section 9.1 Sequences and Series

■ Given the general nth term in a sequence, you should be able to find, or list, some of the terms.
■ You should be able to find an expression for the apparent nth term of a sequence.
■ You should be able to use and evaluate factorials.
■ You should be able to use summation notation for a sum.
■ You should know that the sum of the terms of a sequence is a series.

Vocabulary Check
1. infinite sequence 2. terms
3. finite 4. recursively
5. factorial 6. summation notation
7. index; upper; lower 8. series
9. nth partial sum

1. an
3n  1 2. an
5n  3 3. an
2n
a1
3
1  1
4 a1
5
1  3
2 a1
21
2
a2
3
2  1
7 a2
5
2  3
7 a2
22
4
a3
3
3  1
10 a3
5
3  3
12 a3
23
8
a4
3
4  1
13 a4
5
4  3
17 a4
24
16
a5
3
5  1
16 a5
5
5  3
22 a5
25
32

4. an

12  6. an

 12 
n n
5. an

2n
a1

12 
12 a1

21
2 a1

 12 
 12
1 1

a2

12 
14 a2

22
4 a2

 12 
14
2 2

a3

12 
18 a3

23
8 a3

 12 
 18
3 3

a4

12 
16 a4

24
16 a4

 12 
16
4 1 4 1

a5

2 
32 a5

25
32 a5

 2 
 32
1 5 1 1 5 1

819
820 Chapter 9 Sequences, Series, and Probability

n2 n 6n
7. an
8. an
9. an

n n2 3n2  1
12 1 1 6
1
a1

3 a1

a1

3
1 12 3 3
12  1
4 2 1 6
2 12
a2

2 a2

a2


2 22 2 3
22  1 11
5 3 3 6
3 9
a3
a3

a3


3 32 5 3
32  1 13
6 3 4 2 6
4 24
a4

a4

a4


4 2 42 3 3
42  1 47
7 5 5 6
5 15
a5
a5

a5


5 52 7 3
52  1 37

3n2  n  4 1 
1n
10. an
11. an
12. an
1 
1n
2n2  1 n
a1
1 
11
0
3
12  1  4 a1
0
a1

2 a2
1 
1 2
2
2
12  1 2
a2

1 a3
1 
13
0
3
22  2  4 14 2
a2


2
22  1 9 a3
0 a4
1 
14
2
3
3  3  4 28
2
a5
1 
15
0
a3

a4

2 1


2
32  1 19 4 2
3
42  4  4 16 a5
0
a4


2
42  1 11
3
52  5  4 74
a5


2
52  1 51

1 2n 1
13. an
2  14. an
15. an

3n 3n n32
1 5 21 2 1
a1
2 
a1

a1

1
3 3 31 3 1
1 17 22 4 1
a2
2 
a2

a2

9 9 32 9 232
1 53 23 8 1
a3
2 
a3

a3

27 27 33 27 332
1 161 24 16 1 1
a4
2 
a4

a4


81 81 34 81 432 8
25 32
a5
2 
1


485 a5

a5

1
35 243
243 243 532
 Section 9.1 Sequences and Series 821

10 10
1n
n  1
16. an

3 2 17. an
n
n23 n n2 18. an

1n

10 1 1 1
a1

10 a1

1 a1

11

1 1 11 2
10 10 1 2 2
a2

a2
a2

12


3 22 
3 4
4 21 3
10 10 1 3 3
a3

a3
 a3

13


3 32 
3 9
9 31 4
10 10 1 4 4
a4

a4
a4

14


3 42 
3 16
16 41 5
10 10 1 5 5
a5

a5
 a5

15


3 52 
3 25
25 51 6

2
19. an
3 20. an
0.3 21. an
n
n  1
n  2 22. an
n
n2  6
a1
23 a1
0.3 a1

1
0
1
0 a1
1
12  6
5
a2
2
3 a2
0.3 a2

2
1
0
0 a2
2
22  6
4
a3
23 a3
0.3 a3

3
2
1
6 a3
3
32  6
9
a4
23 a4
0.3 a4

4
3
2
24 a4
4
42  6
40
a5
23 a5
0.3 a5

5
4
3
60 a5
5
52  6
95

23. a25

125
3
25  2
73 24. an

1n1n
n  1

a16

116116
16  1
240

4
11 44 4n2  n  3 3
25. a11

26. an
27. an
n
2
112  3 239 n
n  1
n  2 4
4
132  13  3 37 10
a13


13
13  1
13  2 130

0 10
0

4
28. an
2  29. an
16
0.5n1 30. an
8
0.75n1
n
18 12
2

0 10
0 10

0 10
− 10 0
−3

2n n2 8
31. an
32. an
33. an

n1 n2 2 n1
2 1 8
a1
4, a10

11
The sequence decreases.

0 10 0 10 Matches graph (c).

0 0
822 Chapter 9 Sequences, Series, and Probability

8n 4n
34. an
35. an
4
0.5n1 36. an

n1 n!
1
an → 8 as n →  a1
4, a10
an → 0 as n → 
128
24 The sequence decreases. 44 256 2
a1
4, a3

6 a1
4, a4


10
4 4! 24 3
Matches graph (d).
Matches graph (b). Matches graph (a).

37. 1, 4, 7, 10,13, . . . 38. 3, 7, 11, 15, 19, . . . 39. 0, 3, 8, 15, 24, . . .

an
1 
n  13
3n  2 n: 1 2 3 4 5 . . . n an
n2  1
Terms: 3 7 11 15 19 . . . an
Apparent pattern:
Each term is one less than four
times n, which implies that
an
4n  1.

2 3 4 5 6 1 1 1 1
40. 2, 4, 6, 8, 10, . . . 41.  , ,  , ,  , . . . 42. , , , , . . .
3 4 5 6 7 2 4 8 16
n: 1 2 3 4 5 . . . n
Terms: 2 4 6 8 10 . . . an an

1n nn  12 n: 1
1
2
1
3
1
4
1
. . . n

Apparent pattern: Terms: . . . an

2 4 8 16
Each term is the product of
1n1
Apparent pattern:
and twice n, which implies that
an

1n1
2n. Each term is
1n1 divided by 2
raised to the n, which implies that

1n1
an
.
2n

2 3 4 5 6 1 2 4 8 1 1 1 1
43. , , , , ,. . . 44. , , , , . . . 45. 1, , , , , . . .
1 3 5 7 9 3 9 27 81 4 9 16 25
n1 n: 1 2 3 4 . . . n 1
an
an

2n  1 1 2 4 8 n2
Terms: . . . an
3 9 27 81
Apparent pattern:
Each term is 2n1 divided by 3
raised to the n, which implies that
2n1
an
n .
3

1 1 1 1
46. 1, , , , , . . . 47. 1, 1, 1, 1, 1, . . .
2 6 24 120
an

1n1
n: 1 2 3 4 5 . . . n
1 1 1 1
Terms: 1 . . . an
2 6 24 120
Apparent pattern:
Each term is the reciprocal of n!, which implies that
1
an
.
n!
 Section 9.1 Sequences and Series 823

22 23 24 25 1 1 1 1 1
48. 1, 2, , , , , . . . 49. 1  , 1  , 1  , 1  , 1  , . . .
2 6 24 120 1 2 3 4 5
n: 1 2 3 4 5 6 . . . n 1
an
1 
22 23 24 25 n
Terms: 1 2 . . . an
2 6 24 120
Apparent pattern:
Each term is 2n1 divided by
n  1!, which implies that
2n1
an
.

n  1!

1 3 7 15 31
50. 1  , 1  , 1  , 1  , 1  , . . .
2 4 8 16 32
n: 1 2 3 4 5 . . . n
1 3 7 15 31
Terms: 1 1 1 1 1 . . . an
2 4 8 16 32
Apparent pattern: Each term is the sum of 1 and the quantity 1 less than 2n divided by 2n, which implies that
2n  1
an
1  .
2n

51. a1
28 and ak1
ak  4 52. a1
15, ak1
ak  3 53. a1
3 and ak1
2
ak  1
a1
28 a1
15 a1
3
a2
a1  4
28  4
24 a2
a1  3
15  3
18 a2
2
a1  1
2
3  1
4
a3
a2  4
24  4
20 a3
a2  3
18  3
21 a3
2
a2  1
2
4  1
6
a4
a3  4
20  4
16 a4
a3  3
21  3
24 a4
2
a3  1
2
6  1
10
a5
a4  4
16  4
12 a5
a4  3
24  3
27 a5
2
a4  1
2
10  1
18

1
54. a1
32, ak1
2ak 55. a1
6 and ak1
ak  2 56. a1
25, ak1
ak  5
a1
32 a1
6 a1
25
a2
a1  2
6  2
8 a2
a1  5
25  5
20
2
32
1 1
a2
2 a1

16
a3
a2  2
8  2
10 a3
a2  5
20  5
15
2
16
1 1
a3
2 a2

8
a4
a3  2
10  2
12 a4
a3  5
15  5
10
2
8
1 1
a4
2 a3

4
a5
a4  2
12  2
14 a5
a4  5
10  5
5
a5
12 a 4
12
4
2
In general, an
2n  4. In general, an
30  5n .

1 3n
57. a1
81 and ak1
ak 58. a1
14, ak1

2ak 59. an

3 n!
a1
81 a1
14
30
a0

1
1 1 a2

2a1

2
14
28 0!
a 2
a1

81
27
3 3
a3

2a2

2
28
56 31
1 1 a1

3
a 3
a2

27
9 a4

2a3

2
56
112
1!
3 3
32 9
1 1 a5

2
a4

2
112
224 a2


a 4
a3

9
3 2! 2
3 3
In general, an
14
2n1.
1 1 33 27 9
a 5
a4

3
1 a3



3 3 3! 6 2
In general, 34 81 27
a4



3 3
1 n1 1 n 243 4! 24 8
an
81
81
3
.
3n
824 Chapter 9 Sequences, Series, and Probability

n! 1 n2
60. an
61. an
62. an

n
n  1!
n  1!
0! 1 02 0
a0

undefined a0

1 a0


0
0 1!
0  1! 1
1! 1 1 1 12 1 1
a1


1 a1

a1



1 1 2! 2
1  1! 2  1 2
2! 2  1 1 1 22 4 2
a2


1 a2

a2



2 2 3! 6
2  1! 3 21 3

a3

3! 3


21
2 a3

1


1 32 9 3
a3



3 3 4! 24
3  1! 4 321 8

a4

4! 4


321
6 a4

1


1 42 16 2
a4



4 4 5! 120
4  1! 5 4321 15

12n 1
12n1
63. an

64. an


2n!
2n!
2n  1!
1
12
0 1
11 1
a0

1 a0



1
0!
2  0  1! 1! 1
1 1
12  11
13 1 1
a1

a1




2! 2
2  1  1! 3! 6 6
1 1
12  21
15 1 1
a2

a2




4! 24
2  2  1! 5! 120 120
1 1
12  31
17 1 1
a3

a3




6! 720
2  3  1! 7! 5040 5040
1 1
12  41
19 1 1
a4

a4




8! 40,320
2  4  1! 9! 362,880 362,880

4! 1234 1 1 5! 12345 1 1
65.


66.



6! 1  2  3  4  5  6 5  6 30 8! 1  2  3  4  5  6  7  8 6  7  8 336

10! 1  2  3  4  5  6  7  8  9  10 9  10 25! 1  2  3  . . .  23  24  25
24  25
600

67.


90 68.

8! 12345678 1 23! 123. . .  23 1

n  1! 1  2  3  . . .  n 
n  1 n  1
n  2! 1  2  3  . . .  n 
n  1 
n  2
69.

70.

n! 123. . .n 1 n! 123. . .n

n1

n  1
n  2

2n  1! 1  2  3  . . . 
2n  1
3n  1! 1  2  3  . . . 
3n 
3n  1

71.
72.


2n  1! 1  2  3  . . . 
2n  1 
2n 
2n  1
3n! 1  2  3  . . . 
3n
1 3n  1



3n  1
2n
2n  1 1

5
73.
2i  1

2  1 
4  1 
6  1 
8  1 
10  1
35
i
1

6
74.
3i  1

3  1  1 
3  2  1 
3  3  1 
3  4  1 
3  5  1 
3  6  1
57
i
1

4 5
75. 10
10  10  10  10
40
k
1
76. 5
5  5  5  5  5
25
k
1
 Section 9.1 Sequences and Series 825

4 5
77. i
i
0
2

02  12  22  32  42
30 78. 2i
i
0
2
2
02  2
12  2
22  2
32  2
42  2
52

110

3 5
1 1 1 1 1 9 1 1 1 1 124
79.
k
0 k2

  

1 1 11 41 91 5
80. j
j
3
2

 

 3 32  3 42  3 52  3 429

5
81.
k  1
k  3

3
1 
4
0 
5
1 
6
2
88
k
2
2 2 2 2 2

4
82. 
i  1
i
1
2 
i  13

02 
23  
12 
33  
22 
43  
32 
53
238

4 4
83. 2
2
i
1
i 1  22  23  24
30 84.
2
j
0
j

20 
21 
22 
23 
24

11

6 10
3 4

1k 47 4

1k 3
85.
24  3j
81
j
1
86. j  1
6.06
j
1
87.
k
0


k  1 60
88.
k
0 k!


8

5 15
1 1 1 1 9 1 5 5 5 5
89.  
3
1 3
2 3
3
. . .

3
9 i
1 3i 90.  
11 12 13
. . .

1  15 i
1 1  i

28  3  28  3  28  3  . . .  28  3
28  3

8
1 2 3 8 i
91.
i
1

1  6   1  6   . . .  1  6 
1 6 

2 2 2 6 2
1 2 6 k
92.
k
1

6
93. 3  9  27  81  243  729

i
1

1 i13i

 
7
1 1 1 . . . 1 1 1 1 1 1 1
94. 1     
0 1 2 3. . . 7

2 4 8 128 2 2 2 2 2 n
0 2

1 1 1 1 1 20
1i1 1 1 1 1 10 1
95.
1 2
 2 2 2. . . 2

2 3 4 20 i
1 i2 96.
1 3

2 4

3 5
. . .
10  12

k
k  2
k
1

1 3 7 15 31 5 2i  1 1 2 6 24 120 720 6
k!
97.    
4 8 16 32 64


i
1 2
i1
98.   
2 4 8 16

32

64


k
1 2
k

 2 
5 2   5 2  12 12  3 
2 3  13 13 13 13

4 5 i 1 2 3 4 5
1 1 i 1 2 3 4 75 1 1
99. 5 5 5
100. 2 2 2 2 2
i
1 16 i
1

242


243

4 2   21  4 21  21 8 4   41  41  41  41
3 n 2 3 4 n 1 2 3 4
1 3 1
101.
4  4 
 102.
8  8  8  8 
n
1 2 n
1

51


32
826 Chapter 9 Sequences, Series, and Probability


6

1 i
103. 10
0.6  0.06  0.006  0.0006  . . .
23
i
1


10
1 k
1 1 1 1 1
104.
    . . .
k
1 10 102 103 104 105

0.1  0.01  0.001  0.0001  0.00001  . . .

0.11111 . . .
1


9


210
210  10 
i
1 1 1 1 1
105. By using a calculator, we have 106. 2
  . . .
i
1 103 104

710
10 k
1

0.7777777777
2
0.1  0.01  0.001  0.0001  . . .
k
1

2
0.111 . . .
 
50 k
1
7
0.7777777778
k
1 10
0.222 . . .

710
100 k 2
1 7

.

k
1 9 9
The terms approach zero as n → .

710
1 k 7
Thus, we conclude that
.
k
1 9

 
0.08 n
107. An
5000 1  , n
1, 2, 3, . . . 108. (a) A1
100
101
1.011  1
$101.00
4
A2
100
101
1.012  1
$203.01
(a) A1
$5100.00
A3
100
101
1.013  1
$306.04
A2
$5202.00
A4
100
101
1.014  1
$410.10
A3
$5306.04
A5
100
101
1.015  1
$515.20
A4
$5412.16
A6
100
101
1.016  1
$621.35
A5
$5520.40
(b) A60
100
101
1.0160  1
$8248.64
A6
$5630.81
(c) A240
100
101
1.01240  1
$99,914.79
A7
$5743.43
A8
$5858.30
(b) A40
$11,040.20

109. (a) Linear model: an

60.57n  182 (b) Quadratic model: an
1.61n2  26.8n  9.5

(c) (d) For the year 2008 we have the following predictions:
Year n Actual Linear Quadratic
Data Model Model Linear model: 908 stores

1998 8 311 303 308 Quadratic model: 995 stores

1999 9 357 363 362 Since the quadratic model is a better fit, the predicted
number of stores in 2008 is 995.
2000 10 419 424 420
2001 11 481 484 480
2002 12 548 545 544
2003 13 608 605 611

The quadratic model is a better fit.

 Section 9.1 Sequences and Series 827

110. (a) an
0.0457n3  0.3498n2  9.04n  121.3, n
5, . . . , 13.

a5
73.1 a10
41.6 75

a6
64.3 a11
40.4

a7
56.6 a12
41.4
a8
50.0
5 14
a13
45.1 0

a9
44.9
(b) The number of cases reported fluctuates.

111. (a) an
2.7698n3  61.372n2  600.00n  3102.9

a0
$3102.9 billion a7
$5245.7 billion 7000

a1
$3644.3 billion a8
$5393.2 billion
a2
$4079.6 billion a9
$5551.0 billion
a3
$4425.3 billion a10
$5735.5 billion 0
0
14

a4
$4698.2 billion a11
$5963.5 billion
a5
$4914.8 billion a12
$6251.5 billion
a6
$5091.8 billion a13
$6616.3 billion
(b) The federal debt is increasing.

13 4 4 4
112.
46.609n
n
6
2  119.84n  1125.8
$17,495 million 113. True,
i
i
1
2
 2i
i
i
1
2
2
i
1
i by the
Properties of Sums.
The results from the model and the figure (which are
approximations) are very similar.

4 6
114. 2
2
j
1
j
j
3
j2

True, because 21  22  23  24
232  242  252  262.

an1 3 5
115. a1
1, a2
1, ak2
ak1  ak, k ≥ 1 116. bn
; b1
1, b2
2, b3
, b4
, . . .
an 2 3
1
a1
1 b1

1 1 1
1 b2
1 
1
2
a2
1 2 b1 1
b2

2
a3
1  1
2 1 1 1 3
3 b3
1 
1

b3
b2 2 2
a4
2  1
3 2
1 2 5
a5
3  2
5 5 b4
1 
1

b4
b3 3 3
3
a6
5  3
8
8 1 3 8
a7
8  5
13 b5
b5
1 
1

5 b4 5 5
a8
13  8
21 13
b6
1
8 bn
1 
a9
21  13
34 21
bn1
b7

a10
34  21
55 13
34
a11
55  34
89 b8

21
a12
89  55
144 55
b9

34
89
b10

55
828 Chapter 9 Sequences, Series, and Probability

327.15  785.69  433.04  265.38  604.12  590.30

117.
$500.95
6

1 n 1.899  1.959  1.919  1.939  1.999 n n n

118. x

n i
1
xi

5
119.
x  x 
x  x
i
1
i
i
1
i
i
1

$1.943
 x   nx
n

i
i
1

 x  nn x 
n 1 n

i i
i
1 i
1

0

n n n n

x  x
x  2xix  x 2
x x  nx
2
120. i
i
2
i
2  2x i
2
i
1 i
1 i
1 i
1

n 1 n n 1 n 1 n

x
i
1
i
2 2
xi xi  n 
ni
1 i
1 ni
1
xi  x
ni
1 i
   x 
n n n 2 1 n 1 n

2

xi2  xi xi  
xi2  i
i
1 i
1 i
1 n n i
1 n i
1

xn
1nx2n1
1nx2n
121. an
122. an
123. an

n! 2n  1
2n!
x1
11x2
1 1 x3 x2 x2
a1

x a1

 a1


1! 2
1  1 3 2! 2
x2 x2
12x2
2 1 x5 x4 x4
a2

a2

a2


2! 2 2
2  1 5 4! 24
x3 x3
13x2
3 1 x7 x6 x6
a3

a3

 a3


3! 6 2
3  1 7 6! 720
x4 x4
14x2
4 1 x9 x8 x8
a4

a4

a4


4! 24 2
4  1 9 8! 40,320
x5 x5
15x2
5 1 x11 x10 x10
a5

a5

 a5


5! 120 2
5  1 11 10! 3,628,800

1nx2n1
124. an
125. f
x
4x  3 is one-to-one, so it has an inverse.

2n  1!
y
4x  3

11x2
1 1 x3 x3
a1




2
1  1! 3! 6 x
4y  3

1 2x2
2 1 x5 x5 x3
a2



y

2
2  1! 5! 120 4

13x2
3 1 x7 x7 x3
a3


 f 1
x


2
3  1! 7! 5040 4

14x2
4 1 x9 x9
a4




2
4  1! 9! 362,880

15x2
5 1 x11 x11
a5




2
5  1! 11! 39,916,800
 Section 9.1 Sequences and Series 829

3
126. g
x
127. h
x
5x  1 is one-to-one, so it has an inverse.
x
1
3 Domain: x ≥ 
y
5
x
Range: y ≥ 0
3
x

y 1
y
5x  1, x ≥  , y ≥ 0
5
xy
3
1
3 x
5y  1, x ≥ 0, y ≥ 
y
5
x
x2
5y  1, x ≥ 0
This is a function of x, so f has in inverse.
x2  1
3
y, x ≥ 0
f
x
, x  0
1
5
x
x2  1 1 2
h1
x


x  1, x ≥ 0
5 5

128. f
x

x  12

y

x  12
x

y  12
± x
y  1

1 ± x
y

This does not represent y as a function of x, so f does not have an inverse.

2 6 
2 54
3       
6 5 4 8 1
129. (a) A  B



4 6 3 36 4 
3 3 7
2 8  18 16  15 26
       
4 6 5 1
(b) 4B  3A
4 3


6 3 3 4 24  9 12  12 15 24
2 12  30 24  15
3      
6 5 4 18 9
(c) AB



4 6 3 6  24 12  12 18 0

(d) BA
26 4
3  63  
5
4


12  16
36  9
10  12
 
30  12


0
27
6
18 
12 10  0 7 
12
4       
10 7 0 10 19
130. (a) A  B



6 8 11 4  8 6  11 12 5
12 0  30 48  21 30 69
8       
0 10 7
(b) 4B  3A
4 3


11 4 6 32  12 44  18 44 26
12 0  56 120  77 43
4 8     
10 7 0 56
(c) AB



6 11 0  48 48  66 48 114
12 0  48 0  72 72
8 4     
0 10 7 48
(d) BA



11 6 80  44 56  66 36 122
830 Chapter 9 Sequences, Series, and Probability

       
2 3 6 1 4 2 2  1 3  4 62 3 7 4
131. (a) A  B
4 5 7  0 1 6
40 51 76
4 4 1
1 7 4 0 3 1 10 73 41 1 4 3
4 
6 16 
9

       
1 4 2 2 3 6 8  18 10 25 10
(b) 4B  3A
4 0 1 6 3 4 5 7
0  12 4  15 24  21
12 11 3
0 3 1 1 7 4 03 12  21 4  12 3 9 8

      
2 3 6 1 4 2 2  0  0 8  3  18 4  18  6 2 7 16
(c) AB
4 5 7 0 1 6
400 16  5  21 8  30  7
4 42 45
1 7 4 0 3 1 100 4  7  12 2  42  4 1 23 48

      
1 4 2 2 3 6 2  16  2 3  20  14 6  28  8 16 31 42
(d) BA
0 1 6 4 5 7
046 0  5  42 0  7  24
10 47 31
0 3 1 1 7 4 0  12  1 0  15  7 0  21  4 13 22 25

1 1  0 44 00 1

       
4 0 0 4 0 0 0
132. (a) A  B
5 1 2  3 1 2
53 11 2 
2
2 0 4
0 1 3 1 0 2 0 
1 1  0 32 1 1 1
1 0 
3 16  12 00

       
0 4 0 4 0 3 4 0
(b) 4B  3A
4 3 1 2  3 5 1 2
12  15 43 8  6
3 1 14
1 0 2 0 1 3 4  0 0 
3 89 4 3 1
1 8

      
4 0 0 4 0 0  12  0 4  4  0 080 12 0
(c) AB
5 1 2 3 1 2
0  3  2 20  1  0 024
1 21 2
0 1 3 1 0 2 033 010 026 6 1 8
0 1

      
0 4 4 0 0  20  0 040 080 20 4 8
(d) BA
3 1 2 5 1 2
3  5  0 12  1  2 026
2 15 4
1 0 2 0 1 3 100 4  0  2 006 1 6 6

133. A

3
1
5
7
3
7  5
1
26 134.

2
12
8
15

2
15  8
12
126

3
135. A
0
4 4
7
9
5
3
3
1
7
9

37
1  3
9  44
3  5
7
194
3
1
4
4
7
5
3

136. A
16
C11  9
C21  2
C31  4
C41

8 3 7 8 3 7
C11

1 11 1 12 3
1 12 3
6 2 1 6 2 1

8

12
2
3
1
3
1
6
3
1

8
12  6  3
1  18  7
2  72
413
7
1
6
12
2

11 10 2 11 10 2
C21

121 1 12 3
1 12 3
6 2 1 6 2 1

11

12
2
3
1
1
10
2

11
12  6  1
10  4  6
30  24
108
2
1
6
10
12
2
3

—CONTINUED—
 Section 9.2 Arithmetic Sequences and Partial Sums 831

136. —CONTINUED—

11 10 2 11 10 2
C31
131 8 3 7
8 3 7
6 2 1 6 2 1

11







3
2
7
1
8
10
2
2
1
6
10
3
2
7

113  14  810  4  670  6
215

11 10 2 11 10 2
C41
141 8 3 7
8 3 7
1 12 3 1 12 3

11

3
12
7
3


 8
10
12
2
3
1

119  84  830  24  170  6
937

10
3
2
7




So, A
16413  9108  2215  4937

11,758.

Section 9.2 Arithmetic Sequences and Partial Sums

■ You should be able to recognize an arithmetic sequence, find its common difference, and find its nth term.
■ You should be able to find the nth partial sum of an arithmetic sequence by using the formula
n
Sn
a1  an.
2

Vocabulary Check
1. arithmetic; common 2. an
dn  c
3. sum of a finite arithmetic sequence

1. 10, 8, 6, 4, 2, . . . 2. 4, 7, 10, 13, 16, . . . 3. 1, 2, 4, 8, 16, . . .

Arithmetic sequence, d
2 Arithmetic sequence, d
3 Not an arithmetic sequence

9 7 3 5 5 3
4. 80, 40, 20, 10, 5, . . . 5. 4, 2, 4, 2, 4, . . . 6. 3, 2, 2, 2, 1, . . .
1
Not an arithmetic sequence Arithmetic sequence, d
 4 Arithmetic sequence, d
 2
1

1 2 4 5
7. 3, 3, 1, 3, 6, . . . 8. 5.3, 5.7, 6.1, 6.5, 6.9, . . . 9. ln 1, ln 2, ln 3, ln 4, ln 5, . . .
Not an arithmetic sequence Arithmetic sequence, d
0.4 Not an arithmetic sequence

10. 12, 22, 32, 42, 52, . . . 11. an
5  3n 12. an
100  3n

Not an arithmetic sequence 8, 11, 14, 17, 20 97, 94, 91, 88, 85
Arithmetic sequence, d
3 Arithmetic sequence, d
3
832 Chapter 9 Sequences, Series, and Probability

13. an
3  4n  2 14. an
1  n  14 15. an
1n

7, 3, 1, 5, 9 1, 5, 9, 13, 17 1, 1, 1, 1, 1
Arithmetic sequence, d
4 Arithmetic sequence, d
4 Not an arithmetic sequence

1n3
16. an
2n1 17. an
18. an
2nn
n
1, 2, 4, 8, 16 2, 8, 24, 64, 160
3 3 3
3, , 1, , 
Not an arithmetic sequence 2 4 5 Not an arithmetic sequence
Not an arithmetic sequence

19. a1
1, d
3 20. a1
15, d
4

an
a1  n  1d
1  n  13
3n  2 an
a1  n  1d
15  n  14

4n  11

21. a1
100, d
8 2
22. a1
0, d
 3
an
a1  n  1d
100  n  18 an
a1  n  1d
n  1 23 

8n  108 2 2

3 n  3

23. a1
x, d
2x 24. a1
y, d
5y

an
a1  n  1d
x  n  12x
2xn  x an
a1  n  1d
y  n  15y

5yn  6y

25. 4, 32, 1,  72, . . . 26. 10, 5, 0, 5, 10, . . .

d
 52 d
5
an
a1  n  1d
4  n  1  52  an
a1  n  1d
10  n  15
5n  15
5 13

2 n  2

27. a1
5, a4
15 28. a1
4, a5
16

10
a4
a1  3d ⇒ 15
5  3d ⇒ d
3 an
a1  n  1d
an
a1  n  1d
5  n  1 10
3 
10
3n  5
3 16
4  4d
d
5
an
a1  n  1d
4  n  15

5n  9

29. a3
94, a6
85 30. a5
190, a10
115

a6
a3  3d ⇒ 85
94  3d ⇒ d
3 a10
a5  5d ⇒ 115
190  5d ⇒ d
15
a1
a3  2d ⇒ a1
94  23
100 a1
a5  4d ⇒ a1
190  415
250
an
a1  n  1d
100  n  13 an
a1  n  1d
250  n  115

3n  103
15n  265
 Section 9.2 Arithmetic Sequences and Partial Sums 833

3
31. a1
5, d
6 32. a1
5, d
 4 33. a1
2.6, d
0.4
a1
5 a1
5 a1
2.6
3 17
a2
5  6
11 a2
5 
4 4 a2
2.6  0.4
3.0
17 3 14 7
a3
11  6
17 a3
4 

4 4
2 a3
3.0  0.4
3.4
7 3 11
a4
17  6
23 a4


2 4 4 a4
3.4  0.4
3.8
11 3 8
a5
23  6
29 a5
4 

2
4 4 a5
3.8  0.4
4.2

34. a1
16.5, d
0.25 35. a1
2, a12
46 36. a4
16, a10
46

a1
16.5 46
2  12  1d 16
a4
a1  n  1d
a1  3d
a2
16.5  0.25
16.75 44
11d 46
a10
a1  n  1d
a1  9d
a3
16.75  0.25
17 44
d Answer: a1
1, d
5
a4
17  0.25
17.25 a1
2 a1
1
a5
17.25  0.25
17.5 a2
2  4
6 a2
1  5
6
a3
6  4
10 a3
6  5
11
a4
10  4
14 a4
11  5
16
a5
14  4
18 a5
16  5
21

37. a8
26, a12
42 38. a3
19, a15
1.7

a12
a8  4d 19
a3
a1  n  1d
a1  2d
42
26  4d ⇒ d
4 1.7
a15
a1  n  1d
a1  14d
a8
a1  7d Answer: a1
22.45, d
1.725
26
a1  28 ⇒ a1
2 a1
22.45
a1
2 a2
22.45  1.725
20.725
a2
2  4
2 a3
20.725  1.725
19
a3
2  4
6 a4
19  1.725
17.275
a4
6  4
10 a5
17.275  1.725
15.55
a5
10  4
14

39. a1
15, ak1
ak  4 40. a1
6, ak1
ak  5 41. a1
200, ak1
ak  10

a2
15  4
19 a2
6  5
11 a2
200  10
190
a3
19  4
23 a3
11  5
16 a3
190  10
180
a4
23  4
27 a4
16  5
21 a4
180  10
170
a5
27  4
31 a5
21  5
26 a5
170  10
160
d
4 d
5 d
10
c
a1  d
15  4
11 an
dn  c c
a1  d
200  10
210
an
4n  11 an
5n  c an
10n  210
c
a1  d

65

1
So, an
5n  1.
834 Chapter 9 Sequences, Series, and Probability

42. a1
72, ak1
ak  6 5 1

43. a1
8, ak1
ak  8 44. a1
0.375, ak1
ak  0.25
a2
72  6
66 a1
58 a2
0.375  0.25
0.625
a3
66  6
60 a2

5
8
1
8
1
2 a3
0.625  0.25
0.875
a4
60  6
54 a3

1
2
1
8
3
8 a4
0.875  0.25
1.125
a5
54  6
48 a4

3
8
1
8
1
4 a5
1.125  0.25
1.375
d
6 a5
14  18
18 d
0.25
an
dn  c d
 18 an
dn  c
an
6n  c c
a1  d
  

5
 18 3
8 4 an
0.25n  c
c
a1  d an
 18n  3
4 c
a1  d

72  6
0.375  0.25

78
0.125
So, an
6n  78. So, an
0.25n  0.125.

45. a1
5, a2
11 ⇒ d
11  5
6 46. a1
3, a2
13
an
a1  n  1d ⇒ a10
5  96
59 d
a2  a1
13  3
10
an
dn  c, an
10n  c
c
a1  d
3  10
7
an
10n  7, a9
109  7
83

47. a1
4.2, a2
6.6 ⇒ d
6.6  4.2
2.4 48. a1
0.7, a2
13.8

an
a1  n  1d ⇒ a7
4.2  62.4
18.6 d
a2  a1
13.8  0.7
13.1
an
dn  c, an
13.1n  c
c
a1  d
0.7  13.1
12.4
an
13.1n  12.4, a8
92.4

49. an
 34n  8 50. an
3n  5 51. an
2  34n

3
d
 4 so the sequence is decreasing d
3 so the sequence is increasing
3
d
4 so the sequence is increasing
and a1
714. and a1
2. and a1
234.
Matches (b). Matches (d). Matches (c).

52. an
25  3n 53. an
15  32n 54. an
5  2n

d
3 so the sequence 14 16

is decreasing and a1
22.

Matches (a).
0 10

0 10
0 −6

55. an
0.2n  3 56. an
0.3n  8 57. 8, 20, 32, 44, . . .

6 9 a1
8, d
12, n
10
a10
8  912
116

2 8  116
620
S10
10
0 10 0 10
2 4
 Section 9.2 Arithmetic Sequences and Partial Sums 835

58. 2, 8, 14, 20, . . . , n
25 59. 4.2, 3.7, 3.2, 2.7, . . . 60. 0.5, 0.9, 1.3, 1.7, . . . , n
10
d
6, c
2  6
4 a1
4.2, d
0.5, n
12 d
0.4, c
0.1
an
6n  4 a12
4.2  110.5
1.3 an
0.4n  0.1

2 4.2  1.3
17.4 a1
0.5 and a10
4.1

12
a1
2 and a25
146 S12

2 2  146
1850 2 0.5  4.1
23

S10
10
25
S25

61. 40, 37, 34, 31, . . . 62. 75, 70, 65, 60, . . . , n
25 63. a1
100, a25
220, n
25
a1
40, d
3, n
10 d
5, c
80 n
Sn
a  an
a10
40  93
13 2 1
an
5n  80
25
10 a1
75 and a25
45 S25
100  220
4000
S10
40  13
265 2
2
25
S25
75  45
375
2

64. a1
15, a100
307, n
100 65. an
2n  1

2 15  307
16,100

100
S100
a1
1, a100
199
100

 2n  1
2 1  199
10,000

100
n
1

66. a0
10, a60
50, n
60 67. a1
1, a50
50, n
50 68. an
2n

60 50 a1
2, a100
200, n
100
 i  10
n
2 1  50
1275
50
2 10  50
60

i
0 n
1 100

 2n
2 2  200
10,100
100

1200 n
1

69. a10
60, a100
600, n
91 70. an
7n

100 a51
357, a100
700
 6n
2 60  600
30,030
91
n
10 100


n
51
2 357  700
26,425
7n
50

30 10 100 50

 n  n
 n  n
2 51  100  2 1  50

50 50
2 11  30  10
2 1  10
355
20
71. 72.
n
11 n
1 n
51 n
1

3775  1275
2500

73. a1
1, a400
799, n
400 74. an
1000  n

400 a1
999, a250
750, n
250
 2n  1
2 1  799
160,000
400
n
1 250

 1000  n
2 999  750
218,625

250

n
1

20
75.  2n  5
520
n
1
76. a0
1000, a50
750, n
51
50

 1000  5n
2 1000  750
44,625

51

n
0

100 n4 1 73

77. 
n
1 2

2725 78. a0
, a100

2 4
, n
101

8  3n 101 1 73
 
100


n
0 16


2 2

4

896.375
836 Chapter 9 Sequences, Series, and Probability

60

 250  
10,120
8
79. 3i 80. a1
4.525, a200
9.5, n
200
i
1
200

 4.5  0.025j
2 4.525  9.5
1402.5

200

j
1

81. (a) a1
32,500, d
1500 82. (a) a1
36,800, d
1750

a6
a1  5d
32,500  51500
$40,000 a6
a1  5d
36,800  51750
$45,550

2 32,500  40,000
$217,500 (b) S6
2 36,800  45,550
$247,050

6 6
(b) S6

83. 3a1
20, d
4, n
30 84. a1
15, d
3, n
36 85. a1
14, a18
31

a30
20  294
136 a36
15  353
120 S18
2 14  31
405 bricks
18

2 20  136
2340 seats S36
2 15  120
2430 seats

30 36
S30

86. a1
14, a28
0.5, n
28 87. 4.9, 14.7, 24.5, 34.3, . . .

S28
2 14
28
 0.5
203 bricks d
9.8
a10
4.9  99.8
93.1 meters
S10
2 4.9  93.1
490 meters
10

88. a1
16, a2
48, a3
80, a4
112 89. (a) a1
200, a2
175 ⇒ d
25
d
32 c
200  25
225
an
dn  c
32n  c an
25n  225
c
a1  d
16  32
16 (b) a8
258  225
25
S8
2200  25
$900
8
an
32n  16
7
Distance
 32n  16
784 ft
n
1

90. (a) a1
1200, a2
1100, a3
1000 91. an
1500n  6500

d
100 a1
8000, a6
15,500

S6
28000  15,500
$70,500
6
an
dn  c
an
100n  c The cost of gasoline, labor, equipment, insurance, and
maintenance are a few economic factors that could
c
a1  d
1200  100
1300
prevent the company from meeting its goals, but the
an
100n  1300 biggest unknown variable is the amount of annual
12
snowfall.
(b) Total prize money
 100n  1300
n
1

2 1200  100

12

$7800
 Section 9.2 Arithmetic Sequences and Partial Sums 837

92. a1
15,000
d
5,000
n
1, . . . , 10
an
dn  c
5000n  c
c
a1  d
15,000  5000
10,000
an
5000n  10,000
10

 5000n  10,000
2 15,000  60,000
$375,000

10
Total sales

n
1

93. (a)
Monthly Payment Unpaid Balance (b) an
2n  222 ⇒ a10
202

a1
200  0.012000
$220 $1800 2 220  202
$2110

S10
10
Interest paid: $110
a2
200  0.011800
$218 $1600
a3
200  0.011600
$216 $1400
a4
200  0.011400
$214 $1200
a5
200  0.011200
$212 $1000
a6
200  0.011000
$210 $800

94. (a) Borrowed Amount
a0
$5,000

Amount of Balance Paid Per Month
$250
Unpaid Balance
an
5000  250n
Interest
I
Balance Before Payment  1%
an1  0.01
Total Payment
$250  I

Month (n) 1 2 3 4 5 6

Interest (I) $50 $47.50 $45.00 $42.50 $40.00 $37.50

Total Payment $250  I $300 $297.50 $295.00 $292.50 $290.00 $287.50

Unpaid Balance an $4750 $4500 $4250 $4000 $3750 $3500

Month (n) 7 8 9 10 11 12

Interest (I) $35.00 $32.50 $30.00 $27.50 $25.00 $22.50

Total Payment $250  I $285.00 $282.50 $280.00 $277.50 $275.00 $272.50

Unpaid Balance an $3250 $3000 $2750 $2500 $2250 $2000

20

 5000  250n  1  0.01
2 50000.01  2500.01
$525

20
(b) Total Interest Paid

n
1
838 Chapter 9 Sequences, Series, and Probability

95. (a) Using (5, 23,078) and (6, 24,176) we have d
1098 96. (a) n
7 is 1997.
and c
23,078  51098)
17,588.
an

an  1098n  17,588 12,000

(in millions of dollars)

(b) an  1114.95n  17,795.07 10,000

Revenue
8,000
The models are similar. 6,000

(c) 32,000 4,000

2,000
n
7 8 9 10 11 12 13
Year (7 ↔ 1997)
3 13
20,000 (b) an
Revenue
1726.93n  11,718.43
(d) For 2004 use n
14: $32,960 13

For 2005 use n
15: $34,058

(c) Total revenue
 1726.93n  11,718.43
n
7

(e) Answers will vary.
72370.08  10,731.66

$38,856 million
(d) a18
1726.9318  11,718.43
$19,366.31 million

97. True; given a1 and a2 then d
a2  a1 and 98. True, by the formula for the sum of a finite arithmetic
an
a1  n  1d. sequence,
n
Sn
a1  an.
2

99. A sequence is arithmetic if the differences between 100. First term plus n  1 times the common difference
consecutive terms are the same.
an1  an
d for n ≥ 1

101. (a) an
2  3n (b) y
3x  2

an y

33 33
30 30
27 27
24 24
21 21
18 18
15 15
12 12
9 9
6 6
3 3
n x
−1 1 2 3 4 5 6 7 8 9 10 11 1 2 3 4 5 6 7 8 9 10 11

(c) The graph of an
2  3n contains only points at

the positive integers. The graph of y
3x  2 is a (d) The slope m
3 is equal to the common difference
solid line which contains these points. d
3. In general, these should be equal.

20
102. (a) 1  3
4 103. S20
a  a1  20  13

650
2 1
135
9
102a1  57
650
1  3  5  7
16
2a1  57
65
1  3  5  7  9
25
2a1
8
1  3  5  7  9  11
36
a1
4
(b) Sn
n2
S7
1  3  5  7  9  11  13
49
72
n n
(c) Sn
1  2n  1
2n
n2
2 2
 Section 9.2 Arithmetic Sequences and Partial Sums 839

n
104. Let Sn
a  an  be the sum 105. 2x  4y
3 106. 9x  y
8
2 1
of the first n terms of the original 1 3 y
9x  8
y
x
sequence. 2 4
Slope: 9
n 1
Sn
a1  5  an  5 Slope: m
y-intercept: 0, 8
2 2

0,  43
y
n y-intercept:

a1  an  10 4
2 2
y
x
n n − 4 −3 − 2 − 1 1 2 3 4

a1  an  10 4
2 2 3
2 −6
n

a1  an)  5n 1 −8
2 − 4 −3 − 2 − 1 1 2 3 4
x − 10
− 12

Sn  5n −2
−3
−4

107. x  7
0 y 108. y  11
0 y

x
7
8 4
y
11
6 2
4 x
Vertical line Slope: 0 −8 −6 −4 −2 2 4 6 8
2 −2
No slope
−2 2 4 6 8 10 12 14
x y-intercept: 0, 11 −4
−2 −6
No y-intercept −4 −8
−6 − 10
−8 − 12

 
2x  y  7z
10 Equation 1 1 4 10 4
109. 3x  2y  4z
17 Equation 2 110. 5 3 1

31
6x  5y  z
20 Equation 3 8 2 3

5



1 4 10 4


x  12 y  72z
5
1
2 Eq.1
3x  2y  4z
17 5R1  R2 → 0 17 51
51
6x  5y  z
20 8 2 3
5



1 4 10 4
x  12 y  72z
5


0 17 51
51
7 29
2 y  2 z
32 3Eq.1  Eq.2 8R1  R3 → 0 34 77
27
 2y  20z
10 6Eq.1  Eq.3


1 4 10 4
x  12y  7
2z
5 0 17 51
51

  2y  20z
10
2R2  R3 → 0 0 25



75


R1 → 1 4 10 4
7 29
2y  2z
32 0 17 51
51



x  12 y  72z
5 0 0 25 75
 12 Eq.2

y  10z
5 1 4 10 4
1
7y  29z
64 2 Eq.3 17 R2 → 0 1 3 3
0 0 25 75
12 Eq.2  Eq.1

17
x 
2z  15
2



y  10z
5 1 4 10 4
 99z
99 7Eq.2  Eq.3 0 1 3
3
1
25 R3 → 0 0 1
3


 17 15
x 2z
2



1 4 10 4
y  10z
5
z
1  991  Eq.3 R2  3R3 → 0 1 0
6
0 0 1
3
 172  Eq.3  Eq.1

x
1


R1  4R2  10R3 → 1 0 0 2
y
5 10Eq.3  Eq.2 0 1 0
6
z
1 0 0 1
3
Answer: x
1, y
5, z
1 x
2, y
6, z
3
840 Chapter 9 Sequences, Series and Probability

111. Answers will vary.

Section 9.3 Geometric Sequences and Series

■ You should be able to identify a geometric sequence, find its common ratio, and find the nth term.
■ You should know that the nth term of a geometric sequence with common ratio r is given by an  a1r n1.
■ You should know that the nth partial sum of a geometric sequence with common ratio r  1 is given by
1  rn
Sn  a1  1r
. 
■ 
You should know that if r < 1, then


a1

a r
n1
1
n1 
a r
n0
1
n 
1r
.

Vocabulary Check
1. geometric; common 2. an  a1r n1

11  rr 
n
3. Sn  a1 4. geometric series

a1
5. S 
1r

1. 5, 15, 45, 135, . . . 2. 3, 12, 48, 192, . . . 3. 3, 12, 21, 30, . . .

Geometric sequence, r  3 Geometric sequence, r  4 Not a geometric sequence
Note: It is an arithmetic sequence
with d  9.

4. 36, 27, 18, 9, . . . 5. 1,  12, 14,  18, . . . 6. 5, 1, 0.2, 0.04, . . .

Not a geometric sequence Geometric sequence, r   12 Geometric sequence, r  15  0.2

7. 18, 14, 12, 1, . . . 8. 9, 6, 4,  83, . . . 9. 1, 12, 13, 14, . . .

2
Geometric sequence, r  2 Geometric sequence, r   3 Not a geometric sequence

1 2 3 4
10. 5, 7, 9, 11, . . . 11. a1  2, r  3 12. a1  6, r  2
Not a geometric sequence a1  2 a1  6
a2  23  6 a2  621  12
a3  63  18 a3  622  24
a4  183  54 a4  623  48
a5  543  162 a5  624  96
 Section 9.3 Geometric Sequences and Series 841

1
14. a1  1, r  13 1
13. a1  1, r  2 15. a1  5, r   10
a1  1 a1  1 a1  5
a2  1  a2  1   a2  5 10    12
1 1 1 1 1 1
2 2 3 3

a3  2 2  14 a3  1 3  19 a3   12  10   201
1 1 1 2 1

a4  14 12  18 a4  1 13  27  101    2001

3 1 1
a4  20
a5  18 12  16 a5  113   81 a5   200  101   2000
1 4 1 1 1

1
16. a1  6, r   4 17. a1  1, r  e 18. a1  3, r  5
a1  6 a1  1 a1  3
a2  6   a2  35   35
1 1
 14  32 a2  1e  e
a3  6 4   38 a3  35   15
1 2 2
a3  ee  e2
a4  6 14    32 a4  35   155
3 3
a4  e2e  e3
3

a5  6 4   128 a5  35   75

1 4 4
a5  e3e  e4
3

x 1
19. a1  2, r  20. a1  5, r  2x 21. a1  64, ak1  ak
4 2
a1  5
a1  2 a1  64
a2  52x1  10x
a2  2 4x   2x a3  52x2  20x2
1
a2  64  32
2
a4  52x3  40x3
2x 4x   x8
2
1
a3  a3  32  16
a5  52x  4
80x4 2

a4 
x2
8    x
4

x3
32
1
a4  16  8
2

32x 4x   128

3 4
x 1
a5  a5  8  4
2
1
r
2

2 2
1 n1 1 n
an  64 128

1
22. a1  81, ak1  3ak 23. a1  7, ak1  2ak 24. a1  5, ak1  2ak
a1  81 a1  7 a1  5
a2  1381  27 a2  27  14 a2  25  10
a3  3 27
1
9 a3  214  28 a3  210  20
a4  3 9
1
3 a4  228  56 a4  220  40
a5  3 3
1
1 a5  256  112 a5  240  80
an  81 3  243 3 1 n
1 n1
an  52n1   22n
5
r2
an  72n1  722n
842 Chapter 9 Sequences, Series, and Probability

25. a1  6, ak1   32ak 1

26. a1  48, ak1   2ak 1
27. a1  4, r  2, n  10
a1  6 an  a1r n1  412 
n1
a1  48
a10  4 2   2  128
9 7
a2   326  9 a2   12 48  24
1 1 1

a3   329  27
2 a3   12 24  12
a4   3227
2  4
81
a4   12 12  6
a5   32   81
4  243
8 a5   12 6  3
r   32
an  48 12   96 12 
n1 n

an  6  or an  4 
n1 n
 32  32

3 1 1
28. a1  5, r  , n  8 29. 1a1  6, r   , n  12 30. a1  64, r   , n  10
2 3 4

2  41
n1

 3
3 n1 1 n1
an  a1r n1  5 an  a1r n1  6  an  a1r n1  64 

 41
9

  
3 7
10,935 1 11
2 64
a8  5  a12  6   a10  64  
2 128 3 310 262,144

31. a1  100, r  ex, n  9 32. a1  1, r  3, n  8 33. a1  500, r  1.02, n  40

 13 
n1
an  a1r n1  100  ex n1 an  a1 r n1 an  a1rn1  5001.02n1
a8  13   273
7
a9  100ex8  100e8x a40  5001.0239  1082.372

34. a1  1000, r  1.005, n  60 35. 7, 21, 63, . . . ⇒ r  3 36. a1  3, a2  36, a3  432

an  a1 r n1  10001.005 n1 an  73 n1 a2 36
r   12
a1 3
a60  10001.00559  1342.139 a9  738  45,927
an  a1r n1
a7  3126  8,957,952

27
37. 5, 30, 180, . . . ⇒ r  6 38. a1  4, a2  8, a3  16 39. a1  16, a4 
4
an  56n1 a2 8 a4  a1r3
r  2
a1 4
a10  56  50,388,480
9
27
an  a1r n1  16r3
4
a22  4221  8,388,608 27
 r3
64
3
r
4

34
n1
an  16

34
2
a3  16 9
 Section 9.3 Geometric Sequences and Series 843

3 2 16 64
40. a2  3, a5  41. a4  18, a7  42. a3  ,a 
64 3 3 5 27

a5  a2r 52 a7  a4r 3 a5  a3r 53

a5  a2r 3 2 a5  a3r 2
 18r3
3 64 16 2
3  r
 3r3 27 3
64 1
  r3
27 4
1 r2 
 r3 9
64 1
 r
3 2
1 r
r 3
4 a7 2 3
a6    2
r 1 3 a7  a5r 75
a2  a1r1
a7  a5r 2
3  a1 14
64
27  3 
2 2 256
a7  
a1  12 243

43. an  18 23 44. an  18 3 

n1 2 n 1

a1  18 and r  23 r   23  > 1, so the sequence alternates as it

approaches 0.
Since 0 < r < 1, the sequence is decreasing.
Matches (a). Matches (c).

45. an  18 32 46. an  18 2 

n1 3 n 1

a1  18 and r  32 > 1, so the sequence is increasing. r   2  < 1, so the sequence alternates as it
3

approaches
.
Matches (b).
Matches (d).

47. an  120.75n1 48. an  101.5n1 49. an  120.4n1

16 400 15

0 10 0 10

0 10
−16 0 −15

50. an  201.25n1 51. an  21.3n1 52. an  101.2n1

200 24 66

0 10

0 10 0 10
−200 0 0

9
53.
2
n1
n1  1  21  22  . . .  28 ⇒ a1  1, r  2

11  29
S9   511
12
844 Chapter 9 Sequences, Series, and Probability

2 2  2 

10 1 2
5 n1 5 5 5 9 5
54. 1 . . . ⇒ a1  1, r 
n1 2 2

1  52 


10

  
2 5 10 3,254,867
S10  1  1  6357.162
1 
5
2
3 2 512

9
55.
2
n1
n1 ⇒ a1  1, r  2, n  9

1  29
S9  1  1  2   171

 2  2  2  
8 n1 3 1 3 2 3 7 3
3
56. 5  55  5  . . .5  ⇒ a1  5, r  
n1 2 2

1   32 


8

     128  49.258
3 8 6305
S8  5 2 1 
1   32  2

64 2  2  2  
7 i1
1 1 1 1 2 1 6 1
57.  64  64   64   . . .  64  ⇒ a1  64, r  
i1 2 2
1   12 


7

    43
128 1 7
S7  64  1 
1   12  3 2

2 4  4 4 
10 1 1 2 9
i1 1 1 1 1
58. 22 2 . . .2 ⇒ a1  2, r 
i1 4 4

1  14 


10

    2.667
8 1 10
S10  2  1
1 
1
4
3 4

324 4 4 4 4 4

6 1 i1 1 1 1 2 1 3 1 4 1 5 1
59.  32  32  32  32  32  32 ⇒ a1  32, r  , n  6
i1 4
1  14 
 1    1365
6

S6  32 1
32 4

162 2 2 

12 1 1 2 11
i1 1 1 1 1
60.  16  16  16  . . .  16 ⇒ a1  16, r 
i1 2 2
1  2 
1 12


2   128  31.992
1 4095
12
S12  16  32 1 
1  12 

3 2 
3 2  2 2 
20 n 21 n1
3 3 3 1 3 2 3 20 3
61.  33 3 . . .3 ⇒ a1  3, r 
n0 n1 2 2
1  32 


21

2   29,921.311
3 21
S21  3  6 1 
1  32

5 5 
5 5 
5 5 5   ⇒
40 3 40 3 n 3 3 2 3 3 40
n 1 3 3
62. 5 5 5 5 5 . . .5 a1  3, r 
n0 n1 5 5

1  35 


40

    12.500
40
15 3
S41  5  3 3 5 1
1 5
2 5
 Section 9.3 Geometric Sequences and Series 845

3
3 3 3 

15 4 16 4 4 1 4 2 4 15
n n1 4
63. 2  2 22 2 . . .2 ⇒ a1  2, r  , n  16
n0 n1 3 3
1  43 
   592.647
16

S16  2
1  43

105
105
5 5 5   ⇒
20 1 n 20 1 n 1 1 1 2 1 3 1 20 1
64.  10   10  10  10  10  . . .  10 a1  2, r 
n0 n1 5 5
1  5 


1 20

    12.500
20
5 1
S21  10  2  10  1
1 
1
5
2 5

5 6
65.
3001.06
n0
n

n1

3001.06 n1

 300  3001.061  3001.062  3001.063  3001.064  3001.065 ⇒ a1  300, r  1.06

1  1.066
S6  300
1  1.06
 2092.596 
6 6
66.
5001.04
n0
n
 500 
5001.04
n1
n
 500  5001.041  5001.042  . . .  5001.046

a1  520, r  1.04

11  1.04
1.04 
6
S7  500  520  500  13,0001  1.04  3949.147 6

       
40 n 2 40
1 1 1 1 1
67.

n0
2 
4
22 
4
2 
4
. . .2 
4
⇒ a1  2, r   , n  41
4
1   14 


41 41

    1.6  58
8 1
S41  2  1 
1  14  5 4

103
103
23 23   ⇒ a
50 50
2 n1 2 n1 1 2 2 49 2
68. 15  15  10  10  10  . . .  10 1  10, r 
n0 n1 3 3

1  3 


2 50

23   45.000
50
S51  15  10  15  30 1 
1  23 

8 4  41  8 41  . . .  8 41

10 1 1
i1 1 2 9
69. 88  ⇒ a1  8, r  
i1 4
1   14 


10

    6.400
32 1 10
S10  8  1 
1  14 5 4

8 2 8 
8 2 8 
4  8 2  21   ⇒ a
25 i 25
1 1 i 1 2 3 1 25 1
70. 8   . . . 8  1  4, r  
i0 i1 2 2

1   2 
1 25

8 1
    5.333
25
S26  8  4 1  8 1 
 12  3 2

5 3   3  3  
10 1 i1 1 1 1 2 1 9 1
71. 55  5  . . .5  ⇒ a1  5, r   , n  10
i1 3 3

11    3.750
1 10
S10  5 3
1
3
846 Chapter 9 Sequences, Series, and Probability

153 23 1523 

100 2 i1 1 2 2 99 2
72. 15  15  . . .  15 ⇒ a1  15, r 
i1 3 3

1  3 

2 100

S100  15 1  2
 3

 45 1  23   45.000
100

73. 5  15  45  . . .  3645 74. 7  14  28  . . .  896

r  3 and 3645  53n1 a1  7, r  2
729  3 n1
⇒ 6n1 ⇒ n7 72n1  896
7
Thus, the sum can be written as
53
n1
n1
. 2n1  128
2n1  27
n17
n8
8
Thus, the sum can be written as
72
n1
n1
.

1 1 . . . 1 3 . . . 3
75. 2     76. 15  3   
2 8 2048 5 625
1 1 1
 
n1 1
r   and 2  a1  15, r  
4 2048 4 5
By trial and error, we find that n  7.
 51
n1 3
15  
625

2 4 
7
1 n1
Thus, the sum can be written as .
 51
n1 1
n1

3125

 51
n 1

15,625
By trial and error, we find that n  6.
Thus, the sum can be written as

 5
6 n1
1
15  .
n1

77. 0.1  0.4  1.6  . . .  102.4 78. 32  24  18  . . .  10.125

r  4 and 102.4  0.14n1 3
a1  32, r 
4
1024  4n1 ⇒ 5n1 ⇒ n6

34
n1 81
6
 10.125 


32
Thus, the sum can be written as 0.14 n1.
8
n1

34
n1 81

256

34 34
n1 4


n14
n5
Thus, the sum can be written as

324
5 3 n1
.
n1
 Section 9.3 Geometric Sequences and Series 847

2 12  12
2 3  3 3
n 1 2
1 n 1 2 2 2 2
79. 1 . . . 80. 22 2 . . .
n0 n0

1 2
a1  1, r  a1  2, r 
2 3



2 3 



2
1 n
a1 1 2 n a1 2
  2   6
n0 1  r 1  12  n0 1  r 1  23

2 3   32  32



 2   21   21
2 n 1 2
1 n 1 2
81. 1  . . . 82. 22  2  . . .
n0 n0

1 2
a1  1, r   a1  2, r  
2 3



2 3 



 2 
1 n
a1 1 2 2 n a1 2 6
     
n0 1  r 1   12  3 n0 1  r 1   3  5
2

4 4  14 14



10 101   101 
1 n 1 2 1 n 1 2
83. 44 4 . . . 84. 1 . . .
n0 n0

1 1
a1  4, r  a1  1, r 
4 10




4
 10
n n
1 a1 4 16 1 a1 1 10
    
1  r 1  14   3
4
n0 n0 1  r 1  10
1 9

85.
0.4
n0
n  1  0.41  0.42  . . . 86.
40.2
n0
n
 4  40.21  40.22  . . .

a1  1, r  0.4 a1  4, r  0.2

1 5
4

0.4
n0
n  
1  0.4 3
40.2
n0
n 
1  0.2
5

87.
30.9
n0
n  3  30.91  30.92  . . . 88.
100.2  10  100.2
n0
n 1
 100.22  . . .

a1  3, r  0.9 a1  10, r  0.2

3
10

30.9
n0
n

1  0.9
 30
100.2
n0
n

1  0.2
 12.5


n
9 27 3 8
89. 8  6    . . .  8   32
2 8 n0 4 1  34

8 . . . 1 1
1
90. 9  6  4 
3
 91.  13 . . . 
9 3 n0 9
3n

2 The sum is undefined because
a1  9, r 
3

r  3  3 > 1.


2 n 9
9   27
n0 3 1  23
848 Chapter 9 Sequences, Series, and Probability

125 25


 
125 6 n 0.36 0.36 36 4
92.
36

6
56. . .
n0

36

5
93. 0.36 
0.360.01
n0
n    
1  0.01 0.99 99 11
The sum is undefined because

r   

6
5
6
 > 1.
5

0.297 0.297
3 0.018

94. 0.297 
0 .2970.001
n0
n
 
1  0.001 0.999
95. 0.318  0.3 
0.0180.01
n0
n  
10 1  0.01
297 11 3 0.018 3 18 3 2
       
999 37 10 0.99 10 990 10 110
35 7
 
110 22

0.08 0.08 3 4 7 25
96. 1.38  1.3 
0 .080.1
n0
n  1.3 
1  0.1
 1.3 
0.9
1 
10 45
1 
18 18

1  0.5x 1  0.8x


1  0.8 ,
25



1  0.5 ,
62
1 n 6 4 n 2
97. f x  6   12 98. f x  2   10
n0 1 1
2 n0 1  45
20 The horizontal asymptote of f x is y  10.
This corresponds to the sum of the series.
20
−4 10

−9 18
−15

The horizontal asymptote of f x is y  12.

−25
This corresponds to the sum of the series.

n10

   
r nt 0.06
99. (a) an  1190.881.006n 100. A  P 1   1000 1 
n n
(b) The population is growing at a rate of 0.6% per year.
(a) n  1, A  10001  0.0610  $1790.85
(c) For 2010, let n  20: an  1190.881.00620 210

 
0.06
 1342.2 million (b) n  2, A  1000 1   $1806.11
2
(d) 1190.881.006n  1320 410

 
0.06
(c) n  4, A  1000 1   $1814.02
1320 4
1.006n 
1190.88 1210

 
0.06
(d) n  12, A  1000 1   $1819.40
ln 1.006n  ln  1320
1190.88  12
36510

 
0.06
(e) n  365, A  1000 1   $1822.03
n ln 1.006  ln
1320
1190.88   365

ln 1190.88
1320

n  17.21
ln 1.006
This corresponds with the year 2008.
 Section 9.3 Geometric Sequences and Series 849

n20

   
nt
r 0.02
101. A  P 1   2500 1  102. V5  135,0000.705  $22,689.45
n n

 
0.02 120
(a) n  1: A  2500 1   $3714.87
1
220
 
0.02
(b) n  2: A  2500 1   $3722.16
2
420
 
0.02
(c) n  4: A  2500 1   $3725.85
4
1220
 
0.02
(d) n  12: A  2500 1   $3728.32
12
36520
 
0.02
(e) n  365: A  2500 1   $3729.52
365

1  1.00560

 
60 n 60
0.06
103. A 
n1
100 1 
12


n1
1001.005n  100(1.005 
1  1.005
 $7011.89

501  
60 0.08 n
104. A  105. Let N  12t be the total number of deposits.
n1 12

     
r r 2 r N
1  1.00666666760 AP 1 P 1 . . .P 1
 501.006666667  1  1.006666667  12 12 12

 
P  P1  12  . . .  P1  12 
r r r N1
 $3698.34  1
12

 
1  12
N n1
r r
P 1
12 n1

 12


r N
1 1
 P1  
r

1  1  
12 r
12

  r 
1  1  12 
r 12 r N
P 1
12

r 
1  1  12 
12 r N
P 1

1  12  
N
r 12
P 1 1
r

1  12  
r 12t 12
P 1 1
r

106. Let N  12t be the total number of deposits. 107. P  $50, r  7%, t  20 years
A  Per 12  Pe2r 12  . . .  PeNr 12
(a) Compounded monthly:
N

Pe
n1
r 12  n
A  50
1 
0.07

1220
1 1 
12

12 0.07
1  er 12N   $26,198.27
 Per 12
1  er 12
(b) Compounded continuously:
1  er 1212t 
 Per 12 50e0.07 12e0.0720  1
1  er 12 A  $26,263.88
e0.07 12  1
Per 12ert  1

er 12  1
850 Chapter 9 Sequences, Series, and Probability

108. P  $75, r  3%, t  25 years

1    
0.03 1225 12
(a) Compounded monthly: A  75 1 1  $33,534.21
12 0.03
75e0.03 12e0.0325  1
(b) Compounded continuously: A   $33,551.91
e0.03 12  1

109. P  $100, r  10%, t  40 years

1    
0.10 1240 12
(a) Compounded monthly: A  100 1 1  $637,678.02
12 0.10
100e0.10 12e0.1040  1
(b) Compounded continuously: A   $645,861.43
e0.10 12  1

110. P  $20, r  6%, t  50 years

1    
0.06 1250 12
(a) Compounded monthly: A  20 1 1  $76,122.54
12 0.06
20e 
0.06 12
e0.0650  1
(b) Compounded continuously: A   $76,533.16
e0.06 12  1

1 n

1  12 
12t r
111. P  W 112. W  $2000, t  20, r  9%
n1

 r 
1  1  12 
12 r 12t


PW
 12
r 12t
1
1 1
 W1  
r

0.09
1  1     $222,289.91
12 0.09
1  1  
12 r 1 1220
P  2000
12 12

1  1  12r  
12t

 
1
W
r 1
1 1
12
1  12r 
r  12t

1  1  12 
W
1  12  1
r

12t

 r 
1  1  12 
12 r
W

300
113.
4000.75
n1
n

1  0.75
 $1200 114. a1  2500.80  200
r  80%  0.80


Amount put back into economy 
2500.80
n1
n

200

1  0.80
200

0.20
 $1000
 Section 9.3 Geometric Sequences and Series 851

435
115.
6000.725
n1
n 
1  0.725
 $1581.82 116. a1  4500.775  348.75
r  77.5%  0.775


Amount put back into economy 
4500.775
n1
n

348.75

1  0.775
348.75

0.225
 $1550

117. 64  32  16  8  4  2  126 118. an  54.6e0.172n, n  4, 5, . . . , 13

Total area of shaded region is approximately r  e0.172n
126 square inches.
a1  54.6e0.172  64.84721

11  rr 
n n
Sn 
a r
i1
1
i1  a1

S  S13  S3
0.17213 0.1723
 64.84721 1 1 e e 0.172   64.847211 1e e 0.172 
 2887.141484  233.336893  2653.80
The total sales over the 10-year period is $2653.80 million.

119. an  30,0001.05n1
40 1  1.0540
T
30,0001.05
n1
n1
 30,000
1  1.05
 $3,623,993.23

320.81   16  1  0.81  16  152.42 feet
32
120. (a) Total distance  n
n0

1  0.9  19 seconds
0.9
(b) t  1  2
0.9
n1
n 12

121. False. A sequence is geometric if the 122. False. an  a1r n1, NOT ra1n1
ratios of consecutive terms are the same.
The nth-term of a geometric sequence can be found by
multiplying its first term by its common ratio raised to
the n  1th power.

123. Given a real number r between 1 and 1, 124. Sample answer:

as the exponent n increases, r n approaches zero. 199 8
4

41
n1
n1
and
 852
n1
n1

125. gx  x2  1 126. f x  3x  1

gx  1  x  1  1 2
f x  1  3x  1  1  3x  4
 x2  2x  1  1  x2  2x
852 Chapter 9 Sequences, Series, and Probability

127. f
x
3x  1, g
x
x2  1 128. g
x
x2  1

f
g
x  1
f
x2  2x g
f
x  1
g
3x  4 From Exercise 126

3
x  2x  1
2


3x  4  1
2

3x2  6x  1
9x2  24x  15

129. 9x 3  64x
x
9x2  64
x
3x  8
3x  8 130. x2  4x  63 Does not factor

131. 6x2  13x  5

3x  1
2x  5 132. 16x2  4x4
4x2
4  x2

4x2
2  x
2  x

1
3 x
x  3 3x x2 2x
x  7 1
133.
x3
 x3


x3
, x  3 134. 
, x  7, 2
x7 6x
x  2 3
3

x 3x x 3
2x  1 2x  1 1 x5 10  2x x5 2
x  3

135. 

, x  0,  136. 

x  3 2
3  x x  3
 2
x  5
1, x  3, 5
3 6x  3 3 3x 3 2

7 2 5
x  2
x  2  7
x  2  2
x  2

137. 5  

x2 x2
x  2
x  2
5
x2  4  7
x  2  2
x  2



x  2
x  2
5x2  20  7x  14  2x  4 5x2  9x  30




x  2
x  2
x  2
x  2

x1 4 x4 8
x  1
x  4 
x  12  4
x  4 
x  4

138. 8   

x  4 x  1
x  1
x  4
x  1
x  4
8
x2  3x  4 
x2  2x  1  4x  16  x  4



x  1
x  4
8x2  24x  32  x2  2x  1  4x  16  x  4



x  1
x  4
7x2  21x  53



x  1
x  4

139. Answers will vary.

Section 9.4 Mathematical Induction

■ You should be sure that you understand the principle of mathematical induction. If Pn is a statement involving
the positive integer n, where P1 is true and the truth of Pk implies the truth of Pk1 for every positive k, then Pn
is true for all positive integers n.
■ You should be able to verify (by induction) the formulas for the sums of powers of integers and be able to use
these formulas.
■ You should be able to calculate the first and second differences of a sequence.
■ You should be able to find the quadratic model for a sequence, when it exists.
 Section 9.4 Mathematical Induction 853

Vocabulary Check
1. mathematical induction 2. first
3. arithmetic 4. second

5 1
1. Pk
2. Pk

k
k  1 2
k  2
5 5 1 1
Pk1

Pk1



k  1
k  1  1
k  1
k  2 2
k  1  2 2
k  3

k2
k  12 k
3. Pk
4. Pk

2k  1
4 3

k  12
k  1  12
k  12
k  22 k1 k1

Pk1

Pk1
2
k  1  1

2k  3
4 4 3 3

5. 1. When n
1, S1
2
1
1  1.

2. Assume that
Sk
2  4  6  8  . . .  2k
k
k  1.
Then,
Sk1
2  4  6  8  . . .  2k  2
k  1

Sk  2
k  1
k
k  1  2
k  1

k  1
k  2.
Therefore, we conclude that the formula is valid for all positive integer values of n.

6. 1. When n
1, S1
3
1
2  1  1.

2. Assume that
Sk
3  7  11  15  . . . 
4k  1
k
2k  1.
Then,
Sk1
Sk  ak1

3  7  11  15  . . . 
4k  1  4
k  1  1

k
2k  1 
4k  3

2k 2  5k  3


k  1
2k  3


k  12
k  1  1 .
Therefore, we conclude that this formula is valid.
854 Chapter 9 Sequences, Series, and Probability

1
7. 1. When n
1, S1
2

5
1  1.
2
2. Assume that
k
Sk
2  7  12  17  . . . 
5k  3

5k  1.
2
Then,
Sk1
2  7  12  17  . . . 
5k  3  5
k  1  3
k

Sk 
5k  5  3

5k  1  5k  2
2
5k2  k  10k  4 5k2  9k  4



2 2

k  1
5k  4
k  1


5
k  1  1.
2 2
Therefore, we conclude that this formula is valid for all positive integer values of n.

8. 1. When n
1,
1
S1
1

3
2
 1  1 .

2. Assume that
k
Sk
1  4  7  10  . . . 
3k  2

3k  1.
2
Then,
Sk1
Sk  ak1

1  4  7  10  . . . 
3k  2 
3
k  1  2
k


3k  1 
3k  1
2
3k 2  k  6k  2


2
3k2  5k  2


2

k  1
3k  2


2
k1

3
k  1  1.
2
Therefore, we conclude that this formula is valid for all positive integer values of n.

9. 1. When n
1, S1
1
21  1.
2. Assume that
Sk
1  2  22  23  . . .  2k1
2k  1.
Then,
Sk1
1  2  22  23  . . .  2k1  2k

Sk  2k
2k  1  2k
2
2k  1
2k1  1.
Therefore, we conclude that this formula is valid for all positive integer values of n.
 Section 9.4 Mathematical Induction 855

10. 1. When n
1, S1
2
31  1.
2. Assume that
Sk
2
1  3  32  33  . . .  3k1
3k  1.
Then,
Sk1
Sk  ak1

2
1  3  32  33  . . .  3k1  2  3k11

3k  1  2  3k

3  3k  1

3k1  1.
Therefore, we conclude that this formula is valid for all positive integer values of n.

1
1  1
11. 1. When n
1, S1
1
.
2
2. Assume that
k
k  1
Sk
1  2  3  4  . . .  k
.
2
Then,
Sk1
1  2  3  4  . . .  k 
k  1
k
k  1 2
k  1
k  1
k  2

Sk 
k  1

.
2 2 2
Therefore, we conclude that this formula is valid for all positive integer values of n.

n2
n  12
12. Sn
13  23  33  43  . . .  n3
.
4
12
1  12
1. When n
1, Sn
13
1
.
4
2. Assume that
k2
k  12
Sk
13  23  33  43  . . .  k3
.
4
Then,
Sk1
13  23  33  43  . . .  k3 
k  13
k2
k  12 k2
k  12  4
k  13

Sk 
k  13

k  13

4 4

k  12
k2  4k  4
k  12
k  22
k  12
k  1  12




4 4 4
Therefore, we conclude that this formula is valid for all positive integer values of n.
856 Chapter 9 Sequences, Series, and Probability

12
1  12
2
12  2
1  1

13. 1. When n
1, S1
1
.
12
2. Assume that
k k2
k  12
2k2  2k  1
Sk
i
i
1
5

12
.

Then,

  i  
k  1
k1 k
Sk1
i
i
1
5


i
1
5 5

k2
k  12
2k2  2k  1 12
k  15


12 12

k  12k2
2k2  2k  1  12
k  13


12

k  122k4  2k3  k2  12
k3  3k2  3k  1


12

k  122k4  14k3  35k2  36k  12


12

k  12
k2  4k  4
2k2  6k  3


12

k  12
k  222
k  12  2
k  1  1

.
12
Therefore, we conclude that this formula is valid for all positive integer values of n.
Note: The easiest way to complete the last two steps is to “work backwards.” Start with the desired expression
for Sk1 and multiply out to show that it is equal to the expression you found for Sk 
k  15.

14. 1. When n
1,

S1
14

1
1  1
2  1  1
3  12  3  1  1.
30
2. Assume that
k k
k  1
2k  1
3k2  3k  1
Sk
i
i
1
4

30
.

Then,
Sk1
Sk  ak1
Sk 
k  14
k
k  1
2k  1
3k2  3k  1


k  14
30
k
k  1
2k  1
3k2  3k  1  30
k  14


30

k  1k
2k  1
3k2  3k  1  30
k  13


30

k  1
6k4  39k3  91k2  89k  30


30

k  1
k  2
2k  3
3k2  9k  5


30

k  1
k  2
2
k  1  1
3
k  12  3
k  1  1

.
30
Therefore, we conclude that this formula is valid for all positive integer values of n.
 Section 9.4 Mathematical Induction 857

1
2
3
15. 1. When n
1, S1
2
.
3
2. Assume that
k
k  1
k  2
Sk
1
2  2
3  3
4  . . .  k
k  1
.
3
Then,
Sk1
1
2  2
3  3
4  . . .  k
k  1 
k  1
k  2
k
k  1
k  2 3
k  1
k  2

Sk 
k  1
k  2

3 3

k  1
k  2
k  3

.
3
Therefore, we conclude that this formula is valid for all positive integer values of n.

16. 1. When n
1,
1 1
S1

.
3 2 11
2. Assume that
k 1 k
Sk

2i  1
2i  1
2k  1 .
i
1

Then,
1
Sk1
Sk  ak1
Sk 

2
k  1  1
2
k  1  1
k 1


2k  1
2k  1
2k  3
k
2k  3  1



2k  1
2k  3
2k2  3k  1



2k  1
2k  3

2k  1
k  1



2k  1
2k  3
k1

.
2
k  1  1
Therefore, we conclude that this formula is valid for all positive integer values of n.

17. 1. When n
4, 4!
24 and 24
16, thus 4! > 24.

2. Assume
k! > 2k, k > 4.
Then,

k  1!
k!
k  1 > 2k
2 since k! > 2k and k  1 > 2.
Thus,
k  1! > 2k1.
Therefore, by extended mathematical induction, the inequality is valid for all integers n such that n ≥ 4.
858 Chapter 9 Sequences, Series, and Probability

3
4 7
18. 1. When n
7,  7.4915 > 7.

3
k
4
2. Assume that > k, k > 7.

3 3 3 > k3
k  3 > k  1 for k > 7.

4 k1 4 k 4 4 k
Then,

43
k1
Thus, > k  1.

3
4 n
Therefore, the inequality > n is valid for all integers n such that n ≥ 7.

1 1 1 1
19. 1. When n
2,   1.707 and 2  1.414, thus  > 2.
1 2 1 2

2. Assume that
1 1 1 1
  . . . > k, k > 2.
1 2 3 k

Then,
1 1 1 1 1 1
  . . .  > k  .
1 2 3 k k  1 k  1

Now it is sufficient to show that

1
k  > k  1, k > 2,
k  1

or equivalently
multiplying by k  1,

k k  1  1 > k  1.

This is true because

k k  1  1 > k k  1
k  1.

Therefore,
1 1 1 1 1
  . . .  > k  1.
1 2 3 k k  1

Therefore, by extended mathematical induction, the inequality is valid for all integers n such that n ≥ 2.

y < y and
0 < x < y.

x 2 x
20. 1. When n
1,

2. Assume that

y y
x k1 x k
<

y y ⇒ yy yy ⇒ y y

x k1 x k x x k1 x x k x k2 x k1
< < < .

y y
x n1 x n
Therefore, < for all integers n ≥ 1.

21.
1  an ≥ na, n ≥ 1 and a > 0

Since a is positive, then all of the terms in the binomial expansion are positive.

1  an
1  na  . . .  nan1  an > na
 Section 9.4 Mathematical Induction 859

22. 2n2 >
n  12, n ≥ 3 23. 1. When n
1,
ab1
a1b1
ab.

1. For n
3, the statement is true, because 2. Assume that
abk
akbk.
2
32
18 >
3  12
16.
Then,
abk1

abk
ab
2. Assuming that 2k2 >
k  12 you need to show that
2
k  12 >
k  22. For n
k, you have
akbkab

k  22
k2  4k  4
ak1bk1.

k2  2k  1  2k  3 Thus,
abn
anbn.

k  12  2k  3.
By the assumption
k  12 < 2k2, you have

k  12  2k  3 < 2k2  2k  3.
Because 2k  3 < 4k  2, or 1 < 2k for all k > 3,
you can say that
2k2  2k  3 < 2k2  4k  2
2
k  12.
It follows that
k  22 < 2k2  2k  3 < 2
k  12
or 2
k  12 >
k  22.
Therefore, 2n2
n  12 for all n ≥ 3.

b
a 1 a1 1 1 1
24. 1. When n
1,
. 25. 1. When n
2,
x1x21


x1x2 x1
x
x11x21.
b1 2

2. Assume that
b
a k ak
2. Assume that
.
bk
x1 x2 x3 . . . xk1
x11x21x31 . . . xk1.

b b b
b

a k1 a k a ak a ak1 Then,
Then,
k  b
bk1 .

x1 x2 x3 . . . xk xk11

x1 x2 x3 . . . xkxk11

b
a n an
Thus,
.

x1 x2 x3 . . . xk1xk11
bn

x11x21x31 . . . xk1xk11.
Thus, the formula is valid.

26. 1. When n
1, ln x1
ln x1.

2. Assume that ln
x1 x2 x3 . . . xk 
ln x1  ln x2  ln x3  . . .  ln xk .
Then, ln
x1 x2 x3 . . . xk xk1
ln
x1x2x3 . . . xk  xk1

ln
x1 x2 x3 . . . xk   ln xk1

ln x1  ln x2  ln x3  . . .  ln xk  ln xk1.
Thus, ln
x1 x2 x3 . . . xn 
ln x1  ln x2  ln x3  . . . ln xn .

27. 1. When n
1, x
y1
xy1.

2. Assume that
x
y1  y2  . . .  yk
xy1  xy2  . . .  xyk.
Then,
xy1  xy2  . . .  xyk  xyk1
x
y1  y2  . . .  yk  xyk1

x
y  y  . . .  y   y  1 2 k k1

x
y1  y2  . . .  yk  yk1.
Hence, the formula holds.
860 Chapter 9 Sequences, Series, and Probability

28. 1. When n
1, a  bi and a  bi are complex conjugates by definition.

2. Assume that
a  bik and
a  bik are complex conjugates. That is, if
a  bik
c  di, then
a  bik
c  di.
Then,

a  bik1

a  bik
a  bi

c  di
a  bi


ac  bd   i
bc  ad 
and
a  bik1

a  bik
a  bi

c  di
a  bi


ac  bd   i
bc  ad .
This implies that
a  bik1 and
a  bik1 are complex conjugates.
Therefore,
a  bin and
a  bin are complex conjugates for n ≥ 1.

29. 1. When n
1, 13  3
12  2
1
6 and 3 is a factor.

2. Assume that 3 is a factor of k3  3k2  2k.
Then,

k  13  3
k  12  2
k  1
k3  3k2  3k  1  3k2  6k  3  2k  2


k3  3k2  2k 
3k2  9k  6


k3  3k2  2k  3
k2  3k  2.
Since 3 is a factor of
k3  3k2  2k, our assumption, and 3 is a factor of 3
k2  3k  2,
we conclude that 3 is a factor of the whole sum.
Thus, 3 is a factor of
n3  3n2  2n for every positive integer n.

30. Prove 3 is a factor of n3  n  3 for all positive integers n.

1. When n
1,13  1  3
3 and 3 is a factor.
2. Assume that 3 is a factor of k3  k  3.
Then,

k  13 
k  1  3
k3  3k2  3k  1  k  1  3

k3  3k2  2k  3


k3  k  3  3k2  3k


k3  k  3  3k
k  1.
Since 3 is a factor of each term, 3 is a factor of the sum.
Thus, 3 is a factor of n3  n  3 for all positive integers n.

31. A factor of n4  n  4 is 2.
1. When n
1, 14  1  4
4 and 2 is a factor.
2. Assume that 2 is a factor of k4  k  4.
Then,

k  14 
k  1  4
k4  4k3  6k2  4k  1  k  1  4


k4  k  4 
4k3  6k2  4k


k4  k  4  2
2k3  3k2  2k.
Since 2 is a factor of k4  k  4, our assumption, and 2 is a factor of 2
2k3  3k2  2k,
we conclude that 2 is a factor of the entire expression.
Thus, 2 is a factor of n4  n  4 for every positive integer n.
 Section 9.4 Mathematical Induction 861

32. Prove 3 is a factor of 22n1  1 for all positive integers n.

1. When n
1,22  11  1
23  1
8  1
9 and 3 is a factor.
2. Assume 3 is a factor of 22k1  1.
Then,
22
k1 1  1
22k21  1

2
2k1 2  1

22k1  22 1

4  22k1  1

4
22k1  1  3
Since 3 is a factor of each term, 3 is a factor of the sum.
Thus, 3 is a factor of 22n1  1 for all positive integers n.

33. A factor of 24n2  1 is 5.

1. When n
1,
24
1 2  1
5 and 5 is a factor.
2. Assume that 5 is a factor of 24k2  1.
Then,
24
k1 2  1
24k42  1

24k2  24  1

24k2  16  1


24k2  1  15  24k2.
Since 5 is a factor of 24k2  1, our assumption, and 5 is a factor of 15  24k2, we conclude that
5 is a factor of the entire expression.
Thus, 5 is a factor of 24n2  1 for every positive integer n.

34. 1. When n
1,
22
1 1  32
1 1
2  3
5 and 5 is a factor.

2. Assume that 5 is a factor of
22k1  32k1.
Then, 22
k1 1  32
k1 1
22k21  32k21

22k122  32k132

4  22k1  9  32k1


22k1  32k1 
22k1  32k1

22k1  32k1 
22k1  32k1  5  32k1.

Since 5 is a factor of each set in parentheses and 5 is a factor of 5  32k1, then 5 is a factor of the whole sum.
Thus, 5 is a factor of
22n1  32n1 for every positive integer n.
862 Chapter 9 Sequences, Series, and Probability

35. Sn
1  5  9  13  . . . 
4n  3
S1
1
1  1
S2
1  5
6
2  3
S3
1  5  9
15
3  5
S4
1  5  9  13
28
4  7
From this sequence, it appears that Sn
n
2n  1. This can be verified by mathematical induction.
The formula has already been verified for n
1. Assume that the formula is valid for n
k. Then,
Sk1
1  5  9  13  . . . 
4k  3  4
k  1  3

k
2k  1 
4k  1

2k2  3k  1


k  1
2k  1


k  12
k  1  1.

Thus, the formula is valid.

36. Sn
25  22  19  16  . . . 
3n  28

1
S1
25

50
2
2
S2
25  22
47

47
2
3
S3
25  22  19
66

44
2
4
S4
25  22  19  16
82

41
2
From the sequence, it appears that
n
Sn

3n  53.
2
This can be verified by mathematical induction. The formula has already been verified for n
1.
Assume that the formula is valid for n
k. Then,
Sk1
25  22  19  16  . . . 
3k  28  3
k  1  28
k


3k  53 
3k  25
2
1


3k2  47k  50
2
1


3k2  47k  50
2
1


k  1
3k  50
2
k1

3
k  1  53.
2
Thus, the formula is valid.
 Section 9.4 Mathematical Induction 863

9 81 729 9
 
n1
37. Sn
1    . . .
10 100 1000 10
Since this series is geometric, we have

109 
n
1
 10
109  
n 9 i1 n
Sn


10 1 
9
i
1
1
10

109  .
n

10  10

 
9 27 81 . . . 3 n1
38. Sn
3     3 
2 4 8 2
Since the series is geometric, we have

 23

n
1 
 3 2 
  .
n 3 i1 6 3 n
Sn

3
1 
1   
i
1 3 5 2
2

1 1 1 1 1
39. Sn
   . . .
4 12 24 40 2n
n  1
1 1
S1


4 2
2
1 1 4 2 2
S2




4 12 12 6 2
3
1 1 1 9 3 3
S3
 



4 12 24 24 8 2
4
1 1 1 1 16 4 4
S4
  



4 12 24 40 40 10 2
5
From this sequence, it appears that
n
Sn
.
2
n  1
This can be verified by mathematical induction. The formula has already been verified for n
1.
Assume that the formula is valid for n
k. Then,

Sk1

14  121  401  . . .  2k
k1 1  2
k  11
k  2
k 1


2
k  1 2
k  1
k  2
k
k  2  1


2
k  1
k  2
k2  2k  1


2
k  1
k  2

k  12


2
k  1
k  2
k1

.
2
k  2
Thus, the formula is valid.
864 Chapter 9 Sequences, Series, and Probability

1 1 1 1 1
40. Sn
   . . .
2 3 3 4 4 5 5 6
n  1
n  2
1 1
S1


6 23
1 1 1 2
S2



6 12 4 2  4
1 1 1 3 3
S3
 


6 12 20 10 2  5
1 1 1 1 1 4
S4
  


6 12 20 30 3 2  6
From this sequence, it appears that
n
Sn
.
2
n  2
This can be verified by mathematical induction. The formula has already been verified for n
1.
Assume that the formula is valid for n
k. Then,

Sk1

16  121  201  301  . . . 
k  1
1 k  2 
k  2
1 k  3
k 1


2
k  2
k  2
k  3
k
k  3  2


2
k  2
k  3
k2  3k  2


2
k  2
k  3

k  1
k  2


2
k  2
k  3
k1

.
2
k  1  2
Thus, the formula is valid.

15
15
15  1 30
30
30  1
41. 
n
1
n

2

120 42. n

n
1 2

465

6 6
6  12
6  1 10
102
10  12
43. n
n
1
2

6

91 44. n
n
1
3


4

3025

5 5
5  12
5  13
52  3
5  1 8

82
8  12
2
82  2
8  1
45. 
n
1
n4

30

979 46. n
n
1
5


12

61,776

6 6 6 20 20 20
47. 
n
n
1
2
 n

n
1
n 2
 n
n
1
48. 
n
n
1
3  n
n
n
1
3  n
n
1

6
6  12
6  1 6
6  1
202
20  12 20
20  1



6 2 4 2

91  21
70
202
212  2
20
21


43,890
4

6
6  1
62
6  12



6 6 6
49. 
6i  8i 
6  i  8  i
i
1
3
i
1 i
1
3
6
2
8
4

6
21  8
441
3402
 Section 9.4 Mathematical Induction 865

 3  2 j  2 j 
 3  2  j  2  j
10 10 10 10
1 1 2
1 1 2
50.
j
1 j
1 j
1 j
1

1 10
10  1 1 10
10  1
2  10  1

3
10 
2
 2

2
 6
3
10
12  3
10
11  10
11
21


195
12

51. a1
0, an
an1  3 52. a1
2, an
an1  2

a1
a1
0 a1
a1
2
a2
a1  3
0  3
3 a2
a1  2
2  2
4
a3
a2  3
3  3
6 a3
a2  2
4  2
6
a4
a3  3
6  3
9 a4
a3  2
6  2
8
a5
a4  3
9  3
12 a5
a4  2
8  2
10
a6
a5  3
12  3
15 a6
a5  2
10  2
12
an: 0 3 6 9 12 15 an: 2 4 6 8 10 12
First differences: 3 3 3 3 3 First differences: 2 2 2 2 2
Second differences: 0 0 0 0 Second differences: 0 0 0 0
Since the first differences are equal, the sequence has a Since the first differences are equal, the sequence has a
linear model. linear model.

53. a1
3, an
an1  n
a1
a1
3
a2
a1  2
3  2
1
a3
a2  3
1  3
2
a4
a3  4
2  4
6
a5
a4  5
6  5
11

a6
a5  6
11  6
17
an: 3 1 2 6 11 17
First differences: 2 3 4 5 6
Second differences: 1 1 1 1
Since the second differences are all the same, the sequence has a quadratic model.

3
54. a2
3, an
2an1 an : 2 3 6 12 24 48 96
a2
3 ⇒ 3
2a1 First differences: 92 9 18 36 72 144
3
a1
2 27
Second differences: 2 27 54 108 216
a2
3
a3
2a2
2
3
6 Since neither the first differences nor the second differences are equal, the
sequence does not have a linear or quadratic model.
a4
2a3
2
6
12
a5
2a4
2
12
24
a6
2a5
2
24
48
a7
2a6
2
48
96
866 Chapter 9 Sequences, Series, and Probability

55. a0
2, an

an1 2
a0
2
a1
a02
22
4
a2
a12
42
16
a3
a22
162
256
a4
a32
2562
65,536
a5
a42
65,5362
4,294,967,296
an : 2 4 16 256 65,536 4,294,967,296
First differences: 2 12 240 65,280 4,294,901,760

Second differences: 10 228 65,040 4,294,836,480

Since neither the first differences nor the second differences are equal, the sequence does not have a linear or quadratic model.

56. a0
0, an
an1  n 57. a0
3, a1
3, a4
15

a0
0 Let an
an2  bn  c.
a1
a0  1
0  1
1 Thus: a0
a
02  b
0  c
13 ⇒ c
3
a2
a1  2
1  2
3 a1
a
12  b
1  c
13 ⇒ a  b  c
3
a3
a2  3
3  3
6 ⇒ ab
0
a4
a3  4
6  4
10 a4
a
4  b
4  c
15 ⇒ 16a  4b  c
15
2

a5
a4  5
10  5
15 ⇒ 16a  4b
12

an: 0 1 3 6 10 15 ⇒ 4a  4b
3

First differences: 1 2 3 4 5 By elimination: a  b
0

4a  b
3
Second differences: 1 1 1 1
3a
3
Since the second differences are equal, the sequence has a
a
1 ⇒ b
1
quadratic model.
Thus, an
n2  n  3.

58. a0
7, a1
6, a3
10 59. a0
3, a2
1, a4
9

Let an
an2  bn  c. Then: Let an
an2  bn  c.
a0
a
02  b
0  c
7 ⇒ c
7 Then: a0
a
02  b
0  c
3 ⇒ c
3
a1
a
12  b
1  c
6 ⇒ a bc
6 a2
a
22  b
2  c
1 ⇒ 4a  2b  c
1
a b
1
⇒ 4a  2b
4
a3
a
32  b
3  c
10 ⇒ 9a  3b  c
10
⇒ 2a  2b
2
9a  3b
3
3a  b
1 a4
a
42  b
4  c
9 ⇒ 16a  4b  c
9
By elimination: a  b
1 ⇒ 16a  4b
12
3a  b
1 ⇒ 4a  4b
3
2a
2
a
1 ⇒ b
2 By elimination: 2a  b
2
4a  b
3
Thus, an
n2  2n  7.
2a
1
1
a
2 ⇒ b
1
1 2
Thus, an
2n  n  3.
 Section 9.4 Mathematical Induction 867

60. a0
3, a2
0, a6
36
Let an
an2  bn  c. Then:
a0
a
02  b
0  c
3 ⇒ c
3
a2
a
22  b
2  c
0 ⇒ 4a  2b  c
0
4a  2b
3
a6
a(62  b
6  c
36 ⇒ 36a  6b  c
36
36a  6b
33
12a  2b
11

By elimination: 4a  2b
3
12a  2b
11
8a
14
7
a
4 ⇒ b
5
7
Thus, an
4n2  5n  3.

61. (a) 120.3 122.5 124.9 127.1 129.4 130.3

First differences: 2.2 2.4 2.2 2.3 0.9
(b) The first differences are not equal, but are fairly close to each other, so a linear model can be used.
If we let m
2.2, then b
120.3  2.2
8
102.7
an  2.2n  102.7
(c) an  2.08n  103.9 is obtained by using the regression feature of a graphing utility.
(d) For 2008, let n
18.
an  2.2
18  102.7
142.3
an
2.08
18  103.9
141.34
These are very similar.

62. Answers will vary. See page 626. 63. True. P7 may be false. 64. False. P1 must be proven to be true.

65. True. If the second differences are all zero, then the first 66. False. It has n  2 second differences.
differences are all the same, so the sequence is arithmetic.

67.
2x2  12

2x2  1
2x2  1
4x 4  4x2  1 68.
2x  y2
4x2  4xy  y2

69.
5  4x3
64x3  240x2  300x  125 70.
2x  4y3
8x3  48x2y  96xy2  64y3

x y
71. f
x

x3 10
8
(a) Domain: All real numbers x except x
3 6

(b) Intercept:
0, 0 4

2

(c) Vertical asymptote: x
3 − 12− 10 −8 − 6 − 4 2 4

x

(0, 0)
Horizontal asymptote: y
1 −4
−6
(d)
x 5 4 2 1 1
f
x 5
 12 1
2 4 2 4
868 Chapter 9 Sequences, Series, and Probability

x2
72. g
x
y
x2  4
8
(a) Domain: All real numbers x except x
± 2 6
4
(b) Intercept:
0, 0 2
(0, 0)
x
(c) Vertical asymptotes: x
2, x
2 − 8 −6 − 4 4 6 8

Horizontal asymptote: y
1
(d)
x 4 3 1.5 0 1.5 3 4

g
x 4 9
 79  79 9 4
3 5 0 5 3

t7 5x
73. h
t
74. f
x

t 1x
(a) Domain: All real numbers t except t
0 (a) Domain: All real numbers x except x
1
(b) Intercept:
7, 0 (b) x-intercept:
5, 0
(c) Vertical asymptote: t
0 y-intercept:
0, 5
Horizontal asymptote: y
1 (c) Vertical asymptote: x
1
(d) Horizontal asymptote: y
1
t 2 1 1 2 3
(d)
h
t 9
2 8 6  52 3
4
x 8 5 2 0 2 3 5 7

f
x  31 0 1 5 7 4  25 2
y

8
4
6
2 (0, 5)
4
t
−8 −6 −4 −2 2 6 8
(− 5, 0) 2 4 6 8
(7, 0) x
−4
−2
−6
−4
−8
−6
−8

Section 9.5 The Binomial Theorem

■ You should be able to use the formula

n
n  1 n2 2 . . .

x  yn
xn  nxn1y  x y   nCr xnryr  . . .  yn
2!


n! n
where nCr
, to expand
x  yn. Also, nCr
.

n  r!r! r

■ You should be able to use Pascal’s Triangle in binomial expansion.

Vocabulary Check
1. binomial coefficients 2. Binomial Theorem/Pascal’s Triangle

3.
n
r 
or nCr 4. expanding a binomial
 Section 9.5 The Binomial Theorem 869

5! 5  4
10 8! 87 12!
1. 5C3

2. 8C6


28 3. 12C0

1
3!2! 2 1 6!  2! 2  1 0!12!

20! 20! 20  19  18  17  16
4. 20C20

1 5. 20C15


15,504
20!  0! 15!5! 54321

6.

12!



12  11  10  9  8  7!
12  11  10  9  8
792
12C5
5!  7! 5!7! 54321

10  9  8  7  6!
7. 104
6!4!
10!


6!
24

210

8. 106
6!10! 4!

10  96! 8 4! 7  6!
104 392817
210

100  99
100  99  98! 100  99
9. 100
98 2!98!


100!


21

4950 10. 100
2  98!  2!


100!


98!  2!


21

4950

11. 1 12. 1
1 1 1 1
1 2 1 1 2 1
1 3 3 1 1 3 3 1
1 4 6 4 1 11 4 6 4
1 5 10 10 5 1 1
5 10 10 5 1
1 6 15 20 15 6 1 1 6 15 20 15 6 1
1 7 21 35 35 21 7 1 1 7 21 35 35 21 7 1
1 8 28 56 70 56 28 8 1 1 8 28 56 70 56 28 8 1

85
56, the 6th entry in the 8th row. 87
8, the 8th entry in the 8th row.
13. 1 14. 1
1 1 1 1
1 2 1 1 2 1
1 3 3 1 1 3 3 1
1 4 6 4 1 1 4 1 6 4
1
5 10 10 5 1 1 5 10 10 5 1
1 6 15 20 15 6 1 1 6 15 20 15 6 1
1 7 21 35 35 21 7 1
6C3
20, the 4th entry in the 6th row.
7C4
35, the 5 entry in the 7 row.
th th

15.
x  14
4C0x4  4C1x3
1  4C2x2
12  4C3x
13  4C4
14

x4  4x3  6x2  4x  1

16.
x  16
6C0 x6  6C1x5
1  6C2x 4
12  6C3x3
13  6C4x2
14  6C5x
15  6C6
16

x6  6x5  15x 4  20x3  15x2  6x  1

17.
a  64
4C0a4  4C1a3
6  4C2a2
62  4C3a
63  4C4
64

1a4  4a3
6  6a2
62  4a
63  1
64

a4  24a3  216a2  864a  1296
870 Chapter 9 Sequences, Series, and Probability

18.
a  55
5C0 a5  5C1a4
5  5C2a3
52  5C3a2
53  5C4a
54  5C5
55

a5  25a4  250a3  1250a2  3125a  3125

19.
y  43
3C0y3  3C1y2
4  3C2y
42  3C3
43

1y3  3y2
4  3y
42  1
43

y3  12y2  48y  64

20.
y  25
5C0 y5  5C1y4
2  5C2 y3
22  5C3y2
23  5C4y
24  5C5
25

y5  10y4  40y3  80y2  80y  32

21.
x  y5
5C0x5  5C1x4y  5C2x3y2  5C3x2y3  5C4xy4  5C5y5

x5  5x4y  10x3y2  10x2y3  5xy4  y5

22.
c  d3
3C0c 3  3C1c 2d  3C2cd 2  3C3d 3

c3  3c2d  3cd 2  d 3

23.
r  3s6
6C0r6  6C1r5
3s  6C2r4
3s2  6C3r3
3s3  6C4r2
3s4  6C5r
3s5  6C6
3s6

1r6  6r5
3s  15r 4
3s2  20r3
3s3  15r2
3s4  6r
3s5  1
3s6

r6  18r5s  135r4s2  540r3s3  1215r2s4  1458rs5  729s6

24.
x  2y4
4C0 x4  4C1x3
2y  4C2x2
2y2  4C3x
2y3  4C4
2y4

x4  4x3
2y  6x2
4y2  4x
8y3  16y4

x4  8x3y  24x2y2  32xy3  16y4

25.
3a  4b5
5C0
3a5  5C1
3a4
4b  5C2
3a3
4b2  5C3
3a2
4b3  5C4
3a
4b4  5C5
4b5

1
243a5  5
81a4
4b  10
27a3
16b2  10
9a2
64b3  5
3a
256b4 
1
1024b5

243a5  1620a4b  4320a3b2  5760a2b3  3840ab4  1024b5

26.
2x  5y5
5C0
2x5  5C1
2x4
5y  5C2
2x3
5y2  5C3
2x2
5y3  5C4
2x
5y4  5C5
5y5

2x5  5
2x4
5y  10
2x3
5y2  10
2x2
5y3  5
2x
5y4 
5y5

32x5  400x4y  2000x3y2  5000x2y3  6250xy4  3125y5

27.
2x  y3
3C0
2x3  3C1
2x2
y  3C2
2x
y2  3C3
y3

1
8x3 
3
4x2
y 
3
2x
y2 
1
y3

8x3  12x2y  6xy2  y3

28.
7a  b3
3C0
7a3  3C1
7a2
b  3C2
7a
b2  3C3
b3

7a3  3
7a2
b  3
7a
b2 
b3

343a3  147a2b  21ab2  b3
 Section 9.5 The Binomial Theorem 871

29.
x2  y24
4C0
x24  4C1
x23
y2  4C2
x22
y22  4C3
x2
y23  4C4
y24


1
x8 
4
x6y2 
6
x4y4 
4
x2y6 
1
y8

x8  4x6y2  6x4y4  4x2y6  y8

30.
x2  y26
6C0
x26  6C1
x25
y2  6C2
x24
y22  6C3
x23
y23  6C4
x22
y24  6C5
x2
y25  6C6
y26

x12  6x10y2  15x8y4  20x6y6  15x4y8  6x2y10  y12

 x  y x x y  C x y x y  x y

5 5 4 3 2
1 1 1 1 1 1
31.
5C0  5C1 5 2
2
 5C3 3
 5C4 4
 5C5y5
1 5y 10y2 10y3 5y4

5
 4 3  2   y5
x x x x x

 x  2y x  x 
2y  C  x 
2y  x 
2y  x 
2y  x 
2y

1 6 1 6 1 5 1 4 1 3 1 2 1
32.
6C0  6C1 6 2
2  6C3 3  6C4 4  6C5 5  6C6
2y6

x  x  y  15
4 x  y x y x y  x y

1 6 1 5 1 4 1 3 1 2 1

1  6
2 2
 20
8 3
 15
16 4
 6
32 5
 1
64y 6

1 12y 60y2 160y3 240y4 192y5

  4     64y6
x6 x5 x x3 x2 x

33. 2
x  34  5
x  32
2x4  4
x3
3  6
x2
32  4
x
33  34  5x2  2
x
3  32

2
x4  12x3  54x2  108x  81  5
x2  6x  9

2x4  24x3  113x2  246x  207

34. 3
x  15  4
x  13
35C0 x5  5C1x 4
1  5C2x3
12  5C3x2
13  5C4x
14  5C5
15
 43C0 x3  3C1x2
1  3C2x
12  3C3
13

3
1x5  5x 4  10x3  10x2  5x  1  4
1x3  3x2  3x  1

3x5  15x 4  26x3  18x2  3x  1

35. 5th Row of Pascal’s Triangle: 1 5 10 10 5 1

2t  s5
1
2t5  5
2t4
s  10
2t3
s2  10
2t2
s3  5
2t
s4  1(s5

32t5  80t4s  80t3s2  40t2s3  10ts4  s5

36. 4th Row of Pascal’s Triangle: 1 4 6 4 1

3  2z4
34  4
33
2z  6
32
2z2  4
3
2z3 
2z4

81  216z  216z2  96z3  16z4

37. 5th Row of Pascal’s Triangle: 1 5 10 10 5 1

x  2y5
1x5  5x4
2y  10x3
2y2  10x2
2y3  5x
2y4  1
2y5

x5  10x4y  40x3y2  80x2y3  80xy4  32y5

38. 6th Row of Pascal’s Triangle: 1 6 15 20 15 6 1

2v  36

2v6  6
2v5
3  15
2v4
32  20
2v3
33  15
2v2
34  6
2v
35 
36

64v6  576v5  2160v4  4320v3  4860v2  2916v  729
872 Chapter 9 Sequences, Series, and Probability

39. The 4th term in the expansion of
x  y10 is 40. The 7th term in the expansion of
x  y6 is

10C3 x
103y 3
120x7y 3. 6C6 x
66

y6
1  x 0y 6
y 6.

41. The 3rd term in the expansion of
x  6y5 is 42. The 4th term in the expansion of
x  10z7 is

5C2 x
52
6y2
10x3
36y 2
360x3y 2. 7C3 x
73
10z3
35  x 4
1000z3
35,000x 4z 3.

43. The 8th term in the expansion of
4x  3y9 is 44. The 5th term in the expansion of
5a  6b5 is

9C7
4x97
3y7
36
16x2
2187y7 5C4
5a54
6b4
5 
5a
1296b4
32,400ab 4.

1,259,712x2y7.

45. The 9th term in the expansion of
10x  3y12 is 46. The 7th term in the expansion of
7x  2y15 is

12C8
10x128
3y8
495
10,000x4
6561y 8 15C6
7x156
2y6
5005 
40,353,607x9
64y6

32,476,950,000 x4y8.  1.293  1013x 9 y 6.

47. The term involving x5 in the expansion of
x  312 is 48. The term involving x8 in the expansion of
x2  312 is
12! 12!
12C7x
5
37
 37x5
1,732,104x5. 12C8
x24
38
 38x8
3,247,695x8.
7!5!
12  8!8!
The coefficient is 1,732,104. The coefficient is 3,247,695.

49. The term involving x8y2 in the expansion of
x  2y10 is 50. The term involving x2y8 in the expansion of
4x  y10 is
10! 10!
10C2x
8
2y2
 4x8y2
180x8y2. 10C8
4x2
y8


10  8!8!
 16x2y8
720x2y8.
2!8!
The coefficient is 180. The coefficient is 720.

51. The term involving x4y5 in the expansion of
3x  2y9 is 52. The term involving x6y2 in the expansion of
2x  3y8 is
9! 8!
9C5
3x4
2y5

81x4
32y5
326,592x4y5. 8C2
2x6
3y2

64x6
9y2
16,128x6y2.
5!4!
8  2!2!
The coefficient is 326,592. The coefficient is 16,128.

53. The term involving x8y6

x24y6 in the expansion of 54. The term involving z 4 t 8 in the expansion of
z 2  t10 is
10! 2 4 6 10!

x2  y10 is 10C6
x24y6

x  y
210x8y6. 10C8
z22
t8
z4 t 8
45z4 t 8.
4!6!
10  8!8!
The coefficient is 210. The coefficient is 45.

55.
x  3

x   4
x 
3  6
x
32  4
x 
33 
34

4 4 3 2

x2  12x x  54x  108 x  81

x2  12x32  54x  108x12  81

56.
2 t  1

2 t   3
2 t 
1  3
2 t 
12 
13

3 3 2

8t32  12t  6t12  1

57.
x23  y133

x233  3
x232
y13  3
x23
y132 
y133

x2  3x43y13  3x23y23  y
 Section 9.5 The Binomial Theorem 873

58.
u35  25

u355  5
u354
2  10
u353
22  10
u352
23  5
u35
24  25

u3  10u125  40u95  80u65  80u35  32

f
x  h  f
x
x  h3  x3 f
x  h  f
x
x  h4  x 4

59.
60.

h h h h
x3  3x2h  3xh2  h3  x3 x 4  4x3h  6x2h2  4xh3  h4  x 4



h h
h
3x2  3xh  h2 h
4x3  6x2h  4xh2  h3



h h

3x2  3xh  h2, h  0
4x3  6x2h  4xh2  h3, h  0

1 1

f
x  h  f
x x  h  x f
x  h  f
x xh x
61.
62.

h h h h
x  h  x x  h  x x 
x  h


h
 x  h  x x
x  h


h

x  h  x


h
x  h  x h
x
x  h
1


,h0 h
x  h  x
1

 ,h0
x
x  h

63.
1  i4
4C0
14  4C1
13i  4C2
12i 2  4C3
1i 3  4C4i 4

1  4i  6  4i  1

4

64.
2  i5
5C025  5C124i  5C223i2  5C322i3  5C42i4  5C5i5

32  80i  80  40i  10  i

38  41i

65.
2  3i6
6C026  6C125
3i  6C224
3i2  6C323
3i3  6C422
3i4  6C52
3i5  6C6
3i6

1
64 
6
32
3i  15
16
9  20
8
27i  15
4
81  6
2
243i 
1
729

64  576i  2160  4320i  4860  2916i  729

2035  828i

66.
5  9 3

5  3i3

53  3  52
3i  3  5
3i2 
3i3

125  225i  135  27i

10  198i
874 Chapter 9 Sequences, Series, and Probability

3
 2  
1 3 1
67.
2
i

8

13  3
12
3i  3
1
3i2 
3i3
1


8
1  3 3i  9  3 3i

1

68.
5  3i4
54  4  53
3i  6  52
3i2  4  5
3i3 
3i4

625  500 3i  450  60 3i  9

184  440 3i

69.
1.028

1  0.028

1  8
0.02  28
0.022  56
0.023  70
0.024  56
0.025  28
0.026  8
0.027 
0.028

1  0.16  0.0112  0.000448  . . .  1.172

70.
2.00510

2  0.00510
210  10
29
0.005  45
28
0.0052  120
27
0.0053  210
26
0.0054

 252
25
0.0055  210
24
0.0056  120
23
0.0057  45
22
0.0058
 10
2
0.0059 
0.00510

1024  25.6  0.288  0.00192  0.0000084  . . .
 1049.890

71.
2.9912

3  0.0112

312  12
311
0.01  66
310
0.012  220
39
0.013  495
38
0.014

 792
37
0.015  924
36
0.016  792
35
0.017  495
34
0.018

 220
33
0.019  66
32
0.0110  12
3
0.0111 
0.0112
 531,441  21,257.64  389.7234  4.3303  0.0325  0.0002  . . .  510,568.785

72.
1.989

2  0.029
29  9
28
0.02  36
27
0.022  84
26
0.023  126
25
0.024

 126
24
0.025  84
23
0.026  36
22
0.027  9
2
0.028 
0.029

512  46.08  1.8432  0.043008  0.00064512  0.0000064512  . . .
 467.721

73. f
x
x3  4x 4

g
x
f
x  4 g f
−8 4


x  43  4
x  4

x3  3x2
4  3x
42 
43  4x  16 −4

x3  12x2  48x  64  4x  16

x3  12x2  44x  48
The graph of g is the same as the graph of f shifted four units to the left.
 Section 9.5 The Binomial Theorem 875

74. f
x
x 4  4x 2  1, g
x
f
x  3 5

g
x
f
x  3 f g


x  34  4
x  32  1 −4 8


x 4  4x3
3  6x2
32  4x
33 
34  4
x2  6x  9  1 −3

x 4  12x3  54x2  108x  81  4x2  24x  36  1

x 4  12x3  50x2  84x  46
The graph of g is the same as the graph of f shifted three units to the right.

2 2  8
35168  0.273 4 4 6416,384  0.2503

1 4 1 3 7! 1 1 1 1 1 3 3 7 1 2187
75. 7C4
76. 10C3
120
3!4! 16

3 3  81
708181  0.171 2 2 1616  0.273

4 4 1 4 1 4 1 1
1 2 8! 1 16 1 16
77. 8C4
78. 8C4
70
4!4! 81

79. (a) f
t  0.0025t 3  0.015t 2  0.88t  7.7 (d) 60

g
(b) 24

0 13
0

0 13

(e) For 2008 use t
18 in f
t and t
8 in g
t.

0

(c) g
t
f
t  10
0.0025
t  103  0.015
t  102 f
18
33.26 gallons

 0.88
t  10  7.7 g
8
33.26 gallons

0.0025
t 3  30t 2  300t  1000 Both models yield the same answer.

 0.015
 20t  100  0.88
t  10  7.7

t2 (f ) The trend is for the per capita consumption of bottled
water to increase. This may be due to the increasing

0.0025t 3  0.06t2  1.33t  17.5 concern with contaminants in tap water.

80. f
t
0.031t 2  0.82t  6.1

(a) g
t
f
t  10 (b) 60
g

0.031
t  102  0.82
t  10  6.1
f

0.031
t 2  20t  100  0.82
t  10  6.1

0.031t 2  1.44t  17.4
0 20
0

(c) f
t: f
17
2007

g
t: g
7
2007

81. True. The coefficients from the Binomial Theorem can be 82. False. Expanding binomials that represent differences is
used to find the numbers in Pascal’s Triangle. just as accurate as expanding binomials that represent
sums, but for differences the coefficient signs are
alternating.

83. False. 84. The first and last numbers in each row are 1. Every other
number in each row is formed by adding the two numbers
The coefficient of the x10 -term is 12C7
37
1,732,104.
immediately above the number.
The coefficient of the x14 -term is 12C5
35
192,456.
876 Chapter 9 Sequences, Series, and Probability

85. 1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
1 6 15 20 15 6 1
1 7 21 1 35 35 21 7
1 8
56 70 562828 8 1
1 9 36 84 126 126 84 36 9 1
1 10 45 120 210 252 210 120 45 10 1

86.
n  1 terms 87. The signs of the terms in the expansion of
x  yn
alternate from positive to negative.

n!
88. The functions f
x

1  x3 and k
x
1  3x  3x2  x3 89. nCnr

(choices (a) and (d)) have identical graphs, because k
x is
n 
n  r!
n  r!
the expansion of f
x. n!


4
r!
n  r!
g
n!
−6 6


n  r!r!
h p k=f

−4

nCr

90. 0

1  1n
nC0  nC1  nC2  nC3  . . . ± nCn

n! n!
91. nCr  nCr1
 92. nC0  nC1  nC2  nC3  . . .  nCn

1  1n
2n

n  r!r!
n  r  1!
r  1!
n!
n  r  1!
r  1!  n!
n  r!r!



n  r!r!
n  r  1!
r  1!
n!
n  r  1!
r  1!  r!
n  r!



n  r!r!
n  r  1!
r  1!
n!
r  1!
n  r  1!  r
n  r!



n  r!r!
n  r  1!
r  1!
n!
n  r!
n  r  1  r



n  r!r!
n  r  1!
n!n  1


r!
n  r  1!

n  1!



n  1  r!r!

n1Cr

93. The graph of f
x
x2 is y

94. The graph of f
x
x2 has y

shifted three units to the 8

been reflected in the x–axis, 5
right. Thus, g
x

x  32. shifted two units to the left, 4
6 3
and shifted three units
4 upward. Thus,
2
g
x

x  22  3. −5 − 3 − 2 −1 1 2 3 4 5
x

−2
x
−3
−4 −2 2 4 6
−4
−2
−5
 Section 9.6 Counting Principles 877

95. The graph of f
x
x is y 96. The graph of f
x
x has y

shifted two units to the left 5

been reflected in the x–axis, 3
and shifted one unit upward. shifted one unit to the left, 2
4
Thus, g
x
x  2  1. and shifted two units 1
3 x
downward. Thus, −3 −2 −1 1 2 3 4 5
2
g
x
 x  1  2.
1

x
−3 −2 −1 1 2 3 −4
−1 −5

I
 2
1.2 2.3

97. A1

1 4 5

6
4 
5
5 5 6

4 5
5 6    98. A
4

1
0
0
1
0.1R2  R1 →

21 1.94

1
0
0.1
1 
1 1.9


2R1  R2 → 0 0.2

1
2
0.1
1.2 
1 1.9

5R2 → 0  1

1
10
0.1
6 
1.9R2  R1 → 1

 
0 20 11.5
0 1
10 6

I
A1

20 
11.5
A1

10 6

Section 9.6 Counting Principles

■ You should know The Fundamental Counting Principle.

n!
■ nPr
is the number of permutations of n elements taken r at a time.

n  r!

■ Given a set of n objects that has n1 of one kind, n2 of a second kind, and so on, the number of distinguishable
permutations is
n!
.
n1!n2! . . . nk!

n!
■ nCr
is the number of combinations of n elements taken r at a time.

n  r!r!

Vocabulary Check
1. Fundamental Counting Principle 2. permutation
n!
3. nPr
4. distinguishable permutations

n  r!
5. combinations

1. Odd integers: 1, 3, 5, 7, 9, 11 2. Even integers: 2, 4, 6, 8, 10, 12 3. Prime integers: 2, 3, 5, 7, 11

6 ways 6 ways 5 ways
878 Chapter 9 Sequences, Series, and Probability

4. Greater than 9: 10, 11, 12 5. Divisible by 4: 4, 8, 12 6. Divisible by 3: 3, 6, 9, 12

3 ways 3 ways 4 ways

7. Sum is 9: 1  8, 2  7, 3  6, 4  5, 5  4, 8. Two distinct integers whose sum is 8:

6  3, 7  2, 8  1 1  7, 2  6, 3  5, 5  3, 6  2, 7  1
8 ways 6 ways

9. Amplifiers: 3 choices 10. Chemist: 5 choices

Compact disc players: 2 choices Statistician: 3 choices
Speakers: 5 choices Total: 5  3
15 ways
Total: 3  2  5
30 ways

11. Math courses: 2 12. 1st position: 2

Science courses: 3 2nd position: 1
Social sciences and 3rd position: 6
humanities courses: 5
4th position: 5
Total: 2  3  5
30 schedules 5th position: 4
6th position: 3
7th position: 2
8th position: 1
Total: 2!6!
1440 ways

13. 26
64 14. 212
4096 ways

15. 26  26  26  10  10  10  10
175,760,000 16. 24  24  10  10  10  10
5,760,000

distinct license plate numbers distinct license plates

17. (a) 9  10  10
900 18. (a) 9  10  10  10
9000 numbers

(b) 9  9  8
648 (b) 9  9  8  7
4536 numbers
(c) 9  10  2
180 (c) 4  10  10  10
4000 numbers
(d) 6  10  10
600 (d) 9  10  10  5
4500 numbers

19. 403
64,000 20. 503
125,000 combinations

21. (a) 8  7  6  5  4  3  2  1
40,320 22. (a) 8!
40,320 orders

(b) 8  1  6  1  4  1  2  1
384 (b) 4!4!
576 orders

n! n! 8!
23. nPr
24. nPr
25. 8P3

87  6
336

n  r!
n  r! 5!
4! 5! 5!
So, 4P4

4!
24. 5P5


120
0!
5  5! 0!

20! 5! 7!
26. 20P2

20  19
380 27. 5P4

120 28. 7P4

76  5  4
840
18! 1! 3!
 Section 9.6 Counting Principles 879

29. 14  nP3
n2P4 Note: n ≥ 3 for this to be defined.

n  2!

n  3!

n  2!
n!
14

14n
n  1
n  2

n  2
n  1n
n  1 (We can divide here by n
n  1 since n  0, n  1.)
14
n  2

n  2
n  1
14n  28
n2  3n  2
0
n2  11n  30
0

n  5
n  6
n
5 or n
6

30. nP5
18  n2P4 Note: n ≥ 6 for this to be defined.

n  2!

n!

18

n  5!
n  6!
n
n  1
n  2
n  3
n  4
18
n  2
n  3
n  4
n  5
n2  n
18n  90


We can divide by
n  2,
n  3,
n  4 since n  2, n  3, and n  4.
n2  19n  90
0

n  9
n  10
0
n
9 or n
10

31. 20P5
1,860,480 32. 100P5
9,034,502,400 33. 100P3
970,200

34. 10P8
1,814,400 35. 20C5
15,504 36. 10C7
120

37. 5!
120 ways 38. 6!
720 ways

12!
39. 12P4

12  11  10  9
11,880 ways 40. 4!
24 orders
8!

7! 7! 8!
41.

420 42.
56
2!1!3!1! 2!3! 3!5!

7! 7! 11! 11!
43.

76  5  4  3
2520 44.

34,650
2!1!1!1!1!1! 2! 1!4!4!2! 4!4!2!

45. ABCD BACD CABD DABC 46. ABCD

ABDC BADC CADB DACB ACBD
ACBD BCAD CBAD DBAC DBCA
ACDB BCDA CBDA DBCA DCBA
ADBC BDAC CDAB DCAB
ADCB BDCA CDBA DCBA

15! 6! 40!
47. 15 P9

1,816,214,400 48. 6 P3
3!
120 49. 40C12

5,586,853,480 ways
6! 28!12!
different batting orders
880 Chapter 9 Sequences, Series, and Probability

100!
50. 100C14
51. 6C2
15

100  14!14!
The 15 ways are listed below.
100!

AB, AC, AD, AE, AF, BC, BD, BE,
86!14!
BF, CD, CE, CF, DE, DF, EF

4.42  1016

35!
52. 20C5
15,504 groups 53. 35C5

324,632 ways 54. 40C6
3,838,380 ways
30!5!

55. There are 7 good units and 3 defective units.

7!
(a) 7C4

35 ways
3!4!
7! 3!
(b) 7C2  3C2
5!2!  1!2!
21  3
63 ways
7! 7! 3! 7! 3!
(c) 7C4  7C3  3C1  7C2  3C2

3!4! 4!3!
 2!1!  5!2!  1!2!

35  35  3  21  3

203 ways

3! 12! 12  11
56. (a) 3C2

3 relationships (c) 12C2


66 relationships
2!1! 2!10! 2
8! 87 20! 20  19
(b) 8C2


28 relationships (d) 20C2


190 relationships
2!6! 2 2!18! 2

57. (a) Select type of card for three of a kind: 13C1

Select three of four cards for three of a kind: 4C3

Select type of card for pair: 12C1

Select two of four cards for pair: 4C2

13! 4! 12! 4!
13C1  4C3  12C1  4C2

13  1!1! 
4  3!3! 
12  1!1! 
4  2!2!
3744

(b) Select two jacks: 4C2

Select three aces: 4C3
4! 4!
4C2  4C3

4  2!2! 
4  3!3!
24

8! 8! 8765
58. (a) 8C4



70 ways

8  4!4! 4!4! 432
3! 5!
(b) 3C2  5C2

3  2!2! 
5  2!2!
3  10
30 ways

7! 12! 20!
59. 7C1  12C3  20C2
 
292,600

7  1!1!
12  3!3!
20  2!2!

60. (a)
195
99
89
105
74

1.335  1010 different faces
(b)
89
105
74
691,530 different faces
 Section 9.6 Counting Principles 881

61. 5C2  5
10  5
5 diagonals 62. 6C2  6
15  6
9 diagonals

63. 8C2  8
28  8
20 diagonals 64. 10C2  10
45  10
35 diagonals

65. (a) 53C5 
42
120,526,770 66. (a) Permutation because order matters
(b) 1. If the jackpot is won, then there is only one (b) Combination because order does not matter
winning number.
(c) Permutation because order matters
(c) There are 22,957,480 possible winning numbers in the
state lottery, which is less than the possible number of (d) Combination because order does not matter
winning Powerball numbers.

67. False. 68. True by the definition of the Fundamental

It is an example of a combination. Counting Principle

69. nCr
nCnr They are the same. 70. 10P6 > 10C6
Changing the order of any of the six elements selected
results in a different permutation but the same combination.

n! n! n! n! n! n! n!
71. nPn1



P 72. nCn




C

n 
n  1! 1! 0! n n
n  n!n! 0!n! n!0!
n  0!0! n 0

n! n! n!
73. nCn1

74. nCr


n 
n  1!
n  1!
1!
n  1!
n  r!r!
n! n
n  1
n  2 . . .
n  r  1
n  r!


C


n  1!1! n 1
n  r!r!
n
n  1
n  2 . . .
n  r  1


r!

nPr


r!

75. 100P80
3.836  10139 76. The symbol nPr denotes the number of ways to choose
and order r elements out of a collection of n elements.
This number is too large for some calculators to evaluate.

77. f
x
3x2  8 78. g
x
x  3  2

(a) f
3
3
3  8
35
2
(a) g
3
3  3  2
2
(b) f
0
3
02  8
8 (b) g
7
7  3  2
4
(c) f
5
3
5  8
83
2
(c) g
x  1
x  1  3  2
x  2  2


x2  2x  5, x ≤ 4

79. f
x
 x  5  6  80. f
x

x2  2, x > 4
(a) f
5
 5  5  6
10  6
4
(a) f
4

42  2
4  5
29
(b) f
1
 1  5  6
6  6
0
(b) f
1

12  2
3
(c) f
11
 11  5  6
6  6
0
(c) f
20

202  2
20  5
445
882 Chapter 9 Sequences, Series, and Probability

4 3
81. x  3
x  6 82. 
1
t 2t

x  32

x  62 4 3

2t 
2t
1
2t
x  3
x2  12x  36 t 2t
0
x2  13x  39 8  3
2t
13 ± 13 5.5
t
By the Quadratic Formula we have: x

2
13  13
x
is extraneous.
2
13  13
The only valid solution is x
 8.30.
2

83. log2
x  3
5 84. ex3
16

x  3
25 x

ln 16
3
x  3
32
x
3 ln 16  8.32
x
35

Section 9.7 Probability

You should know the following basic principles of probability.

■ If an event E has n
E equally likely outcomes and its sample space has n
S equally likely outcomes, then
the probability of event E is
n
E
P
E
, where 0 ≤ P
E ≤ 1.
n
S
■ If A and B are mutually exclusive events, then P
A
B
P
A  P
B.
If A and B are not mutually exclusive events, then P
A
B
P
A  P
B  P
A  B.
■ If A and B are independent events, then the probability that both A and B will occur is P
AP
B.
■ The complement of an event A is denoted by A and its probability is P
A 
1  P
A.

Vocabulary Check
1. experiment; outcomes 2. sample space
3. probability 4. impossible; certain
5. mutually exclusive 6. independent
7. complement 8. (a) iii (b) i (c) iv (d) ii

1. 
H, 1,
H, 2,
H, 3,
H, 4,
H, 5,
H, 6, 2. {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12}

T, 1,
T, 2,
T, 3,
T, 4,
T, 5,
T, 6

3. ABC, ACB, BAC, BCA, CAB, CBA

4. 
red, red,
red, blue,
red, yellow,
blue, blue,
blue, yellow
 Section 9.7 Probability 883

5. AB, AC, AD, AE, BC, BD, BE, CD, CE, DE 6. {SSS, SSF, SFS, FSS, SFF, FFS, FSF, FFF}

7. E
HHT, HTH, THH 8. E
HHH, HHT, HTH, HTT

n
E 3 n
E 4 1
P
E

P
E



n
S 8 n
S 8 2

9. E
HHH, HHT, HTH, HTT, THH, THT, TTH 10. E
HHH, HHT, HTH, THH
n
E 7 n
E 4 1
P
E

P
E



n
S 8 n
S 8 2

11. E
K♣, K♦, K♥, K♠, Q♣, Q♦, Q♥, Q♠, J♣, J♦, J♥, J♠ 12. The probability that the card is not a face card is the
n
E 12 3 complement of getting a face card. (See Exercise 11.)
P
E



n
S 52 13 3 10
P
E 
1  P
E
1 

13 13

13. E
K♦, K♥, Q♦, Q♥, J♦, J♥ 14. There are six possible cards in each of 4 suits: 6  4
24
n
E 6 3 n
E 24 6
P
E


P
E



n
S 52 26 n
S 52 13

15. E

1, 3,
2, 2,
3, 1 16. E
{(1, 6), (2, 5), (2, 6), (3, 4), (3, 5), (3, 6), (4, 3),
n
E 3 1 (4, 4), (4, 5), (4, 6), (5, 2), (5, 3), (5, 4), (5, 5), (5, 6),
P
E


(6, 1), (6, 2), (6, 3), (6, 4), (6, 5), (6, 6)}
n
S 36 12
n
E 21 7
P
E



n
S 36 12

17. Use the complement. 18. E

1, 1),
1, 2,
2, 1,
6, 6
E

5, 6,
6, 5,
6, 6 n
E 4 1
P
E



n
 3 1 n
S 36 9
P
E 



n
S 36 12
1 11
P
E
1  P
E
1 

12 12

19. E3

1, 2,
2, 1, n
E3
2 20. E
{(1, 1), (1, 2), (1, 4), (1, 6), (2, 1), (2, 3), (2, 5),
E5

1, 4,
2, 3,
3, 2,
4, 1, n
E5
4 (3, 2), (3, 4), (3, 6), (4, 1), (4, 3), (4, 5), (5, 2), (5, 4),
(5, 6), (6, 1), (6, 3), (6, 5)}
E7

1, 6,
2, 5,
3, 4,
4, 3,
5, 2,
6, 1, n
E7
6
n
E 19
E
E3
E5
E7 P
E


n
S 36
n
E
2  4  6
12
n
E 12 1
P
E



n
S 36 3

3C2 3 1 2C2 1 4C2 6 2

21. P
E


22. P
E

23. P
E



6C2 15 5 6C2 15 6C2 15 5

24. P
E
1C1  2C1  1C1  3C1  2C1  3C1 25. P
E
1  P
E
1  0.7
0.3
6C2

2  3  6 11



15 15
884 Chapter 9 Sequences, Series, and Probability

26. P
E
1  P
E
1  0.36
0.64 27. P
E
1  P
E
1  14
34 28. 1  P
E
1  23
13

29. P
E
1  P
E 30. 1  P
E 
1  0.92
0.08 31. P
E
1  P
E 
1  17 18
35
35

1  0.14
0.86

32. 1  P
E
1  100

61 39

100 33. (a) 290
500
0.58
58% 34. (a) 34
100
0.34
34%
478 45
(b) 500
0.956
95.6% (b) 100
0.45
45%
2 23
(c) 500
0.004
0.4% (c) 100
0.23
23%

59 672 112
35. (a) 0.24
1011  243 adults 36. (a) 59%
37. (a)

100 1254 209
1
(b) 2%
17 582 97
50 (b) 6%  11%
17%
(b)

100 1254 209
16
(c) 52%  12%
64%
13 87 672  124 548 274
25 (c) 1 
(c)


100 100 1254 1254 627

71  53 124 62
38. (a)

39. p  p  2p
1 40. 1  0.37  0.44
0.19
19%
202 202 101
p
0.25
62 39
(b) 1 

101 101 1
Taylor: 0.50

2
24 12
(c)

202 101 1
Moore: 0.25

4
1
Jenkins: 0.25

4

41. (a) 15C10

3003


21
 0.016 (b) 15C8  5C2
64,350
225  0.348
20C10 184,756 1292 C
20 10 184,756 646

(c) 15C9  5C1  15C10
25,025  3003
28,028

49
 0.152
20C10 20C10 184,756 184,756 323

42. Total ways to insert paychecks: 5!
120 ways

5 correct: 1 way
4 correct: not possible
3 correct: 5C3
10 ways (because once you choose 1 correct: 5  3  3
45 ways (five ways to choose
the three envelopes that will contain the which envelope is paired with the correct
correct paychecks, there is only one way paycheck, three ways to fill the next
to insert the paychecks so that the other envelope incorrectly, then three ways
two are wrong) to fill the envelope whose correct paycheck
was placed in the second envelope, and only
2 correct: 5C3  2
20 ways (because once you
one way to fill the remaining two envelopes
choose the two envelopes that will contain
such that both are incorrect)
the correct paychecks, there are two ways
to fill the next envelope incorrectly, then 0 correct: 120  1  10  20  45
44 ways
only one incorrect way to insert the
remaining paychecks)
45 3 45  20  10  1 19
(a)
(b)

120 8 120 30
 Section 9.7 Probability 885

8! 100!
 95!5!
1 1 8C2  100 5

C 6!2!

0.076
43. (a)
44. (a)
5P5 120 108C7 108!
1 1 101!7!
(b)

4P4 24 8! 25! 25!
 23!2!  22!3!
(b) 8C2  25C2  25C3
6!2!
0.00069
108C7 108!
101!7!

45. (a)
20


5
46. 13C1  4C3  12C1  4C2
13  4  12  6
52 13 52C5 2,598,960
26 1 3744
(b)


52 2 2,598,960
16 4 6
(c)


52 13 4165

9C4 126 14 20 20 1
47. (a)

(4 good units) 48. (a) P
EE

40
 40
4
12C4 495 55
 3C2
108
12
40 40
2
9C2 20 20 1
(b) (2 good units) (b) P
EO or OE
2
12C4 495 55

9C3  3C1
252
28 29 29 841

(c) (3 good units) (c) P
N1 < 30, N2 < 30

40
 40
1600
12C4 495 55
12 28 14 54 40 1 1
At least 2 good units:  
(d) P
N1N1

40
 40
40
55 55 55 55

49.
0.783  0.4746 50.
0.322
0.1024

51. (a) P
SS

0.9852  0.9702 52. (a) P
AA

0.902
0.81
(b) P
S
1  P
FF
1 
0.0152  0.9998 (b) P
NN

0.102
0.01
(c) P
FF

0.0152  0.0002 (c) P
A
1  P
NN
1  0.01
0.99

53. (a) P
BBBB

2 
16

1 1 4 1
54. (a) 38

(b) P
BBBB  P
GGGG

2  
2 
8

1 1 14 4 18 9
(b) 38
19
(c) P
at least one boy
1  P
no boys (c)
2
38  18 20 10
38
38
19

1  P
GGGG
1  16
16  381
1444

1 15 1 1
(d) 38

(e)
18
38  18
38  38
54,872
6859
18 5832 729

1
(f) a. 37
18
b. 37
1
 18 19
c. 37 37
37

d.
1
37  371
1369
1

e.
18
37  18
37  37
50,653
18 5832

The probabilities are better for European roulette.

886 Chapter 9 Sequences, Series, and Probability

452
 4
45 2 3 2 9 7
55. 1 
1
1
1


602 60 16 16

56. (a) If the center of the coin falls within the circle of radius d2 around a vertex, the coin will cover the vertex.
Area in which coin may fall
P
coin covers a vertex
so that it covers a vertex
Total area

2 
d 2
n 


2


nd 4
(b) Experimental results will vary.

57. True. Two events are independent if the occurance of one 58. False. The complement of the event is to roll a number
has no effect on the occurance of the other. greater than or equal to 3 and its probability is 23.

59. (a) As you consider successive people with distinct birthdays, the probabilities must decrease to take
into account the birth dates already used. Because the birth dates of people are independent events,
multiply the respective probabilities of distinct birthdays.
365 364 363 362
(b)
365
 365  365  365
365
(c) P1

1
365
365 364 364 365 
2  1
P2

365
 365
365 P1
365
P1

365 364 363 363 365 
3  1

P3

365
 365  365
365 P2
365
P2

365 364 363 365 
n  1 365 
n  1

Pn

365
 365  365  . . .  365


365
Pn1

(d) Qn is the probability that the birthdays are not distinct which is equivalent to at least two people
having the same birthday.
(e)
n 10 15 20 23 30 40 50
Pn 0.88 0.75 0.59 0.49 0.29 0.11 0.03

Qn 0.12 0.25 0.41 0.51 0.71 0.89 0.97

(f) 23, see the chart above.

60. If a weather forecast indicates that the probability of rain 61. 6x2  8
0
is 40%, this means the meteorological records indicate
6x2
8
that over an extended period of time with similar weather
conditions it will rain 40% of the time. x2
 43
No real solution

62. 4x2  6x  12
0 63. x3  x2  3x
0

2x2  3x  6
0 x
x2  x  3
0
b ± b2  4ac 3 ± 32  4
2
6 x
0 or x2  x  3
0
x


2a 2
2
1 ± 1  4
1
3 1 ± 13
x


3 ± 57 2
1 2


4
 Section 9.7 Probability 887

12 32
64. x 5  x 3  2x
0 65.
3 66.
2x
x x
x
x 4  x2  2
0
12
3x 32
2x2
x
x2  2
x2  1
0
4
x 16
x2
x
0
±4
x
x2  1
0 ⇒ x
±1
x
0, ± 1

2 3 1
67.
4 68. 4

x5 2x  3 2x  3
2
4
x  5 3 1

4
2x  3 2x  3
2
4x  20
4
22
4x
4
2x  3
11

x 4
4
2x  3
2
4
8x  12
8x
8
x
1

3 x 2 5 13
69. 
1 70. 

x2 x2 x x  2 x2  2x
3
x  2  x
x  2
1
x  2
x  2 2
x  2  5x 13

2
x2  2x x  2x
3x  6  x2  2x
x2 4
2x  4  5x
13
x2  x  6
x2  4
4  3x
13
x  6
4
3x
9
x
10
x
3


71. y ≥ 3 y 72. y

x ≥ 1 12

x  y ≥ 8 10
8 4
2
4 x
−8 − 6 − 4 − 2 4 6 8
2
x −4
−4 −2 2 4 6 8 12
−6
−8

x  yy ≥≥ 2
73. 2 y 74. y

x4 2 4
x 3
− 8 − 6 −4 − 2 4 6 8

1
x
−4 −3 1 3 4
−8

− 12 −3
− 14 −4
888 Chapter 9 Sequences, Series, and Probability

Review Exercises for Chapter 9

6
1n5n 72
1. an
2  2. an
3. an

n 2n  1 n!
6
115
1 72
a1
2 
8 a1

5 a1

72
1 2
1  1 1!
6
125
2 10 72
a2
2 
5 a2

a2

36
2 2
2  1 3 2!
6
135
3 72
a3
2 
4 a3

3 a3

12
3 2
3  1 3!
6 7
145
4 20 72
a4
2 
a4

a4

3
4 2 2
4  1 7 4!

155
5 25
6 16
a5
2 
a5

 72 3
2
5  1 9 a5


5 5 5! 5

4. an
n
n  1 5. 2, 2, 2, 2, 2, . . .

a1
1
1  1
0 an
2
1n
a2
2
2  1
2
a3
3
3  1
6
a4
4
4  1
12
a5
5
5  1
20

6. 1, 2, 7, 14, 23, . . . 7. 4, 2, 43, 1, 45, . . .

n: 1 2 3 4 5. . .n 4
an

n
Terms: 1 2 7 14 23 . . . an
Apparent pattern: Each term is 2 less than the square of n,
which implies that an
n2  2.

1 1 1 1
8. 1,  , ,  , , . . . 9. 5!
5  4  3  2  1
120
2 3 4 5
n: 1 2 3 4 5. . .n
1 1 1 1
Terms: 1   . . . an
2 3 4 5
Apparent pattern: Each term is
1n1 times the

1n1
reciprocal of n, which implies that an
.
n

3! 5!
3  2  15! 7!  6! 7!  6! 1
10. 3!  2!

3  2  1 
2  1
12 11.

1 12.


6! 6  5! 6!  8! 6!
8  7! 8

6 5
13.  5
6
5
30
i
1
14.  4k
4
2  4
3  4
4  4
5
k
2

8  12  16  20
56
 Review Exercises for Chapter 9 889

4 6 6 6 6 6 3 2 3 205
15. 
j
1

  
6  

j2 12 22 32 42 2 3 8 24

8 i 1 2 3 4 5 6 7 8
16.  i1
1121314151617181
i
1

1 2 3 4 5 6 7 8

        6.17
2 3 4 5 6 7 8 9

10
17.  2k
k
1
3

2
13  2
23  2
33  . . .  2
103
6050

4
18. 
j
j
0
2
 1

02  1 
12  1 
22  1 
32  1 
42  1

1  2  5  10  17
35

20 1 9
1 1 1 1 1 2 3 . . . 9 k
19.  
2
1 2
2 2
3
. . .

2
20 k
1 2k  20.   
2 3 4


10 k
1 k  1 
 5 5
21.  10
0.5  0.05  0.005  0.0005  . . .
0.5555 . . .
9
i
1
i

3
 
 310 
1 
3 1 1
22.  10
i
1
i


i
1
i
10
1
10


3

 2 2
23.  100
k
1
k

0.02  0.0002  0.000002  . . .
0.020202 . . .

99

9
 
  
9 1 1

100
24.
9
1

k
2 10
k
k
2 10k 1  10 10

 
n
0.08
25. An
10,000 1  26. a4
734.52 1000
12
a5
750.25
(a) A1  $10,066.67
a6
768.12
A2  $10,133.78
a7
788.13
4 13

A3  $10,201.34 0

a8
810.28
A4  $10,269.35
a9
834.57
A5  $10,337.81
a10
861.00
A6  $10,406.73
a11
889.57
A7  $10,476.10
a12
920.28
A8  $10,545.95
A9  $10,616.25
A10  $10,687.03
(b) A120  $22,196.40
890 Chapter 9 Sequences, Series, and Probability

27. 5, 3, 1, 1, 3, . . . 28. 0, 1, 3, 6, 10, . . . 29. 21, 1, 32, 2, 52, . . .

Arithmetic sequence, d
2 Not an arithmetic sequence 1
Arithmetic sequence, d
2

98 7 6 5
30. 9, 9, 9, 9, 9, . . . 31. a1
4, d
3 32. a1
6, d
2
Arithmetic sequence, d

1
9 a1
4 a1
6
a2
4  3
7 a2
6  2
4
a3
7  3
10 a3
4  2
2
a4
10  3
13
a4
2  2
0
a5
13  3
16
a5
0  2
2

33. a1
25, ak1
ak  3 34. a1
4.2, ak1
ak  0.4 35. a1
7, d
12

a1
25 a1
4.2 an
7 
n  112
a2
25  3
28 a2
4.2  0.4
4.6
7  12n  12
a3
28  3
31 a3
4.6  0.4
5.0
12n  5
a4
31  3
34 a4
5.0  0.4
5.4
a5
34  3
37
a5
5.4  0.4
5.8

36. a1
25, d
3 37. a1
y, d
3y 38. a1
2x, d
x

an
dn  c an
y 
n  13y an
dn  c
an
3n  c
y  3ny  3y an
xn  c
c
a1  d
25 
3
28
3ny  2y c
a1  d
2x  x
3x
So, an
3n  28. So, an
xn  3x.

39. a2
93, a6
65
a6
a2  4d ⇒ 65
93  4d ⇒ 28
4d ⇒ d
7
a1
a2  d ⇒ a1
93 
7
100
an
a1 
n  1d
100 
n  1
7
7n  107

40. a7
8, a13
6
a13
a7  6d ⇒ 6
8  6d ⇒ d
 13
a1
a7  6d ⇒ a1
8  6
 13  ⇒ a1
10
an
a1 
n  1d ⇒ an
10 
n  1
 3  ⇒ an
 3n  3
1 1 31

10
41. 
2j  3 is arithmetic. Therefore, a
j
1
1 2 1  17
80.

1, a10
17, S10
10

8
9

20  3j
 20  3 j
8
20  3

8 8 8
42.
52
j
1 j
1 j
1 2

11


k  4 is arithmetic. Therefore, a 3 , a11
3 , S11
2  3  3 
88.

2

14 34 11 14 34
43. 3 1
k
1
 Review Exercises for Chapter 9 891

3k  1 1 3
25
26
 

25
3 25 25 1
44.
k
1 4


4k
1
k 
k
1 4


4 2
 25
4

250

100
45.  5k is arithmetic. Therefore, a
k
1
1 2
5  500
25,250.

5, a100
500, S500
100

80 80 19

80
81
19
20
46.  n
n   n

n
20 n
1 n
1 2

2

3050

47. an
34,000 
n  1
2250 48. a1
123, d
112  123
11

(a) a5
34,000  4(2250
$43,000 n
8
(b) S5
2
34,000  43,000
$192,500
5
a8
123  7
11
46
S8
2
123  46
676
8

49. 5, 10, 20, 40, . . . 50. 54, 18, 6, 2, . . .

18 1
The sequence is geometric, r
2 Geometric sequence, r
 54
 3

51. 13,  23, 43,  83, . . . 52. 14, 25, 36, 47, . . .
The sequence is geometric, r
2 Not a geometric sequence

53. a1
4, r
 14 54. a1
2, r
2
a1
4 a1
2
a2
4

1
 14 a2
2
2
4
a3
1
 14 
14 a3
4
2
8
a4
14
 14 
 16 a4
8
2
16
1

1
a5
 16
 14 
641 a5
16
2
32

55. a1
9, a3
4 56. a1
2, a3
12
a3
a1 r2 a3
a1r2
4
9r2 12
2r2
4
9
r 2 ⇒ r
± 23 6
r2
a1
9 a1
9 ± 6
r
a2
9

6 a2
9

6
2
3  23 a1
2 a1
2
a3
6

4
2
3 or a3
6
 23 
4 a2
2
6
26 a2
2
 6
26
a4
4
23 
83 a4
4
 23 
 83 a3
26
6
12 or a3
26
 6
12
a5
83
23 
16
9 a5
 3
 3 
9
8 2 16
a4
12
6
126 a4
12
 6
126
a5
126
6 
72 a5
126
 6
72
892 Chapter 9 Sequences, Series, and Probability

57. a1
16, a2
8 58. a3
6, a4
1

a2
a1r ⇒ 8
16r ⇒ r
 12 a3r
a4
an
16

n1
 12 6r
1
a20
16

19
 12  3.052  105 r
16
a3
a1 r 2
6
a1
16 
2

6
a1
36
1

a1
216
an
216
16 
n1

a20
216
16 
3.545  1013

19

59. a1
100, r
1.05 60. a1
5, r
0.2

an
100
1.05 n1
an
5
0.2n1
a20
100
1.0519  252.695 a20
5
0.219  2.62  1013

1  27
 2
2  4  8  16
16
7
1  35 4

 1  3 
121
5 1 i 1 1 1 1 15
61. 2
i
1
i1


12

127 62. 3
i
1
i1

1 63.
i
1

1 
13 
 1 
6 1
1  729
 3
6 i1 5
1 364
64.
i
1

1
3


1  13


243
65. 
2
i
1
i1

1  2  4  8  16
31

1  34
   5
10 i1
4 3 15
66. 
i
1
6
3i
6
3
13

720 67.
i
1
10  24.85 68.  20
0.2
i
1
i1
25


 8 5   8
25 20 i1 i1
6 7 1
69.  100
1.06
i
1
i1
 5486.45 70.
i
1

1493.50 71.
i
1


1  78

8

  
 3
i1
1 1 3 1 10 1
72.
i
1


1  13


2
73. 
0.1
i
1
i1


1  0.1


9
74. 
0.5
i
1
i1


1  0.5

2

 
 4 3   1.310
2 k1 4 k1
1 1.3 13
75.
2
12 76.

77. (a) at
120,000
0.7t
k
1 1 3 k
1 1 1
10
9
(b) a5
120,000
0.75

$20,168.40

1  12
 
r 12t 12
78. Monthly: A
P 1 1
r

 
12  10

200 1  0.06
12 
1 1
12
0.06

$32,939.75

Per12
ert  1
Continuously: A

er12  1
200e0.0612
e
0.06
10 1


$32,967.03
e0.0612  1
 Review Exercises for Chapter 9 893

79. 1. When n
1, 3
1
1  2.

. . . 
2k  1
k
k  2.
2. Assume that Sk
3  5  7 
Then, Sk1
3  5  7  . . . 
2k  1  2
k  1  1
Sk 
2k  3

k
k  2  2k  3

k2  4k  3


k  1
k  3


k  1
k  1  2.
Therefore, by mathematical induction, the formula is valid for all positive integer values of n.

1
80. 1. When n
1, S1
1

1  3
1.
4
3 5 1 k
2. Assume that Sk
1   2   . . . 
k  1

k  3. Then,
2 2 2 4

 
3 5 1 1
Sk1
Sk  ak1
1   2   . . . 
k  1 
k  2
2 2 2 2
k 1


k  3 
k  2
4 2
k
k  3  2
k  2


4
k2  5k  4


4

k  1
k  4


4
k1


k  1  3.
4
Thus, the formula holds for all positive integers n.

1r
81. 1. When n
1, a
a  1  r .
k1 a
1  r k
2. Assume that Sk

i
0
ar i

1r
.

a
1  r k
 ar
  ar   ar
k k1
Then, Sk1
i i k
 ar k
i
0 i
0 1r
a
1  rk  r k  r k1 a
1  r k1


.
1r 1r
Therefore, by mathematical induction, the formula is valid for all positive integer values of n.
894 Chapter 9 Sequences, Series, and Probability

1
82. 1. When n
1, S1
a  0  d
a
 2a 
1  1d
a.
2
i1 i
2. Assume that Sk

a  kd 
2 2a 
i  1d. Then,
k
0

Sk1
Sk  ak1
i11
i

k
0

a  kd
2a 
i  1d  a  id
2
2ia  i
i  1d  2a  2id 2a
i  1  id
i  1 i1


2


2


2
2a  id.  
Thus, the formula holds for all positive integers n.

83. S1
9
1
9
12
1  7 84. S1
68
4  17

S2
9  13
22
2
11
22
2  7 S2
68  60
128
8  16
S3
9  13  17
39
3
13
32
3  7 S3
68  60  52
180
12  15
S4
9  13  17  21
60
4
15
42
4  7 S4
68  60  52  44
224
16  14
Sn
n
2n  7 Sn
4n
18  n

85. S1
1 86. S1
12
3 8 S2
12  1
11
S2
1 

5 5
1 133
S3
12  1 

3 9 49 12 12
S3
1  

5 25 25
1 1 1595
S4
12  1  

3 9 27 272 12 144 144
S4
1   

5 25 125 125
Since the series is geometric,
Since the series is geometric, 1 
 12 

1 n

 
.
144 1 n
Sn
12
1 
1 5

3 n
1 

 
.
5 3 n 1 13 12
Sn

1  12
1  35 2 5

30
30
31 10
10
10  1
2  10  1
10
11
21
385
87. 
n
1
n

2

465 88. n
n
1
2

6 6

7 7 7

7
8
15
3
49  21  1
7
8
89. 
n
n
1
4  n
n
n
1
4  n

n
1 30

2

7
8
15
167
7
8


30 2

4676  28
4648

6 6 6
90. 
n
n
1
5  n 2
n
n
1
5  n
n
1
2

62
6  122
62  2
6  1 6
6  12
6  1


12 6

62
72
83 6
7
13


12 6

62
72
83  2
6
7
13


12,110
12
 Review Exercises for Chapter 9 895

91. a1
f
1
5, an
an1  5 92. a1
3

a1
5 an
an1  2n
a2
5  5
10 a1
3
a3
10  5
15 a2
a1  2
2
3  4
7
a4
15  5
20 a3
a2  2
3
7  6
13

a5
20  5
25 a4
a3  2
4
13  8
21

n: 1 2 3 4 5 a5
a4  2
5
21  10
31

an : 5 10 15 20 25 an: 3 7 13 21 31

First differences: 5 5 5 5 First differences: 4 6 8 10

Second differences: 0 0 0 Second differences: 2 2 2

The sequence has a linear model. Since the second differences are all the same,
the sequence has a quadratic model.

93. a1
f
1
16, an
an1  1 94. a0
0, an
n  an1

a1
16 a0
0
a2
16  1
15 a1
1  a0
1  0
1
a3
15  1
14 a2
2  a1
2  1
1
a4
14  1
13 a3
3  a2
3  1
2
a5
13  1
12 a4
4  a3
4  2
2
n: 1 2 3 4 5 a n: 0 1 1 2 2
an : 16 15 14 13 12 First differences: 1 0 1 0
First differences: 1 1 1 1 Second differences: 1 1 1
Second differences: 0 0 0 Since neither the first differences nor the second
differences are equal, the sequence does not have
The sequence has a linear model.
a linear or a quadratic model.

6!


10!


10  9  8  7!
95. 6C4

15 96. 10C7
2!4! 7!3! 7!3!
10  9  8


120
321

97. 8C5

8!

56 98.

12!


12  11  10  9!
12  11  10
220
12C3
3!5! 3!9! 3!  9! 321

99. 73
35 100. 1

1 1
1 1 2 1
1 1 1 3 3 1
1 2 1 1 1 4 6 4
1 3 3 1 1
5 10 10 5 1
1 4 6 4 1 1 6 15 20 15 6 1
1 5 10 10 5 1 1 7 21 35 35 21 7 1
1 6 15 20 15 6 1 1 8 28 56 70 56 28 8 1
1 7 21 35 35 21 7 1 1 9 36 84 126 126 84 36 9 1

73
35, the 5th entry in the 7th row 94
126, the 5th entry in the 9th row
896 Chapter 9 Sequences, Series, and Probability

101. 86
28 102. 1

1 1
1 1 2 1
1 1 1 3 3 1
1 2 1 1 4 6 4 1
1 3 3 1 1 5 10 10 5 1
1 4 6 4 1

1
1
5 10 10 5 1
6 15 20 15 6 1 53
10, the 4th entry in the 5th row
1 7 21 35 35 21 7 1
1 8 28 56 70 56 28 8 1

86
28, the 7th entry in the 8th row

103.
x  44
x4  4x3
4  6x 2
42  4x
43  44

x4  16x3  96x 2  256x  256

104.
x  3 6
6C0
x6
30  6C1
x5
3  6C2
x4
3 2  6C3
x3
33  6C4
x2
34  6C5
x
35  6C6
x0
3 6

x6  18x5  135x4  540x3  1215x 2  1458x  729

105.
a  3b5
a5  5a4
3b  10a3
3b2  10a2
3b3  5a
3b4 
3b5

a5  15a4b  90a3b2  270a2b3  405ab4  243b5

106.
3x  y 27
7C0
3x7  7C1
3x6
y 2  7C2
3x5
y 2 2  7C3
3x4
y23  7C4
3x3
y 24  7C5
3x2
y 25
 7C6
3x
y 26  7C7
y 27


3x7  7
3x6y2  21
3x5
y22  35
3x4
y23  35
3x3
y24  21
3x2
y25  7
3x
y26 
y27

2187x7  5103x6y2  5103x5y4  2835x4y6  945x3y8  189x2y10  21xy12  y14

107.
5  2i4

54  4
53
2i  6
52
2i2  4
5
2i3 
2i4

625  1000i  600i2  160i3  16i4

625  1000i  600  160i  16
41  840i

108.
4  5i 3
3C0
43  3C1
42
5i  3C2
4
5i 2  3C3
5i 3

43  3
42
5i  3
4
5i2 
5i3

64  240i  300  125i

236  115i

109. First number: 1 2 3 4 5 6 7 8 9 10 11

Second number: 11 10 9 8 7 6 5 4 3 2 1
From this list, you can see that a total of 12 occurs 11 different ways.

110. 6C1  5C1  6C1
6  5  6
180 111.
10
10
10
10
10,000 different telephone numbers

10! 10  9  8  7!
112. 3C1  4C1  6C1
3  4  6
72 113. 10 P3


7! 7!

10  9  8
720 different ways
 Review Exercises for Chapter 9 897

32! 8!
114. 32C12

225,792,840 115. 8C3

56
20!12! 5!3!

116. Breads: 5C1
5

Meats: 7C0  7C1  7C2  7C3  7C4  7C5  7C6  7C7
1  7  21  35  35  21  7  1
128
Cheese: 3C0  3C1  3C2  3C3
1  3  3  1
8
Vegetables: 6C0  6C1  6C2  6C3  6C4  6C5  6C6
1  6  15  20  15  6  1
64
5  128  8  64
327,680

n
E
19
91
1 1
117.
1 118. P
E


119. (a) 25%  18%
43%
n
S 5! 120
(b) 100%  18%
82%

120. (a)
208
500
0.416 or 41.6% 121.
16 
16 
16 
2161
400
(b) 500
0.8 or 80%
37
(c) 500
0.074 or 7.4%

666666
6
6 5 4 3 2 1 6! 720 5 13 1 3
122.

123. 1 
1

6
46,656 324 52 4 4

n  2!
n  2
n  1n!

2
1 5 31
124. 1  P
HHHHH
1 
125. True.


n  2
n  1
32 n! n!

8 8
126. True by Properties of Sums 127. True.  3k
3  k by the Properties of Sums.
k
1 k
1

128. True because 21  22  23  24  25  26
232  242  252  262  272  282

129. False. If r
0 or r
1, then nPr
nCr. 130. The domain of an infinite sequence is the set of
natural numbers.

131. (a) Odd-numbered terms are negative. 132. (a) Arithmetic. There is a constant difference between
consecutive terms.
(b) Even-numbered terms are negative.
(b) Geometric. Each term is a constant multiple of the
previous term. In this case the common ratio is
greater than 1.

133. Each term of the sequence is defined in terms 134. Increased powers of real numbers between 0 and 1
of preceding terms. approach zero.

n
135. an
4
12  136. an
4
 12   4

n1 n1 1 k1
137. an
2
k
1
1
a1
4, a2
2, a10
128 a1
4 and an fluctuates from
positive to negative. a1
4 and an → 8 as n → 
The sequence is geometric and
Matches graph (a). Matches graph (b).
is decreasing.
Matches graph (d).
898 Chapter 9 Sequences, Series, and Probability

 4  139. S6  S5  S4  S3  130  70  40  240

1 k1
138 . an  2
k1
S7  S6  S5  S4  240  130  70  440
a1  4 and an → 83 as n →
.
S8  S7  S6  S5  440  240  130  810
Matches graph (c).
S9  S8  S7  S6  810  440  240  1490
S10  S9  S8  S7  1490  810  440  2740

140. 0 ≤ p ≤ 1, closed interval

Problem Solving for Chapter 9

1. x0  1 and xn 
1

1
, n  1, 2, . . . n1
x
2 n1 xn1 2. an 
n2  1
x0  1 (a) 2

1 1 3
x1  1    1.5
2 1 2

x2 
1 3
2 2 

1

17
32 12
 1.416 0
0
10

x3 
1 17
2 12 

1

577
1712 408
 1.414215686 (b) an → 0 as n →

(c)
n 1 10 100 1000 10,000
x4 
1 577
2 408
  
1
577408
 1.414213562
11 101 1001 10,001
an 1 101 10,001 1,000,001 100,000,001
1 1
x5  x4   1.414213562
2 x4
(d) an → 0 as n →

x6  x7  x8  x9  1.414213562
Conjecture: xn →
2 as n →

3. an  3  1n 4. Let an  dn  c, an arithmetic sequence with a common

difference of d.
8
(a)
(a) If C is added to each term, then the resulting
sequence, bn  an  C  dn  c  C is still
arithmetic with a common difference of d.
0 10
0 (b) If each term is multiplied by a nonzero constant C,
then the resulting sequence,
bn  Cdn  c  Cdn  Cc is still arithmetic. The
(b) an  2,4, if n is odd
if n is even
common difference is Cd.
(c) If each term is squared, the resulting sequence,
(c) n 1 10 101 1000 10,001 bn  an2  dn  c2 is not arithmetic.

an 2 4 2 4 2

(d) As n →
, an oscillates between 2 and 4 and does not

approach a fixed value.
 Problem Solving for Chapter 9 899

5. (a) 1 4 9 16 25 36 49 64 81
First differences: 3 5 7 9 11 13 15 17
In general, bn  2n  1 for the first differences.
(b) Find the second differences of the perfect cubes.
(c) 1 8 27 64 125 216 343 512 729
First differences: 7 19 37 61 91 127 169 217
Second differences: 12 18 24 30 36 42 48
In general, cn  6n  1  6n  6 for the second differences.
(d) Find the third differences of the perfect fourth powers.
(e) 1 16 81 256 625 1296 2401 4096 6561
First differences: 15 65 175 369 671 1105 1695 2465
Second differences: 50 110 194 302 434 590 770
Third differences: 60 84 108 132 156 180
In general, dn  24n  36 for the third differences.

 202
1 n1 20 1 1 1
6. Distance:   40 7. Side lengths: 1, , , , . . .
n1 1  12 2 4 8

12


 2
1 n1 1 n1
Time:  2 Sn  for n ≥ 1
n1 1  12

2 , 4314 , 4318 , . . .

In two seconds, both Achilles and the tortoise will be
3
3 1 2
2
2
Areas: ,
40 feet away from Achilles starting point. 4 4

4 2
4 2

3 1 n1 2
3 1 2n2
3
An    Sn2
4


an1
, if an1 is even
8. an  2
3an1  1, if an1 is odd

(a) a1  7 a11  20
2  10 (b) a1  4 a1  5 a1  3
a2  37  1  22
10
a12  2 5 a2  2 a2  16 a2  8
a3  22
2  11 a13  35  1  16 a3  1 a3  8 a3  4
a4  311  1  34 16
a14  2 8 a4  4 a4  4 a4  2
34 8
a5  2  17 a15   4 2 a5  2 a5  2 a5  1
a6  317  1  52 4
a16   2 2 a6  1 a6  1 a6  2
52 2
a7  2  26 a17   1 2 a7  4 a7  4 a7  1
a8  26
2  13 a18  31  1  4 a8  2 a8  2 a8  2
a9  313  1  40 4
a19   2 2 a9  1 a9  1 a9  1
40 2
a10  2  20 a20   1 2 a10  4 a10  4 a10  2
Eventually the terms repeat; 4, 2, 1 if a1 is a positive
integer and 2, 1 if a1 is a negative integer.
900 Chapter 9 Sequences, Series, and Probability

9. The numbers 1, 5, 12, 22, 35, 51, . . . can be written recursively as Pn  Pn1  3n  2. Show that Pn  n3n  12.
13  1
1. For n  1: 1 
2
k3k  1
2. Assume Pk  .
2
Then, Pk1  Pk  3k  1  2
k3k  1 k3k  1  23k  1
  3k  1 
2 2
3k2  5k  2 k  13k  2
 
2 2
k  13k  1  1
 .
2
Therefore, by mathematical induction, the formula is valid for all integers n ≥ 1.

10. (a) If P3 is true and Pk implies Pk1, then Pn is true for integers n ≥ 3.
(b) If P1, P2, P3, . . . , P50 are all true, then you can draw no conclusion about Pn in general other than it is
true for 1 ≤ n ≤ 50.
(c) If P1, P2, and P3 are all true, but the truth of Pk does not imply that Pk1 is true, then Pn is false for some
values of n ≥ 4. You can only conclude that it is true for P1, P2, and P3.
(d) If P2 is true and P2k implies P2k2, then P2n is true for all integers n ≥ 1.

11. (a) The Fibonacci sequence is defined as follows: f1  1, f2  1, fn  fn2  fn1 for n ≥ 3.
By this definition f3  f1  f2  2, f4  f2  f3  3, f5  f4  f3  5, f6  f5  f4  8, . . .
1. For n  2: f1  f2  2 and f4  1  2
2. Assume f1  f2  . . .  fk  fk2  1.
Then, f1  f2  f3  . . .  fk  fk1 fk2  1  fk1   fk2  fk1  1  fk3  1  fk1 2 1.
Therefore, by mathematical induction, the formula is valid for all integers n ≥ 2.
(b) S20  f22  1  17,711  1  17,710

number of non-red marbles

12. (a) Odds against choosing a red marble 
number of red marbles
4 x

1 6
24  x (number of non-red marbles)
Total marbles  6  24  30
number of blue marbles 3
(b) Odds in favor of choosing a blue marble  
number of yellow marbles 7
number of yellow marbles 7
Odds against choosing a blue marble  
number of blue marbles 3
nE nE nEnE
(c) PE   
nS nE  nE nEnE  nEnE
odds in favor of E
PE 
odds in favor of E  1

—CONTINUED—
 Problem Solving for Chapter 9 901

12. —CONTINUED—
nE nE
(d) PE  PE 
nS nS
nSPE  nE nSPE  nE
nE nSPE PE
Odds in favor of event E   
nE nSPE PE

1
1 Area of triangle 2 126 1
13. 14. 1  1 1
3 Area of circle 62 
 0.682
 68.2%

15. (a) V   1

47 527
C 
12,000,000  1 
1
47 527
C 1

 $0.71
1 1 1 1 1 1 30
(b) V 1  4  9  16  25  36  0  2.53
36 36 36 36 36 36 36
60
 24 turns
2.53
902 Chapter 9 Sequences, Series, and Probability

Chapter 9 Practice Test

2n
1. Write out the first five terms of the sequence an
.

n  2!

2. Write an expression for the nth term of the sequence 43, 59, 6 7 8
27 , 81 , 243 , . . ..

6
3. Find the sum 
2i  1.
i
1

4. Write out the first five terms of the arithmetic sequence where a1
23 and d
2.

5. Find an for the arithmetic sequence with a1
12, d
3, and n
50.

6. Find the sum of the first 200 positive integers.

7. Write out the first five terms of the geometric sequence with a1
7 and r
2.


 6 3 
10 2 n1
8. Evaluate
n
1
. 9. Evaluate 
0.03 .
n
0
n

n
n  1
10. Use mathematical induction to prove that 1  2  3  4  . . .  n
.
2

11. Use mathematical induction to prove that n! > 2n, n ≥ 4.

12. Evaluate 13C4. 13. Expand
x  35.

14. Find the term involving x7 in
x  212. 15. Evaluate 30P4.

16. How many ways can six people sit at a table with six chairs?

17. Twelve cars run in a race. How many different ways can they come in first,
second, and third place? (Assume that there are no ties.)

18. Two six-sided dice are tossed. Find the probability that the total of the two dice
is less than 5.

19. Two cards are selected at random form a deck of 52 playing cards without
replacement. Find the probability that the first card is a King and the second
card is a black ten.

20. A manufacturer has determined that for every 1000 units it produces, 3 will be
faulty. What is the probability that an order of 50 units will have one or more
faulty units?