Finite Mathematics 11Th Edition Lial Solutions Manual Full Chapter PDF

Finite Mathematics 11th Edition Lial
Solutions Manual
Visit to download the full and correct content document: https://testbankdeal.com/dow
nload/finite-mathematics-11th-edition-lial-solutions-manual/
Chapter 8
COUNTING PRINCIPLES; FURTHER PROBABILITY TOPICS

8.1 The Multiplication Principle; Your Turn 6
Permutations The word Tennessee contains 9 letters, consisting of 1 t,
4 e’s, 2 n’s and 2 s’s. Thus the number of possible
Your Turn 1 arrangements is
Each of the four digits can be one of the ten digits 9!
= 3780.
0, 1, 2, , 10, so there are 10 ⋅ 10 ⋅ 10 ⋅ 10 or 10,000 1! 4! 2! 2!
possible sequences. If no digit is repeated, there
are 10 choices for the first place, 9 for the second, Your Turn 7
8 for the third, and 7 for the fourth, so there are
The student has 4 + 5 + 3 + 2 = 14 pairs of socks, so
10 ⋅ 9 ⋅ 8 ⋅ 7 = 5040 possible sequences.
if the pairs were distinguishable there would be 14!
Your Turn 2 possible selections for the next two weeks. But since the
pairs of each color are identical, the number of
Any of the 8 students could be first in line. Then there distinguishable selections is
are 7 choices for the second spot, 6 for the third, and so
on, with only one student remaining for the last spot in 14!
= 2,522,520.
line. There are 8 ⋅ 7 ⋅ 6 ⋅ 5 ⋅ 4 ⋅ 3 ⋅ 2 ⋅ 1 = 40,320 4!5!3! 2!
different possible lineups.
8.1 Exercises
Your Turn 3
1. 6! = 6 ⋅ 5 ⋅ 4 ⋅ 3 ⋅ 2 ⋅ 1 = 720
The teacher has 8 ways to fill the first space (say the
one on the left), 7 choices for the next book, and so on,
leaving 4 choices for the last book on the right. 2. 7! = 7 ⋅ 6 ⋅ 5 ⋅ 4 ⋅ 3 ⋅ 2 ⋅ 1 = 5040
So the number of possible arrangements is
8 ⋅ 7 ⋅ 6 ⋅ 5 ⋅ 4 = 6720.
3. 15! = 15 ⋅ 14 ⋅ 13 ⋅ 12 ⋅ 11 ⋅ 10 ⋅ 9 ⋅ 8 ⋅ 7
Your Turn 4 ⋅ 6 ⋅ 5⋅ 4 ⋅ 3⋅ 2 ⋅1
There are 6 letters. If we use 3 of the 6, the number of » 1.308 ´ 1012
permutations is
6! 6 ⋅ 5⋅ 4 ⋅ 3⋅ 2 ⋅1 4. 16! = 16 ⋅ 15 ⋅ 14 ⋅ 13 ⋅ 12 ⋅ 11 ⋅ 10
P(6, 3) = =
(6 - 3)! 3⋅2 ⋅ 9 ⋅8 ⋅ 7 ⋅ 6 ⋅ 5⋅ 4 ⋅ 3⋅ 2 ⋅1
= 6 ⋅ 5 ⋅ 4 = 120. » 2.092 ´ 1013
Your Turn 5
13! 13!
If the panel sits in a row, there are 4! or 24 ways of 5. P(13, 2) = =
(13 - 2)! 11!
arranging the four class groups. Within the groups,
there are 2! ways of arranging the freshmen, 2! ways 13 ⋅ 12 ⋅ 11!
=
of arranging the sophomores, 2! ways of arranging the 11!
juniors, and 3! ways of arranging the seniors. Using the = 156
multiplication principle, the number of ways of seating
the panel with the classes together is
24 ⋅ 2!⋅ 2!⋅ 2!⋅ 3! = 24 ⋅ 2 ⋅ 2 ⋅ 2 ⋅ 6 = 1152. 12! 12!
6. P(12, 3) = =
(12 - 3)! 9!
12 ⋅ 11 ⋅ 10 ⋅ 9!
=
9!
= 1320
Copyright © 2016 Pearson Education, Inc. 487

488 Chapter 8 COUNTING PRINCIPLES; FURTHER PROBABILITY TOPICS
38! 38! 21. (a) initial

7. P(38, 17) = =
(38 - 17)! 21! This word contains 3 i’s, 1 n, 1 t, 1 a, and
1  . Use the formula for distinguishable
» 1.024 ´ 1025
permutations with n = 7, n1 = 3, n2 = 1,
n3 = 1, n4 = 1, and n5 = 1.
33! 33!
8. P(33, 19) = =
(33 - 19)! 14! n! 7!
=
» 9.960 ´ 10 25 n1 !n2 !n3 !n4 !n5 ! 3!1!1!1!1!
7 ⋅ 6 ⋅ 5 ⋅ 4 ⋅ 3!
=
n! n! 3!
9. P(n, 0) = = =1 = 840
(n - 0)! n!
There are 840 distinguishable permutations
n! n! n! of the letters.
10. P(n, n) = = = = n! (b) little
(n - n)! 0! 1
Use the formula for distinguishable permu-
tetions with n = 6, n1 = 2, n2 = 1,
n! n(n - 1)!
11. P(n, 1) = = = n n3 = 2, and n4 = 1 .
(n - 1)! (n - 1)!
6! 6!
=
n! n! 2!1!2!1! 2!2!
12. P(n, n - 1) = =
[n - (n - 1)]! (n - n + 1)! 6 ⋅ 5⋅ 4 ⋅ 3⋅ 2 ⋅1
=
n! 2 ⋅1⋅ 2 ⋅1
= = n! = 180
1!
There are 180 distinguishable permutations.
13. By the multiplication principle, there will be (c) decreed
6 ⋅ 3 ⋅ 2 = 36 different home types available. Use the formula for distinguishable
permutations with n = 7, n1 = 2,
14. By the multiplication principle, there will be n2 = 3, n3 = 1, and n4 = 1 .
3 ⋅ 8 ⋅ 7 = 168 different meals possible.
7! 7!
=
15. There are 4 choices for the first name and 5 choices 2!3!1!1! 2!3!
for the middle name, so, by the multiplication 7 ⋅ 6 ⋅ 5 ⋅ 4 ⋅ 3!
=
principle, there are 4 ⋅ 5 = 20 possible 2 ⋅ 1 ⋅ 3!
arrangements. = 420
There are 420 distinguishable permutations.
16. The number of ways to choose a slate of 3
officers is 22. Use the formula for distinguishable permutations.
16! 16! The number of different “words” is
P(16, 3) = =
(16 - 3)! 13! n! 13!
= = 540,540.
16 ⋅ 15 ⋅ 14 ⋅ 13! n1 !n2 !n3 !n4 ! 5!4!2!2!
=
13!
23. (a) The 9 books can be arranged in
= 3360.
P(9, 9) = 9! = 362,880 ways.
19. There is exactly one 3-letter subset of the letters (b) The blue books can be arranged in 4! ways,
A, B, and C, namely A, B, and C. the green books can be arranged in 3! ways,
and the red books can be arranged in 2!
20. In Example 6, there are only 3 unordered 2-letter ways. There are 3! ways to choose the order
subsets of letters A, B, and C. They are AB, AC, of the 3 groups of books. Therefore, using
and BC. the multiplication principle, the number of
possible arrangements is
4!3!2!3! = 24 ⋅ 6 ⋅ 2 ⋅ 6 = 1728.
Copyright © 2016 Pearson Education, Inc.

Section 8.1 489
(c) Use the formula for distinguishable 84 ⋅ 3!⋅ = 84 ⋅ 6 = 504.

permutations with n = 9, n1 = 4, n2 = 3,
and n3 = 2 . The number of distinguishable 25. 10! = 10 ⋅ 9!
arrangements is To find the value of 10!, multiply the value of 9!
9! 9 ⋅ 8 ⋅ 7 ⋅ 6 ⋅ 5 ⋅ 4! by 10.
=
4!3!2! 4! ⋅ 6 ⋅ 2
26. 451! = 451 ⋅ 450!
= 1260.
» 451 ⋅ 1.7333687 ´ 101000
(d) There are 4 choices for the blue book, 3 for
the green book, and 2 for the red book. The » 781.7493 ´ 101000
total number of arrangements is
= 7.817493 ´ 101002
4 ⋅ 3 ⋅ 2 = 24.
(e) From part (d) there are 24 ways to select a 27. (a) The number 13! has 2 factors of five so
blue, red, and green book if the order does there must be 2 ending zeros in the answer.
not matter. There 3! ways to choose the (b) The number 27! has 6 factors of five (one
order. Using the multiplication principle, the each in 5, 10, 15, and 20 and two factors in
number of possible ways is 25), so there must be 6 ending zeros in the
24 ⋅ 3! = 24 ⋅ 6 = 144. answer.
(c) The number 75! has 15 + 3 = 18 factors of
24. (a) Since there are 14 distinguishable objects to five (one each in 5,10,,75 and two factors
be arranged, use permutations. The number each in 25, 50, and 75), so there must be 18
of arrangements is ending zeros in the answer.
P(14, 14) = 14! = 87,178, 291,000
28. (a) Since 12! has two 5s, there are two ending
or 8.7178291 ´ 1010. zeros in the answer to 12!. Thus, 12! ¹
479, 001, 610 .
(b) There are 3! ways to arrange the pyramids
among themselves, 4! ways to arrange the (b) Since 23! Has four 5s, there are four ending
cubes, and 7! ways to arrange the spheres. zeros in the answer to 23!. Thus, 23! ¹
We must also consider the number of ways 25,852, 016, 740, 000, 000, 000, 000.
to arrange the order of the three groups of (c) Since 15! has three 5s, there are three ending
shapes. This can be done in 3! ways. Using zeros in the answer to 15!. Thus, 15! ¹
the multiplication principle, the number of 1,307, 643, 680, 000 .
arrangements is
(d) Since 14! has two 5s, there are two ending
3!4!7!3! = 6 ⋅ 24 ⋅ 5040 ⋅ 6 zeros in the answer to 14!. Using a
= 4,354,560. calculator, 14! is approximated at
8.71782912E10. Since the last two digits are
(c) In this case, all of the objects that are the zero, 14! = 87,178, 291, 200 .
same shape are indistinguishable. Use the
formula for distinguishable permutations.
The number of distinguishable arrange- 4! 4!
29. P(4, 4) = =
ments is (4 - 4)! 0!
n! 14! If 0! = 0 , then P(4, 4) would be undefined.
= = 120,120.
n1 !n2 !n3 ! 3!4!7! 30. Use the multiplication principle. There are
(d) There are 3 choices for the pyramid, 4 for (4)(53)3 (18)(27)(12)(48)(3)(2)(2)4 = 1.600 ´ 1013
the cube, and 7 for the sphere. The total
number of ways is different possible bags.
3 ⋅ 4 ⋅ 7 = 84. 31. (a) By the multiplication principle, since there
are 7 pastas and 6 sauces, the number of
(e) From part (d) there are 84 ways if the order
different bowls is 7 ⋅ 6 = 42.
does not matter. There are 3! ways to choose
the order. Using the multiplication principle, (b) If we exclude the two meat sauces there are
the number of possible ways is 4 sauces left and the number of bowls is
now 7 ⋅ 4 = 28.
32. Ranking 5 investments out of 9 amounts to 6! 6!

finding the number of permutations of 9 elements P(6, 6) = =
0! 1
taken 5 at a time, which is = 6 ⋅ 5⋅ 4 ⋅ 3⋅ 2 ⋅1
9! 9! = 720.
P(9, 5) = = = 15,120.
(9 - 5)! 4!
38. A ballot would consist of a list of the 3 candidates for
33. (a) Since there are 11 slots, the 11 commercials office 1 and a list of the 6 candidates for office 2.
can be arranged in 11! = 39,916,800 ways. The number of ways to list candidates for office 1
(b) Use the multiplication principle. We can put is P(3,3) = 3! = 6 . The number of ways to list
either stores or restaurants first (2 choices). candidates for office 2 is P(6, 6) = 6! = 720.
Then there are 6! orders for the stores and 5! There are two ways to choose which office goes
orders for the restaurants, so the number of first. By the multiplication principle, the number of
groupings is 2 ⋅ 6! ⋅ 5! = 172,800. different ballots is
(c) Since the number of restaurants is one more 6 ⋅ 720 ⋅ 2 = 8640.
than the number of stores, a restaurant must
come first. This eliminates the first choice in 39. The number of possible batting orders is
part (b), but we still can order the restaurants 19! 19!
and the stores freely within each category, P(19, 9) = =
(19 - 9)! 10!
so the answer is 6! ⋅ 5! = 86, 400.
= 33,522,128,640
34. 5 of the 12 drugs can be administered in
» 3.352 ´ 1010.
12! 12!
P(12, 5) = = 40. The number of ways to select the 4 officers is
(12 - 5)! 7!
12 ⋅ 11 ⋅ 10 ⋅ 9 ⋅ 8 ⋅ 7! 35! 35!
= P(35, 4) = =
7! (35 - 4)! 31!
= 95,040 35 ⋅ 34 ⋅ 33 ⋅ 32 ⋅ 31!
=
different sequences. 31!
35. If each species were to be assigned 3 initials, = 1, 256,640.
since there are 26 different letters in the alphabet,
41. (a) The number of ways 5 works can be
there could be 263 = 17,576 different 3-letter arranged is
designations. This would not be enough. If 4
P(5, 5) = 5! = 120.
initials were used, the biologist could represent
264 = 456,976 different species, which is more (b) If one of the 2 overtures must be chosen
than enough. Therefore, the biologist should use first, followed by arrangements of the 4
at least 4 initials. remaining pieces, then
36. (a) The total number of presentations is P(2, 1) ⋅ P(4, 4) = 2 ⋅ 24 = 48

5 + 5 + 2 = 12, so the presentations can
is the number of ways the program can be
be scheduled in 12! = 479,001,600 orders. arranged.
(b) If we group the presentations for a given 42. (a) Pick one of the 5 traditional numbers
subject together, these three groups can followed by an arrangement of the
present in 3! orders, and within each group remaining total of 7. The program can be
there are 5!, 5! and 2! possible orders. arranged in
So the number of possible orders is P(5, 1) ⋅ P(7, 7) = 5 ⋅ 7! = 25, 200
3! ⋅ 5! ⋅ 5! ⋅ 2! = 172,800.
different ways.
(c) There are only 2 physics presentations, so there
are just 2 ways of selecting the first and last (b) Pick one of the 3 original Cajun composi-
presentation. The remaining 10 presentations tions to play last, preceded by an arrangement
can come in any order, so the number of of the remaining total of 7. This program can
possible orders is 2 ⋅ 10! = 7, 257, 600. be arranged in
P(7, 7) ⋅ P(3, 1) = 7!⋅ 3 = 15,120
37. The number of ways to seat the people is
different ways.

Section 8.1 491
43. (a) There are 4 tasks to be performed in There are 7 tasks to be performed in
selecting 4 letters for the call letters. The selecting 7 digits for the telephone number.
first task may be done in 2 ways, the second The first task may be done in 8 ways, and the
in 25, the third in 24, and the fourth in 23. other 6 tasks may each be done in 10 ways.
By the multiplication principle, there will be By the multiplication principle, there will be
2 ⋅ 25 ⋅ 24 ⋅ 23 = 27,600 8 ´ 106 = 8,000,000
different call letter names possible. different telephone numbers possible within
(b) With repeats possible, there will be each area code.
2 ⋅ 26 ⋅ 26 ⋅ 26 = 2 ⋅ 263 or 35,152 (b) Some numbers, such as 911, 800, and 900,
are reserved for special purposes and are
call letter names possible. therefore unavailable for use as area codes.
(c) To start with W or K, make no repeats, and (c) There are 8 choices for the first digit, since
end in R, there will be it cannot be 0 or 1. Since restrictions are
2 ⋅ 24 ⋅ 23 ⋅ 1 = 1104 eliminated for the second digit, there are 10
possibilities for each of the second and third
possible call letter names.
digits. Thus, the total number of area codes
44. (a) There are 5 odd digits: 1, 3, 5, 7, and 9. would be
There are 7 decisions to be made, one for 8 ⋅ 10 ⋅ 10 = 800.
each digit; there are 5 choices for each digit.
46. Under the old system there were
Thus, 57 = 78,125 phone numbers are
232 = 4.295 ´ 109 IP addresses available.
possible.
Under the new system there are
(b) The first digit has 9 possibilities, since 0 is
not allowed; the middle 5 digits each have 2128 = 3.403 ´ 1038 IP addresses available
10 choices; the last digit must be 0. Thus, 47. (a) There were
there are
5
263 ⋅ 103 = 17,576,000
9 ⋅ 10 ⋅ 1 = 900,000
license plates possible that had 3 letters
possible phone numbers. followed by 3 digits.
(c) Solve as in part (b), except that the last two (b) There were
digits must be 0; therefore there are
4
103 ⋅ 263 = 17,576,000
9 ⋅ 10 ⋅ 1 ⋅ 1 = 90,000
new license plates possible when plates
possible phone numbers. were also issued having 3 digits followed by
(d) There are no choices for the first three 3 letters.
digits; thus, (c) The number of possible new license plates
added by the format change in 1980 was
13 ⋅ 104 = 10,000
(10)(1000)(263 ) = 175,760,000.
phone numbers are possible.
(e) The first digit cannot be 0; in the absence of 48. Since a social security number has 9 digits with
repetitions there are 9 choices for the second no restrictions, there are
digit, and the choices decrease by one for
109 = 1,000,000,000 (1 billion)
each subsequent digit. The result is
9 ⋅ 9 ⋅ 8 ⋅ 7 ⋅ 6 ⋅ 5 ⋅ 4 = 544,320 different social security numbers. Yes, this is
enough for every one of the 318 million people
phone numbers. in the United States to have a social security
45. (a) Our number system has ten digits, which are number.
1 through 9 and 0. 49. If there are no restrictions on the digits used,
There are 3 tasks to be performed in there would be
selecting 3 digits for the area code. The first
task may be done in 8 ways, the second in 2, 105 = 100,000
and the third in 10. By the multiplication different 5-digit zip codes possible.
principle, there will be If the first digit is not allowed to be 0, there
8 ⋅ 2 ⋅ 10 = 160 would be
different area codes possible. 9 ⋅ 104 = 90,000
zip codes possible.
50. Since a zip code has nine digits with no 8.2 Combinations
restrictions, there are
Your Turn 1
109 = 1,000,000,000
Use the combination formula.
different 9-digit zip codes. 10!
C (10, 4) = = 210
6!4!
51. There are 3 possible identical shapes on each
card. Your Turn 2
There are 3 possible shapes for the identical Since the group of students contains either 3 or 4 students
shapes. out of 15, it can be selected in C (15,3) + C (15, 4) ways.
There are 3 possible colors. 15! 15!
There are 3 possible styles. C (15, 3) + C (15, 4) = +
12!3! 11!4!
Therefore, the total number of cards is = 455 + 1365
3 ⋅ 3 ⋅ 3 ⋅ 3 = 81.
= 1820
52. Since a 20-sided die is rolled 12 times, the Your Turn 3

number of possible games is (a) Use permutations.
2012 15
or 4.096 ´ 10 games. P(10, 4) = 10 ⋅ 9 ⋅ 8 ⋅ 7 = 5040
(b) Use combinations.

53. There are 3 possible answers for the first question 15!
and 2 possible answers for each of the 19 other C (15, 3) = = 455
12!3!
questions. The number of possible objects is
(c) Use combinations.
3 ⋅ 219 = 1,572,864. 8!
C (8, 2) = = 28
20 questions are not enough. 6!2!
(d) Use combinations and permutations. First pick
54. (a) The number of different circuits is P(9,9) 4 rooms; this is an unordered selection:
since we do not count the city he is 6!
starting in. C (6, 4) = = 15
2!4!
P(9, 9) = 9! = 362,880 Now assign the patients to the rooms; this is an
is the number of different circuits. ordered selection:
(b) He must check half of the circuits since, for P(4, 4) = 4! = 24
each circuit, there is a corresponding one in The number of possible assignments is
the reverse order. Therefore, 15 ⋅ 24 = 360.
1 Your Turn 4
(362,880) = 181, 440
2
The committee is an unordered selection.
circuits should be checked.
20!
(c) No, it would not be feasible. C (20, 3) = = 1140
17!3!
If the selection includes assignment to one of the three
55. (a) Since the starting seat is not counted, the offices we have an ordered selection.
number of arrangements is
P(20, 3) = 20 ⋅ 19 ⋅ 18 = 6840
P(19, 19) = 19! » 1.216451 ´ 1017.
Your Turn 5
(b) Since the starting bead is not counted and
There are C(4,2) ways to select 2 aces from the 4 aces in
the necklace can be flipped, the number of
the deck and C(48,3) ways to select the 3 remaining
arrangements is
cards from the 48 non-aces. Now use the multiplication
P(14, 14) 14! principle.
= = 43,589,145,600.
2 2 C (4, 2) ⋅ C (48, 3) = 6 ⋅ 17, 296 = 103,776

Section 8.2 493
8.2 Warmup Exercises n!

7. C (n, 0) =
(n - 0)!0!
W1. P(5, 3) = 5 ⋅ 4 ⋅ 3 = 60 n!
=
n!⋅ 1
W2. There are 3 a’s and two n’s, one b and one s, so
=1
the number of distinguishable permutations is
7! n! n! n!
= 420. 8. C (n, n) = = = =1
(3!)(2!)(1!)(1!) (n - n)!n ! 0!n ! 1 ⋅ n!
n!
8.2 Exercises 9. C (n, 1) =
(n - 1)!1!
3. To evaluate C (8, 3), use the formula n(n - 1)!
=
n! (n - 1)! ⋅ 1
C (n, r ) =
(n - r )!r ! = n
with n = 8 and r = 3.
n!
10. C (n, n - 1) =
8! [n - (n - 1)]!(n - 1)!
C (8, 3) =
(8 - 3)!3! n!
=
8! (n - n + 1)!(n - 1)!
=
5!3! n(n - 1)!
8 ⋅ 7 ⋅ 6 ⋅ 5! =
= = 56 1!(n - 1)!
5! ⋅ 3 ⋅ 2 ⋅ 1
= n
12! 12! 11. There are 13 clubs, from which 6 are to be

4. C (12, 5) = =
(12 - 5)!5! 7!5! chosen. The number of ways in which a hand
12 ⋅ 11 ⋅ 10 ⋅ 9 ⋅ 8 ⋅ 7! of 6 clubs can be chosen is
=
7! ⋅ 5 ⋅ 4 ⋅ 3 ⋅ 2 ⋅ 1 13!
C (13, 6) = = 1716.
= 792 7!6!
5. To evaluate C (44, 20) , use the formula 12. There are 26 red cards in a deck, so there are
C (26, 6) ways to select a hand of 6 red cards.
n!
C (n, r ) = 26!
(n - r )!r ! C (26, 6) = = 230, 230
20! 6!
with n = 44 and r = 20 .
44! 13. (a) There are
C (44, 20) =
(44 - 20)!20! 5! 5 ⋅ 4 ⋅ 3!
44! C (5, 2) = = = 10
= 3!2! 3! ⋅ 2 ⋅ 1
24!20!
different 2-card combinations possible.
= 1.761 ´ 1012
(b) The 10 possible hands are
40! {1, 2},{2,3},{3, 4},{4,5},{1,3},
6. C (40, 18) =
(40 - 18)!18! {2, 4},{3,5},{1, 4},{2,5},{1,5}.
40! Of these, 7 contain a card numbered less
=
22!18! than 3.
» 1.134 ´ 1011

14. (a) The number of ways to select a committee L

M
of 4 from a club with 31 members is L N
P
C (31, 4) = 31, 465. L
M
M N
(b) If the committee must have at least 1 P
member and at most 3 members, it must L
have 1, 2, or 3 members. The number of N M
N
committees is P
L
C (31, 1) + C (31, 2) + C (31, 3) P M
N
= 31 + 465 + 4495 P
= 4991.
(b) If repetition is not permitted, one branch is
missing from each of the clusters of second
15. Choose 2 letters from {L, M, N}; order is
branches, for a total of 12 different pairs.
important.
M
(a) L N
L P
L M L
M N
N P
L
L
N M
M M P
N L
P M
L N
N M (c) Find the number of combinations of

N 4 elements taken 2 at a time.
There are 9 ways to choose 2 letters if C (4, 2) = 6
repetition is allowed. No repetitions are allowed, so the answer
(b) cannot equal that for part (a). However,
since order does not matter, our answer is
M
only half of the answer for part (b). For
L example, LM and ML are distinct in (b) but
N not in (c). Thus, the answer differs from both
(a) and (b).
L
17. Order does not matter in choosing members of
M
a committee, so use combinations rather than
N permutations.
L (a) The number of committees whose members
are all men is
N
9!
M C (9, 5) =
4!5!
There are 6 ways to choose 2 letters if no
9 ⋅ 8 ⋅ 7 ⋅ 6 ⋅ 5!
repeats are allowed. =
4 ⋅ 3 ⋅ 2 ⋅ 1 ⋅ 5!
(c) The number of combinations of 3 elements
= 126.
taken 2 at a time is
(b) The number of committees whose members
3!
C (3, 2) = = 3. are all women is
1!2!
11!
This answer differs from both parts (a) C (11, 5) =
6!5!
and (b). 11 ⋅ 10 ⋅ 9 ⋅ 8 ⋅ 7 ⋅ 6!
=
16. (a) With repetition permitted, the tree diagram 6! ⋅ 5 ⋅ 4 ⋅ 3 ⋅ 2 ⋅ 1
shows 16 different pairs. = 462.

Section 8.2 495
(c) The 3 men can be chosen in 14!

C (14, 9) = = 364 ways.
9! 9 ⋅ 8 ⋅ 7 ⋅ 6! 3!11!
C (9, 3) = =
6!3! 6! ⋅ 3 ⋅ 2 ⋅ 1 21. Since order does not matter, the answers are
= 84 ways. combinations.
16! 16 ⋅ 15 ⋅ 14!
The 2 women can be chosen in (a) C (16, 2) = = = 120
14!2! 14! ⋅ 2 ⋅ 1
11! 11 ⋅ 10 ⋅ 9!
C (11, 2) = = 120 samples of 2 marbles can be drawn.
9!2! 9! ⋅ 2 ⋅ 1
(b) C (16, 4) = 1820
= 55ways.
1820 samples of 4 marbles can be drawn.
Using the multiplication principle, a (c) Since there are 9 blue marbles in the bag,
committee of 3 men and 2 women can be the number of samples containing 2 blue
chosen in marbles is
84 ⋅ 55 = 4620 ways. C (9, 2) = 36.
18. Since order is not important, the answers are 22. Since order does not matter, use combinations.
combinations. (a) There are
(a) If there are at least 4 women, there will be C (26, 3) = 2600
either 4 women and 1 man or 5 women and
no men. The number of such committees is possible samples of 3 apples.
(b) There are
C (11, 4) C (9, 1) + C (11, 5) C (9, 0)
C (7, 3) = 35
= 2970 + 462 = 3432.
possible samples of 3 rotten apples.
(b) If there are no more than 2 men, there will
(c) There are
be either no men and 5 women, 1 man and
C (7, 1) C (19, 2) = 1197
4 women, or 2 men and 3 women. The
number of such committees is possible samples with exactly 1 rotten apple.
C (9, 0) C (11,5) + C (9, 1) C (11, 4) 23. Since order does not matter, use combinations.
+ C (9, 2) C (11, 3) 5! 5 ⋅ 4 ⋅ 3!
(a) C (5, 3) = = = 10
= 462 + 2970 + 5940 2!3! 2 ⋅ 1 ⋅ 3!
= 9372. There are 10 possible samples with all black
jelly beans.
19. Order is important, so use permutations. The
(b) There is only 1 red jelly bean, so there are
number of ways in which the children can find
no samples in which all 3 are red.
seats is
(c) C (3, 3) = 1
12! 12!
P(12, 11) = = There is 1 sample with all yellow.
(12 - 11)! 1!
= 12! (d) C (5, 2) C (1, 1) = 10 ⋅ 1 = 10
= 479,001,600. There are 10 samples with 2 black and 1 red.
(e) C (5, 2) C (3, 1) = 10 ⋅ 3 = 30
20. Order does not matter, so use combinations.
(a) The 3 students who will take part in the There are 30 samples with 2 black and
course can be chosen in 1 yellow.
(f) C (3, 2) C (5, 1) = 3 ⋅ 5 = 15
14!
C (14, 3) = There are 15 samples with 2 yellow and
11!3!
14 ⋅ 13 ⋅ 12 ⋅ 11! 1 black.
= (g) There is only 1 red jelly bean, so there are
11! ⋅ 3 ⋅ 2 ⋅ 1
no samples containing 2 red jelly beans.
= 364 ways.
24. Since order is important, use a permutation. The
plants can be arranged in
(b) The 9 students who will not take part in the P(9, 5) = 9 ⋅ 8 ⋅ 7 ⋅ 6 ⋅ 5 = 15,120
course can be chosen in
different ways.
25. Show that C ( n, r ) = C ( n, n - r ). 6!

C (6, 2) = = 15.
Work with each side of the equation separately. 2!4!
n! Each pair intersects in two points. The total
C (n, r ) = number of intersection points is 2 ⋅ 15 = 30.
r !(n - r )!
n! (b) The number of pairs of circles is
C (n, n - r ) =
(n - r )![n - (n - r )]! n!
C (n, 2) =
n! (n - 2)!2!
=
(n - r )! r ! n(n - 1)(n - 2)!
=
Since both results are the same, we have shown that (n - 2)! ⋅ 2
C (n, r ) = C (n, n - r ). 1
= n(n - 1).
2
26. (a) We will call the digit on the left the first digit.
Each pair intersects in two points. The total
No fives: There are 8 choices for the first digit number of points is
and 9 choices for the second and third digits,
1
giving 8(92 ) possibilities. 2⋅ n(n - 1) = n(n - 1).
2
Two fives: If the non-5 digit goes in the first 28. There are 7 digits. The number of cases with the
place, it can have one of eight values; if it goes same number of dots on both sides is C (7, 1) = 7.
in the second or third place it can have one of 9
The number of cases with a different number of
values, so these are 8 + 9 + 9 possibilites.
7! = 21. The
dots on each side is C (7, 2) = 5!2!
Three fives: For 3 fives there is only one
possibility, namely the number 555. total number of dominoes that can be formed is
C (7, 1) + C (7, 2) = 7 + 21 = 28.
Thus out of the 900 numbers from 100 to 999,
900 − 8(92 ) − (8 + 9 + 9) − 1 = 225 29. Since the assistants are assigned to different
managers, this amounts to an ordered selection
contain exactly one 5. of 3 from 8.
(b) Multiply the numbers of possibilities along P(8, 3) = 8 ⋅ 7 ⋅ 6 = 336
each path in the tree diagram and add these
30. Since order is not important, use combinations.
products.
50!
C (50, 5) = = 2,118,760
45!5!
31. Order is important in arranging a schedule, so use
permutations.
6!
(a) P(6, 6) = = 6! = 720
0!
She can arrange her schedule in 720 ways if
she calls on all 6 prospects.
6!
(b) P(6, 4) = = 360
2!
She can arrange her schedule in 360 ways if
she calls on only 4 of the 6 prospects.
(1)(9)(9) + (8)(1)(9) + (8)(9)(1) = 225 32. Since order is not important, use combinations.
(a) Since 3 workers are to be chosen from a
group of 9, the number of possible
delegations is
27. Use combinations since order does not matter. C (9, 3) = 84.
(a) First consider how many pairs of circles
there are. This number is (b) Since a particular worker must be in the
delegation, the first person can only be
chosen in 1 way. The two others must be

Section 8.2 497
selected from the 8 workers who are not the 31 ways to make double-scope cones with
worker who must be included. The number the same flavors. Therefore,
of different delegations is
465 + 31 = 496
1 ⋅ C (8, 2) = 28. double-scoop cones can be made if order
(c) We must count those delegations with doesn’t matter.
exactly 1 woman (1 woman and 2 men), those
with exactly 2 women (2 women and 1 man), (d) There is one mono-flavor triple-scoop cone.
and those with 3 women. The number of For two-flavor cones, we choose one of 31
delegations including at least 1 woman is flavors to be the single scoop, leaving 30
flavors for the non-unique scoops. Finally,
C (4, 1) C (5, 2) + C (4, 2) C (5, 1) + C (4, 3) there are C(31,3) ways of building a cone
= 4 ⋅ 10 + 6 ⋅ 5 + 4 = 74. with three different flavors. Thus there are
(31)(30)(29)
33. There are 2 types of meat and 6 types of extras. 1 + (31)(30) + = 5456
Order does not matter here, so use combinations. 3!
(a) There are C (2, 1) ways to choose one type of different triple-scoop cones if order doesn’t
meat and C (6, 3) ways to choose exactly matter.
three extras. By the multiplication principle, 35. Select 8 of the 16 smokers and 8 of the 22 non-
there are smokers; order does not matter in the group, so
C (2, 1) C (6, 3) = 2 ⋅ 20 = 40 use combinations. There are
different ways to order a hamburger with C (16, 8) C (22, 8) = 4,115, 439,900

exactly three extras. different ways to select the study group.
(b) There are
C (6, 3) = 20 36. Since the plants are selected at random, that is,
order does not matter, the answers are
different ways to choose exactly three combinations.
extras. (a) She is selecting 4 plants out of 11 plants.
(c) “At least five extras” means “5 extras or 6 The number of ways in which this can be
extras.” There are C (6,5) different ways to done is
C (11, 4) = 330.
choose exactly 5 extras and C (6,6) ways
to choose exactly 6 extras, so there are (b) She is selecting 2 of the 6 wheat plants and
2 of the 5 other plants. The number of ways
C (6, 5) + C (6, 6) = 6 + 1 = 7
in which this can be done is
different ways to choose at least five extras. C (6, 2) C (5, 2) = 150.
34. There are no restrictions as to whether the scoops
have to be different flavors. 37. Order does not matter in choosing a delegation,
so use combinations. This committee has
5 + 4 = 9 members.
(a) The number of different double-scoop cones
will be (a) There are
9!
31 ⋅ 31 = 961. C (9, 3) =
6! 3!
(b) The number of different triple-scoop cones 9 ⋅ 8 ⋅ 7 ⋅ 6!
will be =
6! ⋅ 3 ⋅ 2 ⋅ 1
31 ⋅ 31 ⋅ 31 = 313 = 29,791. = 84 possible delegations.
(b) To have all Democrats, the number of
possible delegations is
(c) There are
31! C (5, 3) = 10.
C (31, 2) = = 465
29!2!
(c) To have 2 Democrats and 1 Republican, the
ways to make double-scoop cones with two number of possible delegations is
different flavors. In addition, there would be
C (5, 2) C (4, 1) = 10 ⋅ 4 = 40.

(d) We have previously calculated that there are C (12, 2) C (40, 3) = 66 ⋅ 9880
84 possible delegations, of which 10 consist = 652,080.
of all Democrats. Those 10 delegations are
the only ones with no Republicans, so the
(d) If there are at least 2 face cards, there must
remaining 84 - 10 = 74 delegations
be either 2 face cards and 3 nonface cards,
include at least one Republican.
3 face cards and 2 nonface cards, 4 face cards
and 1 nonface card, or 5 face cards. Use the
38. Since order is important, use permutations. multiplication principle as in part (c) to find
10! 10! the number of ways to obtain each of these
P(10, 4) = = = 5040 possibilities. Then add these numbers. The
(10 - 4)! 6!
total number of ways to get at least 2 face
different committees are possible. cards is
C (12, 2) C (40, 3) + C (12, 3) C (40, 2)
39. Order does not matter in choosing the panel, so
use combinations. + C (12, 4) C (40, 1) + C (12, 5)
= 66 ⋅ 9880 + 220 ⋅ 780
45!
C (45, 3) = + 495 ⋅ 40 + 792
42! 3!
= 652,080 + 171,600 + 19,800 + 792
45 ⋅ 44 ⋅ 43 ⋅ 42!
= = 844, 272.
3 ⋅ 2 ⋅ 1 ⋅ 42!
= 14,190 (e) The number of ways to choose 1 heart is
C(13, 1), the number of ways to choose 2
The publisher was wrong. There are 14,190 diamonds is C(13, 2), and the number of
possible three judge panels. ways to choose 2 clubs is C(13, 2). Using
the multiplication principle, the number of
40. Since order does not matter, use combinations. ways to get this result is
52! C (13, 1) C (13, 2) C (13, 2) = 13 ⋅ 78 ⋅ 78
C (52, 13) =
(52 - 13)!13!
= 79,092.
52!
= 42. (a) List the possibilities for each suit.
39!13!
= 635,013,559,600 5, 6, 7, 8, 9; 5, 6, 7, 8, 10; 5, 6, 7, 9, 10;
5, 6, 8, 9, 10; 5, 7, 8, 9, 10; 6, 7, 8, 9, 10
41. Since the cards are chosen at random, that is, There are 6 possibilities for each suit and
order does not matter, the answers are there are 4 suits, so there are 4 ⋅ 6 = 24
combinations. possibilities.
(a) There are 4 queens and 48 cards that are not (b) There are 6 cards of each suit from 5 to 10.
queens. The total number of hands is Select 5 of the 6 cards. There are
C (4, 4) C (48, 1) = 1 ⋅ 48 = 48. 4 ⋅ C (6, 5) = 4 ⋅ 6
= 24 possibilities.
(b) Since there are 12 face cards (3 in each suit),
there are 40 nonface cards. The number of 43. Since order does not matter, use combinations.
ways to choose no face cards (all 5 nonface
2 good hitters: C (5, 2) C (4, 1) = 10 ⋅ 4 = 40
cards) is
40! 2 good hitters: C (5, 3) C (4, 0) = 10 ⋅ 1 = 10
C (40, 5) = = 658,008.
35! 5! The total number of ways is 40 + 10 = 50.
(c) If there are exactly 2 face cards, there will 44. Since the hitters are being chosen at random,
be 3 nonface cards. The number of ways in that is, order does not matter, the answers are
which the face cards can be chosen is combinations.
C (12, 2), while the number of ways in
which the nonface cards can be chosen is (a) The coach will choose 2 of the 6 good
C (40,3). Using the multiplication principle, hitters and 1 of the 8 poor hitters. Using the
the number of ways to get this result is multiplication principle, this can be done in
C (6, 2) C (8, 1) = 120 ways.

Section 8.2 499
(b) The coach will choose 3 of the 6 good (c) The number of indistinguishable ways can
hitters. This can be done in be thought of as first choosing the 7 places
occupied by the red shirts out of 19 possible
C (6, 3) = 20 ways.
places in the line up and then choosing the
(c) The coach must choose either 2 good hitters 5 places occupied by yellow shirts out of the
and 1 poor hitter or 3 good hitters. Add the remaining 12 places. The number of ways is
results from parts (a) and (b). This can be C (19, 7) C (12, 5) = 39,907, 296.
done in
C (6, 2) C (8, 1) + C (6,3) This is the same calculation as in part (a).
= 140 ways. 49. (a) The number of different committees
possible is
45. Since order does not matter, use combinations.
(a) There are C (5, 2) + C (5, 3) + C (5, 4) + C (5, 5)
C (20, 5) = 15,504 = 10 + 10 + 5 + 1 = 26.
different ways to select 5 of the orchids. (b) The total number of subsets is
(b) If 2 special orchids must be included in the
show, that leaves 18 orchids from which the 25 = 32.
other 3 orchids for the show must be chosen.
The number of different committees
This can be done in
possible is
C (18, 3) = 816
different ways. 25 - C (5, 1) - C (5, 0)
= 32 - 5 - 1
46. In the lottery, 6 different numbers are to be = 26.
chosen from the 99 numbers.
(a) There are 50. Three distinct letters can be selected in C(26, 3)
99! ways, and once they are selected there is only one
C (99, 6) = way to arrange them in alphabetical order. There
93! 6! are 10 ⋅ 10 ⋅ 10 = 1000 ways to select the three
= 1,120,529, 256 digits. So the total number of plates is
different ways to choose 6 numbers if order 26!
⋅ 1000 = 2,600,000.
is not important. 23!3!
(b) There are
99! 51. (a) If the letters can be repeated, there are 266
P(99, 6) = choices of 6 letters, and there are 10 choices
93!
for the digit, giving
= 806,781,064,320
266 ⋅ 10 = 3, 089,157, 760 passwords.
different ways to choose 6 numbers if order
matters. (b) For nonrepeating letters we have
P(26, 6) ⋅ 10 or 1,657,656,000 passwords.
47. Since order is not important, use combinations.
To pick 5 of the 6 winning numbers, we must 52. (a) There can be 5, 4, 3, 2, 1, or no toppings.
also pick 1 of the 93 losing numbers. Therefore, The total number of possibilities for the first
the number of ways to pick 5 of the 6 winning pizza is
numbers is C (11, 5) + C (11, 4) + C (11, 3) + C (11, 2)
C (6, 5) C (93, 1) = 6 ⋅ 93 = 558. + C (11, 1) + C (11, 0)
= 462 + 330 + 165 + 55 + 11 + 1
48. (a) The number of ways to form the two
committees assuming the nominating = 1024.
committee is formed first is
The total number of possibilities for the
C (19, 7) C (12, 5) = 39,907, 296. toppings on two pizzas is
(b) The number of ways to form the two 1024 ⋅ 1024 = 1, 048,576.
committees assuming the public relations
(b) In part (a), we found that if the order of the
committee is formed first is
two pizzas matters, there are
C (19, 5) C (14, 7) = 39,907, 296.
10242 = 1, 048,576
possibilities. If we had a list of all of these (c) Using the described method, there would be
possibilities and if the order of the pizzas 837 vertical lines and 4 X’s or 841 objects,
doesn’t matter, we must eliminate all of the so the total number is
possibilities that involve the same two
C (841, 4) = 20,695, 218,670.
pizzas. There are 1024 such items on the list,
one of each of the possibilities for one pizza. 54. (a) C (8, 1) + C (8, 2) + C (8, 3) + C (8, 4)
Therefore, the number of items on the list
that have a duplicate is + C (8, 5) + C (8, 6) + C (8, 7) + C (8, 8)
= 8 + 28 + 56 + 70 + 56 + 28 + 8 + 1
1, 048,576 - 1024 = 1, 047,552.
= 255
To eliminate duplicates, we eliminate the
There are 255 breakfasts that can be made.
second listing of each of these, that is,
An easier way to compute this number is to
1, 047,552 notice that we could assemble a breakfast by
= 523, 776.
2 deciding, for each of the 8 items, whether to
Subtracting this from the number of include it. This gives 28 or 256 breakfasts.
possibilities on the list, we see that if But one of these is the “empty breakfast”
the order of the two pizzas doesn’t containing no items. Since no one wants to
matter, the number of possibilities is eat this breakfast, we discard it and are left
with 256 - 1 = 255 breakfasts.
1, 048,576 - 523, 776 = 524,800.
(b) She has 2 choices. For the first choice she
53. (a) A pizza can have 3, 2, 1, or no toppings. The has 4 items. For the second choice she has
number of possibilities is 4 items.
C (17, 3) + C (17, 2) + C (17, 1) + C (17, 0) 4 ⋅ 4 = 16
= 680 + 136 + 17 + 1 She can make 16 breakfasts.
= 834. (c) She has C (4, 2) choices of cereal mix and
C (4, 3) choices of add-in mix. Her total
There are also four speciality pizzas, so the
number of different pizzas is number of choices is
834 + 4 = 838. C (4, 2) C (4, 3) = 6 ⋅ 4 = 24.
(b) The number of 4forAll Pizza possibilities
if all four pizzas are different is (d) He has
C (838, 4) = 20, 400,978,015. C (4, 1) + C (4, 2) + C (4, 3) + C (4, 4)

= 4 + 6 + 4 + 1 = 15
The number of 4forAll Pizza possibilities if
there are three different pizzas (2 pizzas are choices of cereal mix and
the same and the other 2 are different) is
C (4, 1) + C (4, 2) + C (4, 3) + C (4, 4)
838 ⋅ C (837, 2) = 838 ⋅ 349,866 = 4 + 6 + 4 + 1 = 15
= 293,187,708.
choices of add-in mix. His total number of
The number of 4forAll Pizza possibilities if breakfasts is
there are two different pizzas (3 pizzas are the
15 ⋅ 15 = 225.
same or 2 pizzas and 2 pizzas are the same) is
(e) C (7, 0) + C (7, 1) + C (7, 2)
838 ⋅ 837 + C (838, 2)
+ C (7, 3) + C (7, 4)
= 701, 406 + 350,703
+ C (7, 5) + C (7, 6) + C (7, 7)
= 1,052,109.
= 1 + 7 + 21 + 35 + 35
The number of 4forAll Pizza possibilities + 21 + 7 + 1
if all four are the same is 838. The total
number of 4forAll Pizza possibilities is = 128
20, 400,978, 015 + 293,187, 708 She has 128 different cereals.
+ 1, 052,109 + 838
= 20, 695, 218, 670

Section 8.3 501
9! The number of ways the similar 4 lines can

55. (a) C (9, 3) = = 84 be arranged among the 6 total lines is
6! 3!
C (6, 4) = 15.
(b) 9 ⋅ 9 ⋅ 9 = 729
17! The number of arrangements that fit the
(d) C (17, 3) = = 680 pattern is
14!3!
2,903, 040 ⋅ 720 ⋅ 15 » 3.135 ´ 1010.
(e) First pick the two boneless buffalo wing
flavors; there are C (5, 2) = 10 ways of 58. (a) The number of ways the judges can be
doing this. Then we still have 7 non-wing selected is
options, plus the 5 buffalo chicken wings C (12, 9) = 220.
available for the third item. So our total is
10 ⋅ 12 = 120. (b) The number of different sets of scores is
56. Consider the first conference with five teams in C (12, 9) C (12, 9) = 2202 = 48, 400.
each of the three divisions. The three winners
from the three divisions can result in 5 ⋅ 5 ⋅ 5, or
53 , ways. Then, of the remaining 15 - 3 = 12
8.3 Probability Applications of Counting
teams, the three wild card teams can be chosen in Principles
12 ⋅ 11 ⋅ 10 ways. And since the order of the teams
Your Turn 1
is not relevant, there are 53 ⋅12⋅11⋅10 ways to choose
6 Using method 2,
the teams from the first conference. C (3, 1) C (1, 1) 1
P(1 NY, 1 Chicago) = = .
In the second conference, the situation is the same C (6, 2) 5
with the single exception being that one division
has six, not five, teams. Therefore, there are Your Turn 2
6 ⋅ 5 ⋅ 5 = 6 ⋅ 52 ways to choose the three
Since 8 of the nurses are men, 22 - 8 = 14 of them
division winners and 13 ⋅ 12 ⋅ 11 ways to choose
are women. We choose 4 nurses, 2 men and 2 women.
the wild card teams. Therefore, there are
6.52 ⋅13⋅12⋅11 P(2 men among 4 selected)
6
ways to choose the six teams from
C (8, 2) C (14, 2) 2548
the second conference. = = » 0.3483
C (22, 4) 7315
Finally, the number of ways the six teams can be
selected from the first conference and the six teams Your Turn 3
can be selected from the second conference is
The probability that the container will be shipped is the
53 ⋅ 12 ⋅ 11 ⋅ 10 6 ⋅ 52 ⋅ 13 ⋅ 12 ⋅ 11 probability of selecting 3 working engines for testing
⋅ when there are 12 - 4 = 8 working engines in the
6 6
container. This is
= 1,179, 750, 000.
C (8, 3) 56 14
57. (a) The number of ways the names can be P(all 3 work) = = = .
arranged is C (12, 3) 220 55
18! » 6.402 ´ 1015. The probability that at least one defective engine is in
the batch is
(b) 4 lines consist of a 3 syllable name repeated,
followed by a 2 syllable name and then a 14 41
P(at least one defective) = 1 - = » 0.7455.
4 syllable name. Including order, the number 55 55
of arrangements is
10 ⋅ 4 ⋅ 4 ⋅ 9 ⋅ 3 ⋅ 3 ⋅ 8 ⋅ 2 ⋅ 2 ⋅ 7 ⋅ 1 ⋅ 1 Your Turn 4
= 2,903, 040. C (4, 2) C (4, 2) C (44, 1)
P(2 aces, 2 kings, 1 other) =
C (52, 5)
2 lines consist of a 3 syllable name repeated,
followed by two more 3 syllable names. 6 ⋅ 6 ⋅ 44
=
Including order, the number of arrangements is 2,598,960
6 ⋅ 5 ⋅ 4 ⋅ 3 ⋅ 2 ⋅ 1 = 720. » 0.0006095

Your Turn 5 3. There are C (4, 2) samples of 2 yellow apples.

If the slips are chosen without replacement, there are 4⋅3
C (4, 2) = = 6
P(7, 3) = 7 ⋅ 6 ⋅ 5 = 210 ordered selections. Only one 2 ⋅1
of these spells “now” so P(now) = 1 . If the slips are
210 There are C (7,1) = 7 samples of 1 red apple.
chosen with replacement there are 7 choices for each Thus, there are 6 ⋅ 7 = 42 samples of 3 in
and thus 7 ⋅ 7 ⋅ 7 = 343 selections. Again, only one of which 2 are yellow and 1 red. Thus,
1 .
these spells “now” so in this case P(now) = 343 42 14
P(2 yellow and1red apple) = = .
Your Turn 6 165 55
Using method 1 we compute the number of ways to 4. “More red than yellow” means 2 or 3 red. There
arrange 14 pieces of fruit which come in 4 kinds: 2 kiwis, are C (7, 2) ways to choose 2 red apples and
3 apricots, 4 pineapples and 5 coconuts. Assuming the
pieces of each kind of fruit are indistinguishable (all kiwis C (4, 1) ways to pick a yellow; hence, there are
look alike, and so on), the number of arrangements is C (7, 2) C (4, 1) = 84 ways to choose 2 red. Since
14! = 2,522,520. If we keep the four kinds there are C (7, 3) = 35 ways to pick 3 red, we
2!3!4!5!
have 84 + 35 = 119 ways to have more red
together (all kiwis next to each other, and so on) there
are 4! = 24 arrangements of the kinds that keep them than yellow. Therefore,
together. So 119 119
P(more red) = = .
24 C (11, 3) 165
P(all of same kind together) =
2,522,520 For Exercises 5 through 10 the number of possible 5-
» 9.514 ´ 10-6. member committees is C (20, 5) = 15,504.
8.3 Warmup Exercises C (9, 5)

5. P(all men) =
C (20, 5)
W1. There are 4 choices for the suit and then C(13, 6) 126
ways of choosing from this suit, so there are = » 0.008127
13 ⋅ 12 ⋅ 11 ⋅ 10 ⋅ 9 ⋅ 8 15,504
(4) = 6864
6 ⋅ 5⋅ 4 ⋅ 3⋅ 2 ⋅1 C (11, 5)
6. P(all women) =
ways of choosing the cards. C (20, 5)
462
W2. C (59,3) ⋅ C (41,3) = 346,545,940 = » 0.02980
15,504
8.3 Exercises C (9, 3) C (11, 2)

7. P(3 men, 2 women) =
C (20, 5)
1. There are C (11, 3) samples of 3 apples.
4620
11 ⋅ 10 ⋅ 9 = » 0.2980
C (11, 3) = = 165 15,504
3⋅ 2 ⋅1
C (9, 2) C (11, 3)
There are C (7, 3) samples of 3 red apples. 8. P(2 men, 3 women) =
C (20, 5)
7⋅6⋅5 5940
C (7, 3) = = 35 = » 0.3831
3⋅ 2 ⋅1 15,504
Thus,
35 7 9. P(at least 4 women)
P(all red apples) = = .
165 33 = P(4 women) + P(5 women)
C (11, 4) C (9, 1) + C (11, 5) C (9, 0)
2. There are C (11,3) = 165 ways to select 3 of the =
C (20, 5)
11 apples, while there are C (4,3) = 4 ways to
3532
select 3 yellow ones. Hence, = » 0.2214
15,504
C (4, 3) 4
P(3yellow) = = .
C (11, 3) 165

Section 8.3 503
10. 17. There are C(52, 2) = 1326 different 2-card

P (no more than 2 men) hands. There are 12 face cards in a deck, so there
are 40 cards that are not face cards. Thus,
= P (no men) + P (1 man) + P (2 men)
C (9, 0) C (11, 5) + C (9, 1) C (11, 4) + C (9, 2) C (11, 3) P(no face cards)
= C (40, 2) 780 130
C (20, 5) = = = » 0.588.
9372 C (52, 2) 1326 221
= » 0.6045
15,504
18. Ace, 2, 3, 4, 5, 6, 7, and 8 are the cards in each
11. The number of 2-card hands is suit that are “not higher than 8,” for a total of
32, so
52 ⋅ 51
C (52, 2) = = 1326. P(no card higher than 8)
2 ⋅1
C (32, 2) 496 248
12. There are C (4, 2) = 6 ways to pick 2 aces out of = = = » 0.374.
C (52, 2) 1326 663
C (52, 2) ways to pick 2 cards; hence,
19. There are 26 choices for each slip pulled out, and
C (4, 2) 6 there are 5 slips pulled out, so there are
P(2 aces) = =
C (52, 2) 1326
1 265 = 11,881,376
= » 0.0045.
221 different “words” that can be formed from the
letters. If the “word” must be “chuck,” there is
13. There are C (52, 2) = 1326 different 2-card
only one choice for each of the 5 letters (the first
hands. The number of 2-card hands with exactly slip must contain a “c,” the second an “h,” and so
one ace is on). Thus,
C (4, 1) C (48, 2) = 4 ⋅ 48 = 192. P(word is “chuck”)
The number of 2-card hands with two aces is 15 æ 1 ö÷5
= = çç ÷ » 8.417 ´ 10-8.
265 çè 26 ÷ø
C (4, 2) = 6.
Thus there are 198 hands with at least one ace. 20. Only the first letter is specified; the other 4 can
Therefore, be any letter. The probability of starting with the
letter p is
P(the 2-card hand contains an ace)
1
198 33 » 0.038.
= = » 0.149. 26
1326 221
21. There are 265 = 11,881,376 different “words”
14. There are C (13, 2) = 78 ways to pick 2 spades;
that can be formed. If the “word” is to have no
hence, repetition of letters, then there are 26 choices for
78 1 the first letter, but only 25 choices for the second
P(2 spades) = = » 0.059. (since the letters must all be different), 24 choices
1326 17
for the third, and so on. Thus,
15. There are C(52, 2) = 1326 different 2-card P(all different letters)
hands. There are C(13, 2) = 78 ways to get a
26 ⋅ 25 ⋅ 24 ⋅ 23 ⋅ 22
2-card hand where both cards are of a single =
named suit, but there are 4 suits to choose from. 265
Thus, 1 ⋅ 25 ⋅ 24 ⋅ 23 ⋅ 22
=
P(two cards of same suit) 264
4 ⋅ C (13, 2) 312 4 303, 600
= = = » 0.235. =
C (52, 2) 1326 17 456, 976
18, 975
16. There are C (12, 2) = 66 ways to pick 2 face = » 0.6644.
28, 561
cards; hence,
66 11
P(2 face cards) = = » 0.0498.
1326 221

22. There are 265 possible 5-letter “words,” and 235 29. P(matched pair)
“words” that do not contain x, y, or z. Hence, = P(2 black or 2 brown or 2 blue)
P(no x, y, or z) = P(2 black) + P(2 brown) + 2(2 blue)
235 6, 436,343 C (9, 2) C (6, 2) C (2, 2)
= = » 0.5417. = + +
265 11,881,376 C (17, 2) C (17, 2) C (17, 2)
36 15 1
25. P(at least 2 presidents have the same birthday) = + +
136 136 136
= 1 - P(no 2 presidents have the 52 13
= =
same birthday) 136 34
30. The number of orders of the three types of birds
The number of ways that 43 people can have is P(3, 3). The number of arrangements of the
the same or different birthdays is (365)43 . The crows is P(3, 3), of the bluejays is P(4, 4), and
number of ways that 43 people can have all of the starlings is P(5, 5). The total number of
different birthdays is the number of permutations arrangements of all the birds is P(12, 12).
of 365 things taken 43 at a time or P(365, 43). P(all birds of same type are sitting together)
Thus, P(3, 3) ⋅ P(3, 3) ⋅ P(4, 4) ⋅ P(5, 5)
=
P(at least 2 presidents have the same birthday) P(12, 12)
P(365, 43) » 2.165 ´ 10-4
= 1- .
36543
31. There are 6 letters so the number of possible
(Be careful to realize that the symbol P is spellings (counting duplicates) is 6! = 720. Since
sometimes used to indicate permutations and the letter 1 is repeated 2 times and the letter t is
sometimes used to indicate probability; in this repeated 2 times, the spelling “little” will occur
solution, the symbol is used both ways.) 2!2! = 4 times. The probability that “little” will
26. Using the result from Example 6, the probability be spelled is 7204 = 1 .
180
that at least 2 people in a group of n people have
the same birthday is 32. There are 11 letters so the number of possible
P(365, n) spellings (counting duplicates) is 11! = 39,916,800.
1- .
(365)n Since the letter s is repeated 4 times, the letter s is
repeated 4 times, and the letter p is repeated 2 times,
Therefore, the probability that at least 2 of the the spelling “Mississippi” will occur 4!4!2! = 1152
100 U.S. Senators have the same birthday is times. The probability that “Mississippi” will be
P(365, 100) spelled is
1- . 1152
(365)100 » 0.0000289.
39,916,800
27. Since there are 435 members of the House of
Representatives, and there are only 365 days in a 33. Each of the 4 people can choose to get off at any
year, it is a certain event that at least 2 people one of the 7 floors, so there are 7 4 ways the four
will have the same birthday. Thus, people can leave the elevator. The number of ways
the people can leave at different floors is the
P(at least 2 members have the same birthday) = 1. number of permutations of 7 things (floors) taken
4 at a time or
28. There are C (n, 2) ways to pick which pair is to
P(7, 4) = 7 ⋅ 6 ⋅ 5 ⋅ 4 = 840.
have the same birthday. One member of the pair
has 365 choices of a birthday, the other only 1. The probability that no 2 passengers leave at the
The other n - 2 people have 364, 363, 362, etc., same floor is
choices. Thus, the probability is
P(7, 4) 840
= » 0.3499.
P(365, n - 1) 7 4 2401
C (n, 2) ⋅ .
(365)n
Thus, the probability that at least 2 passengers
leave at the same floor is
1 - 0.3499 = 0.6501.
(Note the similarity of this problem and the
“birthday problem.”)
Section 8.3 505
34. Let x = the total number of balls. Since the 38. There are C (11, 3) ways to choose 3 typewriters.
probability of picking 5 balls which all are blue
11! 11 ⋅ 10 ⋅ 9
is 12 , we can see that x > 5 . (If x = 5, the C (11, 3) = = = 165
3! 8! 3⋅ 2 ⋅1
probability would be 1.) Let’s look at the number
of blue balls needed. If there were 6 blue balls, There are C (9, 3) ways to choose 3 nondefective
C (6, 5) = 6 and C ( x, 5) = 12, since the typewriters.
probability is 1. Since x must be larger than the
2 9! 9⋅8⋅7
C (9, 3) = = = 84
number of blue balls, x ³ 7. But since 3! 6! 3⋅ 2 ⋅1
C (7, 5) = 21, Thus,
C ( x, 5) ³ 21 ¹ 12. P(3 drawn from the 9 are nondefective)
If there were 7 blue balls, C (7, 5) = 21 and 84 28
= = .
C ( x, 5) = 42. Since x ³ 8, 165 55
39. There are C (9, 4) possible ways to choose 4
C ( x, 5) ³ 56 ¹ 42.
nondefective typewriters out of the C (11, 4)
If there were 8 blue balls, C (8, 5) = 56 and possible ways of choosing any 4. Thus,
C ( x, 5) = 112. Since x ³ 9,
C (9, 4) 126 21
P(no defective) = = = .
C ( x, 5) ³ 126 ¹ 112. C (11, 4) 330 55
If there were 9 blue balls, C (9, 5) = 126 and 40. There are C(12, 4) = 495 different ways to choose
C ( x, 5) = 252. Since x ³ 10, C ( x, 5) ³ 252, 4 engines for testing from the crate of 12. A crate
and x must be 10. will not be shipped if any one of the 4 in the sample
is defective. If there are 2 defectives in the crate,
Therefore, there were 10 balls, 9 of them blue, then there are C(10, 4) = 210 ways of choosing a
C (9, 5) 1 sample with no defectives. Thus,
P(all 5 blue) = = .
C (10, 5) 2 P(shipping a crate with 2 defectives)
210 14
35. P(at least one $100-bill) = = » 0.424.
495 33
= P(1 $100-bill) + P(2 $100-bills)
41. There are C (12, 5) = 792 ways to pick a sample
C (2, 1) C (4, 1) C (2, 2) C (4, 0)
= + of 5. It will be shipped if all 5 are good. There are
C (6, 2) C (6, 2)
C (10, 5) = 252 ways to pick 5 good ones, so
8 1 9 3
= + = =
15 15 15 5
252 7
C (2, 0) C (4, 2) 6 2 P(all good) = = » 0.318.
P(no $100-bill) = = = 792 22
C (6, 2) 15 5
42. If Melanie is first and Boyd last, the remaining 7
It is more likely to get at least one $100-bill. can be in any order. There are 9! possible orders,
so
36. There are 11 ways to choose 1 typewriter from
7! 1
the shipment of 11. Since 2 of the 11 are defective, P(Melanie first, Boyd last) = = .
there are 9 ways to choose 1 nondefective 9! 72
typewriter. Thus, 43. P(not Scottsdale customer)
9 é number of choices of 4 out of the ù
P(1 drawn from the 11 is not defective) = . ê 5 non-Scottsdale customers ú
11 = ëê ûú
37. There are C (9, 2) possible ways to choose 2 number of choices of 4 out of the 6 customers
nondefective typewriters out of the C (11, 2) C (5, 4) 5 1
= = =
possible ways of choosing any 2. Thus, C (6, 4) 15 3
C (9, 2) 36 44. There are P(5, 5) different orders of the names.

P(no defective) = = .
C (11, 2) 55 Only one of these would be in alphabetical order.
Therefore, P(5, 5) - 1 are not in alphabetical
order. Thus,
P(not in alphabetical order) P(exactly 3 Hoopas)

P(5, 5) - 1 120 - 1 119 C (5, 3) C (15, 2)
= = = . =
P(5, 5) 120 120 C (20, 5)
175
= » 0.068
45. There are 20 people in all, so the number 2584
of possible 5-person committees is
C (20, 5) = 15,504. Thus, in parts (g) There can be 2 to 5 Pomos, the rest chosen
(a)-(g), n( S ) = 15,504. from the 11 non-Pomos.
(a) There are C (10, 3) ways to choose the 3 men P(at least 2 Pomos)
and C (10, 2) ways to choose the 2 women. C (9, 2) C (11, 3) + C (9, 3) C (11, 2) + C (9, 4) C (11, 1) + C (9, 5) C (11, 0)
=
Thus, C (20, 5 )
P(3 men and 2 women) 503
= » 0.779
C (10, 3) C (10, 2) 120 ⋅ 45 646
= =
C (20, 5) 15,504 5 1
46. (a) P(first person) = =
225 40 8
= » 0.348.
646
5(39!)
(b) P(last person) =
(b) There are C (6, 3) ways to choose the 3 40!
Miwoks and C (9, 2) ways to choose the 5(39!)
2 Pomos. Thus, =
40(39!)
P(exactly 3 Miwoks and 2 Pomos) 5 1
= =
C (6, 3) C (9, 2) 20 ⋅ 36 40 8
= =
C (20, 5) 15,504 (c) No, everybody has the same chance.
15
= » 0.046. 47. There are 21 books, so the number of selection
323 of any 6 books is
(c) Choose 2 of the 6 Miwoks, 2 of the 5 Hoopas, C (21, 6) = 54, 264.
and 1 of the 9 Pomos. Thus,
(a) The probability that the selection consisted
P(2 Miwoks, 2 Hoopas, and a Pomo)
of 3 Hughes and 3 Morrison books is
C (6, 2) C (5, 2) C (9, 1) 15 ⋅ 10 ⋅ 9
= = C (9, 3) C (7, 3) 85 ⋅ 35
C (20, 5) 15,504 =
C (21, 6) 54, 264
225
= » 0.087. 2940
2584 = » 0.0542.
54, 264
(d) There cannot be 2 Miwoks, 2 Hoopas, and
2 Pomos, since only 5 people are to be (b) A selection containing exactly 4 Baldwin
selected. Thus, books will contain 2 of the 16 books by the
P(2 Miwoks, 2 Hoopas, and 2 Pomos) = 0. other authors, so the probability is
C (5, 4) C (16, 2) 5 ⋅ 120
(e) Since there are more women then men, there =
must be 3, 4, or 5 women. C (21, 6) 54, 264
600
P(more women than men) = » 0.0111.
54, 264
C (10, 3) C (10, 2) + C (10, 4) C (10, 1) + C (10, 5) C (10, 0)
=
C (20, 5) (c) The probability of a selection consisting
7752 1 of 2 Hughes, 3 Baldwin, and 1 Morrison
= = book is
15,504 2
C (9, 2) C (5, 3) C (7, 1) 30 ⋅ 10 ⋅ 7
(f) Choose 3 of 5 Hoopas and any 2 of the =
C (21, 6) 54, 264
15 non-Hoopas.
2520
=
54, 264
» 0.0464.

Section 8.3 507
(d) A selection consisting of at least 4 Hughes 36 36

books may contain 4, 5, or 6 Hughes books, P(straight flush) = =
C (52 ,2) 2,598,960
with any remaining books by the other
authors. Therefore, the probability is » 0.00001385
æ C (9, 4) C (12, 2) + C (9, 5) C (12, 1) ö÷ = 1.385 ´ 10-5.

çç ÷÷
çè + C (9, 6) C (12, 0) ø÷
50. The four of a kind can be chosen in 13 ways and
C (21, 6) then is matched with 1 of the remaining 48 cards
126 ⋅ 66 + 126 ⋅ 12 + 84 to make a 5-card hand containing four of a kind.
=
54, 264 Thus, there are 13 ⋅ 48 = 624 poker hands with
8316 + 1512 + 84 four of a kind. It follows that
=
54, 264 P(four of a kind)
9912 624 624 1
= » 0.1827. = = =
54, 264 C (52, 2) 2,598,960 4165
(e) Since there are 9 Hughes books and 5 » 2.401 ´ 10-4.
Baldwin books, there are 14 books written
by males. The probability of a selection with 51. A straight could start with an ace, 2, 3, 4, 5, 6, 7,
exactly 4 books written by males is 8, 9, or 10 as the low card, giving 40 choices. For
C (14, 2) C (7, 2) 1001 ⋅ 21 each succeeding card, only the suit may be
= chosen. Thus, the number of straights is
C (21, 6) 54, 264
=
21,021
» 0.3874. 40 ⋅ 44 = 10, 240.
54, 264
But this also counts the straight flushes, of which
(f) A selection with no more than 2 books there are 36 (see Exercise 49), and the 4 royal
written by Baldwin may contain 0, 1, or flushes. There are thus 10,200 straights that are
2 books by Baldwin, with the remaining not also flushes, so
books by the other authors. Therefore, the
10, 200
probability is P(straight) = » 0.0039.
2,598,960
C (5, 0) C (16, 6) + C (5, 1) C (16, 5) + C (5, 2) C (16, 4)
C (21, 6)
8008 + 5 ⋅ 4368 + 10 ⋅ 1820 52. There are 13 different values with 4 cards of each
=
54, 264 value. The total number of possible three of a
8008 + 21,840 + 18, 200 kinds is then 13 ⋅ C (4,3). The other 2 cards must
= be chosen from the remaining 48 cards of
54, 264
different value. However, these 2 cards must be
48,048
= » 0.8854. different. Thus, for the last 2 cards, there are 48
54,264 cards to choose from, but the cards must not have
the same value. The number of possibilities for
48. There are C (52,5) different 5-card poker hands. the last 2 cards is C (48, 2) - 12 ⋅ C (4, 2), and
There are 4 royal flushes, one for each suit. Thus,
P(three of a kind)
P(royal flush)
13 ⋅ C (4,3) [C (48, 2) - 12 ⋅ C (4, 2)]
4 4 =
= = C (52,5)
C (52,5) 2,598,960
» 0.0211.
1
=
649, 740 53. There are 13 different values of cards and 4 cards
of each value. Choose 2 values out of the 13 for
» 1.539 ´ 10-6. the values of the pairs. The number of ways to
select the 2 values is C(13, 2). The number of
49. A straight flush could start with an ace, ways to select a pair for each value is C(4, 2).
2, 3, 4, , 7, 8, or 9. This gives 9 choices in each There are 52 - 8 = 44 cards that are neither of
of 4 suits, so there are 36 choices in all. Thus, these 2 values, so the number of ways to select
the fifth card is C (44,1). Thus,

C (13, 2) C (4, 2) C (4, 2) C (44,1) For Exercises 59 through 65, use the fact that the
P(two pairs) =
C (52,5) number of 7-card selections is C (52, 7).
123,552 59. Pick a kind for the pair: 13 choices
= » 0.0475.
2,598,960 Choose 2 suits out of the 4 suits for this kind:
C (4, 2)
54. There are 13 different values with 4 cards of
each value. The total number of possible pairs Then pick 5 kinds out of the 12 remaining:
is 13 ⋅ C (4, 2). The remaining 3 cards must be C (12, 5)
chosen from the 48 cards of different value. For each of these 5 kinds, pick one of the
However, among these 3 we cannot have 3 4 suits: 45
of a kind nor can we have 2 of a kind. The product of these factors gives the numerator
P(one pair)
and the denominator is C (52, 7).
13 ⋅ C (4, 2)[C (48, 3) - 12 ⋅ C (4, 3) - 12 ⋅ C (4, 2) ⋅ C (44,1)] 13 ⋅ C (4, 2) ⋅ C (12, 5) ⋅ 45
= » 0.4728
C (52, 5) C (52, 7)
» 0.4226
60. Pick the 2 kinds for the 2 pairs: C (13, 2)
55. There are C (52,13) different 13-card bridge For each of these kinds, choose 2 of the 4 suits:
hands. Since there are only 13 hearts, there is two factors of C (4, 2)
exactly one way to get a bridge hand containing There are now 3 cards remaining which must be
only hearts. Thus, 3 of the 11 kinds remaining: C (11, 3)
1 For each of these 3 kinds we pick one of the
P(only hearts) = » 1.575 ⋅ 10-12.
C (52,13) 4 suits: 43
The product of these factors gives the numerator
56. The hand can have exactly 3 aces or 4 aces. and the denominator is C (52, 7).
There are C (4,3) = 4 ways to pick exactly
3 aces, and there are C (48,10) ways to pick the C (13, 2) ⋅ [C (4, 2)]2 ⋅ C (11, 3) ⋅ 43
other 10 cards. Also, there is only C (4, 4) = 1 » 0.2216
C (52, 7)
way to pick 4 aces, and there are C (48,9) ways
to pick the other 9 cards. Hence,
C (4,3) C (48,10) + C (4, 4) C (48,9) 61. Pick a kind for the three-of-a-kind: 13 choices
P(3 aces) = Choose 3 suits out of the 4 suits for this kind:
C (52,13)
C (4, 3)
» 0.0438.
There are now 4 cards remaining which must be
57. There are C (4, 2) ways to obtain 2 aces, C (4, 2) 4 of the 12 kinds remaining: C (12, 4)
ways to obtain 2 kings, and C (44,9) ways to For each of these 4 kinds we pick one of the
obtain the remaining 9 cards. Thus,
4 suits: 44
P(exactly 2 aces and exactly 2 kings) The product of these factors gives the numerator
C (4, 2) C (4, 2) C (44,9) and the denominator is C (52, 7).
= » 0.0402.
C (52,13)
13 ⋅ C (4, 3) ⋅ C (12, 4) ⋅ 44
» 0.0493
58. The number of ways of choosing 3 suits is C (52, 7)
P(4,3). The number of ways of choosing 6 of
one suit is C (13,6), 4 of another is C (13, 4) and 62. Pick a kind for the four-of-a-kind: 13 choices
3 of another is C (13,3). Thus, Choose 4 suits out of the 4 suits for this kind:
C (4, 4) (there’s only one way of doing this!)
P(6 of one suit, 4 of another, and 3 of another) There are now 3 cards remaining which must be
P(4,3) C (13,6) C (13, 4) C (13,3) 3 of the 12 kinds remaining: C (12, 3)
=
C (52,13) For each of these 3 kinds we pick one of the
» 0.0133. 4 suits: 43
The product of these factors gives the numerator
Order is important in this problem because 6
and the denominator is C (52, 7).
spades, 4 hearts, and 3 clubs would be different
than 6 hearts, 4 clubs, and 3 spades. 13 ⋅ C (4, 4) ⋅ C (12, 3) ⋅ 43
» 0.0014
C (52, 7)

Section 8.3 509
63. Pick a suit: 4 C (6,5) C (93,1) = 558.

Now we either get exactly 5 of this suit and 2 of
other suits: C (13,5) ⋅ C (39, 2) Thus, the probability of picking 5 of the 6
…or exactly 6 of this suit and 1 of another suit: numbers correctly is
C (13, 6) ⋅ C (39,1) C (6,5) C (93,1)
» 4.980 ´ 10-7.
…or all 7 of our chosen suit: C (13, 7) . We now C (99,6)
add these options over our usual denominator.
68. Let A be the event of drawing four royal flushes
4 ⋅ [C (13,5) ⋅ C (39, 2) + C (13, 6) ⋅ C (39,1) + C (13, 7)] in a row all in spades, and B be the event of
C (52, 7) meeting four strangers all with the same birthday.
» 0.0306 Then,
é 1 ù4
64. Pick 2 kinds: C (13, 2) P( A) = ê ú .
ê C (52,5) ú
Pick either 3 of the first kind and 2 of the second ë û
and 2 not of either of these 2 kinds: For four people, the number of possible birthdays
C (4,3) ⋅ C (4, 2) ⋅ C (44, 2) is 3654. Of these there are 365 which are the
…or pick 2 of the first kind and 3 of the second same (that is, all birthdays January 1 or January 2
and 2 not of either of these 2 kinds: or January 3, etc.).
C (4, 2) ⋅ C (4,3) ⋅ C (44, 2) 365 1
…or pick 3 of each kind and 1 of a different kind: P( B) = 4
=
365 3653
C (4,3) ⋅ C (4,3) ⋅ C (44,1) Therefore,
Noting that the first and second expressions
é 1 ù4 1
above are the same, we can assemble the P( A Ç B) = ê ú
numerator over the usual denominator. ê C (52,5) ú 3653
ë û
C (13, 2) ⋅ [2 ⋅ C (4, 3) ⋅ C (4, 2) ⋅ C (44, 2) + C (4, 3) ⋅ C (4, 3) ⋅ C (44,1)] » 4.507 ´ 10-34.
C (52, 7) No, this probability is much smaller than that of
» 0.0269 winning the lottery.
65. We need at least 3 hearts out of 5 cards. This can 69. The probability of picking six numbers out
happen in three ways: of 49 is
3 hearts, 2 non-hearts: C (11,3) ⋅ C (39, 2) 1 1
P(6 out of 49) = =
4 hearts, 1 non-heart: C (11, 4) ⋅ C (39,1) C (49, 6) 13,983,816
5 hearts: C (11,5) The probability of picking of picking five
Add these options over the usual denominator. numbers out of 52 is
C (11,3) ⋅ C (39, 2) + C (11, 4) ⋅ C (39,1) + C (11,5) 1 1
P(5 out of 52) = =
C (52,7) C (52,5) 2,598,960
» 0.0640 The probability of winning the lottery when
picking five out of 52 is higher.
66. There are C (99, 6) = 1,120,529, 256 different
ways to pick 6 numbers from 1 to 99, but there is 70. (a) The number of ways to select 5 numbers
only 1 way to win; the 6 numbers you pick must between 1 and 55 is C (55,5) = 3, 478, 761
exactly match the 6 winning numbers, without
and there are 42 ways to select the bonus
regard to order. Thus,
number.
1 1
P(win the big prize) = P(winning jackpot) =
1,120,529, 256 3, 478, 761 ⋅ 42
» 8.924 ´ 10-10. =
1
146,107,962
67. To find the probability of picking 5 of the 6 lottery
numbers correctly, we must recall that the total (b) The number of selections you would make
number of ways to pick the 6 lottery numbers is over 138 years is
C(99, 6) = 1,120,529, 256. To pick 5 of the 138 ⋅ 365 ⋅ 24 ⋅ 60 = 72,582, 480.
6 winning numbers, we must also pick 1 of the
93 losing numbers. Therefore, the number of The probability that none of the selections
ways of picking 5 of the 6 winning numbers is win is

æ 146,107,961 ö÷72,482,480 until there is only one team left, and it is

çç ÷ » 0.6085. the one that lost all of its games. By the
çè 146,107,962 ÷÷ø
multiplication principle, this means that
there were
Therefore, the probability of winning is
1 - 0.6085 = 0.3915. This calculator 8! = 8 ⋅ 7 ⋅ 6 ⋅ 5 ⋅ 4 ⋅ 3 ⋅ 2 ⋅ 1 = 40,320
answer is slightly inaccurate because of
rounding in the calculator’s arithmetic. different “perfect progressions” possible.
The correct answer to four places is 0.3911. (d) Thus,
P(“perfect progression” in an 8-team league)
71. (a) The number of ways to select 6 numbers be-
8!
tween 1 and 49 is C (49, 6) = 13,983,816. = » 0.0001502 = 1.502 ´ 10-4.
The number of ways to select 3 of the 6 228
numbers, while not selecting the bonus (e) If there are n teams in the league, then the
number is “Won” column will begin with n - 1 ,
C (6,3) C (42,3) = 20 ⋅ 11, 480 followed by n - 2, then n - 3, and so on
= 229, 600. down to 0. It can be shown that the sum of
n(n -1)
these n numbers is , so there are
The probability of winning fifth prize is 2
229, 600 2n(n-1) / 2 different win/lose progressions

» 0.01642. possible. The n teams can be ordered in n!
13,983,816 different ways, so there are n! different
(b) The number of ways to select 2 of the “perfect progressions” possible. Thus,
6 numbers plus the bonus number is P(“perfect progression” in an n-team league)
C (6, 2) C (1,1) C (42,3) = 15 ⋅ 1 ⋅ 11, 480 n!
= n(n-1) / 2 .
= 172, 200. 2
C (103, 19)
74. (a) » 9.366 ´ 10-5
The probability of winning sixth prize is C (162, 19)
172, 200 C (48, 19)

» 0.01231. (b) » 7.622 ´ 10-6
13,983,816 C (81, 19)
72. P(saying “math class is tough”) 75. (a) There are only 4 ways to win in just 4 calls:
C (1,1) C (269,3) the 2 diagonals, the center column, and the
= » 0.0148 center row. There are C (75, 4) combinations
C (270, 4)
of 4 numbers that can occur. The probability
No, it is not correct. The correct figure is 1.48%. that a person will win bingo after just
4 numbers are called is
73. (a) There were 28 games played in the season, 4 » 3.291 ´ 10-6.
since the numbers in the “Won” column C (75,4)
have a sum of 28 (and the numbers in the
“Lost” column have a sum of 28). (b) There is only 1 way to get an L. It can occur in as
few as 9 calls. There are C (75,9)
(b) Assuming no ties, each of the 28 games had combinations of 9 numbers that can occur in
2 possible outcomes; either Team A won 9 calls , so the probability of an L in 9 calls
and Team B lost, or else Team A lost and
Team B won. By the multiplication is 1
C (75,9)
» 7.962 ´ 10-12.
principle, this means that there were
(c) There is only 1 way to get an X-out. It can
228 = 268, 435, 456 ocur in as few as 8 calls. There are C (75,8)
different outcomes possible. combinations of 8 numbers that can occur.
The probability that an X-out occurs in 8
(c) Any one of the 8 teams could have been the 1
calls is C (75,8) » 5.927 ´ 10-11.
one that won all of its games, any one of the
remaining 7 teams could have been the one
that won all but one of its games, and so on,

Section 8.4 511
(d) Four columns contain a permutation of 8.4 Binomial Probability

15 numbers taken 5 at a time. One column
contains a permutation of 15 numbers taken Your Turn 1
4 at a time. The number of distinct cards is
P(15,5) 4 ⋅ P(15, 4) » 5.524 ´ 1026. P(exactly 2 of 6) = C (6, 2)(0.59)2 (0.41)4
= 15(0.3481)(0.0283)
æ 3 ö6 » 0.1475
76. (a) P(6 blues drawn | red removed) = çç ÷÷÷
çè 5 ø Your Turn 2
and
P(at least one incorrect charge)
æ 2 ö6
P(6 blues drawn | blue removed) = çç ÷÷÷ . = 1 - P(no incorrect charges in 4)
çè 5 ø
= 1 - C (4, 0)(0.29)0 (0.71)4
Since the box initially contained equal
numbers of red and blue balls, » 1 - 0.2541
1 = 0.7459
P(red removed) = P(blue removed) = .
2
By Bayes’ Theorem, Your Turn 3
P(red removed | 6 blues drawn) P(at most 3 incorrect charges in 6)
= [ P(6 blues drawn | red removed) ⋅ P(red removed) ] = P(0) + P(1) + P(2) + P(3)
¸ é P(6 blues drawn | red removed) ⋅ P(red removed) ù = C (6, 0)(0.29)0 (0.71)6 + C (6,1)(0.29)1(0.71)5
ê ú
êë + P(6 blues drawn | blue removed) ⋅ P(blue removed) úû + C (6, 2)(0.29) 2 (0.71)4 + C (6,3)(0.29)3 (0.71)3
6
æ 3 ö÷ 1 » 0.9372
çç ÷ ⋅
çè 5 ÷ø 2
=
æ 3 ÷ö6 1 æ 2 ö6 1 8.4 Warmup Exercises
çç ÷ ⋅ + çç ÷÷ ⋅
çè 5 ÷ø 2 çè 5 ø÷ 2
6 W1. C (100,10) » 1.731 ´ 1013
3
= » 0.9193
6 6
3 + 2 W2. C(32, 8) = 10,518,300
(b) P(44 blues in 80 | red removed)
æ 3 ö44 æ 2 ö36
= C (80, 44) ⋅ çç ÷÷÷ çç ÷÷÷ 8.4 Exercises
èç 5 ø èç 5 ø
1. This is a Bernoulli trial problem with
and
P(44 blues in 80 | blue removed) P(success) = P(girl) = 1. The probability of
2
44 36
æ2ö æ ö
= C (80, 44) ⋅ çç ÷÷÷ çç 3 ÷÷ exactly x successes in n trials is
èç 5 ø çè 5 ÷ø
C (n, x ) p x (1 - p)n - x ,
(See the next section for an explanation of
this probability). By Bayes’ Theorem, where p is the probability of success in a single
trial. We have n = 5, x = 2, and p = 12
P(red removed | 44 blues in 80)
= [ P(44 blues in 80 | red removed) ⋅ P(red removed) ] Note that

¸ é P(44 blues in 80 | red removed) ⋅ P (red removed) ù
ê ú 1 1
êë + P(44 blues in 80 | blue removed) ⋅ P(blue removed) úû 1- p = 1- = .
2 2
æ 3 ö44 æ 2 ö36 1
C (80, 44) ⋅ çç ÷÷ çç ÷÷ ⋅ P(exactly 2 girls and 3 boys)
çè 5 ÷ø çè 5 ÷ø 2
=
æ 3 ö44 æ 2 ö36 1 æ 2 ö44 æ 3 ö36 æ 1 ö2 æ 1 ö3
C (80, 44) ⋅ çç ÷÷÷ çç ÷÷÷ ⋅ + C (80, 44) ⋅ çç ÷÷÷ çç ÷÷÷ = C (5, 2) çç ÷÷ çç ÷÷
èç 5 ø èç 5 ø 2 çè 5 ø çè 5 ø çè 2 ÷ø èç 2 ÷ø
» 0.9624 10 5
= = » 0.313
32 16

2. This is a Bernoulli trial problem with 7. P(no more than 3 boys)

P(success) = P(girl) = 12 . The probability of = 1 - P(at least 4 boys)
exactly x successes in n trials is = 1 - P(4 boys or 5 boys)
= 1 - [ P(4 boys) + P(5 boys)]
C (n, x ) p x (1 - p )n - x ,
æ 5 1 ö÷
= 1 - çç + ÷
where p is the probability of success in a single çè 32 32 ÷ø
trial.
6
1. = 1-
Here n = 5, x = 3, and p = 2 32
3 13
P(exactly 3 girls and 2 boys) = 1- = » 0.813
16 16
æ 1 ö3 æ 1 ö2
= C (5,3) çç ÷÷÷ çç ÷÷÷ 8. P(no more than 4 girls)
çè 2 ø çè 2 ø
= 1 - P(5 girls)
æ 1 ö 5
= 10 çç ÷÷÷ = » 0.313 æ 1 ö5 æ 1 ö0
çè 32 ø 16 = 1 - C (5,5) çç ÷÷÷ çç ÷÷÷
èç 2 ø çè 2 ø
3. We have 1 31
= 1- = » 0.969
n = 5, x = 0, p = 1 , and 1 - p = 1. 32 32
2 2
9. On one roll, P(1) = 1. We have n = 12,
æ 1 ö0 æ 1 ö5 6
P(no girls) = C (5, 0) çç ÷÷ çç ÷÷ x = 12, and p = 1. Note that 1 - p = 5.
çè 2 ø÷ çè 2 ø÷ 6 6
1 Thus,
= » 0.031
32 æ 1 ö12 æ 5 ö0
P(exactly 12 ones) = C (12,12) çç ÷÷÷ çç ÷÷÷
èç 6 ø èç 6 ø
4. We have n = 5, x = 0 is the number of boys,
» 4.594 ´ 10-10.
and P = 1 is the probability of having a boy.
2 1 ,so
10. We have n = 12, x = 6, and p = 6
æ 1 ö0 æ 1 ö5 1
P(no boys) = C (5, 0) çç ÷÷ çç ÷÷ = » 0.031 æ 1 ö6 æ 5 ö6
çè 2 ÷ø çè 2 ÷ø 32 P(exactly 6 ones ) = C (12, 6) çç ÷÷÷ çç ÷÷÷
èç 6 ø çè 6 ø
5. “At least 4 girls” means either 4 or 5 girls. » 0.0066.
P(at least 4 girls) æ 1 ö1 æ 5 ö11
11. P(exactly 1 one ) = C (12,1) çç ÷÷÷ çç ÷÷÷
æ 1 ö4 æ 1 ö1 æ 1 ö5 æ 1 ö0 èç 6 ø èç 6 ø
= C (5, 4) çç ÷÷÷ çç ÷÷÷ + C (5,5) çç ÷÷÷ çç ÷÷÷
èç 2 ø èç 2 ø èç 2 ø èç 2 ø » 0.2692
5 1 6 3 12. We have n = 12, x = 2, and p = 1 , so
= + = = » 0.188 6
32 32 32 16
æ 1 ö2 æ 5 ö10
P(exactly 2 ones ) = C (12,2) çç ÷÷÷ çç ÷÷÷
6. We have 3, 4, or 5 boys, so çè 6 ø èç 6 ø
P(at least 3 boys) » 0.2961.
3 2 4 1
æ1ö æ ö æ ö æ ö
= C (5,3) çç ÷÷÷ ç 1 ÷ + C (5, 4) çç 1 ÷÷ ç1÷
çè 2 ø ççè 2 ÷÷ø çè 2 ÷ø ççè 2 ÷÷ø
æ 1 ö5 æ 1 ö0
+ C (5,5) çç ÷÷÷ çç ÷÷÷
çè 2 ø çè 2 ø
10 5 1 16 1
= + + = = .
32 32 32 32 2

Section 8.4 513
13. “No more than 3 ones” means 0, 1, 2, or 3 ones. 20. P(3 incorrect charges)
Thus,
æ 1 ö3 æ 29 ö12
P(no more than 3 ones) = C (15,3) çç ÷÷ çç ÷÷
èç 30 ø÷ çè 30 ø÷
= P(0 ones) + P(1 one) + P(2 ones) + P(3 ones)
» 0.0112
æ 1 ö0 æ 5 ö12 æ 1 ö1 æ 5 ö11
= C (12, 0) çç ÷÷ çç ÷÷ + C (12,1) çç ÷÷ çç ÷÷ 21. P(0 incorrect charges)
çè 6 ÷ø çè 6 ÷ø çè 6 ÷ø çè 6 ÷ø
æ 1 ö0 æ 29 ö15
æ 1 ö2 æ 5 ö10 æ 1 ö3 æ 5 ö9 = C (15, 0) çç ÷÷ çç ÷÷
+ C (12, 2) çç ÷÷ çç ÷÷ + C (12, 3) çç ÷÷ çç ÷÷ çè 30 ÷ø çè 30 ÷ø
çè 6 ÷ø çè 6 ÷ø çè 6 ÷ø çè 6 ÷ø
» 0.8748. » 0.6014
14. “No more than 1 one” means 0 one or 1 one. 22. P(at least 1 incorrect charges)
Thus, = 1 - P(no incorrect charges)
P(no more than 1 one) = P(0 one) + P(1 one)
= 1 - 0.6014 (from Exercise 25)
æ 1 ö0 æ 5 ö12 æ 1 ö1 æ 5 ö11
= C (12,0) çç ÷÷÷ çç ÷÷÷ + C (12,1) çç ÷÷÷ çç ÷÷÷ » 0.3986
èç 6 ø èç 6 ø èç 6 ø çè 6 ø
» 0.3813. 23. P(at least 2 incorrect charges)
= 1 - P(0 or 1 incorrect charges)
17. C (n, r ) + C (n, r + 1)
æ 1 ö0 æ 29 ö15
n! n! = 1 - C (15,0) çç ÷÷÷ çç ÷÷÷
= + çè 30 ø èç 30 ø
r! ( n - r )! ( r + 1)! [ n - ( r + 1) ]!
æ 1 ö1 æ 29 ö14
n! ( r + 1) - C (15,1) çç ÷÷÷ çç ÷÷÷
= èç 30 ø èç 30 ø
r! ( r + 1) ( n - r )!
» 0.0876
n! ( n - r )
+
( r + 1)! [ n - ( r + 1) ]! (n - r ) 24.
rn! + n! n(n!) - rn! P(at most 2 incorrect charges)
= +
( r + 1)! (n - r )! (r + 1)! (n - r )! æ 1 ö÷0 æ 29 ö÷15 æ ö1 æ ö14
= C (15, 0) çç ÷ çç ÷ + C (15,1) çç 1 ÷÷ çç 29 ÷÷
rn! + n! + n(n!) - rn! èç 30 ø÷ èç 30 ø÷ èç 30 ø÷ èç 30 ÷ø
=
(r + 1)! (n - r )!
æ 1 ö÷2 æ 29 ö÷13
n! (n + 1) + C (15, 2) çç ÷ ç ÷
= èç 30 ø÷ èçç 30 ø÷
( r + 1)! (n - r )! » 0.9875
(n + 1)!
=
( r + 1)! [ (n + 1) - (r + 1) ]!
For Exercises 25 through 28, we define a success to be
= C (n + 1, r + 1) the event that the family hardly ever pays off the
balance. In this situation, n = 20, p = 0.254 and
18. Since these two crib deaths cannot be assumed
to be independent events, the use of binomial 1 - p = 0.746.
probabilities is not applicable and thus the
probabilities that are computed are not correct. 25. P(6) = C (20, 6)(0.254)6 (0.746)14
19. Since the potential callers are not likely to have » 0.1721
birthdates that are distributed evenly throughout
26. P(9) = C (20,9)(0.254)9 (0.746)11
the twentieth century, the use of binomial
probabilities is not applicable and thus, the » 0.0294
probabilities that are computed are not correct. 27.
For Exercises 20 through 24 we define a success to be P(at least 4)
the event that a customer is charged incorrectly. In this 0 20 1 19
= 1 - C (20, 0)(0.254) (0.746) - C (20,1)(0.254) (0.746)
situation, n = 15, p = 301 and 1 - p = 29 .
30 2 18 3 17
- C (20, 2)(0.254) (0.746) - C (20, 3)(0.254) (0.746)
» 0.7868

28. (b) The probability that from 28 to 30 people

(inclusive) like the product is
P(at most 5)
0 20 1 19 P(exactly 28) + P(exactly 29) + P(exactly 30)
= C (20, 0)(0.254) (0.746) + C (20,1)(0.254) (0.746)
2 18 3 17 = C (58, 28)(0.7)28 (0.3)30 + C (58, 29)(0.7)29 (0.3)29
+ C (20, 2)(0.254) (0.746) + C (20, 3)(0.254) (0.746)
4 16 5 15 + C (58,30)(0.7)30 (0.3)28
+ C (20, 4)(0.254) (0.746) + C (20, 5)(0.254) (0.746) » 0.0024.
» 0.6009
33. (a) Since 80% of the “good nuts” are good, 20%
29. n = 20, p = 0.05, x = 0 of the “good nuts” are bad. Let’s let success
represent “getting a bad nut.” Then 0.2 is the
P(0 defective transistors) = C (20,0)(0.05)0 (0.95)20 probability of success in a single trial. The
» 0.3585 probability of 8 successes in 20 trials is
30. We have n = 20, p = 0.05, and 1 - p = 0.95. C (20, 8)(0.2)8 (1 - 0.2)20-8
Thus,
= C (20, 8)(0.2)8 (0.8)12
P(at most 2 defective transistors) » 0.0222
= P(none defective) + P(one defective)
(b) Since 60% of the “blowouts” are good, 40% of
+ P(two defective)
the “blowouts” are bad. Let’s let success
= C (20,0)(0.05)0 (0.95)20 + C (20,1)(0.05)1(0.95)19 represent “getting a bad nut.” Then 0.4 is the
probability of success in a single trial. The
+ C (20, 2)(0.05)2 (0.95)18 probability of 8 successes in 20 trials is
» 0.9245.
31. Let success mean producing a defective item. Then C (20,8)(0.4)8 (1 - 0.4) 20-8
we have n = 75, p = 0.05, and 1 - p = 0.95. = C (20,8)(0.4)8 (0.6)12
(a) If there are exactly 5 defective items, » 0.1797
then x = 5. Thus,
P(exactly 5 defective) (c) The probability that the nuts are
5
= C (75,5)(0.05) (0.95) 70 “blowouts” is
» 0.1488. æ Probability of “Blowouts” ö÷
çç ÷
è having 8 bad nuts out of 20 ø÷
(b) If there are no defective items, then x = 0.
æ Probability of “Good Nuts” or “Blowouts” ö÷
Thus, ç ÷
çè having 8 bad nuts of 20 ø÷
P(none defective)
0.3 éê C (20, 8)(0.4) (0.6) ùú
8 12
0 75 = ë û
= C (75, 0)(0.05) (0.95)
0.7 éê C (20, 8)(0.2) (0.8) ùú + 0.3 éê C (20, 8)(0.4) (0.6) ùú
8 12 8 12
» 0.0213. ë û ë û
» 0.7766.
(c) If there is at least 1 defective item, then we
are interested in x ³ 1. We have 34. n = 20, p = 0.05
P(at least one defective) P(fewer than 3) = P(0) + P(1) + P(2)
= 1 - P( x = 0) = C (20,0)(0.05)0 (0.95)20 + C (20,1)(0.05)1(0.95)19
» 1 - 0.021
+ C (20, 2)(0.05)2 (0.95)18
= 0.9787. » 0.9245
32. n = 58, p = 0.7 The answer is e.
(a) The probability that all 58 people like the
product is
P(all 58) = C (58,58)(0.7)58 (0.3)0

» 1.037 ´ 10-9.

Section 8.4 515
35. n = 15, p = 0.85 40, 000, 000

= 369.344
(5700)(19)
P(all 15) = C (15,15)(0.85)15 (0.15)0
» 0.0874 or about 369 such strings. Thus the
probability of a boy-string in any one of the
36. n = 15, p = 0.85 hospitals is
P(none) = C (15, 0)(0.85)0 (0.15)15

-13
40, 000, 000
(5700)(19)
( )
1.907 × 10 −6 = 7.043 × 10−4
» 4.379 ´ 10
37. n = 15, p = 0.85 or about 7 × 10−4 .
(c) The probability of a boy-string in at least
P(not all) = 1 - P(all 15)
one hospital is 1 minus the probability of no
= 1 - C (15,15)(0.85)15 (0.15)0 string in any hospital, which is
» 0.9126
1 − (1 − 7.043 × 10 −4 )5700 = 0.982
38. n = 15, p = 0.85
or about 0.98.
P(more than half ) = P(8) + P(9) + P(10) + P(11) + P(12)
(d) Boys have a birth probability greater than
+ P(13) + P(14) + P(15) 0.5.
= C (15,8)(0.85)8 (0.15)7 + C (15,9)(0.85)9 (0.15)6 42. (a) The probability of at least 54 male births out
10 5
+ C (15,10)(0.85) (0.15) + C (15,11)(0.85) (0.15) 11 4 of 84 can be found using the binomial
probability function on a calculator, and it is
+ C (15,12)(0.85)12 (0.15)3 + C (15,13)(0.85)13 (0.15)2 about 0.0058. The probability of at least 201
+ C (15,14)(0.85)14 (0.15)1 + C (15,15)(0.85)15 (0.15)0 male births out of 346 is given by the
calculator as 0.001526.
» 0.9994
(b) The male percentage is higher in the Clay
County data, but the total number of births
39. n = 100, p = 0.012, x = 2 in Clay County is much smaller, so in fact
the Macon County data is more surprising
P(exactly 2 sets of twins)
(less probable).
= C (100, 2)(0.012) 2 (0.988)98
(c) We are interested in the probability that the
» 0.2183 male number would be this high or higher,
since any higher value also have been
40. We have n = 100, p = 0.012, and surprising. Any particular number of male
1 - p = 0.988. births is very improbable, so the probability
Thus, of exactly 54 male births is not a good
measure of how surprising this event is.
P(more than half ) = P( x = 0) + P( x = 1) + P( x = 2)
43. n = 53, p = 0.042
= C (100,0)(0.012)0 (0.988)100 + C (100,1)(0.012)1(0.988)99
(a) The probability that exactly 5 men are color-
+ C (100, 2)(0.012)2 (0.988)98
blind is
= (0.012)0 (0.988)100 + 100(0.012)1(0.0988)99
2 98
P(5) = C (53,5)(0.042)5 (0.958) 48
+ 4950(0.012) (0.988)
» 0.0478.
» 0.8805.
(b) The probability that no more than 5 men are
1
41. (a) = 1.907 × 10−6 color-blind is
219
(b) We distribute the 40 millon births that occur
in 10 years evenly among the 5700
hospitals, and then divide the births in any
one hospital into strings of 19 consecutive
births. Any one hospital has

P(no more than 5 men are color-blind) (b) P(10 or more) = 1 - P(less than 10)
0 53
= C (53,0)(0.042) (0.958)
+ C (53,1)(0.042)1(0.958)52 = 1 - [ P(0) + P(1) + P(2) +  + P(9)]
= 1 - [C (100, 0)(0.71)0 (0.929)100
2 51
+ C (53, 2)(0.042) (0.958)
+ C (53,3)(0.042)3(0.958)50 + C (100,1)(0.071)1(0.929)99
4 49
+ C (53, 4)(0.042) (0.958) + C (100, 2)(0.71)2 (0.929)98
5 48
+ C (53,5)(0.042) (0.958)
+ C (100, 3)(0.071)3(0.929)97
» 0.9767.
+ C (100, 4)(0.71)4 (0.929)96
(c) The probability that at least 1 man is color-
blind is + C (100, 5)(0.071)5 (0.929)95
1 - P(0 men are color-blind) + C (100, 6)(0.71)6 (0.929)94
= 1 - C (53, 0)(0.042)0 (0.958)53 + C (100, 7)(0.071)7 (0.929)93
» 0.8971.
+ C (100, 8)(0.71)8 (0.929)92
44. (a) P(10 or more) = 1 - P(less than 10)
+ C (100, 9)(0.071)9 (0.929)91
= 1 - [ P(0) + P(1) + P(2) +  + P(9)]
= 1 - 0.82765
= 1 - [C (100, 0)(0.073)0 (0.927)100 = 0.17235
+ C (100,1)(0.073)1(0.927)99
The probability that 10 or more will
+ C (100, 2)(0.073)2 (0.927)98 experience nausea/vomiting is about 0.1724.
+ C (100,3)(0.073)3 (0.927)97 45. (a) Since the probability of a particular band
+ C (100, 4)(0.073)4 (0.927)96 matching is 1 in 4 or 14 , the probability that
5
+ C (100,5)(0.073)5 (0.927)95 5 bands match is ( 14 ) 1 or 1 chance
= 1024
+ C (100, 6)(0.073)6 (0.927)94 in 1024.
7 93
+ C (100, 7)(0.073) (0.927) (b) The probability that 20 bands match is
20
+ C (100,8)(0.73)8 (0.927)92 ( 14 ) » 1
1.1´1012
or about 1 chance in
9 91
+ C (100,9)(0.073) (0.927) ]
1.1 ´ 1012.
» 1 - [0.00051 + 0.00402 + 0.01567
(c) If 20 bands are compared, the probability
+ 0.04031 + 0.07698 + 0.11639 that 16 or more bands match is
+ 0.14512 + 0.15346
P(at least 16)
+ 0.14049 + 0.11309]
= P(16) + P(17) + P(18) + P(19) + P(20)
= 1 - 0.80604 = 0.19396
The probability that 10 or more will æ 1 ö16 æ 3 ö4 æ 1 ö17 æ 3 ö3
= C (20,16) çç ÷÷÷ çç ÷÷÷ + C (20,17) çç ÷÷÷ çç ÷÷÷
experience nausea/vomiting is about 0.1940. èç 4 ø èç 4 ø èç 4 ø èç 4 ø
æ 1 ö18 æ 3 ö2 æ 1 ö19 æ 3 ö1
+ C (20,18) çç ÷÷÷ çç ÷÷÷ + C (20,19) çç ÷÷÷ çç ÷÷÷
èç 4 ø èç 4 ø èç 4 ø èç 4 ø
æ 1 ö20 æ 3 ö0
+ C (20,20) çç ÷÷÷ çç ÷÷÷
çè 4 ø çè 4 ø

Section 8.4 517
æ 1 ö16 æ 3 ö4 æ 1 ö17 æ 3 ö3 n = 30, p = 0.02, x = 1

= 4845çç ÷÷÷ çç ÷÷÷ + 1140 çç ÷÷÷ çç ÷÷÷
çè 4 ø çè 4 ø çè 4 ø çè 4 ø P(1) = C (30,1)(0.02)1(0.98)29 » 0.3340
æ 1 ö18 æ 3 ö2 æ 1 ö19 æ 3 ö1 æ 1 ö20
+ 190 çç ÷÷÷ çç ÷÷÷ + 20 çç ÷÷÷ çç ÷÷÷ + çç ÷÷÷ ⋅ 1 Use Bayes’ Theorem to find the probability that
çè 4 ø èç 4 ø èç 4 ø èç 4 ø èç 4 ø shipment came from company X. Let A be the
event that the shipment came from company X
æ 1 ö16 é æ 81 ÷ö æ 1 öæ 27 ö æ 1 öæ 9 ö
= çç ÷÷÷ ê 4845çç + 1140 çç ÷÷÷çç ÷÷÷ + 190 çç ÷÷÷çç ÷÷÷ and B be the event that one vial out of thirty is
çè 4 ø ê çè 256 ÷÷ø çè 4 øèç 64 ø çè 16 øèç 16 ø
ë ineffective.
æ 1 öæ 3 ö 1 ùú
+20 çç ÷÷÷çç ÷÷÷ + P( A) =
1
= 0.2
çè 64 øèç 4 ø 256 ú
û 5
æ 1 ö16 æ 392, 445 + 30,780 + 1710 + 60 + 1 ö÷ 1 4
P( B) » (0.1413) + (0.3340) » 0.2955
= çç ÷÷÷ çç ÷
çè 4 ø çè 256 ø÷ 5 5
P( B|A) » 0.1413
424,996 1
= = P( B|A) P( A)
4 20 420 P( A|B) =
424,996 P( B )
1 0.11413 ⋅ 0.2
» »
2,587,110 0.2955
or about 1 chance in 2.587 ´ 106. » 0.10
46. (a) n = 4, p = 0.25 The answer is a.
P(at least 1) = 1 - P(none) 49. First, find the probability that one group of
0
= 1 - C (4, 0)(0.25) (0.75) 4 ten has at least 9 participants complete the
study. n = 10, P = 0.8,
» 0.6836
P(at least 9 complete) = P(9) + P(10)
(b) n = 3, p = 0.25
= C (10,9)(0.8)9 (0.2)1
P(at least 1) = 1 - P(none)
0 3
+ C (10,10)(0.8)10 (0.2)0
= 1 - C (3, 0)(0.25) (0.75) » 0.3758
» 0.5781
The probability that 2 or more drop out in one
(c) The assumption of independence is likely not group is 1 - 0.3758 = 0.6242. Thus, the
justified because the bacteria would be probability that at least 9 participants complete
present in groups of eggs from the same the study in one of the two groups, but not in both
source. groups, is
47. n = 4800, p = 0.001 (0.3758)(0.6242) + (0.6242)(0.3758) » 0.469.
P(more than 1) The answer is e.

= 1 - P(1) - P(0) 50. We define a success to be the event that a woman
would prefer to work part-time if money were not
= 1 - C (4800,1)(0.001)1(0.999)4799 a concern.
- C (4800,0)(0.001)0 (0.999)4800 In this situation, n = 10, x = number of
» 0.9523 successes, p = 0.60, and 1 - p = 0.40.
48. First, find the probability that one out of 30 vials P(at least 3) = P( x = 0,1, or 2)
is ineffective, given that the shipment came from
company X. = 1 - P( x = 0) - P( x = 1) - P( x = 2)
n = 30, p = 0.1, x = 1 = 1 - C (10,0)(0.60)0 (0.40)10 - C (10,1)(0.60)1(0.40)9

- C (10, 2)(0.60)2 (0.40)8
P(1) = C (30,1)(0.01)1(0.9)29 » 0.1413 » 0.9877
Next, find the probability that one out of 30 vials
is ineffective, given that the shipment came from 51. n = 12, x = 7, p = 0.83
company Y.
P(7) = C (12, 7)(0.83)7 (0.17)5 » 0.0305

52. n = 12, x = 9, p = 0.83 P(90 or more) = P(90) + P(91) +  + P(100)

90 10 91 9
P(9) = C (12,9)(0.83)9 (0.17)3 » 0.2021 = C (100, 90)(0.84) (0.16) + C (100, 91)(0.84) (0.16)
92 8 93 7
+ C (100, 92)(0.84) (0.16) + C (100, 93)(0.84) (0.16)
53. n = 12, p = 0.83
94 6 95 5
+ C (100, 94)(0.84) (0.16) + C (100, 95)(0.84) (0.16)
P(at least 9) = P(9) + P(10) + P(11) + P(12)
96 4 97 3
+ C (100, 96)(0.84) (0.16) + C (100, 97)(0.84) (0.16)
= C (12,9)(0.83)9 (0.17)3 + C (12,10)(0.83)10 (0.17)2
98 2 99 1
+ C (100, 98)(0.84) (0.16) + C (100, 99)(0.84) (0.16)
+ C (12,11)(0.83)11(0.17)1 + C (12,12)(0.83)12 (0.17)0
100 0
+ C (100,100)(0.84) (0.16)
» 0.8676
» 0.02915 + 0.01682 + 0.00864 + 0.00390 + 0.00152
54. n = 12, p = 0.83 + 0.00051 + 0.00014 + 0.00003 + 0 + 0 + 0
P(at most 9) = 1 - P(at least 10) = 0.06071
= 1 - P(10) - P(11) - P(12) The probability that 90 or more will answer
10
= 1 - C (12,10)(0.83) (0.17) 2 affirmatively to the question is about
0.0607.
- C (12,11)(0.83)11(0.17)1
57. (a) Using the binomcdf function on a graphing
- C (12,12)(0.83)12 (0.17)0 calculator, we find
» 0.3344
P(at least 30) = 1 - P(29 or fewer)
55. n = 10, p = 0.322,1 - p = 0.678 = 1 - binomcdf (40, 0.74, 29)
» 1 - 0.4740
(a) P(2) = C (10, 2)(0.322)2 (0.678)8 » 0.2083
= 0.5260
0 10
(b) P(3 or fewer) = C (10,0)(0.322) (0.678) (b) Using the binomcdf function on a graphing
1 9 calculator, we find
+ C (10,1)(0.322) (0.678)
P(at least 30) = 1 - P(29 or fewer)
+ C (10, 2)(0.322)2 (0.678)8
= 1 - binomcdf (40, 0.83, 29)
+ C (10,3)(0.322)3(0.678)7
» 1 - 0.0657
» 0.5902
= 0.9343
(c) If exactly 5 do not belong to a minority, then
exactly 10 - 5 = 5 do belong to a minority, 1174
58. (a) n = 1613, p =
and this probability is 644, 066
P(5) = C (10,5)(0.322)5 (0.678)5 » 0.1250. P(at least 9) = 1 - P(at most 8)
(d) If 6 or more do not belong to a minority, then at = 1 - binomcdf(1613, 1174/644066, 8)
most 4 do belong to a minority, and this » 0.0033
probability is P(at most 4)
1174
(b) n = 7146, p =
P(at most 4) = C (10,0)(0.322)0 (0.678)10 644, 066
+ C (10,1)(0.322)1(0.678)9 P(at least 28) = 1 - P(at most 27)
2 8
+ C (10, 2)(0.322) (0.678) = 1 - binomcdf(7146, 1174/644066, 27)
3
+ C (10,3)(0.322) (0.678) 7
» 2.076 ´ 10-4
+ C (10, 4)(0.322)4 (0.678)6 1174
» 0.8095 (c) n = 7146, p =
644, 066
56. (a) No, the results only indicated that 84% of
college students believe they need to cheat P(at most 54) = binomcdf (62572, 1174/644066, 54)
to get ahead in the world today. It says » 2.799 ´ 10-10
nothing about whether or not they cheat.
(b) 59. (a) Suppose the National League wins the series in
four games. Then they must win all four games
and P = C (4, 4)(0.5) 4 (0.5)0 = 0.0625. Since

Section 8.5 519
the probability that the American League wins the games. Then they must win exactly three of the
series in four games is equally likely, the previous five games and
probability the series lasts four games is P = C (5,3)(0.27)3 (0.73) 2 ⋅ (0.27) » 0.0283.
2(0.0625) = 0.125.
The probability the series lasts six games is the
Suppose the National League wins the series sum of the two probabilities, 0.2353.
in five games. Then they must win exactly Suppose the better team wins the series in seven
three of the previous four games and P = games. Then they must win exactly three of the
C (4,3)(0.5)3 (0.5)1 ⋅ (0.5) = 0.125. Since previous six games and
the probability that the American League P = C (6,3)(0.73)3 (0.27)3 ⋅ (0.73) » 0.1118.
wins the series in five games is equally likely, Suppose the other team wins the series in seven
the probability the series lasts five games is games. Then they must win exactly three of the
2(0.125) = 0.25. Suppose the National previous six games and
League wins the series in six games. Then P = C (6,3)(0.27)3 (0.73)3 ⋅ (0.27) » 0.0413.
they must win exactly three of the previous The probability the series lasts seven games is
five games and the sum of the two probabilities, 0.1531.
P = C (5,3)(0.5)3 (0.5)2 ⋅ (0.5) = 0.15625.
Since the probability that the American
League wins the series in six games is
equally likely, the probability the series lasts 8.5 Probability Distributions; Expected
six games is 2(0.15625) = 0.3125. Suppose Value
the National League wins the series in seven
Your Turn 1
games. Then they must win exactly three of
the previous six games and C (3, 0)C (9, 2) 6
3 3
P( x = 0) = =
P = C (6,3)(0.5) (0.5) ⋅ (0.5) = 0.15625. C (12, 2) 11
Since the Probability that the American
League wins the series in seven games is C (3,1)C (9,1) 9
equally likely, the probability the series P( x = 1) = =
C (12, 2) 22
last seven games is 2(0.15625) = 0.3125.
(b) Suppose the better team wins the series in
C (3, 2)C (9, 0) 1
four games. Then they must win all four P( x = 2) = =
C (12, 2) 22
games and P = C (4, 4)(0.73)4 (0.27)0 »
0.2840. Suppose the other team wins the
series in four games. Then they must win all The distribution is shown in the following table:
four games and x 0 1 2
P = C (4, 4)(0.27) 4 (0.73)0 » 0.0053. The P( x) 6 11 9 22 1 22
probability the series lasts four games is the
sum of two probabilities, 0.2893. Your Turn 2
Suppose the better team wins the series in five
games. Then they must win exactly three of the Let the random variable x represent the number of tails.
previous four games and
æ 1 ö0 æ 1 ö3 1
3 1
P = C (4,3)(0.73) (0.27) ⋅ (0.73) » 0.3067. P( x = 0) = C (3, 0) çç ÷÷ çç ÷÷ =
çè 2 ÷ø çè 2 ÷ø 8
Suppose the other team wins the series in five
games. Then they must win exactly three of the
previous four games and æ 1 ö1 æ 1 ö2 3
P( x = 1) = C (3,1) çç ÷÷÷ çç ÷÷÷ =
C (4, 3)(0.27)3 (0.73)1 ⋅ (0.27) » 0.0155. The èç 2 ø èç 2 ø 8
probability the series lasts five games is the sum
of the two probabilities, 0.3222.
æ 1 ö2 æ 1 ö1 3
Suppose the better team wins the series in six P( x = 2) = C (3, 2) çç ÷÷ çç ÷÷ =
games. Then they must win exactly three of the çè 2 ÷ø çè 2 ø÷ 8
previous five games and
P = C (5,3)(0.73)3 (0.27) 2 ⋅ (0.73) » 0.2070.
Suppose the other team wins the series in six
æ 1 ö3 æ 1 ö0 1 8.5 Warmup Exercises

P( x = 3) = C (3,3) çç ÷÷ çç ÷÷ =
çè 2 ÷ø èç 2 ø÷ 8
W1. This is a binomial experiment. The probability of
a six on one roll is 1/6.
The distribution is shown n the following table: The probability of exactly n sixes in 5 rolls is
æ 1 ön æ 5 ö5-n
x 0 1 2 3 C (5, n) çç ÷÷÷ çç ÷÷÷
èç 6 ø èç 6 ø
P( x) 1 8 3 8 3 8 1 8 so for n = 0,1, ..., 5 these probabilities are
approximately 0.4019, 0.4019, 0.1608, 0.0322,
0.0032, and 0.0001.
Here is the histogram.
P W2. This is a binomial experiment. The probability of
3/8
Probability
2/8
drawing a spade is 1/4.
1/8
The probability of exactly n spades in 4 draws is
æ 1 ön æ 3 ö4- n
0 1 2 3 x
C (4, n) çç ÷÷÷ çç ÷÷÷
Tails
èç 4 ø èç 6 ø
so for n = 0,1, ..., 4 these probabilities are
Your Turn 3
approximately 0.3164, 0.4219, 0.2109, 0.0469,
The expected payback is and 0.0039.
æ 1 ö÷ æ 1 ÷ö æ 1 ÷ö æ 997 ÷ö 8.5 Exercises

955çç ÷ + 495ççç ÷ + 245ççç ÷ + (-5) ççç ÷
èç 1000 ø÷ è 1000 ÷ø è 1000 ÷ø è 1000 ÷ø
1. Let x denote the number of heads observed. Then
-3250 x can take on 0, 1, 2, 3, or 4 as values. The
=
1000 probabilities are as follows.
= -3.25 or -$3.25.
æ 1 ö0 æ 1 ö4 1
P( x = 0) = C (4, 0) çç ÷÷ çç ÷÷ =
çè 2 ÷ø çè 2 ÷ø 16
Your Turn 4
Let the random variable x represents the number of male æ 1 ö1 æ 1 ö3 4 1
engineers in the sample of 5. P( x = 1) = C (4,1) çç ÷÷ çç ÷÷ = =
çè 2 ÷ø çè 2 ÷ø 16 4
P( x = 0) = C (5,0)(0.809)0 (0.191)5 » 0.00025
æ 1 ö2 æ 1 ö2 6 3
1
P( x = 1) = C (5,1)(0.809) (0.191) » 0.00538 4 P( x = 2) = C (4, 2) çç ÷÷ çç ÷÷ = =
çè 2 ÷ø èç 2 ÷ø 16 8
P( x = 2) = C (5,2)(0.809)2 (0.191)3 » 0.04560
æ 1 ö3 æ 1 ö1 4 1
3
P( x = 3) = C (5,3)(0.809) (0.191) » 0.19316 2 P( x = 3) = C (4,3) çç ÷÷ çç ÷÷ = =
çè 2 ø÷ çè 2 ø÷ 16 4
P( x = 4) = C (5,4)(0.809)4 (0.191)1 » 0.40907
æ 1 ö4 æ 1 ö0 1
5
P( x = 5) = C (5,5)(0.816) (0.184) » 0.34653 0 P( x = 4) = C (4, 4) çç ÷÷ çç ÷÷ =
çè 2 ÷ø çè 2 ÷ø 16
E ( x ) » (0)(0.0025) + (1)(0.00538) + (2)(0.04560)
Therefore, the probability distribution is as
+ (3)(0.19316) + (4)(0.40907) + (5)(0.34653) follows.
= 4.0420
In fact the exact value of the expectation can be Number of Heads 0 1 2 3 4
computed quickly using the formula E ( x) = np. 1 1 3 1 1
Probability 16 4 8 4 16
For this example, n = 5 and p = 0.809 so
np = (5)(0.809) = 4.045.
Your Turn 5
The expected number of girls in a family of a dozen
æ1ö
children is 12 çç ÷÷÷ = 6.
çè 2 ø

Section 8.5 521
2. There are 36 outcomes. We count the number of P( x = 0) + P( x = 1) + P( x = 2),

ways each sum can be obtained, and then divide
by 36 to get each probability. so shade the first 3 rectangles in the histogram.
Number P
of 2 3 4 5 6 7 8 9 10 11 12
Points
Ways to 3
Get This 1 2 3 4 5 6 5 4 3 2 1 8
Total 1
4
Probability 1 1 1 1 5 1 5 1 1 1 1 1
36 18 12 9 36 6 36 9 12 18 36 8
0
0 1 2 3 4 x
3. Let x denote the number of aces drawn. Then x 6. P( x ³ 11)

can take on values 0, 1, 2, or 3. The probabilities
are as follows. Use the probabilities that were calculated in
æ 48 öæ 47 öæ 46 ö Exercise 2, and shade the regions corresponding
P( x = 0) = C (3, 0) çç ÷÷çç ÷÷çç ÷÷ » 0.7826 to x = 11 and x = 12.
÷ç 51 øè
çè 52 øè ÷ç 50 ø÷
æ 4 öæ 48 öæ 47 ö
P( x = 1) = C (3,1) çç ÷÷çç ÷÷çç ÷÷ » 0.2042
÷ç 51 ÷øèç 50 ÷ø
èç 52 øè
æ 4 öæ 3 öæ 48 ö
P( x = 2) = C (3, 2) çç ÷÷÷çç ÷÷÷çç ÷÷÷ » 0.0130
èç 52 øèç 51 øèç 50 ø
æ 4 öæ 3 öæ 2 ö
P( x = 3) = C (3,3) çç ÷÷çç ÷÷çç ÷÷ » 0.0002
çè 52 ÷øèç 51 ÷øèç 50 ÷ø
7. Use the probabilities that were calculated in
Exercise 3. Draw a histogram with 4 rectangles,
Therefore, the probability distribution is as
corresponding to x = 0, x = 1, x = 2, and
follows.
x = 3. P(at least one ace) = P( x ³ 1)
Number of Aces 0 1 2 3 corresponds to
Probability 0.7826 0.2042 0.0130 0.0002 P( x = 1) + P( x = 2) + P( x = 3),
so shade the last 3 rectangles.

4. Use combinations to find the probabilities of P
drawing 0, 1, and 2 black balls. 0.8
C (2, 0) C (4, 2) 6 2
P(0) = = = 0.6
C (6, 2) 15 5 0.4
C (2,1) C (4,1) 8 0.2

P(1) = = 0
C (6, 2) 15 0 1 2 3 x
C (2, 2) C (4, 0) 1 8. P(at least one black ball)

P(2) = =
C (6, 2) 15 Use the probabilities that were calculated in
Exercise 4, and shade the regions corresponding
Number of to x = 1 and x = 2.
0 1 2
Black Balls
P
2 8 1
Probability 5 15 15 0.5
5. Use the probabilities that were calculated in

Exercise 1. Draw a histogram with 5 rectangles,
corresponding to x = 0, x = 1, x = 2, x = 3, 0
0 1 2 x
and x = 4. P( x £ 2) corresponds to

9. E ( x) = 2(0.1) + 3(0.4) + 4(0.3) + 5(0.2) 18.

= 3.6 Possible Results
Result of toss H H
10. E ( y) = 4(0.4) + 6(0.4) + 8(0.05) + 10(0.15) Call H T
= 5.9 Caller wins? Yes No
1 1
Probability 2 2
11. E ( z ) = 9(0.14) + 12(0.22) + 15(0.38)
+ 18(0.19) + 21(0.07)
= 14.49 (a) Yes, this is still a fair game, since the
probability of Donna matching is still 1.
2
12. E ( x) = 30(0.31) + 32(0.29) + 36(0.26)
+38(0.09) + 44(0.05) (b) If Donna calls heads, her expected gain
= 33.56 (since she will match with probability = 1) is
1(1.20) = $1.20.
13. It is possible (but not necessary) to begin by
writing the histogram’s data as a probability
distribution, which would look as follows. (c) If Donna calls tails, her expected gain (since
she will lose with probability = 1) is
x 1 2 3 4
P(x) 0.2 0.3 0.1 0.4 1(-1.20¢) = -$1.20.
The expected value of x is 19. (a)

E ( x) = 1(0.2) + 2(0.3) + 3(0.1) + 4(0.4) Number of Yellow
Probability
Marbles
= 2.7.
C (3, 0) C (4,3) 4
14. P(2) = 0.2, P(4) = 0.3, P(6) = 0.2, 0 =
C (7,3) 35
P(8) = 0.1, and P(10) = 0.2.
E ( x) = 2(0.2) + 4(0.3) + 6(0.2) + 8(0.1) C (3,1) C (4, 2) 18
1 =
+10(0.2) C (7,3) 35
= 5.6
C (3, 2) C (4,1) 12
2 =
15. The expected value of x is C (7,3) 35
E ( x) = 6(0.1) + 12(0.2) + 18(0.4) C (3,3) C (4, 0) 1
+ 24(0.2) + 30(0.1) 3 =
C (7,3) 35
= 18.
16. Notice that the probability of all values is 0.2. Draw a histogram with four rectangles
E ( x) = 0.2(10 + 20 + 30 + 40 + 50) corresponding to x = 0, 1, 2, and 3.
= 0.2(150) = 30 P
17. Using the data from Example 5, the expected 20/35
winnings for Mary are 15/35
10/35
æ1ö æ1ö
E ( x) = -1.2 çç ÷÷ + 1.2 çç ÷÷
çè 4 ÷ø èç 4 ÷ø
5/35
æ1ö æ1ö 0 1 2 3 x
+ 1.2 çç ÷÷ + (-1.2) çç ÷÷
çè 4 ÷ø çè 4 ÷ø
= 0.
Yes, it is still a fair game if Mary tosses and
Donna calls.

Section 8.5 523
(b) Expected number of yellow marbles æ 1 ö4 æ 5 ö0 1

P( x = 4) = C (4, 4) çç ÷÷ çç ÷÷ =
æ 4 ö æ 18 ö æ 12 ö æ 1 ö çè 6 ÷ø çè 6 ÷ø 1296
= 0 çç ÷÷ + 1çç ÷÷ + 2 çç ÷÷ + 3çç ÷÷
èç 35 ø÷ èç 35 ø÷ èç 35 ø÷ èç 35 ø÷
45 9 x 0 1 2 3 4
= = » 1.286
35 7
P(x) 625 125 25 5 1
20. (a) Use combinations to set up the probability 1296 324 216 324 1296
distribution. In each case, there are 5 rotten
apples and 20 good apples to pick from.
There are a total of C(25, 2) ways to choose æ 625 ö÷ æ 125 ö÷ æ 25 ö÷
(b) E ( x) = 0 çç ÷ + 1ççç ÷+ 2 çç ÷
any two apples. èç 1296 ø÷ è 324 ø÷ èç 216 ø÷
Number of æ 5 ö÷ æ 1 ÷ö
Probability Simplified + 3çç + 4 çç
Rotten Apples çè 324 ÷÷ø çè 1296 ÷÷ø
C (5, 0) C (20, 2) 190
0 2
C (25, 2) 300 =
3
C (5,1) C (20,1) 100
1 300
C (25, 2) 22. The probability that the delegation contains no
C (5, 2) C (20, 0) 10 liberals and 3 conservatives is
2 300
C (25.2) C (5, 0) C (6,3) 1⋅ 6 20
= = .
C (11,3) 11 165
Similarly, use combinations to calculate the

remaining probabilities for the probability
distribution.
(a) Let x represent the number of liberals on the

delegation. The probability distribution of x
(b) We therefore have is as follows.
x 0 1 2 3
æ 190 ö÷ æ 100 ö÷ æ 10 ö÷
E ( x) = 0 çç + 1çç ÷+ 2 çç
çè 300 ø÷÷ èç 300 ø÷
÷
èç 300 ÷ø P(x) 20 75 60 10
165 165 165 165
120
= = 0.4.
300
The expected value is
21. (a) Let x be the number of times 1 is rolled. æ 20 ö÷ æ 75 ö÷

E ( x) = 0 çç + 1çç
Since the probability of getting a 1 on any çè 165 ÷÷ø çè 165 ÷÷ø
single roll is 16 , the probability of any other æ 60 ö÷ æ 10 ö÷
+ 2 çç ÷
÷ + 3çç ÷
outcome is 5. Use combinations since the èç 165 ø èç 165 ø÷
6
order of outcomes is not important. 225 15
= = » 1.3636 liberals.
165 11
æ 1 ö0 æ 5 ö4 625
P( x = 0) = C (4, 0) çç ÷÷÷ çç ÷÷÷ =
èç 6 ø èç 6 ø 1296 (b) Let y represent the number of conservatives
on the committee. The probability
æ 1 ö1 æ 5 ö3 125 distribution of y is as follows.
P( x = 1) = C (4,1) çç ÷÷ çç ÷÷ =
èç 6 ÷ø èç 6 ø÷ 324 y 0 1 2 3
10 60 75 20
P(y) 165 165 165 165
æ 1 ö2 æ 5 ö2 25
P( x = 2) = C (4, 2) çç ÷÷ çç ÷÷ =
çè 6 ÷ø çè 6 ÷ø 216
æ 1 ö3 æ 5 ö1 5
P( x = 3) = C (4,3) çç ÷÷ çç ÷÷ =
çè 6 ÷ø çè 6 ÷ø 324
The expected value is æ 741 ö÷ æ 507 ÷ö æ 78 ÷ö

E ( x) = 0 çç + 1çç + 2 çç
æ 10 ö÷ æ 60 ö÷ çè 1326 ÷÷ø çè 1326 ÷÷ø çè 1326 ÷÷ø
E ( y) = 0 çç ÷ + 1ççç ÷
èç 165 ÷ø è 165 ÷ø =
663
=
1
æ 75 ö÷ æ 20 ö÷ 1326 2
+ 2 çç + 3çç
çè 165 ÷÷ø ÷
èç 165 ø÷
26. The probability of drawing 2 diamonds is
270 18
= = » 1.6364 conservatives. C (13, 2) 78
165 11 = ,
C (52, 2) 1326
23. Set up the probability distribution.
and the probability of not drawing 2 diamonds is
Number of
0 1 2
Women 78 1248
1- = .
C (3,0) C (5,2) C (3,1) C (5,1) C (3,2) C (5,0) 1326 1326
Probability C (8,2) C (8,2) C (8,2)
Let x represent your net winnings. Then the
5 15 3 expected value of the game is
Simplified 14 28 28
æ 78 ö÷ æ 1248 ö÷
E ( x) = 4.5çç + (-0.5) çç
æ 5ö æ 15 ö æ 3 ö çè 1326 ÷÷ø çè 1326 ÷÷ø
E ( x) = 0 çç ÷÷ + 1çç ÷÷ + 2 çç ÷÷
çè 14 ø÷ çè 28 ÷ø çè 28 ÷ø 273
=- » -$0.21 or - 21¢.
21 3 1326
= = = 0.75
28 4 No, the game is not fair since your expected
24. Let x represent the number of junior members on winnings are not zero.
the committee. Use combinations to find the
probability of 0, 1, 2, 3, and 4 junior members. 29. (a) First list the possible sums, 5, 6, 7, 8, and 9,
C (30, 4) = 27, 405; C (10, 0) C (20, 4) = 4845; and find the probabilities for each. The total
possible number of results are 4 ⋅ 3 = 12.
C (10, 1) C (20, 3) = 11, 400; C (10, 2) C (20, 2) = 8550; There are two ways to draw a sum of
C (10, 3) C (20, 1) = 2400; C (10, 4) C (20, 0) = 210; 5 (2 then 3, and 3 then 2). The probability of
2 = 1 . There are two ways to draw a
5 is 12
The probability distribution of x is as follows. 6
sum of 6 (2 then 4, and 4 then 2). The
x 0 1 2 3 4 2 = 1 . There are four
probability of 6 is 12 6
P(x) 323 760 190 160 2 ways to draw a sum of 7 (2 then 5, 3 then 4,
1827 1827 609 1827 261 4 then 3, and 5 then 2). The probability of 7
4 = 1 . There are two ways to draw a
is 12
æ 323 ö÷ æ 760 ö÷ æ 190 ö÷ æ 160 ö÷ 3
E ( x ) = 0 çç + 1çç ÷+ 2 çç ÷+ 3çç
çè 1827 ÷÷ø èç 1827 ø÷ èç 609 ø÷
÷
èç 1827 ø÷ sum of 8 (3 then 5, and 5 then 3). The
2 = 1 . There are two
probability of 8 is 12
æ 2 ÷ö 6
+ 4 çç
çè 261 ÷÷ø ways to draw a sum of 9 (4 then 5, and 5
4 2 = 1 . The
then 4).The probability of 9 is 12
= . 6
3
distribution is as follows.
The expected number of junior members is 1 13 . Sum 5 6 7 8 9
1 1 1 1 1
25. Set up the probability distribution as in Exercise Probability 6 6 3 6 6
20.
(b)
Number of
Probability Simplified P
Women
1
C (13,0) C (39,2) 741 3
0 C (52,2) 1326
1
C (13,1) C (39,1) 507
6
1 C (52,2) 1326
x
C (13,2) C (39,0) 78 5 6 7 8 9
2 C (52,2) 1326

Section 8.5 525
(c) The probability that the sum is even is x 1000 0

1 + 1 = 1 . Thus the odds are 1 to 2.
6 6 3 P(x) 0.63 ⋅ 0.4 = 0.0864 1 - 0.8704 = 0.1296
1 1 1
(d) E ( x) = (5) + (6) + (7) E ( x ) = 4000(0.4) + 3000(0.24) + 2000(0.144)
6 6 3
1 1 + 1000(0.0864) + 0(0.1296)
+ (8) + (9) = 7 = 2694.4
6 6
The answer is e.
30. The expected value is
33. (a) Expected number of good nuts in 50 “blow
E ( x) = 0(0.02) + 1(0.06) + 2(0.16) + 3(0.25) outs” is
+ 4(0.32) + 5(0.13) + 6(0.06)
E ( x) = 50(0.60) = 30.
= 3.42 complaints per day.
(b) Since 80% of the “good nuts” are good, 20%
are bad. Expected number of bad nuts in 50
31. We first compute the amount of money the
“good nuts” is
company can expect to pay out for each kind of
policy. The sum of these amounts will be the total E ( x) = 50(0.20) = 10.
amount the company can expect to pay out. For a
single $100,000 policy, we have the following
probability distribution. 34.
Pay Don’t Pay Exist. Vol.

Account Expected
+ Exp. Class
Outcome $100,000 $100,000 Number Value
Value
Probability 0.0012 0.9998 1 $ 2500 $17,000 C
E (payoff ) = 100, 000(0.0012) + 0(0.9998) 2 --------- $40,000 C
= $120 3 $ 2000 $22,000 C
For all 100 such policies, the company can expect 4 $ 1000 $51,000 B
to pay out
5 $25,000 $30,000 C
100(120) = $12, 000.
6 $60,000 $60,000 A
For a single $50,000 policy, 7 $16,000 $46,000 B
E (payoff ) = 50, 000(0.0012) + 0(0.9998)
= $60. 35. The tour operator earns $1050 if 1 or more
tourists do not show up. The tour operator earns
For all 500 such policies, the company can expect $950 if all tourists show up. The probability that
to pay out
all tourists show up is (0.98) 21 » 0.6543. The
500(60) = $30, 000. expected revenue is
1050(0.3457) + 950(0.6543) = 984.57
Similarly, for all 1000 policies of $10,000, the
company can expect to pay out The answer is e.
1000(12) = $12, 000. 36. Let x represent the number of offspring. We have
Thus, the total amount the company can expect to the following probability distribution.
pay out is x 0 1 2 3 4
$12, 000 + $30, 000 + $12, 000 = $54, 000. P(x) 0.29 0.23 0.18 0.16 0.14
32. Let x represent the benefit amount. E ( x) = 0(0.29) + 1(0.23) + 2(0.18)

+ 3(0.16) + 4(0.14)
x 4000 3000 2000
= 1.63
P(x) 0.4 0.6 ⋅ 0.4 = 0.24 0.62 ⋅ 0.4 = 0.144

37. (a) Expected cost of Amoxicillin: (d) Using binomial probability,

E ( x ) = 0.75($59.30) + 0.25($96.15) = $68.51 n = 6, p = 0.1.
Expected cost of Cefaclor: P(at least 2)

E ( x ) = 0.90($69.15) + 0.10($106.00) = $72.84 = 1 - C (6,0)(0.1)0 (0.9)6 - C (6,1)(0.1)1(0.9)5
» 0.1143
(b) Amoxicillin should be used to minimize
total expected cost.
42. (a) Let x represent the amount of damage in
38. Calculate the probability and payment for the millions of dollars. For seedling, the
number of days of hospitalization. expected value is
E ( x ) = 0.038(335.8) + 0.143(191.1) + 0.392(100)
X P(x) Payment
+ 0.255(46.7) + 0.172(16.3)
5 = 1
1 15 3 $100 » $94.0 million.
4
2 15 $200 For not seedling, the expected value is
3 = 1
3 15 5 $300 E ( x ) = 0.054(335.8) + 0.206(191.1) + 0.480(100)
4 2
$325 + 0.206(46.7) + 0.054(16.3)
15
1
» $116.0 million.
5 15 $350
(b) Seed, since the total expected damage is less

Expected payment is with that option.
æ1ö æ 4ö æ1ö æ 2ö
100 çç ÷÷÷ + 200 çç ÷÷÷ + 300 çç ÷÷÷ + 325çç ÷÷÷ 43. (a) The six possibilities and their scores are as
çè 3 ø çè 15 ø çè 5 ø èç 15 ø
follows:
æ 1ö æ 4 öæ 4 ö
+ 350 çç ÷÷÷ P(neither 1 nor 5) = çç ÷÷÷çç ÷÷÷ score: 0
çè 15 ø
èç 6 øèç 6 ø
» 213.
æ 1 öæ 4 ö
The answer is d. P(exactly one 5) = 2 çç ÷÷÷çç ÷÷÷ score: 50
çè 6 øèç 6 ø
E ( x) = 250(0.74) = 185 æ 1 öæ 4 ö
39. P(exactly one 1) = 2 çç ÷÷÷çç ÷÷÷ score: 100
çè 6 øèç 6 ø
We would expect 38 low-birth-weight babies to
graduate from high school. æ 1 öæ 1 ö
P(one 5, one 1) = 2 çç ÷÷÷çç ÷÷÷ score: 150
èç 6 øèç 6 ø
40. Expected number of a group of 500 college æ 1 öæ 1 ö
students that say they need to cheat is P(two 5s) = çç ÷÷÷çç ÷÷÷ score: 100
çè 6 øèç 6 ø
E ( x) = 500(0.84) = 420.
æ 1 öæ 1 ö
P(two 1s) = çç ÷÷÷çç ÷÷÷ score: 200
èç 6 øèç 6 ø
41. (a) Using binomial probability, n = 48, x = 0,
p = 0.0976. The expected score is
P(0) = C (48,0)(0.0976)0 (0.9024)48 » 0.007230 é æ 1 öæ

÷÷ ç 4 ÷öù é æ 1 öæ 4 öù é æ 1 öæ 1 öù
0 + (50) ê 2 çç
ç ÷ ç ÷
÷ ú + (100) ê 2 çç ÷÷÷ çç ÷÷÷ ú + (150) ê 2 çç ÷÷÷ çç ÷÷÷ ú
êë è 6 øè 6 ø úû ëê è 6 øè 6 ø ûú ëê è 6 øè 6 ø ûú
(b) Using combinations, the probability is éæ 1 öæ 1 öù éæ 1 öæ 1 öù
+ (100) ê ç ÷÷ ç ÷÷ ú + (200) ê ç ÷÷ ç ÷÷ ú = 50
C (74, 48)
» 5.094 ´ 10-4. ëê çè 6 ÷øèç 6 ÷ø ûú ëê çè 6 ÷øèç 6 ÷ø ûú
C (82, 48)
(c) Using binomial probability, n = 6, x = 5,

p = 0.1.
P(0) = C (6,5)(0.1)5 (0.9)1 + (0.1)6

= 5.5 ´ 10-5

Section 8.5 527
(b) The ten possibilities and their scores are 44. (a) We define a success to be the event that a
letter was delivered the next day. In this
æ 4 ö3 situation, n = 10; x = 0, 1, 2, 3, ..., 10;
P(neither 1 nor 5) = çç ÷÷÷ score: 0
çè 6 ø p = 0.83, and 1 - p = 0.17.
æ 1 öæ 4 ö2 Number of
P(exactly one 5) = 3çç ÷÷÷çç ÷÷÷ score: 50
èç 6 øèç 6 ø Letters
Probability
2 Delivered the
æ 1 öæ 4 ö Next Day
P(exactly one 1) = 3çç ÷÷÷çç ÷÷÷ score: 100
èç 6 øèç 6 ø 0 C (10, 0)(0.83)0 (0.17)10 » 0.0000
2
æ1ö æ4ö C (10,1)(0.83)1(0.17)9 » 0.0000
P(one 5, one 1) = 6 çç ÷÷÷ çç ÷÷÷ score: 150 1
èç 6 ø èç 6 ø
2 C (10, 2)(0.83)2 (0.17)8 » 0.0000
2
æ1ö æ4ö
P(two 5s) = 3çç ÷÷÷ çç ÷÷÷ score: 100 3 C (10,3)(0.83)3 (0.17)7 » 0.0003
çè 6 ø çè 6 ø
4 C (10, 4)(0.83)4 (0.17)6 » 0.0024
æ 1 ö2 æ 4 ö
P(two 1s) = 3çç ÷÷÷ çç ÷÷÷ score: 200
çè 6 ø çè 6 ø 5 C (10,5)(0.83)5 (0.17)5 » 0.0141
æ 1 ö2 æ 1 ö 6 C (10, 6)(0.83)6 (0.17)4 » 0.0573

P(two 5s, one 1) = 3çç ÷÷÷ çç ÷÷÷ score: 200
çè 6 ø èç 6 ø 7 C (10, 7)(0.83)7 (0.17)3 » 0.1600
æ 1 ö2 æ 1 ö 8 C (10,8)(0.83)8 (0.17) 2 » 0.2929
P(one 5, two 1s) = 3çç ÷÷÷ çç ÷÷÷ score: 250
èç 6 ø èç 6 ø 9 C (10,9)(0.83)9 (0.17)1 » 0.3178
3
æ1ö
P(three 5s) = çç ÷÷÷ score: 150 10 C (10,10)(0.83)10 (0.17)0 » 0.1552
çè 6 ø
æ 1 ö3 (b) P(4or fewer letters would be delivered)

P(three 1s) = çç ÷÷÷ score: 300
çè 6 ø
= P( x = 0) + P( x = 1) + P( x = 2)
+ P( x = 3) + P( x = 4)
The expected score is
» 0.0027
é æ 1 öæ 4 ö 2ù é 2ù
0 + (50) êê 3 çç ÷÷ çç ÷÷ ú + (100) ê 3 çæ 1 ÷÷öæç 4 ÷÷ö ú (d) Expected number of letters delivered next day
ç ÷ç ÷ ú ê ççè 6 ÷øèçç 6 ÷ø ú
ëê è 6 øè 6 ø úû êë ûú » 0(0.0000) + 1(0.0000) + 2(0.0000)
é æ 1 ö æ 4 öù
2 é æ 1 ö æ 4 öù
2
+ 3(0.0003) + 4(0.0024) + 5(0.0141)
+ (150) êê 6 çç ÷÷ çç ÷÷ úú + (100) êê 3 çç ÷÷ çç ÷÷ úú
çè 6 ÷ø çè 6 ÷ø çè 6 ÷ø çè 6 ÷ø + 6(0.0573) + 7(0.1600) + 8(0.2929)
ëê ûú ëê ûú
é æ1ö + 9(0.3178) + 10(0.1552)
2
æ 4 ÷ö ùú é æ ö2 æ ö ù
+ (200) êê 3 çç ÷÷ çç ÷ + (200) ê 3 çç 1 ÷÷ çç 1 ÷÷ ú » 8.3
ç ÷ çè 6 ÷ø ú ê çè 6 ø÷ çè 6 ÷ø ú
ê è6ø
ë ûú ëê ûú
é æ 1 ö æ 1 öù
2 éæ 1 ö ù3 é æ 1 ö3 ù
(250) êê 3 çç ÷÷ çç ÷÷ úú + 150 êê çç ÷÷ úú + 300 êê çç ÷÷ úú = 75 45. Below is the probability distribution of x, which
ç ÷ ç ÷ ç ÷ ç ÷
êë è 6 ø è 6 ø úû êë è 6 ø úû êë è 6 ø úû stands for the person’s payback.
x $398 $78 -$2
(c) We can subtract the last two terms from the 1 3 497
P(x) = 0.002 = 0.006 = 0.994
expected value sum in (b) and in their place 500 500 500
add the term
æ 1 ö3 The expected value of the person’s winnings is
(1000 + 200 + 300 + 400 + 500 + 600) çç ÷÷÷
çè 6 ø
E ( x) = 398(0.002) + 78(0.006) + (-2)(0.994)
» -$0.72 or -72¢.
which yields an expected value of
Since the expected value of the payback is not 0,
æ 1 ö3 æ 1 ö3
75 - 450çç ÷÷÷ + 3000 çç ÷÷÷ » 86.81 this is not a fair game.
çè 6 ø çè 6 ø

46. Reduce each price by the 50¢ cost of the If an even number comes up, you win $1.
raffle ticket, and multiply by the corresponding Otherwise, you lose $1 (win -$1 ). If x represents
probability. your payback, then the expected value is
æ 1 ö÷ æ 2 ÷ö æ 18 ö æ 19 ö
E ( x ) = 999.50 çç ÷ + 299.50 çç ÷ E ( x ) = 1çç ÷÷÷ + (-1) çç ÷÷÷
çè 10,000 ÷ø çè 10,000 ÷ø èç 37 ø èç 37 ø
æ 20 ö÷ æ 9977 ÷ö 1
+ 9.50 çç ÷ + (-0.50) çç ÷ =- » -$0.027 or -2.7¢.
èç 10,000 ÷ø çè 10,000 ÷ø 37
-3200
= = -$0.32 or - 32¢ 51. You have one chance in a thousand of winning
10,000
$500 on a $1 bet for a net return of $499. In the
No, this is not a fair game. In a fair game the 999 other outcomes, you lose your dollar.
expected value is 0.
æ 1 ö÷ æ 999 ö÷
E ( x) = 499 çç + (-1) çç
çè 1000 ÷÷ø çè 1000 ÷÷ø
47. There are 13 possible outcomes for each suit.
500
That would make 134 = 28,561 total possible =- = -50¢
1000
outcomes. In one case, you win $5000 (minus the
$1 cost to play the game). In the other 28,560,
cases, you lose your dollar. 52. In this form of the game Keno,
æ 1 ö÷ æ 28,560 ö÷ 20 1
E ( x) = 4999 çç ÷ + (-1) çç ÷ P(your number comes up) = =
çè 28,561 ÷÷ø çè 28,561 ÷÷ø 80 4
and
= -82¢
60 3
P(your number doesn't come up) = = .
80 4
If your number comes up, you win $2.20.

48. The probability of getting exactly 3 of the 4 Otherwise, you lose $1 (win -$1). If x represents
selections correct and winning this game is
your payback, then the expected value is
æ 1 ö3 æ 12 ö1 æ1ö æ3ö
C (4,3) çç ÷÷ çç ÷÷ » 0.001681. E ( x ) = 2.20 çç ÷÷÷ - 1çç ÷÷÷ = 0.55 - 0.75
èç 13 ÷ø çè 13 ÷ø çè 4 ø çè 4 ø
The probability of losing is 0.998319. If you win, = -$0.20 or -20¢.
your payback is $199. Otherwise, you lose $1
(win -$1 ). If x represents your payback, then the 53. Let x represent the payback. The probability
expected value is distribution is as follows.
E ( x ) = 199(0.001681) + (-1)(0.998319) x P(x)
= 0.334519 - 0.998319
1
= -0.6638 » -$0.66 or -66¢. 100,000 2,000,000
2
40,000 2,000,000
49. There are 18 + 20 = 38 possible outcomes. In
18 cases you win a dollar and in 20 you lose a 2
dollar; hence, 10,000 2,000,000
æ 18 ö æ 20 ö 1,999,995
E ( x) = 1çç ÷÷ + (-1) çç ÷÷ 0
çè 38 ÷ø çè 38 ÷ø 2,000,000
1 The expected value is

=- , or about -5.3¢.
19
50. In this form of roulette,

18 19
P(even) = and P(noneven) = .
37 37

Section 8.5 529
æ 1 ÷÷ö + 40,000 ççæ 2 ÷÷ö 11 which has a probability of 2 ,

E ( x ) = 100,000 çç ÷ 36
èç 2,000,000 ø çè 2,000,000 ÷ø
12 which has a probability of 1 .
æ 2 ö æ 1,999,995 ö÷ 36
+ 10,000 çç ÷÷ + 0 çç ÷
çè 2,000,000 ÷ø çè 2,000,000 ÷ø æ 11 ö÷ æ 1 ö æ 2 ö æ 3 ö æ 4 ö
E ( x) = 0 çç ÷ + 4 ççç ÷÷÷ + 5 ççç ÷÷÷ + 6 ççç ÷÷÷ + 7 ççç ÷÷÷
= 0.05 + 0.04 + 0.01 + 0 èç 36 ø÷ è 36 ø è 36 ø è 36 ø è 36 ø
= $0.10 = 10¢. æ 5 ö æ 4 ö æ 3 ö æ 2 ö æ 1 ö
+ 8 çç ÷÷ + 9 çç ÷÷ + 10 çç ÷÷ + 11çç ÷÷ + 12 çç ÷÷
çè 36 ø÷ çè 36 ø÷ çè 36 ø÷ çè 36 ø÷ èç 36 ÷ø
Since the expected payback is 10¢, if entering
4 10 18 28 40 36 30 22 12
the context costs 100¢, then it would be worth it = + + + + + + + +
36
36 36 36 36 36 36 36 36
to enter. The expected net return is -$0.90.
200
50
= =
36 9
54. At any one restaurant, your expected winnings are
(c) If a single die does not result in a score of
æ 1 ÷÷ö + 25,000 æçç 1 ö÷ zero, the possible scores are 2, 3, 4, 5, 6 with
E ( x ) = 100,000 çç ÷
çè 176, 402,500 ÷ø çè 39, 200,556 ÷ø 1
each of these having a probability of .
æ 1 ö æ 1 ö 5
+ 5000 çç ÷÷÷ + 1000 çç ÷÷÷
èç 17,640, 250 ø çè 1,568,022 ø
æ1ö æ1ö æ1ö æ1ö æ1ö
æ 1 ö æ 1 ö÷ æ 1 ÷ö E ( x ) = 2 çç ÷÷÷ + 3çç ÷÷÷ + 4 çç ÷÷÷ + 5çç ÷÷÷ + 6 çç ÷÷÷
+ 100 çç ÷÷ + 5çç ÷ + 1ççç ÷ èç 5 ø èç 5 ø èç 5 ø èç 5 ø èç 5 ø
÷
èç 288,244 ø ç ÷
è 7056 ø è 588 ø÷ 1
= 0.00488. = (20) = 4
5
Going to 25 restaurants gives you expected
Thus, if a player rolls n dice the expected
earnings of 25(0.00488) = 0.122. Since you average score is
spent $1, you lose 87.8¢ on the average, so your
expected value is -87.8¢. n ⋅ E ( x) = n ⋅ 4 = 4n.
(d) If a player rolls n dice, a nonzero score will

55. (a) The possible scores are 0, 2, 3, 4, 5, 6. Each occur whenever each die rolls a number
score has a probability of 16 . other than 1. For each die there are 5
possibilities so the possible scoring ways for
æ1ö æ1ö æ1ö n dice is 5n. When rolling one die there are
E ( x ) = 0 çç ÷÷÷ + 2 çç ÷÷÷ + 3çç ÷÷÷ 6 possibilities so the possible outcomes for n
çè 6 ø çè 6 ø çè 6 ø
æ1ö æ1ö æ1ö dice is 6n. The probability of rolling a
+ 4 çç ÷÷÷ + 5çç ÷÷÷ + 6 çç ÷÷÷ 5n
èç 6 ø çè 6 ø çè 6 ø scoring set of dice is ; thus the expected
6n
1 10 value of the player’s score when rolling n
= (20) =
6 3 5n (4n)
dice is E ( x) = .
6n
(b) The possible scores are
0 which has a probability of 11 ,
36
4 which has a probability of 1 , 56. (a) Expected value of a two-point conversion:

36
2 ,
E ( x ) = 2(0.478) = 0.956
5 which has a probability of 36

36 Expected value of an extra-point kick:
4 , E ( x) = 1(0.996) = 0.996
7 which has a probability of 36

36 (b) Since the expected value of an extra-point
4 ,
kick is greater than the expected value of a
9 which has a probability of 36 two-point conversion, the extra-point kick
3 , will maximize the number of points scored
10 which has a probability of 36 over the long run.

57. Let x represent the number of hits. Since There are 120 variations in first-, second- and
p = 0.331, 1 - p = 0.669. third-place finishes.
15. 3 oranges can be taken from a bag of 12 in
P(0) = C (4,0)(0.331)0 (0.669)4 = 0.2003
12! 12 ⋅ 11 ⋅ 10
C (12,3) = = = 220
P(1) = C (4,1)(0.331)1(0.669)3 = 0.3964 9!3! 3⋅ 2⋅1
P(2) = C (4, 2)(0.331)2 (0.669)2 = 0.2942 different ways.

16. Since the order of selection is not important, use
P(3) = C (4,3)(0.331)3(0.669)1 = 0.0970 combinations.
10!
P(4) = C (4, 4)(0.331)4 (0.669)0 = 0.0120 C (10, 4) = = 210
6!4!
The distribution is shown in the following table. 17. (a) The sample will include 1 of the 2 rotten
oranges and 2 of the 10 good oranges. Using
x 0 1 2 3 4 the multiplication principle, this can be
P(x) 0.2003 0.3964 0.2942 0.0970 0.0120 done in
C (2,1) C (10, 2) = 2 ⋅ 45 = 90 ways.
The expected number of hits is
np = (4)(0.331) = 1.324.
(b) The sample will include both of the 2 rotten
oranges and 1 of the 10 good oranges. This
can be done in
Chapter 8 Review Exercises C (2, 2) C (10,1) = 1 ⋅ 10 = 10 ways.
1. True
(c) The sample will include 0 of the 2 rotten
2. True oranges and 3 of the 10 good oranges. This
can be done in
3. True
C (2, 0) C (10,3) = 1 ⋅ 120 = 120 ways.
4. True
5. False: The probability of at least two occurrences
is the probability of two or more occurrences. (d) If the sample contains at most 2 rotten
oranges, it must contain 0, 1, or 2 rotten
6. True oranges. Adding the results from parts (a),
7. True (b), and (c), this can be done in
8. False: Binomial probability applies to trials with 90 + 10 + 120 = 220 ways.

exactly two outcomes. 18. (a) Exactly 3 males means 3 males out of 6 and
9. True 1 female out of 4:
C (6,3)C (4,1) = 20 ⋅ 4 = 80
10. False: For example, the random variable that
assigns 0 to a head and 1 to a tail has expected (b) No males means all 4 females must be
value 1/ 2 for a fair coin. selected, and there is 1 way of doing this.
(c) At least 2 males means 2, 3 or 4 males:
11. True
C (6, 2)C (4, 2) + C (6,3)C (4,1)
12. False: The expected value of a fair game is 0. + C (6, 4)C (4, 0)
13. 6 shuttle vans can line up at the airport in = 90 + 80 + 15
P(6, 6) = 6! = 720 = 185
different ways. 19. (a) P(5,5) = 5! = 120
14. Since order makes a difference, use permutations. (b) P(4, 4) = 4! = 24
6! 6!
P(6,3) = = 20. (a) There are 2! ways to arrange the landscapes,
(6 - 3)! 3! 3! ways to arrange the puppies, and 2
= 6 ⋅ 5 ⋅ 4 = 120

Chapter 8 Review 531
25. There are C(13, 3) ways to choose the 3 balls and

choices whether landscape or puppies come C(4, 3) ways to get all black balls. Thus,
first. Thus, the pictures can be arranged in
C (4,3) 4
2!3! ⋅ 2 = 24 P(all black) = =
C (13,3) 286
different ways. 2
(b) The pictures must be arranged puppy, = » 0.0140.
143
landscape, puppy, landscape, puppy.
Arrange the puppies in 3! or 6 ways.
26. It is impossible to draw 3 blue balls, since there
Arrange the landscapes in 2! or 2 ways. In
are only 2 blue balls in the basket; hence,
this scheme, the pictures can be arranged in
6 ⋅ 2 = 12 different ways. P(all blue balls) = 0.
21. (a) The order within each list is not important. 27. There are C(4, 2) ways to get 2 black balls and
Use combinations and the multiplication C(7, 1) ways to get 1 green ball. Thus,
principle. The choice of three items from
column A can be made in C(8, 3) ways, and C (4, 2) C (7,1)
P(2 black and 1 green) =
the choice of two from column B can be C (11,3)
made in C(6, 2) ways. Thus, the number of (6.7) 42 21
possible dinners is = = = » 0.1469.
286 286 143
C (8,3) C (6, 2) = 56 ⋅ 15 = 840.
(b) There are 28. P(exactly 2 black balls)

C (4, 2) C (9,1) 54 27
C (8, 0) + C (8,1) + C (8, 2) + C (8,3) = = = » 0.1888
C (13,3) 286 143
ways to pick up to 3 items from column A.
Likewise, there are
29. There are C (2, 1) ways to get 1 blue ball and
C (6, 0) + C (6,1) + C (6, 2)
C (11, 2) ways to get 2 nonblue balls. Thus,
ways to pick up to 2 items from column B.
C (2,1) C (11, 2)
We use the multiplication principle to obtain P(exactly1blue) =
C (13,3)
[ C (8,0) + C (8,1) + C (8, 2) + C (8,3) ] 2 ⋅ 55 110 5
= = = » 0.3846.
⋅ [ C (6,0) + C (6,1) + C (6, 2) ] 286 286 13
= (1 + 8 + 28 + 56)(1 + 6 + 15)
30. P(2 green balls and 1 blue ball)
= 93(22) = 2046.
C (7, 2) C (2,1) 42 21
Since we are assuming that the diner will = = = » 0.1469
C (13,3) 286 143
order at least one item, subtract 1 to exclude
the dinner that would contain no items.
Thus, the number of possible dinners is 31. This is a Bernoulli trial problem with
2045. P(success) = P(girl) = 12 . Here,
22. (a) There are 7 ⋅ 5 ⋅ 4 = 140 different groups
n = 6, p = 12 , and x = 3.
of 3 representatives possible.
(b) 7 ⋅ 5 ⋅ 4 = 140 is the number of groups æ 1 ö3 æ 1 ö3
with 3 representatives. For 2 representatives, P(exactly 3girls) = C (6,3) çç ÷÷÷ çç ÷÷÷
èç 2 ø èç 2 ø
the number of groups is
20 5
7 ⋅ 5 + 7 ⋅ 4 + 5 ⋅ 4 = 83. = = » 0.313
64 16
For 1 representative, the number of groups is
7 + 5 + 4 = 16.
The total number of these groups is
140 + 83 + 16 = 239
groups.
Another random document with
no related content on Scribd:
innostukseni, kaikkeni! Mutta minulla on rohkeutta, minulla on
voimaa raivata itselleni uusi tie. Kunpa Jumala auttaisi minua, ja
Hän sen kyllä tekee. Se on kohtaloni, tunnen sen, minun pitää
seurata sitä, minun pitää taipua sen alle, minulla ei ole voimaa
vastustaa sitä. Itken ajatellessani, mitä minä jätän. Riemuitsen
ajatellessani itseni vapaaksi. Nyt kai aavistatte, mitä minä teen.
Toivon, ettette ilmoita sitä muille. Älkää halveksiko minua. Teen
sen, koska minun luonnollani on mahdotonta tehdä toisin!
Teidän onneton, onnellinen
Iida Aalberg.»
Tämäkin kirje on kirjoitettu kiihkotilassa, se on jo siksi

epämääräinenkin, että Bertha Forsman, vastaanottaja, luuli Ida
Aalbergin tarkoituksena olevan luopua kokonaan näyttämöltä. Tämä
ei kiihkossaan ollut lukenut edes tarkkaan välikirjaa, josta puhuu —
sillä sen mukaan hän olisi voinut irti sanomisensa säästää kuukautta
myöhemmäksi. Bertha Forsman piti luopumisajatuksia hyvin
valitettavina, Suomalainen näyttämö ei hänen mielestään saanut
kadottaa Ida Aalbergia. Silloin tämä selvittelee tekoansa seuraavalla
tavalla:
»Olkaa huoleti. Antakaa anteeksi epäselvä kirjoitustapani. En jätä

vielä näyttämöä. Erosin nyt päästäkseni lentämään. En kuulu
mihinkään ahtaaseen uskontolahkoon. Löydän oman jumalani
kaikkialta ja palvelen häntä kaikkialla, missä on kauneutta, korkeutta,
suuruutta ja totuutta!»
Ida Aalbergin elämässä oli monta myrsky- ja kiihkokautta, mutta

erikoisesti tämä nuoruudenajan raju kiihkoilu esiintyy
päämäärättömänä ja haihattelevana sisäisenä palona. Siitä kiihkosta
havaitaan merkkejä melkein kaikissa taidearvosteluissa, jotka
koskevat hänen näyttämöluomiaan tältä ajalta. Keväällä 1883 hän
sai Adrienne Lecouvreurinä suuren menestyksen, mutta arvostelu
totesi, että tämän voitto johtui lähinnä siitä hillittömästä hehkusta,
jolla hän voi täyttää pääosan Scriben näytelmässä. On muistettu,
että hän näihin aikoihin esiintyi näytäntöiltoina toisinaan
semmoisessa mielentilassa, että toverit pelkäsivät hänen
näyttämöllä hajottavan kulissit tai pukuhuoneessaan seinät. Joskus
hänen sanotaan tehneen itsensä syypääksi rikkomuksiin sekä
itsekuria että näyttämökuria vastaan »tulisilla
ajattelemattomuuksillaan». Kiihkohetkien välillä on aina syvän
alakuloisuuden ja mielenmasennuksen aikoja, jolloin hän vetäytyy
yksinäisyyteen hautomaan ajatuksiaan. Tyhjyyden ja ikävyyden
tunne vaivaa häntä. Hänen kunnianhimonsa etsii vaikutusalaa, joka
antaisi enemmän kuin Suomalainen teatteri kykenee tarjoamaan.
Hän saa näinä vuosina suuren joukon ystäviä ja ihailijoita. Ne ovat

enimmäkseen miespuolisia, vain harvojen naisten kanssa hän
asettuu läheisen tuttavuuden suhteeseen. Hän tahtoo päästä
eteenpäin elämässä ja hän sovittaa tuttaviinsa mittapuuta: onko hän
erikoinen? Ilman näkyvää aihetta hän saattaa kirjoittaa jollekin
ystävättärelleen huudahduksia: »olkaamme suoria! olkaamme tosia!
olkaamme avomielisiä!» Itse hän on taipuvainen ystävätärten kesken
tunnustuksiin, joita kieltää muille ilmoittamasta, hän tekee heistä
uskottujaan ja ihailee heissä ilmenevää »erikoisuutta».
VII.
SARAH BERNHARDT. VÄLJEMMILLE VESILLE.
Saksalaisen teatterin antamat vaikutelmat, jotka olivat sangen

määräävinä tekijöinä Ida Aalbergin nuoruudessaan saavuttamiin
voittoihin, näyttelijätär oli omaksunut lyhyessä ajassa ja käyttänyt
niitä hyväkseen erinomaisella menestyksellä. Peritty kiihkeä ja
tulinen temperamentti, johon yhtyi nuoruuden viehkeys ja sulo ja
ihana, puhtaana heläjävä ääni, oli saanut tuekseen saksalaisen
tähtikouluutuksen kehitetyn lausuntataidon.
Ida Aalbergin myöhemmällä iällä ei saksalaisen kouluutuksen

ansioita hänen kehitykseensä nähden paljoakaan muisteltu.
Tiedettiin mainita nimi: Marie Seebach, mutta siinä olikin melkein
kaikki. Sensijaan muisteltiin, yleisemmin niitä vaikutelmia, joita
taiteilijattaren sanottiin saaneen Ranskan suurelta tähdeltä, Sarah
Bernhardtilta.
Kesällä 1883 Ida Aalberg ensi kerran tutustui Sarah Bernhardtin

taiteeseen.
*****
Ida Aalberg sai, vaikka erosikin Suomalaisesta teatterista, keväällä
1883 pienen valtioavun ulkomaamatkaa varten. Hän suunnitteli
esiintymistä Kööpenhaminassa, jonne Z. Topelius häntä lämpimästi
suosittelu Sarah Bernhardt vieraili näihin aikoihin Tukholmassa ja
Kööpenhaminassa, ja uskotulleen Bertha Forsmanille Ida Aalberg
kertoo ensi vaikutelmistaan seuraavalla tavalla:
»Millä mielenkiinnolla, millä jännityksellä, millä tunteilla näinkään

ja seurasinkaan Sarah Bernhardtin näyttelemistä. Kaikki, mitä olin
kuullut hänestä, ja sitä on paljon, palasi muistiini ja teki minut niin
hajamieliseksi, etten lainkaan voinut seurata hänen esiintymistään
ensimmäisenä iltana, en tiedä, miten hän näytteli. Vasten tahtoani
ajatukseni kiertelivät hänen persoonaansa, koko ajan ajattelin
Sarah Bernhardtia ihmisenä, tahdoin nähdä, miltä hänenlaisensa
nainen näyttää. Myöhempinä iltoina kiinnitti hänen näyttelemisensä
huomioni — kuten näette, menettelin perusteellisesti. Ensin tunsin
pettyneeni — kuten monet muutkin — mutta vika oli pääasiallisesti
Sardoun. Kappale, osa, on ontto, pinnallinen, luonnoton, kaikkialla
johtuu ajattelemaan, kuinka Sardou on kyhännyt kokoon sen ja sen
kohtauksen antaakseen maailmankuululle taiteilijalle tilaisuuden
näyttää ihmeteltäviä vaikutuskeinojaan. Hänellä on säihkyvä
tekniikka. Hämmästyy, kun näkee sen taituruuden, millä hän
suoriutuu pahimmistakin vaikeuksista. Hän on suuri. Hänellä on
nerollisuutta. Mutta hän käyttää väärin leiviskäänsä. Hän häikäisee
omaa aikaansa, mutta jälkimaailma unhottaa hänet pian. Hän
häikäisee yleisönsä, mutta kun tulee kotiin, unhottaa hänet ja voi
rauhallisesti laskeutua levolle. Hänen elämänsä on liiaksi
samentanut hänen sieluansa. Runous on kadonnut, se ei enää
levitä tuoksuaan hänen luomainsa yli. — Hän on antanut
parhaansa ihmisille, jotka eivät ole sitä ansainneet, hän on leikkinyt
elämällään; ja niin on hänen persoonansa ‒ ennenkuin hän sitä itse
aavisti ‒ muuttunut kasaksi kuihtuneita lehtiä. En tuomitse sitä, mitä
en ole nähnyt. Mutta eiköhän Sarah Bernhardtin naisellisuus ole
ajautunut karille? Ellei se olisi totta, niin kuinka hän voisi sallia
kaiken maailman kertojien haastaa itsestään merkillisiä, ei kauniita
anekdootteja; kirjoittaahan hän toisinaan julkisesti, ellei se olisi
totta, kuinka voisi sallia jonkin vintiön julkisessa
sanomalehtiartikkelissa käyvän hänen kunniansa kimppuun???
Kaikki tuo samensi hänen näyttelemisensä vaikutusta minuun.
Valériena hän kuitenkin ihastutti minua, hänen esiintymisessään oli
yksinkertaisuutta ja totuutta, näin kyynelten kimaltelevan hänen
kauniissa silmissään, se liikutti minua niin, kuinka katkerasti, kuinka
syvästi hän usein tuntee tulleensa sen ihanteen vastakohdaksi, jota
hän esittää. Valériessa oli kohtia, joissa hän mielestäni oli ylevä.
Kööpenhaminassa yleisö oli kylmähköä, he väittivät, ettei hän ollut
sitä, mitä hän ennen oli ollut. Hänen levoton elämänsä kuluttaa
voiman, väsymyksen piirre verhosi hänen aina kauniita,
jalonmuotoisia kasvojaan. Hänen vartalonsa oli kaunis, pitkä
täyteläinen, taipuisa ja hoikka. Millä innostuksella olisinkaan
katsonut häneen, jos hän naisenakin olisi tullut suureksi. Onko
sitten tuo ala niin vaikea, ettei kukaan nainen voi tulla suureksi
taiteilijaksi menettämättä kunniaansa. Eikö voi tulla suureksi
taiteilijaksi ja olla kristitty? Naisen, joka on taiteilija, suurimpana
tehtävänä on näyttää ihmiskunnalle, että semmoinen mahdollisuus
on olemassa. Eikö jalo voita? Ah! Kunpa Jumala antaisi minulle
voimaa, antaisi minulle tarmoa täyttämään sen, mistä uneksin.»
Tämän kirjeen Ida Aalberg kirjoitti kesäkuun 10 p:nä Emsistä,

minne hän oli mennyt kylpemään. Kirjeen lopussa hän kertoo
olostaan siellä:
»Vasta muutamia päiviä olen ollut Emsissä, enkä siis voi kuurista
sanoa mitään. Keisari Wilhelm tulee tänne huomenna, vieraita tulvii
tänne. Keisariaikana sanotaan sesongin olevan loistavan.
Elän yksin unelmineni. Näyttää herättävän huomiota, että nuori

nainen on niin aivan yksikseen. En ole tiedustellut, keitä
suomalaisia täällä oleskelee. Olisin iloinen, jos pian saisin Teiltä
kirjeen.
Maailmassa on vähän sellaista, mikä kestää. Olkoon Teidän

ystävyytenne
minua kohtaan sellainen harvinaisuus.
Teidän
Ida Aalberg.»
Heinäkuussa Ida Aalberg parin Emsissä tapaamansa suomalaisen

naisen kanssa matkusti Parisiin. Kirjeissään hän kertoo, että Seinen
kaupunki miellytti häntä tavattomasti. Hän tekee pitkiä, isänmaalleen
perin epäedullisia vertailuja Suomen ja Ranskan olojen välillä;
edellisessä on pikkumaisuutta, ilkeätä puoluemieltä, jälkimäisessä
työteliäisyyttä, iloa ja onnea. Louvre ja Boulognen metsä ovat hänen
mielipaikkansa j.n.e. Lokakuussa hän kirjoittaa Bertha Forsmanille
kirjeen, jossa on kuitenkin merkillisempiäkin tietoja:
»Tulen Björnstjerne Björnsonin läheisyydestä. Olen koko illan ollut

hänen seurassaan Walter Runebergin luona. Ah, miten tunnen itseni
vähäpätöiseksi, heikoksi, onnettomaksi. Kuinka tämmöinen pieni
persoonallisuus katoaa semmoisen hengen rinnalla. Hyvä Jumala,
kuinka onnellista on saada joka päivä seurustella suurenmoisen
luonteen kanssa. Kunpa ihmiset eivät vaientaisi omiatuntojaan,
kunpa he pintapuolisen hupatuksen sijaan ottaisivat ajatellakseen
vähän syvemmälle, kunpa he eivät niin kevytmielisesti valitsisi
seurapiiriään, jokapäiväistä seurapiiriään. Tuommoinen tavallinen,
kaikkien konvenanssin sääntöjen mukaan valittu seura, joka
kokoontuu pari kolme kertaa viikossa ihaillakseen kahvipöydän
ääressä toinen toisensa halpahintaisia ajatuksia, millaista myrkkyä
sielulle, millainen vaarallinen putous paremmalle minällemme, mikä
raunio kaikelle yksilöllisyydelle. Jos kerta olemme päässeet selville
siitä, että olemme ihmisiä, niin tiedämme myöskin, kuinka paljon
lähin ympäristömme vaikuttaa meihin. Kehenkään nähden ei pidä
olla niin varovainen kuin ystäviinsä nähden, s.o. niihin henkilöihin,
joiden kanssa useimmin on yhdessä. Aivan huomaamatta alkaa
mukautua heihin. Kuinka henkisesti rikkaaksi tunnenkaan itseni
semmoisen illan jälkeen kuin esim. tämä. Kuinka valveutunut, kuinka
terve, kuinka rohkea (hän olikaan), ja kuitenkin, samalla kuin sana
»excelsior» soi korvissani, tunnen itseni masentuneeksi,
vähäpätöiseksi, mitättömäksi. En ole mitään, sieluni on köyhä.
Ajatukseni ovat ahtaita. En osaa luonnehtia hänen
persoonallisuuttaan. Hänessä oli Norjan tunturien graniittista lujuutta,
Norjan vuonon kohisevaa aallonloisketta. Intelligentti, henkevä,
epätavallinen, rohkea mies, joka uskaltaa uhmata kokonaista
tavallista vulgääriä maailmaa, Sanoin, että »Hansikkaan»[15] loppu
minua hämmästytti. Hän sanoi, että »Svava» oli »ihminen». Jos
meneteltäisiin toisin, ei maailma pysyisi pystyssä. Hän puhui
voimakkaasti ylellisyyttä vastaan, koska se oli ensimmäinen syy
tapojen huonouteen. Puolusti kovin niitä, joita maailma tuomitsee.
Fennomania on saanut hänen sympatiansa puolelleen. Hän ihaili
heidän energiaansa, työkykyänsä. — Menen jonakin päivänä hänen
luokseen. Tahdon puhua hänen kanssaan useista asioista, joista en
ole selvillä ja jotka esiintyvät »Hansikkaassa». Sanoi saaneensa
nimettömän kirjeen Suomesta ja että siinä oli ollut lopusta sama
mielipide kuin minullakin oli. Luonnollisesti se oli naisen kirjoittama,
luulen että aihe ei ole miehille kovinkaan mieluinen.
En muista kerroinko Teille viime kirjeessäni, että Vicomtesse de

Bridierin äiti [Ida Aalberg asui Parisissa de Bridierin luona] on
kirjailija. Hänellä on suuria tuttavuuksia Parisin henkisessä
maailmassa. Hänen kauttaan olen saanut tutustua henkilöihin, jotka
eivät ole aivan tavallisia. Eräänä päivänä kävimme Mille
Reichemberin luona, Théâtre français'n nykyään parhaan
naispuolisen taiteilijan. Varsinkin pidetään häntä Français'n viimeisen
uutuuden, »Les maurois'n» jälkeen parhaana, sittenkun he ovat
menettäneet korvaamattoman primadonnansa Sarah Bernhardtin.
Sanoin Reichemberille, että minä hyvin kernaasti halusin nähdä
Comédie françaisen kuuluisan paljon puhutun taiteilijalämpiön. Hän
oli niin rakastettava, että pyysi minua väliajalla käymään luonaan
pukuhuoneessa. — Voitte aavistaa iloni, uteliaisuuteni. Koko päivän
kuljin 40, ei, 100 asteen kuumuudessa ja odotin iltaa ja niin se
lopuksi tuli sadan vuoden odotuksen jälkeen. Ja minä olin yhdessä
Madamen kanssa. Vietin siellä unohtumattoman tunnin. Minut
esitettiin Delaunaylle, »françaisen helmelle», hän on jo 60-vuotias ja
näyttää näyttämöllä 25—29-vuotiaalta, Coquelinille, Wormsille y.m.
Hyvä Jumala, kuinka onnellinen olin! Puhuin koko näytöksen ajan
ensinmainittujen kanssa. Puhuimme paljon Suomesta, josta heillä
tuskin oli aavistustakaan. Kun he kuulivat, että olin näytellyt Adrienne
Lecouvreuria, he ottivat minua kädestä, veivät minut erääseen
sivugalleriaan ja näyttivät hänen muotokuvansa, hänen ylpeän,
ylvään päänsä. — Mitä ihmisiä. Ruhtinaita omalla alallaan. Hienoja,
sivistyneitä, vakavia. Kuinka lämpimäksi tunsin itseni heidän
seurassaan. Kuinka hyviä he olivat minua kohtaan. Kuinka avuliaita,
kuinka hienoja. He olivat taiteilijoita, taiteilijoita semmoisia kuin olen
ajatellut olevan maailman ensimmäisellä näyttämöllä. He tekevät
työtä vakavasti. He ovat kyenneet asettamaan ihanteensa korkealle
ja he tuntevat, mitä vaikeuksia tiellä on. Heillä on ollut kykyä kohota
yli hetken turhamaisuuden ja itsekkyyden ja tehdä työtä yhteiseksi
hyväksi samalla kuin itsensä vuoksi. — Delaunay sanoi, kun jätin
hänelle hyvästi, että saisin toisenkin kerran tulla heidän lämpiöönsä,
ja sitten hän sydämellisesti puristi kättäni. — En voinut nukkua koko
yönä. Minä vain ajattelin ja vertailin, vertailin ja ajattelin — tyhmästi
kyllä. Tulos kaikesta oli, että tunsin itseni äärettömän onnelliseksi ja
kuitenkin hyvin onnettomaksi ja kuitenkin onnelliseksi. Olinhan
löytänyt vähäisen osan unelmistani.» —
Ida Aalberg teki Parisissa parhaansa mukaan työtä oppiakseen

ranskankielen. Tuntuu merkilliseltä, että hän tällä ensi matkallaan on
senkin verran voinut seurustella ranskankielisten henkilöiden kanssa
kuin hänen kirjeistään ilmenee, sillä ranskaan nähden hänen
taitonsa jäi — sen voi ilman muuta päättää hänen myöhemmistä
kirjoitusyrityksistään — aina perin alkeelliselle asteelle. Eräissä
kirjeissään hän ilmoittaa opettelevansa maalausta tai
suunnittelevansa jonkin kirjan kääntämistä suomenkielelle.
Björnsonin, suuren norjalaisen, tapaaminen näytti hänen elämälleen
korkean päämaalin:[16] pyrkimys tulla suureksi persoonallisuudeksi
alkoi entistä ihanampana kangastaa hänen kunnianhimoisessa
mielessään. Mutta hänen taiteellensa oli suurin merkitys sittenkin
Sarah Bernhardtin taiteella. Syyskuun loppupuolella 1883 Sarah
alkoi antaa näytäntöjä Porte Saint Martin teatterissa, ja huolimatta
yritetystä kriitillisyydestään, joka pääasiassa koskee Sarah
Bernhardtin amerikkalaisella reklaamilla väritettyä seikkailijaelämää,
ei Ida Aalberg voi kirjeissään salata suurta ihailuaan »Euroopan
kultaharppua» kohtaan. »Hän ei ollut semmoinen »Froufrou», joksi
minä olin osan ajatellut», hän kirjoittaa Bertha Forsmanille, »hän oli
jotakin muuta, mutta hän oli hyvä. Kun hän kolmannessa
näytöksessä herää tietoisuuteen rikollisuudestaan, kun hän alkaa
surra sortuneita ihanteitaan, kun hän syyttää ympäristöään, kotiaan,
kasvatustaan, miestään syvän onnettomuutensa aiheuttajiksi, oli hän
suuri, se oli hänen triumfinsa. Neljännessä näytöksessä hänen
näyttelemiseltään puuttui tarpeellista alleviivausta, mutta viidennessä
näytöksessä hän taas kohosi, sehän onkin ainoa näytös, jossa on
runollisuutta, ja sitä kallisarvoista tavaraa hän ymmärsi hoitaa.
Resignoitua tuskaa, antautumista, syvästi onnetonta uhrautumisen
tunnetta, jota ihmiset nimittävät rakkaudeksi, hän osaa esittää kuin ei
kukaan muu. Olin syvästi järkytetty hänen näyttelemisestään. Tie
kotoani P.S. Martiniin on hyvin pitkä, mutta nähty vaikutti minuun niin
voimakkaasti, etten kyennyt edes istuutumaan omnibusiin. Kaikki
nuo tavalliset vulgääriset ihmiset kiusasivat minua, minusta tuntui
paremmalta kuljeskella ja olla yksin.» —
Ida Aalberg lähetti kukkia Sarah Bernhardtille ja kuljeskeli tämän

ikkunain alla. Ranskatar sai kuulla uudesta palvojastaan ja lupasi
ottaa suomalaisen näyttelijättären puheilleen teatterissa. Kohtaus oli
sangen lyhyt ja merkityksetön. Ida Aalberg oli ostanut Sarah'n kuvan
ja pyysi tältä siihen omistuksen. Ja Sarah Bernhardt, joka kerran oli
saanut ohjeekseen:
»Photographies, tu signeras» [valokuviin panet nimesi],
teki ystävällisen merkinnän pieneen kuvaan.
Ida Aalberg istui hyvin monena iltana Porte Saint Martin teatterissa
ja seurasi suuren Sarah'n näyttelemistä. Ei ole miksikään häpeäksi
hänelle, että hän otti vastaan vaikutteita itseään vanhemmalta
suurelta taiteilijalta. Saihan Eleonora Dusekin kiittää Sarah’ta tiensä
viitoittamisesta.
Kotimaahan Ida Aalberg lähetti ärtyneitä kirjeitä kuullessaan
juorupuheista, joita hänestä siellä levitettiin. »Jumaloin Suomeani,
mutta inhoan ihmisiä siellä», hän kirjoittaa. Huhut koskivat hänen
luultua jäämistään Ranskaan, Sarah Bernhardt muka oli tarjonnut
hänelle paikan teatterissaan. Toiset tiesivät hänen aikovan mennä
avioliittoon ja senvuoksi luopuvan Suomalaisesta teatterista. Vanha
kaulatauti vaivasi häntä myöskin Seinen kaupungissa ja teki hänet
toisinaan melkein epätoivoiseksi:
»Mitä kotona minusta nykyisin sanotaan? Minulle itselleni

elämäntarinani alkaa olla lopussa. Kuka tietää mihin Afrikan
erämaahan joudun. Olen niin kyllästynyt, kyllästynyt, kyllästynyt,
kyllästynyt surkeaan kaulaani.»
*****
Parisista Helsinkiin palattuaan ja esiintyessään vanhassa

Arkadiassa Ida Aalberg joutui heti yleisön suuren suosion esineeksi.
Ylioppilaat juhlivat häntä taas kukkasin ja laakeriseppelein.
Sanomalehdet koettivat ratkaista, mitä jälkiä uusi opintomatka oli
jättänyt, ja verraten yksimielisesti arvostelu totesi hänen
näyttelemisensä käyneen hillitymmäksi. Toiset pitivät omaksuttua
uutta suuntaa suurena edistyksenä, toiset virheenä, toiset eivät
osanneet ratkaista, mille kannalle olisi tullut asettua. Helsinki oli
tähän aikaan saanut ensiluokkaisen teatteriarvostelijan, Hjalmar
Neiglickin, jonka »Finsk Tidskriftiin» kirjoittamat lausunnot olivat
suorastaan loistavia. Hän oli ankara kriitikko, joka ei milloinkaan
laatinut ylimalkaisia suitsutusartikkeleita niillekään taiteilijoille, joita
— ja Ida Aalberg oli ensimmäinen heidän joukossaan — hän suuresti
ihaili. Hän antoi tunnustusta ja moitetta sekaisin, mutta hänen
tyylinsä loisto, hänen lahjomaton oikeamielisyytensä, hänen
yksilöllinen ja kaikesta sovinnaisuudesta vapaa sanontansa ja hänen
nuorekas rohkeutensa takaavat hänelle kunniapaikan kaikkien niiden
joukossa, jotka ovat suomalaisesta näyttämötaiteesta kirjoittaneet.
Ida Aalbergin keväällä 1884 näyteltyä uudessa suuressa osassa,

Mariana
Schillerin »Maria Stuartissa» Hjalmar Neiglick kirjoitti:
»Oman kauneutensa lumoamaksi, ilman muuta rikosta kuin oma

mielettömyytensä, ikuisesti naisellisen ilmaukseksi, ikuisesti
naisellisen, jota romantiikka palvoi ja Musset kutsui nimellä »trois
fois feminins», — sellaiseksi on Schiller ajatellut sankarittarensa.
Ajankohta on valittu tätä silmälläpitäen. Ollaan onnettoman
kuningattaren viimeisissä elonpäivissä. Hän on vankina, ilman
kruunua ja valtakuntaa; kaikki, mikä on kiihoittanut hänen
intohimojaan ja samentanut hänen sielunelämäänsä, on poissa, ja
sovittavassa valossa, jonka kärsimys luo hänen kirjavan elämänsä
ylle, hän esiintyy viattomana ja puhtaana, legendan Maria Stuartina.
Oli odotettavissa, että nti Aalberg tekisi jotakin tästä. Ehkäpä siitä
tulikin kaunein kuva, jonka hän milloinkaan on luonut, ja inspiroitu
sisäisyys, jolla hän kykenee esittämään vaikuttavia kohtia niin
rikkaasta draamallisesta elämästä, saa tässä suuren ja todellisen
taiteen leiman, josta voi päätellä hänen Parisin opintojensa
hyödyllisyyden. Niin täydellisesti hän ei koskaan ennen ole näytellyt;
melkein kaikkialla on sama varma katse ja sama välitön lämpö. Heti
ensi näytöksessä hänellä on kaunis kohtaus dialogissa lordi
Burleighin kanssa. Verrattomalla hienoudella nti Aalberg näyttelee
esiinmurtautuvan majesteettisuuden, se tulee Mariasta ilmi eloisasti
ja intohimoisesti kuin muinoin, kun sitä ärsytettiin. Kolmannessa
näytöksessä on kappaleen huippukohta, ja siinä nti Aalbergilla onkin
suurin kohtauksensa. Täysin katolilainen hehku on hänen
näyttelemisessään, kun hän kulkee päästä päähän skaalan, jossa
vaihtelevat vienot ja myrskyiset tunteet, joita Schiller on koonnut
tuohon kuuluisaan kohtaukseen, missä molemmat kuningattaret
tapaavat. Marian kaksinkertainen taistelu: omaa ylpeyttään ja
Elisabethin julmuutta vastaan, haltioitunut innostuminen, joka johtuu
vapautumisen toivosta, hyväilevä tuttavallisuus, joka vähitellen saa
sulamaan hänen vihansa Elisabethia vastaan, ja lopuksi loukattu
naisellisuus, joka murtautuu esiin villinä koston janona — kaiken
tämän nti Aalberg esittää semmoisella voimalla ja ennen kaikkea
semmoisella luonnollisuudella, joka kuuluu valituille ja joka vaikuttaa
vastustamattomasti. Mutta myöskin kiihkottoman viimeisen
näytöksen hän esittää tositaiteellisella maulla. Loppu on luonteeltaan
jumaloivaa; Maria, joka niin kainona ja kirkastuneena astuu kohti
kuolemaa, vaikuttaa siltä, kuin olisi hän jo kulkenut kappaleen
matkaa taivasta kohti. Se on idylli mestauslavan juurella ja se tulee
neiti Aalbergin jalosti tulkitsemana liikuttavan kauniiksi. Hän on
puettuna komeaan kuningatarpukuun, paksuun kultaompeleiseen
silkkiin, ja koskaan hänen vartalonsa, joka on taipuisa kuin paju, ei
ole tehnyt niin suurenmoista vaikutusta kuin tässä.
On itsestään selvää, että niin etevä ja samalla yksilöllinen

näyttelijätär kuin nti Aalberg tulee muodostamaan oman koulunsa
sillä näyttämöllä, johon hän kuuluu, sitäkin suuremmalla syyllä,
koska se toistaiseksi on ainoa suomalainen. Mutta voi olla kokonaan
toinen kysymys, onko neiti Aalbergin näyttelemistapa erikoisen
sopiva tyypin muodostamiseen. Ennen kaikkea kaksi piirrettä
muodostaa hänen taiteensa merkillisen lumousvoiman: ihmeellisen
pehmeä plastiikka ja lapsellisen hyväilevät äänenpainot. Näitä kahta
vaikutuskeinoa hän itsekin joskus on tullut käyttäneeksi liian paljon,
kuten esim. Maria Stuartin 3:ssa näytöksessä, missä hän kyllä leikkii
äänellään; se, jos se tulee alemman asteen näyttelijöille maneeriksi,
vaikuttaa ehdottomasti epäedullisesti. Tarvitsee vain nähdä viimeisen
näytöksen kohtaus itkevine kamarineitoineen, huomatakseen, että
tämä sisäinen näyttelemistapa, joka lahjakkaan nti Aalbergin
edustamana muodostaa hänen varsinaisen voimansa, muuttuu
omituiseksi, jos sitä käytetään metodina. On oikea
kummittelukohtaus, kun siinä nuo neljä viisi naista toistavat nti
Aalbergia.» —
Ainakin jonkin määrän »lapsellisen hyväilevistä äänenpainoista»

Ida
Aalbergin korva lienee ottanut Sarah Bernhardtin puheesta.
Kevätkaudella 1885 Neiglick kirjoitti Minna Canthin »Työmiehen

vaimon» johdosta, todettuaan aluksi, että siinä Homsantuu on Birch-
Pfeifferin Sirkan kaksoissisar, epätodellinen ja teatraalinen, koska
kirjailija ei ole muodostanut osaa elävän luonnon mukaan:
»Neiti Aalbergin näytteleminen on sekin kaikissa kohdissaan

harjoitelma ilman mallia. Hänen mustalaistyttönsä on, puvusta
alkaen, maalauksellinen, mutta sellaista ei ole koskaan ollut
Suomessa, vielä vähemmän on mahdollista, että hän voisi olla
vereltään puoleksi suomalainen. Hehkua, hyväilevää hellyyttä,
harmonian ja sulon mestarinäytteitä, niitä siinä on ylenmäärin;
semmoisia loistavia episodeja kuin esim. tanssi toisessa
näytöksessä, sovinto Riston kanssa kolmannessa ja hänen äkillinen
ilmestymisensä Johannan ovelle neljännessä. Mutta siihen, joka on
useasti nähnyt nti Aalbergin, ei tuo vaikuta erikoisemmin; kaikki on
jättänyt jälkeensä muiston jostakin hyvin rytmillisestä, hyvin
ajatellusta. Näkee, että suuri näyttelijätär on ottanut hallussaan
olevista rikkaista varastoista, saatuaan osan, joka ei ole temmannut
häntä mukaansa. Tuommoisista suhteellisen hengettömistä
tuotteista helpoimmin havaitsee, kuinka paljon taiteilijan tekniikasta
jo on muuttunut maneeriksi. Ja jos Homsantuuta voi pitää
kriteeriona, niin nti Aalbergin on heti ruvettava olemaan varuillaan.
On kuin tulisi lämpimien intohimojen tulva näyttämölle, kun näkee
hänen sinne astuvan, mutta hän on uppoamaisillaan plastiikkaan.
Kieltämättä myöskin hänen notkeassa ja jonkin verran pehmeässä
luonteessaan on paljon sellaista, mikä houkuttelee juuri tuohon
suuntaan; mutta tulella kerta kaikkiaan ei leikitä rankaisematta, ei
edes pyhällä tulella, josta nti Aalberg on saanut niin suuren osan.»
Samana keväänä Ida Aalbergin esittämää Ofeliaa Neiglick aluksi

moittii alkukohtauksien perusteella. Niissä näyttelijätär on vain
kuljeskellut auttamatta katsojaa saamaan kokonaiskäsitystä, siinä
osassa draamaa häneltä oli puuttunut persoonallisuutta, oli nähty,
kuten joskus muulloinkin, neiti Aalberg eikä kappaleen henkilöä.
Mutta sitten tapahtuu loistava muutos:
»Se tapahtuu hulluuskohtauksessa, ja hänen esityksensä on tässä

ehdottomasti draamallisen taiteen huipulla. Hyvin mielenkiintoista on
verrata nti Aalbergia ja hra Bangia mielipuolisuuden esittäjinä. Voisi
sanoa, että heidän näyttelemisessään on sama ero kuin
Shakespearen ja Ibsenin realismissa. Nti Aalbergin näytteleminen on
rauhallista ja vailla patologisia efektejä; hän kuljeskelee
unelmissaan, laulaa oudot balladit monotonisesti, ikäänkuin yhteen
kaukaisten äänien kanssa — ikäänkuin kangastuksiin tuijotellen —
johtuu ajattelemaan intiaanien vanhaa uskoa hulluudesta, että se on
kaunis ja pyhä jumalain lahja. Ofelian hulluudessa on rytmiä, niinkuin
Hamletin hulluudessa on metodia, ja tämä rytmi, joka saa aikaan,
että
surun, murheen, tuskan, helvetinkin hän tekee viehättävän
viehkeäksi,
on nti Aalbergin näyttelemisessä, samoinkuin Shakespearen

kuolemattomassa runossa. Kaikkein ihmeellisintä ehkä on, että nti
Aalberg, joka, mikäli tiedetään, ei ole koskaan harjoittanut laulua, nyt
on luonut parhaan osansa laulamalla siitä parhaan osan. Parempaa
todistusta hänen kyvystään sulautua yhteen luomiensa kanssa ei
tarvita; kun hän kerta innostuu tehtävään, näyttää hänen
näyttelemisensä muodostuvan vastustamattomaksi valloittamiseksi.
Tekniikkaa ei näy, runoilijan sanat elävät näyttämöllä, ja silloin hänen
liikkeensä mukautuvat hänen sielunelämänsä vivahduksiin, kuten
pehmeä silkkipuku mukautuu hänen notkeisiin jäseniinsä.»
Kevätkaudella 1885 Ida Aalberg saavutti Suomalaisessa

teatterissa vielä suuren voiton esiintymällä Gretcheninä »Faustissa».
Arvostelu ylisti hänen lausuntansa tavatonta ilmehikkyyttä ja hänen
itkunsa suunnatonta voimaa.
*****
Kaarlo Bergbom, jolle Suomalaisen oopperan kuoltua

puhenäyttämön johto oli tullut melkein vasten tahtoa, ei alkuaikoina
voinut olla mikään ammattitaitoinen ohjaaja. Hän oli kyllä suuri
kirjanoppinut, mutta näyttämötaidetta hän oli opiskellut
pääasiallisesti vain katsomosta käsin. Jokavuotisilla
ulkomaamatkoillaan hän kuitenkin koetti kehittää silmäänsä, ja
ammattitaitoa hän oppi käytännön koulussa. Kerrotaan hänen
sittenkin loppuun asti pysyneen sangen vähäpuheisena ohjaajana.
Ne näyttelijät, jotka häntä ihaillen muistelevat, selittävät hänen
harvasanaisuutensa ja vähäisen neuvomisensa aiheutuneen siitä,
että tohtori kunnioitti näyttelijän yksilöllisyyttä ja antoi senvuoksi
mahdollisimman vapaat kädet. Toiset taas vakuuttavat, että tohtori
Bergbomilla ei myöhemminkään ollut täyttä ammattitaitoa
varsinaisessa näyttämöohjauksessa. Hänen sanotaan suosineen
suurta klassillista ohjelmistoa siksi, että tunsi itsensä
kykenemättömäksi detaljityöhön, jota moderni ohjelmisto edellytti.
Bergbomin ohjaus liikkui suurissa piirteissä, ja hän vetosi näyttelijäin
omaan älyyn ja puhetaitoon, jolla klassillisen ohjelmiston pitkiä,
runomuotoisia vuorosanoja lausuttiin.
Ohjaajan ja näyttelijän suhde on näyttämötaiteen ehkä suurin

probleemi. Ei ole syytä yrittää tutkiskella Bergbomin todellisia
mielipiteitä ja vaikuttimia ohjaajakysymyksessä koko laajuudessaan.
Riittää, kun sanotaan, että hänellä tuntuu olleen viisaana
periaatteena suhtautua eri näyttelijöihin eri tavalla: toisille hänen
sanotaan antaneen paljon neuvoja, toisille vähemmän, toisille tuskin
mitään.
Ida Aalbergin ohjaaminen tuntuu Kaarlo Bergbomille olleen

riemullinen tehtävä. Häntä hän neuvoi enemmän kuin ketään toista,
sillä hänestä »sai irti» enemmän kuin kenestäkään toisesta. Heillä oli
paljon kahdenkeskisiä neuvotteluja, ja varsinaisissa
näyttämöharjoituksissa heidän sanotaan mahtavasti inspiroineen
toinen toistaan uusiin keksintöihin ja vaikuttavan tulkinnan
löytämiseen. Ida Aalberg, joka oli toistaiseksi verraten vaillinaisesti
perehtynyt kirjallisuuteen, kaipasi älyllistä tukea, ja Kaarlo
Bergbomin kerrotaan sitä hänelle suoneen.
Ida Aalbergille epäilemättä kertyi vuosien kuluessa sangen suuri

kiitollisuusvelka Kaarlo Bergbomia kohtaan. Hän olisi saanut kiittää
tätä ohjeista ja neuvoista ja suurista osista, joita sai Suomalaisessa
teatterissa esittää ja joiden kehittävää merkitystä ei voi kyllin
suureksi arvioida. Hänellä oli paljon omaa, paljon hän oli saattanut
tuoda ulkomailta, mutta Suomalaisessa teatterissa, itse
näyttämötyössä, hän vasta oli voinut päästä täyteen selvyyteen siitä,
miten katsomoa hallitaan ilmeellä, liikkeellä ja puhutulla sanalla.
Jos Ida Aalberg taiteilijana olisi ollut yksinomaan Kaarlo

Bergbomin työn tulos, voisi Kaarlo Bergbomin sanoa ihastuneen
omaan työhönsä. Bergbom-sisarusten kirjeenvaihto puhuu sangen
selvää kieltä siitä, kuinka tavattoman suureksi he Ida Aalbergin
kyvyn arvioivat. Heille hän oli ensiluokan taiteilija, joka kohotti
kappaleen ja näyttelijäympäristönsä toiselle tasolle, heille hän oli
Suomalaisen teatterin tulevaisuuden toivo. Kaarlo Bergbom
hemmoitteli Ida Aalbergia enemmän kuin ketään muuta.
Eivät Kaarlo Bergbomin kukat eivätkä uudet suuret tehtävät, ei

vanhempien ystävien opettama velvollisuudentunto, ei yleisön ja
arvostelun suuri suopeus, mikään ei saanut Ida Aalbergia
suostutetuksi uskollisesti jäämään Bergbomin teatterin jäseneksi.
Keväällä 1885 hän uudestaan jättää suomalaisen teatterin. Ettei
päätös tullut yhtäkkiä, näkee siitä, että hän jo edellisenä kesänä,
jolloin oli kierrellyt maaseutukaupungeissa lausunta-iltoja
antamassa, oli pyrkinyt vierailemaan Kööpenhaminan
kuninkaalliseen teatteriin, mutta saanut, periaatteellisista syistä,
kieltävän vastauksen Tämän taidelaitoksen johtajalta, vanhalta
Fallesenilta.
Herman Bang, joka kevätkaudella 1885 piti esitelmiä Helsingissä,

vaikutti ehkä ratkaisevasti Ida Aalbergin päätöksen syntymiseen.
Tämä kirjailija on itse eräässä tanskalaisessa lehdessä kertonut
m.m. seuraavaa:
»Ilta illan jälkeen näin Ida Aalbergin esitelmiäni kuuntelemassa. En
milloinkaan unohda hänen katsettaan ja muotoaan noina tunteina.
Hänessä ilmeni vangin kaipuu. Luentosalin ulkopuolella näin hänet
harvoin. Mutta Helsingistä lähdettyäni sain häneltä kirjeen. Kirje oli
hätähuuto — huuto, jolla hän mursi ovet suureen elämään:
»Huomenna matkustan», hän kirjoitti. »Täällä on vain vankila.»
Ida Aalbergin päätös oli sisäisen taistelun tulos. Hän tiesi

loukkaavansa vanhoja ystäviään, mutta hän sai täyden kannatuksen
eräältä uudelta ajan hengeltä, jonka oppia hän oli joutunut
kotimaassaankin kuulemaan. Hänellä oli kahdenlaisia neuvonantajia,
vanhoja ja nuoria. Siitä aiheutui ristiriita.
VIII.
NEUVONANTAJIA JA YSTÄVIÄ.
»Nooran» jälkeen Ida Aalberg oli joutunut läheisiin tekemisiin

kansallisen romantiikan edustajien kanssa. He olivat pääasiallisesti
vanhoja miehiä. Hänellä oli setätuttavana Zacharias Topelius, jolta
riitti loputtomasti neuvoja, lämmintä osanottoa ja kiitosta. Jo ennen
»Regina v. Emmeritzin» esitystä runoilija oli ihastunut nuoreen
näyttelijättäreen ja kunnioittanut häntä seuraavalla runolla:
»Hur faller släpet och hur klär rosetten?

Hur sitter lifvet? Är han snörd, korsetten?
Är håret pudradt à la Pompadour?
Är ögonbrynet penslad fin natur?
Vet, Cendrillon, i kväll är bal hos kungen.

Nej, rör oss icke! Fy den svarta ungen!
Prins Hjertekläm skall börja valsen der;
Jag spår, att han i en af oss blir kär.
— Ack, vore jag en mygga der i salen!

— Du, Cendrillon, ha, ha, vill du till balen,

Finite Mathematics 11Th Edition Lial Solutions Manual Full Chapter PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Finite Mathematics 11Th Edition Lial Solutions Manual Full Chapter PDF

Uploaded by

Copyright:

Available Formats

Finite Mathematics 11th Edition Lial

COUNTING PRINCIPLES; FURTHER PROBABILITY TOPICS

Copyright © 2016 Pearson Education, Inc. 487

38! 38! 21. (a) initial

Copyright © 2016 Pearson Education, Inc.

(c) Use the formula for distinguishable 84 ⋅ 3!⋅ = 84 ⋅ 6 = 504.

32. Ranking 5 investments out of 9 amounts to 6! 6!

36. (a) The total number of presentations is P(2, 1) ⋅ P(4, 4) = 2 ⋅ 24 = 48

Copyright © 2016 Pearson Education, Inc.

52. Since a 20-sided die is rolled 12 times, the Your Turn 3

(b) Use combinations.

Copyright © 2016 Pearson Education, Inc.

8.2 Warmup Exercises n!

12! 12! 11. There are 13 clubs, from which 6 are to be

Copyright © 2016 Pearson Education, Inc.

14. (a) The number of ways to select a committee L

N M (c) Find the number of combinations of

Copyright © 2016 Pearson Education, Inc.

(c) The 3 men can be chosen in 14!

25. Show that C ( n, r ) = C ( n, n - r ). 6!

Copyright © 2016 Pearson Education, Inc.

different ways to order a hamburger with C (16, 8) C (22, 8) = 4,115, 439,900

Copyright © 2016 Pearson Education, Inc.

Copyright © 2016 Pearson Education, Inc.

C (838, 4) = 20, 400,978,015. C (4, 1) + C (4, 2) + C (4, 3) + C (4, 4)

Copyright © 2016 Pearson Education, Inc.

9! The number of ways the similar 4 lines can

Copyright © 2016 Pearson Education, Inc.

Your Turn 5 3. There are C (4, 2) samples of 2 yellow apples.

8.3 Warmup Exercises C (9, 5)

8.3 Exercises C (9, 3) C (11, 2)

Copyright © 2016 Pearson Education, Inc.

10. 17. There are C(52, 2) = 1326 different 2-card

Copyright © 2016 Pearson Education, Inc.

C (9, 2) 36 44. There are P(5, 5) different orders of the names.

P(not in alphabetical order) P(exactly 3 Hoopas)

Copyright © 2016 Pearson Education, Inc.

(d) A selection consisting of at least 4 Hughes 36 36

æ C (9, 4) C (12, 2) + C (9, 5) C (12, 1) ö÷ = 1.385 ´ 10-5.

Copyright © 2016 Pearson Education, Inc.

Copyright © 2016 Pearson Education, Inc.

63. Pick a suit: 4 C (6,5) C (93,1) = 558.

Copyright © 2016 Pearson Education, Inc.

æ 146,107,961 ö÷72,482,480 until there is only one team left, and it is

229, 600 2n(n-1) / 2 different win/lose progressions

172, 200 C (48, 19)

Copyright © 2016 Pearson Education, Inc.

(d) Four columns contain a permutation of 8.4 Binomial Probability

= [ P(44 blues in 80 | red removed) ⋅ P(red removed) ] Note that

Copyright © 2016 Pearson Education, Inc.

2. This is a Bernoulli trial problem with 7. P(no more than 3 boys)

Copyright © 2016 Pearson Education, Inc.

Copyright © 2016 Pearson Education, Inc.

28. (b) The probability that from 28 to 30 people

P(all 58) = C (58,58)(0.7)58 (0.3)0

Copyright © 2016 Pearson Education, Inc.

35. n = 15, p = 0.85 40, 000, 000

P(none) = C (15, 0)(0.85)0 (0.15)15

Copyright © 2016 Pearson Education, Inc.

Copyright © 2016 Pearson Education, Inc.

æ 1 ö16 æ 3 ö4 æ 1 ö17 æ 3 ö3 n = 30, p = 0.02, x = 1

46. (a) n = 4, p = 0.25 The answer is a.

P(more than 1) The answer is e.