Unit 02 Textbook Chapte 2 Full Solution
Unit 02 Textbook Chapte 2 Full Solution
Unit 02 Textbook Chapte 2 Full Solution
a) The list 0.5, 0.24, 0.718, 0.039 in order from least to greatest is 0.039, 0.24, 0.5, 0.718.
b) The list 3.78, 3.078, 3.0078 in order from least to greatest is 3.0078, 3.078, 3.78.
1 1 1 1 1 1 1 1 1 1
c) The list , , , , in order from least to greatest is , , , , .
2 3 6 5 4 6 5 4 3 2
5 3 5 7
d) First, rewrite the list , , , using a common denominator of 24.
8 4 6 12
5 15 3 18 5 20 7 14
8 24 4 24 6 24 12 24
7 5 3 5
Then, the list in order from least to greatest is , , , .
12 8 4 6
d) 2 ÷ 5 = 0.4 e) 57 ÷ 12 = 4.75
0.4 × 100 = 40% 4.75 × 100 = 475%
2 7 33 20
First, rewrite the sequence , , , using a common denominator of 72.
8 12 36 16
18 42 66 90
, , ,
72 72 72 72
90 24 114 57
Since the numerators increase by 24, the next number in the sequence is , or .
72 72 36
a) Starting with one triangle, add an increasing number of odd triangles to form a larger triangle
in the pattern.
b) Starting with 12, subtract 3 continuously to get new terms in the pattern.
12, 9, 6, 3, 3 – 3 = 0, 0 – 3 = –3, –3 – 3 = –6, …
1
d) Starting with, multiply the denominator by 2 continuously to get new terms in the pattern.
2
1 1 1 1 1 1 1 1 1
, , , , , , ...
2 4 8 8 2 16 16 2 32 32 2 64
b) The first sequence extended is 2, 3, 4, 5, 6, …. The second sequence extended is 6, 8, 10, 12,
14, ….
4 2 3
2 16 1 1 1 1
e) 1 1 f)
3 81 2 4 4 64
81 16 1
81 81 256
65
81
8 7 6 5 4 3 2 1 8 7 6 5 4 3 2 1
a)
5 4 3 2 1 5 4 3 2 1
40 320 8 7 6 5 4 3 2 1
120 5 4 3 2 1
336 336
8 7 6 5 4 3 2 1 8 7 6 5 4 3 2 1
b)
2 2 2 2 2 2
40 320 8 7 6 5 4 3 2 1
8 2 2 2
5040 5040
5 4 3 2 1 120 5 4 3 2 1 5 4 3 2 1
c)
5 4 20 5 4 5 4
6 6
11 10 9 8 7 6 11 10 9 8 7 6
d)
5 4 3 2 1 5 4 3 2 1
332 640 2 2
11 10 9 8 7 6
120
2772 5 4 3 2 1
2772
1
a) The probability of rolling a 4 on a single die is .
6
b) From a table of all possible sums, the probability of rolling a sum of 6 on a pair of dice is
5
.
36
1
c) The probability of flipping tails with a coin is .
2
d) From a table of all possible combinations , the probability of flipping two heads with two
1
coins is .
4
First Coin
H T
Second Coin
H HH TH
T HT TT
e) The probability of selecting a blue ball from a bag containing a red, a blue, a green, a yellow,
1
a brown, and a purple ball is .
6
a) Since the outcome of flipping a coin does not affect the outcome of rolling a die, these are
independent events.
b) Since the outcome of dealing a first card affects the second card dealt, these are dependent
events.
c) Since the outcome of first die does not affect the outcome of the second die, these are
independent events.
d) Since the outcome of randomly selecting a date from a calendar does not affect the outcome
of randomly selecting someone’s name from a list, these are independent events.
1
a) The probability of rolling a 3 on an icosahedron die is .
20
1
b) The probability of rolling a 4 on an icosahedron die is .
20
d) The probability of rolling an even number (2, 4, 6, 8, 10, 12, 14, 16, 18, 20) on an
10 1
icosahedron die is , or .
20 2
e) The probability of rolling a prime number (2, 3, 5, 7, 11, 13, 17, 19) on an icosahedron die is
8 2
, or .
20 5
f) The probability of rolling a number greater than 6 (7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18,
14 7
19, 20) on an icosahedron die is , or .
20 10
a) The event of rolling a 3 with a single die and the event of rolling an even number on a single
die are mutually exclusive.
b) The event of randomly selecting a student with blue eyes and the event of randomly selecting
a student with brown hair are non-mutually exclusive.
c) The event of selecting a face card from a deck and the event of selecting a numbered card
from a deck are mutually exclusive.
d) The event of selecting a red sweater and the event of selecting a wool sweater are non-
mutually exclusive.
e) The event of randomly selecting a vowel from the alphabet and the event of randomly
selecting “A” or “E” from the alphabet are non-mutually exclusive.
a)
b) There are six branches in the final stage. So, there are six different routes that Abby could
take.
a) and b)
The path illustrates Zach setting the table, Ben helping make breakfast, Rhys washing the dishes,
and Dylan sweeping the floor.
Answers may vary. While a tree diagram does show all possible outcomes, the actual drawing
gets more complicated with more stages. For three stages, a tree diagram is an efficient way to
illustrate the outcomes of three spins.
b) This is a personal preference. A chart may be less efficient than a tree diagram when there are
three or fewer stages.
T, T, T, T, T T, F, F, T, T T, T, F, F, F T, F, F, T, F
T, T, T, T, F F, F, T, T, T T, F, F, F, T T, F, T, F, F
T, T, T, F, T F, T, F, T, T F, F, F, T, T F, F, F, F, T
T, T, F, T, T F, T, T, F, T F, F, T, F, T F, F, F, T, F
T, F, T, T, T F, T, T, T, F F, F, T, T, F F, F, T, F, F
F, T, T, T, T T, F, T, F, T F, T, F, F, T F, T, F, F, F
T, T, T, F, F T, F, T, T, F F, T, F, T, F T, F, F, F, F
T, T, F, F, T T, T, F, T, F F, T, T, F, F F, F, F, F, F
a) There are 9 branches in the final stage of the tree diagram. So, there are 9 different outcomes
if the spinner is spun twice.
b) There are 27 branches in the final stage of the tree diagram. So, there are 27 different
outcomes if the spinner is spun three times.
In the game of Rock-Paper-Scissors, there are a total of three choices (branches) in the first stage.
Then in the second stage, there are three choices for each branch in the first stage for a total of
nine outcomes. Diagram B illustrates this.
If a single die is rolled twice, the tree diagram will have two stages. The first stage has six
branches, and the second stage has six branches for each branch in the first stage for a total of 36.
The best choice is C: two stages, six branches per stage, 36 outcomes.
a)
c) There are 20 branch paths in the tree diagram. So, there are 18 different outcomes possible.
a)
Member 1 Member 2
A B or C or D or E or F
B A or C or D or E or F
C A or B or D or E or F
D A or B or C or E or F
E A or B or C or D or F
F A or B or C or D or E
b) Once the first member of the committee is chosen, there are five possible choices for the
second member. There are 6(5), or 30 outcomes possible.
c) If order is not important, the chart changes. Now, there are only 15 outcomes possible.
Member 1 Member 2
A B or C or D or E or F
B C or D or E or F
C D or E or F
D E or F
E F
Since the die and coin results are independent events, it does matter whether the die is rolled first
or the coin is flipped first. This is confirmed by tree diagrams with either event being first
resulting in the same outcomes.
b) There are seven different routes for Cathie to get to the shopping mall.
a) Since there are three colour choices for siding, stage 1 of a tree diagram will have 3 choices.
Next, there are five colour choices for trim. So, stage 2 will have five branches for each siding
branch, or a total of 15 options listed. Finally, there are three colour choices for the garage doors.
So, stage 3 will have three branches for each of the 15 siding-trim branches, or a total of 45
outcomes.
a) Make a tree diagram to show the results of flipping a coin five times. There are two possible
results with no consecutive flips of heads or tails.
Since there are two choices for area code, stage 1 of a tree diagram will have 2 choices.
Next, the 519-branch has 80 choices for prefix, and the 226-branch has 39 choices for prefix. So,
stage 2 will have 80 + 39, or a total of 119 options listed. From each of these branches there are
10 choices (0 through 9) for the first of four digits, from each of these there are 10 choices (0
through 9) for the second of four digits, from each of these there are 10 choices (0 through 9) for
the third of four digits, and finally from each of these there are 10 choices (0 through 9) for the
last of four digits. So, the final stage will have 119(10)(10)(10)(10), or 1 190 000 different local
phone numbers Sarah can call.
Assume rows on checkerboard are numbered 0 to 7. The portion of the tree diagram that starts
with a move diagonally left has 49 possible paths to the opposite side. Similarly, the portion of
the tree diagram that starts with a move diagonally right has 54 possible paths to the opposite
side. The total number of possible paths to the opposite side is 49 + 54, or 103.
b) Assume that a level is represented by a row of pegs. Then, five levels would provide 1 + 4 +
6 + 4 + 1, or 16 pathways to the bottom of the board.
c) Assume that a level is represented by a row of pegs. Look for a pattern that relates the row
number to the number of pathways.
Row Number Number of Pathways
1 2
2 4
3 8
4 16
n 2n
If the board were extended to n levels, there would be 2n pathways to the bottom of the board.
Using the fundamental counting principle, there are 3 × 2 × 10, or 60 different configurations of
the smartphone available.
b) For a six-letter password with repetition allowed and the letters can be capitals or
lower case, there are 52 × 52 × 52 × 52 × 52 × 52, or 19 770 609 664 different possibilities.
From a class of 25 students, three of them are selected to attend a workshop in 25 × 24 × 23, or
13 800 ways.
Johnny is wrong. He should apply the fundamental counting principle, then there are 4 × 8 × 3, or
96 choices in total.
b) When a coin is tossed three times, there are 2(2)(2), or 8 possible outcomes.
c) When a coin is tossed four times, there are 2(2)(2)(2), or 16 possible outcomes.
a) From a committee of 15 people, there are 15(14), or 210 ways to choose a president and vice
president.
b) From a committee of 15 people, there are 15(14)(13), or 2730 ways to choose a president,
vice president, and secretary.
The total number of choices when selecting patio stones is 10(8)(3), or 240 choices.
b) The first course, appetizers, has 4 choices. The second course, main course, has 5 choices.
The third course, dessert, has 3 choices.
c) The three-course menu in a restaurant provides 4(5)(3), or 60 meal choices for customers.
A computer can randomly select three different numbers from between 1 and 100 in 100 × 99 ×
98 ways. Answer C.
A contestant can randomly select a letter of the alphabet from a spinner and roll a standard die in
26(6), or 156 ways. Answer B.
a) A two-digit number chosen from five digits with repetition can be formed in 5(5), or 25 ways.
b) A two-digit number chosen from five digits without repetition can be formed in 5(4), or 20
ways.
a) When rolling two 4-sided dice, there are 4(4), or 16 possible outcomes.
b) When rolling three 4-sided dice, there are 4(4)(4), or 64 possible outcomes.
c) When rolling two 8-sided dice, there are 8(8), or 64 possible outcomes.
d) When rolling four 8-sided dice, there are 8(8)(8)(8), or 4096 possible outcomes.
e) When rolling two 12-sided dice, there are 12(12), or 144 possible outcomes.
f) When rolling five 12-sided dice, there are 12(12)(12)(12)(12), or 248 832 possible outcomes.
The business card design software has 25(38)(20), or 19 000 card design available to the user.
When rolling five dice once, there are 65, or 7776 possible outcomes.
a) If repetition of times during each hour is permitted, there are 604, or 12 960 000 different
arrangements of winning times.
b) If repetition of times during each hour is not permitted, there are 60(59)(58)(57), or
11 703 240 different arrangements of winning times.
a) If repetition is permitted, there are 603, or 216 000 unique three-digit lock combinations
possible.
b) If repetition is not permitted, there are 60(59)(58), or 205 320 unique 3-digit lock
combinations possible.
a) For an eight-character password containing digits and capital and lower-case letters
with repetition, there are 628, or 218 340 105 584 896 choices available.
b) For an eight-character password beginning with four different capital letters and
followed by four different digits, there are 26(25)(24)(23)(10)(9)(8)(7), or 1 808 352 000
choices available.
c) For an eight-character password containing one digit and seven letters with repetition,
there are 10(8)(52)(52)(52)(52)(52)(52)(52), or 82 245 736 202 240 choices available.
a) For an Ontario licence plate with four letters followed by three digits, there are
26(26)(26)(26)(10)(10)(10), or 456 976 000 choices available.
b) For a Québec licence plate with three letters followed by three digits, there are
26(26)(26)(10)(10)(10), or 17 576 000 choices available.
c) For a Northwest Territories licence plate with six digits, there are 106, or 1 000 000 choices
available.
An Alberta licence plate with three letters followed by 4 digits will have much fewer choices than
an Ontario licence plate with four letters followed by three digits. There are 26 choices for a
letter, while there are only 10 choices for a digit.
Angus can travel 4(6), or 24 ways from Halifax to Vancouver via Toronto.
The number of outcomes for all three events will be the same, 63, or 216.
In event one and two, the colour of the dice does not affect the choices for a die, and rolling three
dice once has the same results as rolling one die three times.
b) It might take 100 times longer to break a five-digit code versus a three-digit code. The actual
number of possible outcomes for a five-digit security is 100 000. Using a graphing calculator to
randomly generate a five-digit code could possibly take more than 10 000 presses of ENTER
because of duplicates or your code may never be generated.
a) A 10-question multiple-choice test, each with four possible answers, can be completed in 410,
or 1 048 576 ways.
b) Since the student can leave answers blank, the total number of choices per question is now 5
and the 10 questions can be answered in 510, or 9 765 625 ways.
a) There are three choices for the ones place. Since one digit is used, then there are five choices
for the tens place. Similarly, there are then four choices for the hundreds place.
If repetition is not permitted, there are 4(5)(3), or 60 ways to form an even three-digit number
from 1, 2, 3, 4, 5, and 6.
A committee is being formed with one student from each grade, plus an additional student from
either grade 11 or 12.
Case 1: one student from each grade
There are three choices for grade 9, five choices for grade 10, six choices for grade 11, and nine
choices for grade 12: 3(5)(6)(9) or 810 ways.
For a string of five different letters that must begin with a vowel and end with a consonant,
First Letter Second Letter Third Letter Fourth Letter Fifth Letter
(vowel) (consonant)
5 choices 24 choices 23 choices 22 choices 21 choices
a) 4! 4 3 2 1 b) 6! 6 5 4 3 2 1
24 720
11! 11 10 9 8 7 6 5 4 3 2 1 6! 4! 6 5 4 3 2 1 4!
c) d)
7! 7 6 5 4 3 2 1 5! 5 4 3 2 1
11 10 9 8 6 4 3 2 1
7920 144
Since all eight 30-second advertisement time slots are to be arranged, use a factorial.
8! 8 7 6 5 4 3 2 1
40 320
There are 40 320 ways that the eight advertisements can be assigned a time.
There are three medals to be awarded. The medals can be awarded in 40(39)(38), or 59 280 ways.
Consider the two football photos as a single photo with the other four photos. These can be
arranged in 5! ways. The two football photos can be arranged in 2! ways. Then, the photos can be
arranged in 5! × 2!, or 240 ways.
Arranging r people from a group of n people with regard to order will have more possibilities.
For example, ABC can be arranged in 6 ways: ABC, ACB, BAC, BCA, CAB, and CBA. Without
regard for order these arrangements are the same.
a) 9! 9 8 7 6 5 4 3 2 1 12! 12 11 10 9 8 7 6 5 4 3 2 1
b)
362 880 5! 5 4 3 2 1
12 11 10 9 8 7 6
3 991 680
c) 7 6 5 4 3 2 1 7! 8 7 6 5 4!
d) 8 7 6 5
4!
8!
4!
91 90 89 88 87 86 85!
b) 91 90 89 88 87 86
85!
91!
(91 6)!
91 P6
18! 18!
c)
12! (18 6)!
18 P6
96! 96!
24! (96 72)!
96 P72
Answer C.
For the permutations of five items from a list of nine items, n = 9 and r = 5.
9!
9 P5
(9 5)!
9!
4!
9 8 7 6 5 4!
4!
98 7 65
15120
Answer B.
There are three places to be awarded. The places can be awarded in 15(14)(13), or 2730 ways.
There are nine spots to be assigned from 22 baseball players. So, n = 22 and r = 9.
Assume repeats within the remaining choices are allowed and all other digits are different than 0.
Consider the 00 as a single digit, so there are 7 digits in the password.
7 × 96 = 3 720 087
a) Since all six members of the student council executive are to be in the photo, use a
factorial.
6! 6 5 4 3 2 1
720
There are 720 ways that the student council executive can line up.
b) Consider the president and vice president as a single person with the other 4 people.
These can be arranged in 5! ways. The president and vice president can be arranged in 2!
ways. Then, the executive can be arranged in 5! × 2!, or 240 ways.
c) There are 2! ways to arrange the president and vice president in the middle of the
row. There are 4! ways to arrange the remaining members of the executive. So, there are
4! × 2!, or 48 ways to arrange the executive with the president and vice president in the
middle.
So, the six boys and seven girls can be arranged in 7! × 6!, or 3 628 800 ways so that none of the
girls sit together.
The groups are in a given order and only the skaters are arranged within their group. So,
the number of skating orders in each group is 5!. The number of orders for 4 groups is (5!)4, or
207 360 000.
The solution is n = 6.
For each linear permutation, you can convert that arrangement into a circle arrangement by
connecting the two ends. Instead of n! arrangements, there are (n – 1)! because circular
permutations of objects are equivalent since the circle can be rotated.
Consider each couple as a single person. These can be arranged in (10 – 1)! ways. Then, each
couple can be arranged in 2! ways. So, the 10 couples can be arranged in 9! × 2! × 2! × 2! × 2! ×
2! × 2! × 2! × 2! × 2! × 2!, or 371 589 120 ways.
From the solution to question 17, there are (n – 1)! circular permutations of objects.
Choose a seat at the Round Table for King Arthur. This can be done 1 way. Then, the 23 knights
can be seated in 23! ways. So, there are 1(23!), or 25 852 016 738 884 976 640 000 ways that
King Arthur and the knights be seated at the Round Table.
a) 9!! 1 3 5 7 9
1 2 3 4 5 6 7 8 9
2 468
9!
8!!
n!
b) Using the pattern from part a), n!! .
(n 1)!!
(2k 1)!
(2k 1)!!
((2k 1) 1)!!
(2k 1)!
2k !!
Determine how many times 10 is a factor of the expansion of 30!. In particular, which numbers
are multiples of 5 or 2.
30×29×28×27×26×25×24×23×22×21×20×19×18×17×16×15×14×13×12×11×10×9×8×7×6×5×4×3×2×1
A scan of the expansion list shows that there are many numbers that are multiples of 2 (even
numbers), so concentrate on those that are multiples of 5.
There are six multiples of 5: 5, 10, 15, 20, 25, and 30.
So, 30! has six zeros at the end.
a) Use the rule of sum because either seven or eight or nine countries’ flags will be flown.
7! + 8! + 9! = 408 240
The flags could be arranged in 408 240 ways.
b) If the host country’s flag is always on the far left, there is only one choice for this position
and one less flag to arrange for the other positions.
1(6!) + 1(7!) + 1(8!) = 46 080
The flags could be arranged in 46 080 ways.
c) The events “hearts” and “aces” are not mutually exclusive, since there is one ace of hearts,
which has been counted twice.
Apply the principle of inclusion and exclusion.
Number of ways to get 3 aces or 3 hearts 13 P3 4 P3 1
13! 4!
1
10! 1!
1716 24 1
1739
There are 1739 ways to get three aces or three hearts.
To use the indirect method, first calculate the total number of outcomes without restrictions and
the number of outcomes when the vowels must be together.
There are six letters in the word FACTOR. So, the total number of outcomes is 6!, or 720.
Total – together = 6! – 5! × 2!
= 720 – 240
= 480
The vowels can be apart in 480 ways.
The indirect method is useful in determining the number of possible outcomes in this scenario,
because it is simpler to calculate the number of executives without any males or females than all
the possibilities for at least one male and one female.
Use the fundamental counting principle when the events are independent. For example, rolling a
die twice. The outcome of the first event does not affect the second.
Use the rule of sum when events are mutually exclusive. For example, rolling a 1 or a 2. Both
events cannot happen at the same time.
Use the rule of sum because either three or four toys will be picked from eight.
8! 8!
8 P3 8 P4
5! 4!
336 1680
2016
The three or four toys could be arranged in 2016 ways.
a) Recall the table of all possible outcomes for the sum of the dice when two standard dice are
thrown. There are 6 ways to roll a sum of 7 and 2 ways to roll a sum of 11. So, there are 6 + 2, or
8 ways to roll a sum of 7 or 11 on two dice.
b) Recall the table of all possible outcomes for the sum of the dice when two standard dice are
thrown. There are 6 ways to roll doubles and 12 ways to roll a sum divisible by 3. So, there are
6 + 12, or 18 ways to roll doubles or a sum divisible by three on two dice.
There are 6 ways to roll a die and 36 ways to roll two dice. So, there are 6 + 36, or 42 ways to roll
either one or two dice. Answer A.
To use the indirect method, first calculate the total number of outcomes without restrictions and
the number of outcomes when the even digits must be together.
Total – together = 5! – 4! × 2!
= 120 – 48
= 72
The even digits can be apart in 72 ways. Answer D.
Consider the cases for 1- to 5-digit numbers. For each case, there are 2 choices for the ones place
in order to form an even number. Once a choice is made, the other place values can be
determined.
Case 1: 1 digit Case 2: 2 digits Case 3: 3 digits
2 choices 4(2), or 8 choices 4(3)(2), or 24 choices
So, there are 2 + 8 + 24 + 48 + 48, or 130 even numbers that can be formed.
b) To use the indirect method, consider the cases for numbers less than 3000.
Case 1: 4-digit even number starts with 1 Case 2: 4-digit even number starts with 2
1(3)(2)(2), or 12 choices 1(3)(2)(1), or 6 choices
The even numbers less than 3000 also include all the 1-, 2-, and 3-digit number found in part a).
Total – together = 130 – (12 + 6 + 2 + 8 + 24)
= 130 – 52
= 78
So, there are 78 even numbers greater than 3000.
Assume repeats are allowed. Use the rule of sum because the licence plate may have either two or
three letters followed by four digits.
26(26)(10)(10)(10)(10) + 26(26)(26)(10)(10)(10)(10) = 182 520 000
The number of motorcycle plates that can be made is 182 520 000.
Use the rule of sum because the security code may have either five or six different letters.
To calculate the security codes in each event, use the fundamental counting principle or
permutations.
26(25)(24)(23)(22)(21) + 26P5 = 173 659 200
There are 173 659 200 distinct security codes possible.
a) Assume no repeats. Use the rule of sum because the child may have one, two, or three names.
To calculate the number of possible names in each event, use the fundamental counting principle
or permutations.
50 + 50(49) + 50(49)(48) = 120 100
There are 120 100 choices when naming their child.
b) Assume no repeats. Use the rule of sum, but now there 100 names.
100 + 100(99) + 100(99)(98) = 980 200
There are 980 200 choices when naming their child.
c) When the answers in parts a) and b) are expanded into factorial form, all three
expressions in part b) are at least 2 times as big as those in part a). So, the result is more
than 23 = 8 times the answer in part a).
a) Since speaker P can go before speaker Q in several ways, different cases must be considered.
Case 1: 1 × 4! = 24
Case 2: 1 × 3 × 3! = 18
Case 3: 1 × 2 × 3! = 12
Case 4: 1 × 1 × 3! = 6
Since these events are not mutually exclusive, the principle of inclusion and exclusion needs to be
considered.
To form a 5-digit number, the first digit cannot be 0, so there are 9 choices for the first digit.
9(10)(10)(10)(10) = 90 000
Then, calculate the number of 5-digit numbers that do not contain 4.
8(9)(9)(9)(9) = 52 488 (First digit cannot be 0 or 4.)
So, 90 000 – 52 488, or 37 512 5-digit numbers do contain 4.
Next, numbers containing both 4 and 6 were counted twice, so subtract them once to compensate.
90 000 – 2(52 488) + 7(8)(8)(8)(8) = 13 696 (Total – [no 4] – [no 6] + [no 4 nor 6])
So, there are 3 628 800 – 1, or 3 628 799 ways the names could they be pulled from the hat so
they are not in alphabetical order.
a) There are 6 ways for spin #1, 2 ways for spin #2, 2 ways for spin #3, and 2 ways for spin #4
to land on all the same colour. Use the rule of sum.
6 × 2 × 2 × 2 = 48
There are 48 ways to land on the same colour on all four spins.
b) First, calculate how many ways the spinner could result in an even number. There are three
sections that have an even number.
34 = 81
From part a) you know there are 48 ways to get the same colour on all four spins.
There are three ways to get all even and the same colour.
The number of ways to get all even or the same colour is 81 + 48 – 3, or 126.
Answers may vary. For each roll of the two dice, there are six ways to get doubles. Since rolling
the dice once or twice or three times are mutually exclusive, there are 6 + 6 + 6, or 18 ways to get
doubles in one or two or three rolls of the dice.
Morse code is used to represent 26 letters, 10 digits, and 8 punctuation symbols, or a total of 44
symbols. Since each character has two options (dot or dash), a maximum of six characters is
needed: 26 = 64.
a) There are 26 capital letters, 26 lower-case letters, and 10 digits, for a total of 62
options for each character. With no restrictions, there are 626 + 627 + 628, or 221 918 520
426 688 ways to create a password with 6, 7, or 8 characters.
b) With no repetition allowed, there are 62P6 + 62P7 + 62P8, or 138 848 807 594 160 ways
to create a password with 6, 7, or 8 characters.
c) Use the indirect method. Then, there are 526 + 527 + 528, or 54 507 570 843 648 ways to
create a password with 6, 7, or 8 characters without a digit.
So, there are 221 918 520 426 688 – 54 507 570 843 648, or 167 410 949 583 040 ways
to create a password with 6, 7, or 8 characters with at least one digit.
In this case, the seven numbers are a mix of prime and composite. So, repeated products must be
eliminated. For example, 2 × 6 = 3 × 4 = 12, 5 × 6 = 5 × 2 × 3 = 30, 5 × 6 × 8 = 5 × 4 × 3 ×
2 = 240 should only be counted once. From the possible 120 products, 38 must be eliminated.
There are a total of 82 different numbers formed by multiplying some or all of the numbers 2, 3,
4, 5, 6, 7 and 8.
a) The derangements of {1, 2, 3, 4} are {2, 1, 4, 3}, {2, 3, 4, 1}, {2, 4, 1, 3}, {3, 1, 4, 2}, {3, 4,
1, 2}, {3, 4, 2, 1}, {4, 1, 2, 3}, {4, 3, 1, 2}, and {4, 3, 2, 1}. There are 9 derangements.
b) Internet research shows that there are 44 derangements of {1, 2, 3, 4, 5}. The number of
derangements of n items is given by !n = (n – 1)[!(n – 1) + !(n – 2)].
For n = 5,
!n = (n – 1)[!(n – 1) + !(n – 2)]
!5 = (5 – 1)[!(5 – 1) + !(5 – 2)]
!5 = 4[!4 + !3]
!5 = 4[9 + 2]
!5 = 44
a) This is a derangement problem. Use the formula from the solution to question 17, part b).
For n = 6,
!n = (n – 1)[!(n – 1) + !(n – 2)]
!6 = (6 – 1)[!(6 – 1) + !(6 – 2)]
!6 = 5[!5 + !4]
!6 = 5[44 + 9]
!6 = 265
There are 265 ways that none of the cans will be labelled correctly.
b) Use the indirect method. First, calculate the total number of ways the labels can be replaced:
6!.
So, there are 6! – 265, or 455 ways at least one of the cans will be labelled correctly.
c) There is only one way for all the cans to be labelled correctly.
a) These trials are independent, so the probability of each person writing the same number is
1
. There are five trials, so
100
5
1
P(all same)
100
1
10 000 000 000
1
The probability that all numbers are the same is .
10 000 000 000
1
b) These trials are independent, so the probability of rolling a six on a die is . There are five
6
trials, so
5
1
P(all 6s)
6
1
7776
For independent trials, P(all the same) = (P(a success))# trials .
The trials are dependent, since a person cannot be selected more than once. Use factorials.
n(S) = 4!
There is only one successful outcome, the single order of their grades, so n(A) = 1.
1
P(in grade order)
4!
1
24
1
The probability that the students will be order of their grades is .
24
a) Since Kylie selects the cards without replacement, the trials are dependent: n(S) = 52P5.
Select three aces followed by two jacks: n(A) = 4P3 × 4P2.
52 P5
24 12
311875 200
288
311875 200
1
1 082 900
1
The probability of selecting three aces followed by two jacks is .
1 082 900
b) Since Kylie selects the cards without replacement, the trials are dependent: n(S) = 52P5.
Select two hearts followed by three clubs: n(A) = 13P2 × 13P3.
P P
P(heart, heart, club,club, club) 13 2 13 3
52 P5
156 1716
311875 200
267 696
311875 200
143
166 600
143
The probability of selecting two hearts followed by three clubs is .
166 600
a) There are 365 days in one year. So, for the sample space, each of the 16 people has 365
choices for their birthday. There are 16 trials, so n(S) = 36516.
If everyone must have a different birthday, the successful outcomes are dependent and 16 days
are selected from 365 days. So, n(A) = 365P16.
P16
P(all different) 365 16
365
0.7164
The probability that no two people have the same birthday is approximately 0.7164.
The first represents 3 of 12 objects being arranged. The second is 3 times 1 of 12 objects being
arranged.
Since the student selects the cards without replacement, the trials are dependent: n(S) = 52P3.
Select king, queen, jack: n(A) = 4P1 × 4P1 × 4P1.
P P 4 P1
P (king, queen, jack) 4 1 4
52 P3
4 4 4
132 600
64
132 600
8
16 575
8
The probability of selecting a king, a queen, and a jack is .
16 575
The trials are dependent, since a person cannot run the race more than once. Use factorials.
n(S) = 6!
The number of successful outcomes, Abby and Chantral will be the first two finishers, is n(A) =
2! × 4!.
The trials are dependent, since a name cannot be selected more than once: n(S) = 25P5.
There is only one successful outcome, the names in alphabetical order, so n(A) = 1.
1
P(in alphabetic order)
25 P5
Answer A.
There are 6 results for each roll. So, the sample space for the four trials is n(S) = 64.
The number of successful outcomes, a number divisible by three, is n(A) = 24.
24
P (divisble by 3) 4
6
4
1
3
1
81
Answer C.
The trials are dependent, since a ball cannot fall in more than once. Use factorials: n(S) = 15!
The number of successful outcomes, falling in order from 1 to 15, is n(A) = 1.
1
P( A)
15!
1
1307 674 368 000
1
P( A) 1
15!
1307 674 367 999
1307 674 368 000
So, the odds against the balls following in order from 1 to 15 are
1307 674 367 999 1
: .
1307 674 368 000 1307 674 368 000
a) and b) There are 365P3 ways of choosing 3 days in a year, and 30P3 ways of choosing 3 days
from the 30 days of April.
30 P3
0.000 505
365 P3
a) Recall the table of all possible outcomes for the sum of the dice when two standard dice are
thrown. There are a total of 36 outcomes with 6 having the successful outcomes of doubles.
n( A)
P ( A)
n( S )
6
P (doubles)
36
1
6
1
The probability of rolling doubles with two dice is .
6
c) Recall the table of all possible outcomes for the sum of the dice when two standard dice are
thrown. There are also 6 ways to roll a sum of 7. So, the probability of rolling consecutive sums
of 7 on two rolls of dice is the same as the probability of rolling consecutive doubles.
1
a) These are dependent events. The probability of selecting M first is . The probability of
9
1 1
selecting A second is . The probability of selecting T third is . The probability of selecting H
8 7
1
fourth is .
6
1 1 1 1
P(MATH)
9 8 7 6
1
3024
1
The probability that it spells MATH is .
3024
b) These are dependent events. The probability of selecting one of the letters M, A, T, or H is
4 3 2
. The probability of selecting another letter from the set is , and another letter is , and the
9 8 7
1
remaining letter is .
6
c) Since the letters are selected without replacement, the trials are dependent: n(S) = 9P4.
Calculate the number of successful outcomes, contains an M. Use the indirect method.
The total number of results without restrictions is 9P4, or 3024. The number of results that do not
contain M is: 8(7)(6)(5), or 1680.
So, there are 3024 – 1680, or n(A) = 1344 ways to include the letter M.
1344
P
3024
4
9
4
The probability that it includes the letter M is .
9
a) The cards have to be in ascending order but they don’t have to be consecutive.
The are 13 consecutive denominations in a deck: 2 3 4 5 6 7 8 9 10 J Q K A.
There are 4 choices for each denomination.
There are 7 possible sequences of 7 consecutive cards:
2 3 4 5 6 7 8
3 4 5 6 7 8 9
4 5 6 7 8 9 10
…
8 9 10 J Q K A
C7 4 7
So, 13
4.1697 10 5 .
52 P7
The probability of that the cards are dealt in ascending order is approximately 4.1697 × 10−5.
b) Since the players are each dealt a card without replacement, the trials are dependent:
n(S) = 52P7.
“Denomination,” means one of the thirteen symbols that is represented on each card: 2, 3, 4, 5, 6,
7, 8, 9, 10, J, Q, K, A. Note there are four of each in a standard deck.
Select cards that are not of the same denomination: n(A) = 52(48)(44)(40)(36)(32)(28).
52(48)(44)(40)(36)(32)(28)
P(no same denomination)
52 P7
0.2102
The probability of dealing no cards of the same denomination is approximately 0.2102.
There are 365 days in one year. So, for the sample space, each of the 20 people has 365 choices
for their birthday. There are 20 trials, so n(S) = 36520.
If everyone must have a different birthday, the successful outcomes are dependent and 20 days
are selected from 365 days. So, n(A) = 365P20.
P20
P(all different) 365 20
365
0.5886
Use the indirect method, P(A) = 1 – P(A′).
P(at least two the same) 1 P(no two the same)
P20
1 365 20
365
0.4114
The probability that at least two people have the same birthday is approximately 0.4114.
From Example 4, the probability that at least two students have the same birthday in 30 students
is approximately 0.7063. From question 11, the probability that at least two students have the
same birthday in 20 students is approximately 0.4414. So, the number of students will be between
20 and 30. Use trial and error.
Try n = 25. Then, P(at least two the same) 0.5687. Too high.
Try n = 22. Then, P(at least two the same) 0.4757. Too low.
Try n = 23. Then, P(at least two the same) 0.5073.
So, 23 students are needed for the probability that at least two people have the same birthday
reaches 0.5.
a) Since the songs are played without repeats, the events are dependent.
1
The probability of playing your most favourite song first is , your second most favourite next
10
1
is , and so on.
9
1 1 1 1
P(songs in order) 1
10 9 8 2
1
3 628 800
1
The probability that the songs are played in your order of preference is .
3 628 800
2
b) The probability of playing one of your two favourite songs first is , and the probability of
10
1
playing the other of your two favourite songs next is .
9
a) The trials are independent, since the card is replaced: n(S) = 525.
Use the complement. The number of unsuccessful outcomes, no two people choose the same
card, is n(A′) = 52(51)(50)(49)(48).
52(51)(50)(49)(48)
P( A)
525
0.8203
Then, P( A) 0.1797 .
So, the odds against at least two people choosing the same card are 0.8203:0.1797.
b) By “denomination,” means one of the thirteen symbols that is represented on each card: 2, 3,
4, 5, 6, 7, 8, 9, 10, J, Q, K, A. Note there are four of each in a standard deck.
The trials are independent, since the card is replaced: n(S) = 525.
Use the complement. The number of unsuccessful outcomes, no two people choose the same
denomination, is n(A) = 52(48)(44)(40)(36).
52(48)(44)(40)(36)
P( A)
525
0.4160
Then, P( A) 0.5840 .
So, the odds against at least two people choosing the same denomination are 0.4160:0.5840.
a) i) Since the numbers must be different, the trials are dependent: n(S) = 35P5.
The number of successful outcomes, correct combination, is n(A) = 1.
1
P( A)
35 P5
1
38 955 840
The probability of cracking a combination lock on a safe if five different numbers are used from 1
1
to 35 is .
38 955 840
ii) Since the numbers must be different, the trials are dependent: n(S) = 40P5.
The number of successful outcomes, correct combination, is n(A) = 1.
1
P( A)
40 P5
1
78 960 960
iii) Since the numbers must be different, the trials are dependent: n(S) = 45P5.
The number of successful outcomes, correct combination, is n(A) = 1.
1
P( A)
45 P5
1
146 611 080
The probability of cracking a combination lock on a safe if five different numbers are used from 1
1
to 45 is .
146 611 080
b) The probability of cracking the safe decreases as the five different numbers are chosen from a
greater range of number.
a)
b)
1 1 1
c) Using the tree diagram, the probability of winning the grand prize is , or .
3 2 6
1 1 1 1 1
d) Using the tree diagram, the probability of winning a good prize is + , or .
3 2 3 2 3
1 1 1
f) The sum of all the probabilities is , or 1. There are only three possibilities
6 3 2
for prizes, so the sum of all probabilities in the sample space must equal 1.
Choose the date as your birthday. Then, the problem is the same.
There are 365 days in one year. So, for the sample space, each of the 25 people has 365 choices
for their birthday. There are 25 trials, so n(S) = 36525.
If everyone must have a different birthday, the successful outcomes are dependent and 25 days
are selected from 365 days. So, n(A) = 365P25.
P25
P(all different) 365 25
365
0.4313
Use the indirect method, P(A) = 1 – P(A′).
P(at least two the same) 1 P(no two the same)
P25
1 365 25
365
0.5687
The probability that at least two people have the same birthday is approximately 0.5687.
a) Recall the table of all possible outcomes for the sum of the dice when two standard dice are
thrown. There are only 6 ways to roll a sum of 7 and 30 ways to not roll a sum of 7. So, it is more
likely that not throwing a sum of 7 on consecutive rolls will occur.
1 1 1 1
b) The probability of arranging five digits in ascending order is 1 . The probability
5 4 3 2
1 1
of three letters being arranged in alphabetical order is 1 . So, it is more likely that three
3 2
different letters being arranged in alphabetical order will occur.
c) The probability of at least two out of 20 friends having the same birthday is approximately
0.4414. See solution to question 11.
There are 12 months in one year. So, for the sample space, each of the five people has 12 choices
for their birth month. There are five trials, so n(S) = 125.
If everyone must have a different birth month, the successful outcomes are dependent and five
months are selected from 12 months. So, n(A) = 12P5.
P
P(all different) 12 55
12
0.3819
Since the numbers must be different, the trials are dependent: n(S) = 40P5.
The number of successful outcomes, all five numbers in the correct order, is n(A) = 1.
1
P ( A)
40 P5
1
78 960 960
1.2664 108
The probability of winning the first prize is approximately 1.2664 108 .
24
78 960 960
3.0395 107
The probability of winning the second prize is approximately 3.0395 107 .
So, the probability of winning the first or second prize is approximately 3.1664 × 10–7.
Answers may vary. Any scenario that has n(A) = 1 and n(S) = 15P7. For example, winning first
prize, similar to question 20.
a) There are a total of 170 points on the grid. The sample space is n(S) = 170P2.
The number of successful outcomes, the segment is horizontal, is n(A) = 17(16)(10). There are 17
points per row and 10 rows.
17(16)(10)
P( A)
170 P2
0.0947
b) There are two diagonals, running from (0, 0) to (16, 9) and from (16, 0) to (0, 9).
The total number of line segments of length one or more is 170 × 169.
a) There are eight ways to win with cards in a row, a column, or a diagonal. If a card is picked,
3 2
then the probability of the remaining two cards are of the same denomination is . So, the
51 50
3 2
probability that there is exactly one winning set of the same denomination is 8 , or about
51 50
0.0188.
b) There are eight ways to win with cards in a row, a column, or a diagonal. If a card is picked,
4 4
then the probability of the remaining two cards are consecutive in any order is 2 . So,
51 50
4 4
the probability that there is exactly one winning set of consecutive cards is 8 2 , or
51 50
about 0.1004.
2.2355 106
b) If the cards can be in any order, then there are 6! permutations of the six cards.
6! 46
P(consecutive in any order) 8
52 P6
0.0026
The probability that the six cards are consecutive, but in any order is 6! × 3.6327 × 10–6, or about
0.0026.
The sum of 9 occurs eight times. There is only one occurrence of the sum 2 and sum 16.
a) and b)
a) Assuming repetition is permitted, there are 105, or 100 000 unique five-digit security codes
possible.
b) At 8 s per try, it will take Sarah at most 800 000 s, or about 9.3 days to find the correct code.
b) If there were six choices for the video card, then Ryan has 3(4)(6)(3)(2), or 432 choices to
configure his computer. Increasing the number of choices for any option will increase the total
number of possible configurations.
Assume that the socks have three stripes. Barb can make 6(5)(5), or 150 distinct pairs of socks.
a)
b)
The first term in row n is n. To obtain the remaining terms in row n, multiply all the terms in the
row above by n.
c) Answers may vary. The last term in row n equals n!. The last two terms in each row are
equal.
Consider each group a book. These can be arranged 3! ways. Then, the novels can be arranged in
7! ways, the plays in 4! ways, and the poetry books in 5! ways. So, the books can be arranged in
3! × 7! × 4! × 5!, or 87 091 200 ways.
a) There are 3 vowels and 4 consonants in the word STORAGE. If the vowels must remain in
even positions, there are 4(3)(3)(2)(2)(1)(1), or 144 ways this can be done.
b) Since there are fewer vowels than odd positions, there are several possible cases for vowel
positions:1, 3, 5; 1, 3, 7; 3, 5, 7; and 1, 5, 7. If the vowels must remain in odd positions, there are
4 × 3(4)(2)(3)(1)(2)(1), or 576 ways this can be done.
c) If the vowels can be in even or odd positions, there are 7!, or 5040 ways this can be done.
Use the complement. There are 6! ways to arrange the six letters. The number of unsuccessful
outcomes, the vowels are together, is 4! × 3!. Then, the number of ways that the vowels will not
be together is 6! – (4! × 3!), or 576 ways.
Since the ten thousands place cannot contain 0, there are several cases to consider for a five-digit
even number formed by using all the digits 0, 1, 2, 3, and 4.
Case 1: 0 in the ones place
There is one choice for the ones, four choices for the tens place, three choices for the hundreds
place, two choices for the thousands, and one choice for the ten thousands: 1(2)(3)(4)(1), or 24
ways.
There are 24 + 12 + 12 + 12, or 60 ways to form a five-digit even number using all the digits 0, 1,
2, 3, and 4.
1 1 1 1 1
a) The probability of each person selecting their own name is 1 , or
10 9 8 3 2
approximately 2.7557 × 10–7.
b) Use the complement. The probability that nobody selects his or her own name is 1 – 2.7557 ×
10–7, or about 1.
1 1
a) The probability that Kendra selects the green ball and Abdul selects the red ball is , or
6 5
1
.
30
b) The probability that Kendra selects the green ball and Abdul does not select the red ball is
1 4 2
, or .
6 5 15
c) Use the complement. The probability that Kendra does not select the green ball and Abdul
1 29
does not select the red ball is 1 – , or .
30 30
1 1 1 1 1
a) The probability that each person selects the same letter is , or
26 26 26 26 26
approximately 8.4165 × 10–8.
b) Use the complement. The probability of each person selects a different letter is 1 – 8.4165 ×
10–8, or about 1.
If a standard die is rolled four times, there are 64 possible orders of faces. Answer C.
101!
P
(101 98)!
101 98
101!
3!
Answer D.
5
1 1
When flipping a coin five times, the probability that heads turns up every time is , or .
2 32
Answer A.
a)
There are 12P5, or 95 040 ways to assign five different roles in a play to the 12 members of a
drama club.
Since each Canadian can win either first, second, or third, the events are dependent.
3
There are three ways the Canadians can win gold, so the probability of winning gold is .
8
2
There are two ways the Canadians can win silver, so the probability of winning silver is .
7
1
There is one way the Canadians can win bronze, so the probability of winning bronze is .
6
3 2 1
8 7 6
6
336
1
56
1
The probability that three Canadians will win gold, silver, and bronze is , or approximately
56
0.0179.
a) There are eight letters in the word COMPUTER. These can be arranged in 8!, or 40 320
ways.
b) There are five consonants in the word COMPUTER. The number of arrangements that begin
with a consonant is (5)(7)(6)(5)(4)(3)(2)(1), or 25 200.
First, determine the number ways the captain and assistant captain can be together.
Treat the captain and assistant captain as a single person, making 10 players. Then, arrange the
two of them among themselves: 10! × 2!
a) There are 25 men and 20 women who belong to a club, for a total of 45 members. With no
restrictions, the executive panel of four people can be chosen in 45P4, or 3 575 880 ways.
c) For the executive panel to have a president and vice president of different genders, there are
two cases: male president and female vice president or female president and male vice president.
For the first case, the executive panel of four people can be chosen in (25)(20)(43)(42), or 903
000 ways. Similarly for the second case, the executive panel of four people can be chosen in
(20)(25)(43)(42), or 903 000 ways.
There are 903 000 + 903 000 , or 1 806 000 ways the executive panel can be formed with a
president and vice president of different genders.
4
1 1
a) The probability of selecting A, B, C, D if repetition is permitted is , or .
26 456 976
1 1 1 1
b) The probability of selecting A, B, C, D if repetition is not permitted is ,
26 25 24 23
1
or .
358 800
First, determine the probability that no two select the same number.
20 19 18 12 11
The probability that each person selects a different number is , or
20 20 20 20 20
approximately 0.0655.
Then, use the complement. The probability that at least two people select the same number is 1 –
0.0655, or about 0.9345.
a) When dealing a card to five players, there are 52P5, or 311 875 200 different results possible.
b) When players must receive different denominations, there are 52(48)(44)(40)(36), or 158 146
560 results possible.
c) The probability that four players receive cards of the same denomination is
4 3 2 1
, or approximately 3.6938 × 10–6.
52 51 50 49