Chapter 3 Combinations

Chapter 3 Prerequisite Skills

Chapter 3 Prerequisite Skills Question 1 Page 102

a) 8!  8  7  6  5  4  3  2  1 9! 9  8  7  6  5  4  3  2  1
b) 
 40 320 3! 3  2 1
 98 7  6 5 4
 60 480

c) 3!  4!  3  2 1 4  3  2 1 d) For 10P6, n = 10 and r = 6.

 144 10!
10 P6 
(10  6)!
10!

4!
10  9  8  7  6  5  4  3  2  1

4  3  2 1
 10  9  8  7  6  5
 151 200

e) For 12P3, n = 12 and r = 3. f) For 7P3, n = 7 and r = 3.

12! 7 P3 7!
12 P3  
(12  3)! 3! (7  3)!3!
12! 7!
 
9! 4!3!
12  11  10  9! 7  6  5  4!
 
9! 4!3!
 12  11  10 765

 1320 3  2 1
 35

g) For 11P4, n = 11 and r = 4. 14! 14  13  12  11  10  9  8  7  6!

h) 
11 P4 11!
 2!5!6! 2!5! 6!
4! (11  4)!4!
14  13  12  11  10  9  8  7
11! 
 2 1 5  4  3  2 1
7!4!  504 504
11  10  9  8  7!

7!4!
11  10  9  8

4  3  2 1
 330

MHR  Data Management 12 Solutions 1

Chapter 3 Prerequisite Skills Question 2 Page 102

a) n! is a product of sequential natural numbers with the form n! = n(n – 1)(n – 2) ×  × 2 × 1.

b) The number of permutations of r items from a collection of n items is written as nPr or

P(n, r).
n!
n Pr  , nr
(n  r )!

Chapter 3 Prerequisite Skills Question 3 Page 102

a) For 7P3, n = 7 and r = 3. b) For 100P92, n = 100 and r = 92.

7! 100!
7 P3  100 P92 
(7  3)! (100  92)!
7! 100!
 
4! 8!

c) For nP6, r = 6. d) For 15Pr, n = 15.

n! 15!
n P6  15 Pr 
(n  6)! (15  r )!

Chapter 3 Prerequisite Skills Question 4 Page 102

a) There are 8!, or 40 320 ways to arrange 8 objects.

b) There are 8P5, or 6720 ways to arrange 5 of 8 objects.

c) There are 13P3, or 1716 ways to arrange 3 of 13 objects.

Chapter 3 Prerequisite Skills Question 5 Page 102

a) There are a total of 11 people. They can be arranged in 11!, or 39 916 800 ways in one row.

b) There are 5!, or 120 ways to arrange the girls in the front row. There are 6!, or 720 ways to
arrange the boys in the black row. They can be arranged in 5! × 6!, or 86 400 ways in the two
rows.

Chapter 3 Prerequisite Skills Question 6 Page 102

a) There is a total of 8 letters. They can be arranged in 8!, or 40 320 ways to arrange the letters.

b) There are 8P3, or 336 ways to arrange 3 of 8 letters.

Chapter 3 Prerequisite Skills Question 7 Page 102

a) Pascal’s triangle can be generated by noticing a pattern. The first and last terms are 1. The
remaining terms are the sum of the two adjacent terms in the row above.

2 MHR  Data Management 12 Solutions

b) Answers may vary. Consider the top of the triangle row 0. Then, the sum of entries in row n
equals 2n. The second diagonal contains the counting numbers 1, 2, 3, 4, 5, ….

Chapter 3 Prerequisite Skills Question 8 Page 102

a) These are independent events, so multiply the probabilities.

1 1 1
P(3 heads)   
2 2 2
1

8
1
The probability that the results of a coin flipped three times as all heads is .
8

b) These are independent events, so multiply the probabilities.

1 1 1
P(heads, heads, tails)   
2 2 2
1

8
1
The probability that the results of a coin flipped three times as heads, heads, tails is .
8

c) These are independent events, so multiply the probabilities.

1 1 1
P(heads, tails, heads,)   
2 2 2
1

8
1
The probability that the results of a coin flipped three times as heads, tails, heads is .
8

d) The probability that the results of a coin flipped three results in two heads and one tail in any
3
order (HHT, HTH, or THH) is .
8

Chapter 3 Prerequisite Skills Question 9 Page 102

4 4
a) The probability that the first card is a king and the second card is an ace is  , or
52 51
approximately 0.0060.

MHR  Data Management 12 Solutions 3

 26 26
b) The probability that the first card is red and the second card is black is  , or
52 51
approximately 0.2549.

c) These events are not mutually exclusive.

13 4 1
The probability that the first card is a heart and the second card is a king is   , or
52 52 52
about 0.3077.

Chapter 3 Prerequisite Skills Question 10 Page 102

1
a) The probability that Jacob goes first is .
18

1
b) The probability that Caryn goes first is .
18

1 1 1
c) The probability that Jacob or Caryn goes first is  , or .
18 18 9

1 1 1 1
d) The probability that the names are in alphabetical order is      1 , or
18 17 16 2
approximately 1.5619 × 10–16.

Chapter 3 Prerequisite Skills Question 11 Page 103

a) There are only three choices for the coloured die, so it could have six faces, two of each
colour.

b) From the tree diagram, there are 18 different outcomes.

1
c) The probability of P(5, Red) is .
18

2
d) The probability of P(Green or Blue) is .
3

Chapter 3 Prerequisite Skills Question 12 Page 103

The events A and B are not mutually exclusive, since the overlap shows there are common
elements. If A and B are non-mutually exclusive events, then the total number of favourable
outcomes is: n(A or B) = n(A) + n(B) – n(A and B).

4 MHR  Data Management 12 Solutions

Chapter 3 Prerequisite Skills Question 13 Page 103

Let event A represent red cards and event B represent face cards. Then, n(A) = 5, n(B) = 4, and
n(A and B) = 2.
n(A or B) = n(A) + n(B) – n(A and B)
=5+4–2
=7
There are seven cards in the hand.

Chapter 3 Prerequisite Skills Question 14 Page 103

a)

b) Answers may vary. This Venn diagram only displays the prime and even whole numbers up
to 10.

c) Answers may vary. This Venn diagram only displays the prime and even whole numbers up
to 10.

MHR  Data Management 12 Solutions 5

d)

Chapter 3 Prerequisite Skills Question 15 Page 103

a) ( x 2 )3  x 23 b) (2a) 2  22 a 2 c) (5m3 )2  52 (m3 )2 d) (3k 3 )4  34 (k 3 )4

 x6  4a 2  25m6  81k 12

Chapter 3 Prerequisite Skills Question 16 Page 103

a) ( x  y ) 2  ( x  y )( x  y )
 x 2  xy  xy  y 2
 x 2  2 xy  y 2

b) (a  b)3  (a  b)(a  b)(a  b)

 (a 2  ab  ab  b 2 )(a  b)
 (a 2  2ab  b 2 )(a  b)
 a 3  a 2b  2a 2b  2ab 2  ab 2  b3
 a 3  3a 2b  3ab 2  b3

c) (2 p  q)2  (2 p  q)(2 p  q)
 4 p 2  2 pq  2 pq  q 2
 4 p 2  4 pq  q 2

Chapter 3 Prerequisite Skills Question 17 Page 103

(n  1)(n  2)(n  3)(n  4)

a)
(n  3)(n  4)
(n  1)(n  2) (n  3) (n  4)

(n  3) (n  4)
 (n  1)(n  2)

6 MHR  Data Management 12 Solutions

 n(n  1)(n  2) 3  2  1
b)
(n  2)(n  3)(n  4) 3  2  1
n(n  1)(n  2)!

(n  2)!
n(n  1) ( n  2)!

(n  2)!
 n(n  1)

n!
c)
( n  1)!
n( n  1)!

(n  1)!
n ( n  1)!

( n  1)!
n

Chapter 3 Section 1 Permutations With Non-Ordered Elements

Chapter 3 Section 1 Example 1 Your Turn Page 105

a) List all of the possible arrangements of AB1B2B3 and ABBB.

Arrangements of AB1B2B3 Arrangements of ABBB
AB1B2B3 AB1B3B2 AB2B1B3 AB2B3B1 AB3B2B1 AB3B1B2 ABBB
B1AB2B3 B1AB3B2 B2AB1B3 B2AB3B1 B3AB2B1 B3AB1B2 BABB
B1B2AB3 B1B3AB2 B2B1AB3 B2B3AB1 B3B2AB1 B3B1AB2 BBAB
B1B2B3A B1B3B2A B2B1B3A B2B3B1A B3B2B1A B3B1B2A BBBA

In each case, there are 3! permutations of AB1B2B3 for each ABBB arrangement. This is because
there are 3! permutations of B1B2B3.

b) List all of the possible arrangements of A1A2B1B2 and AABB.

Arrangements of A1A2B1B2 Arrangements of AABB
A1A2B1B2 A2A1B1B2 A1A2B2B1 A2A1B2B1 AABB
A1B1A2B2 A2B1A1B2 A1B2A2B1 A2B2A1B1 ABAB
A1B1B2A2 A2B1B2A1 A1B2B1A2 A2B2B1A1 ABBA
B2A1A2B1 B2A2A1B1 B1A1A2B2 B1A2A1B2 BAAB
B1B2A1A2 B1B2A2A1 B2B1A1A2 B2B1A2A1 BBAA
B2A1B1A2 B2A2B1A1 B1A1B2A2 B1A2B2A1 BABA

In each case, there are 2!2! permutations of A1A2B1B2 for each AABB arrangement. This is
because there are 2!2! permutations of A1A2B1B2.

MHR  Data Management 12 Solutions 7

Chapter 3 Section 1 Example 2 Your Turn Page 106

Apply the formula.

n=8+8+8 p=8 q=8 r=8
= 24
24!
Number of permutations =
8!8!8!
= 9 465 511 770
These outcomes could have happened in 9 465 511 770.

The numerators are unchanged so compare denominators.

12!8!4! = 12(11)(10)(9)8!8!4! and 8!8!8!
It is obvious that the denominator of the original team is greater. So, I would expect the number
of orders of the second team to be higher.

Chapter 3 Section 1 Example 3 Your Turn Page 107

You can place the vowels in any position but you must keep them in the order EAI.
Since you cannot arrange the vowels in a different order, treat them as like elements, using V for
each vowel. Rewrite the letters as VXPLVVN.
n=7 p=3
7!
The number of arrangements of VXPLVVN is , or 840.
3!
There are 840 ways to arrange the letters, keeping the vowels in the original order.

Chapter 3 Section 1 R1 Page 108

You must divide by 4! because there are four identical 2s.

Chapter 3 Section 1 R2 Page 108

No. The number of permutations of three girls and four boys, or seven people, is 7!
7!
The number of permutations of three red balls and four green balls is . All red balls are
3!4!
identical and all green balls are identical.

Chapter 3 Section 1 R3 Page 108

Answers may vary. It is much quicker to use the formula. Use the information given to determine
the total number of objects and the number of each identical object. Drawing a tree diagram or
chart may not be practical and takes longer.

Chapter 3 Section 1 Question 1 Page 108

10! 10  9  8  7  6  5! 9! 9  8  7  6  5  4  3!
a)  b) 
2!3!5! 2!3! 5! 3!3!3! 3!3! 3!
10  9  8  7  6 98 7  65 4
 
2 1 3  2 1 3  2 1 3  2 1
 2520  1680

8 MHR  Data Management 12 Solutions

 7! 7  6  5  4  3! 120! 120  119  118  117  116  115!
c)  d) 
2!3! 2! 3! 115!3!2! 3!2!115!
7  6 5 4 120  119  118  117  116
 
2 1 3  2  1 2  1
 420  1905 780 240

Chapter 3 Section 1 Question 2 Page 108

There are five small tiles and tree large tiles. Apply the formula.
n=5+3 p=5 q=3
=8

8!
Number of permutations =
5!3!
= 56
The number of arrangements is 56. Answer B.

Chapter 3 Section 1 Question 3 Page 108

There are a total of 12 pens, so n = 12. There are four blue, so p = 4. There are three red, so q = 3.
The others are all different. Answer D.

Chapter 3 Section 1 Question 4 Page 108

a) There are a total of 8 letters, so n = 8. There are two Os, so p = 2. The rest are all different.
8!
The number of permutations of the letters in WATERLOO is , or 20 160.
2!

b) There are a total of 7 letters, so n = 7. There are three Os and two Ts, so p = 3 and q = 2. The
rest are all different.
7!
The number of permutations of the letters in TORONTO is , or 420.
3!2!

c) There are a total of 11 letters, so n = 11. There are four Ss, two Is, and two As, so p = 4, q =
2, and r = 2. The rest are all different.
11!
The number of permutations of the letters in MISSISSAUGA is , or 415 800.
4!2!2!

d) There are a total of 6 letters, so n = 6. There are two As and two Ts, so p = 2 and q = 2. The
rest are all different.
6!
The number of permutations of the letters in OTTAWA is , or 180.
2!2!

Chapter 3 Section 1 Question 5 Page 108

5!
a) For 1, 2, 2, 3, 4, there are , or 60 five-digit numbers that can be formed.
2!

MHR  Data Management 12 Solutions 9

 5!
b) For 1, 2, 2, 2, 3, there are , or 20 five-digit numbers that can be formed.
3!

5!
c) For 1, 1, 2, 3, 3, there are , or 30 five-digit numbers that can be formed.
2!2!

5!
d) For 1, 2, 2, 2, 2, there are , or 5 five-digit numbers that can be formed.
4!

Chapter 3 Section 1 Question 6 Page 108

a) There is a total of 12 pieces of fruit, so n = 12. There are three pieces of each of the four
types, so p = 3, q = 3, r = 3, and s = 3.
12!
The number of ways Sam could arrange the fruit in a line is , or 369 600.
3!3!3!3!

b) There is a total of 12 pieces of fruit, so n = 12. There are 4! ways for the same pieces of fruit
to be arranged to each row.
12!
The number of ways Sam could arrange the fruit in three rows of four is , or 34 650.
4!4!4!

c) There is a total of 12 pieces of fruit, so n = 12. There are 6! ways for the same pieces of fruit
to be arranged to each row.
12!
The number of ways Sam could arrange the fruit in two rows of six is , or 924.
6!6!

Chapter 3 Section 1 Question 7 Page 108

There is a total of eight switches, so n = 8. Half are on and half are off, so p = 4 and q = 4.
8!
The number of ways this can be done is , or 70.
4!4!

Chapter 3 Section 1 Question 8 Page 108

There is a total of 10 coins, so n = 12. There are two quarters, three loonies, and five toonies, so
p = 2, q = 3, and r = 5, respectively.
10!
The magician can arrange the coins is , or 2520 ways.
2!3!5!

Chapter 3 Section 1 Question 9 Page 109

There are 15 fags, so n = 15. There are five red, four green, two blue, and four yellow, so
p = 5, q = 4, r = 2, and s = 4, respectively.
15!
The flags can be arranged in , or 9 459 450 ways.
5!4!2!4!

10 MHR  Data Management 12 Solutions

Chapter 3 Section 1 Question 10 Page 109

Since it is not possible to have 0 or a fractional number of ways to do something, the number of
permutations involving identical objects will be a natural number. So, the denominator must be a
factor of the numerator.

Chapter 3 Section 1 Question 11 Page 109

Let each block travelled north by represent by N and each block travelled west be represented by
W. Assume all distances in each directions are equal. Now, find the number of arrangements of
NNNNNWWWWWW.
There are 11 blocks, so n = 11. There are five north and six west, so p = 5 and q = 6, respectively.
11!
The number of routes Minh can take is , or 462.
5!6!

Chapter 3 Section 1 Question 12 Page 109

a) There are 12! ways to assign the volleyball players. Order of assignment does not matter. For
example, ABC is the same as BAC, ACB, BCA, CBA, and CAB. So, there are 3! ways for the
same players to be assigned to each room.
12!
The number of ways that 12 volleyball players can be assigned to four triple rooms is or
3!3!3!3!
369 600.

b) There are 12! ways to assign the volleyball players. Order of assignment does not matter. For
example, AB is the same as BA. So, there are 2! ways for the same players to be assigned to each
room.
The number of ways that 12 volleyball players can be assigned to six double rooms is
12!
or 7 484 400.
2!2!2!2!2!2!

Chapter 3 Section 1 Question 13 Page 109

You can place the consonants in any position but you must keep them in the order PRBLM.
Since you cannot arrange the consonants in a different order, treat them as like elements, using C
for each consonant. Rewrite the letters as CCOCCEC.
n=7 p=5
7!
The number of arrangements of CCOCCEC is , or 42.
5!
There are 42 ways to arrange the letters, keeping the consonants in the original order.

Chapter 3 Section 1 Question 14 Page 109

You can place the numbers in any position, except for 5 and 7 which must remain where they are.
There are four digits that can be placed in any position, so n = 4.
There are two 8s so treat them as like elements.

4!
The number of arrangements is  2! , or 24.
2!

MHR  Data Management 12 Solutions 11

There are 24 ways to arrange the numbers, keeping 5 and 7 in their original positions.

Chapter 3 Section 1 Question 15 Page 109

a) There is a total of 12 letters, so n = 12. There are two Ws and two Ts, so
p = 2 and q = 2, respectively.
12!
All of the letters in FAWLTY TOWERS can be arranged in , or 119 750 400 ways.
2!2!

b) You can put the A, Y, O, and E in any position but you must keep them in the order AYOE.
Since you cannot arrange the vowels in a different order, treat them as like elements, using V for
each vowel. Rewrite the letters as FVWLTV TVWVRS.

n = 12
p=4
12!
The number of arrangements of FVWLTV TVWVRS is  19958400 .
4!

There are 19 958 400 ways to arrange the letters, keeping the vowels in the original order.

c) Since A, Y, E, and O must stay in their original positions, deal with each position:
FAW LT Y T OW E R S
8(1)(7)(6)(5)(1)(4)(1)(3)(1)(2)(1)
There are still 2!2! identical arrangements.
8(1)(7)(6)(5)(1)(4)(1)(3)(1)(2)(1)
So, the number of arrangements of these letters becomes , or
2!2!
20 160.

d) There are seven consonants that must remain in alphabetical order, this can only happen in
one way.
FR S T T WW
1(1)(1)(2)(1)(2)(1)
1(1)(1)(2)(1)(2)(1)
There are still 2!2! identical arrangements; 1
2!2!
The vowels can be arranged in 5! ways.
So, the number of arrangements of these letters becomes 1(5!), or 120.

Chapter 3 Section 1 Question 16 Page 109

a) There are 26 letters in the alphabet.

26!
There are or 14 950 letter combinations in alphabetical order.
22! 4!
10!
There are or 720 number combinations.
7!

14 950 × 720 = 10 764 000

12 MHR  Data Management 12 Solutions

There are 10 764 000 ways for the letters to be in alphabetical order and the numbers to be all
different.

26!
b) There are , or 358 800 ways for the letters to be combined.
22!
10!
There are , or 120 ways for the numbers to be in numerical order.
7! 3!

358 800 × 120 = 43 056 000

There are 43 056 000 ways for the letters to be all different and the numbers to be in numerical
order.

c) From parts a) and b), 14950 × 120 = 1 794 000.

There are 1 794 000 ways for the letters to be in alphabetical order and the numbers to be in
numerical order.

d) There are 264 × 103, or 456 976 000 different possible combinations with no restrictions, so the
answer in part c) represents approximately 0.4% of all of the available plates.

Chapter 3 Section 1 Question 17 Page 109

Answers may vary. Any scenario with n = 12, p = 2, q = 3, r = 4, and s = 3. For example,
How many arrangements are there of 12 flags in a row if two are red, three are green, four are
blue, and three are yellow?

Chapter 3 Section 1 Question 18 Page 109

Since the millions place cannot contain 0, there are several cases to consider for a seven-digit
even number formed by using all the digits 0, 1, 1, 2, 3, 4, and 5.
Case 1: 0 in the ones place
There is one choice for the ones, six choices for the tens place, five choices for the hundreds
place, four choices for the thousands, three choices for the ten thousands, two choices for the
hundred thousands, and one choice for the millions: 1(2)(3)(4)(5)(6)(1), or 720 ways. Taking into
account the two 1s, this becomes 360 ways.

Case 2: 0 in the tens place

There are two choices for the ones place, one choice for the tens place, five choices for the
hundreds place, four choices for the thousands, three choices for the ten thousands, two choices
for the hundred thousands, and one choice for the millions: 1(2)(3)(4)(5)(1)(2), or 240 ways.
Taking into account the two 1s, this becomes 120 ways.

Case 3: 0 in the hundreds place

This is similar to the previous case. There are 1(2)(3)(4)(1)(5)(2) ÷ 2, or 120 ways.

Case 4: 0 in the thousands place

This is similar to the previous two cases. There are 1(2)(3)(1)(4)(5)(2) ÷ 2, or 120 ways.

Case 4: 0 in the ten thousands place

MHR  Data Management 12 Solutions 13

This is similar to the previous three cases. There are 1(2)(1)(3)(4)(5)(2) ÷ 2, or 120 ways.

Case 4: 0 in the hundred thousands place

This is similar to the previous four cases. There are 1(1)(2)(3)(4)(5)(2) ÷ 2, or 120 ways.

There are 720 + 5(120), or 1320 ways to form a five-digit even number using all the digits 0, 1, 1,
2, 3, 4, and 5.

Chapter 3 Section 1 Question 19 Page 109

P4
5
There are , or 60 four-letter arrangements of the letters in the word APPLE.
2!

Chapter 3 Section 1 Question 20 Page 109

Each pair adds up to 21. Place 1 in a position around the circumference, then 20 must be opposite
it. Now, there are 18 positions to fill. Place 2 in a position around the circumference, then 19 must
be opposite it. Continue the pattern. So, there 1(18)(16)(14)(12)(10)(8)(6)(4)(2), or 185 794 560
ways the ten pairs of numbers can be placed around the circumference of the board.

Chapter 3 Section 2 Combinations

Chapter 3 Section 2 Example 1 Your Turn Page 111

a) If four of the ten ingredients must be used, then n = 10 and r = 4.

10!
10 C4 
(10  4)!4!
10!

6!4!
 210
The chefs can make 210 different soups with four ingredients.

b) If five of the ten ingredients must be used, then n = 10 and r = 5.

10!
10 C5 
(10  5)!5!
10!

5!5!
 252
The chefs can make 252 different soups with five ingredients.

c) If six of the ten ingredients must be used, then n = 10 and r = 6.

10!
10 C6 
(10  6)!6!
10!

4!6!
 210
The chefs can make 210 different soups with six ingredients.

14 MHR  Data Management 12 Solutions

Chapter 3 Section 2 Example 2 Your Turn Page 112

Choose each group of four types of cheeses and four types of crackers separately. Since the two
groups are being selected together, the fundamental counting principle applies.
7! 6!
7 C4  6 C4  
(7  4)!4! (6  4)!4!
7! 6!
 
3!4! 2!4!
 525
Erica can make 525 different platters.

Chapter 3 Section 2 Example 3 Your Turn Page 112

Choosing any three points from the seven will produce a unique triangle. Note: ABC is the
same as BCA, CAB, ACB, CBA, and BAC.
7!
C3 
(7  3)!3!
7

7!

4!3!
 35
A total of 35 triangles can be drawn using the seven points.

Chapter 3 Section 2 R1 Page 113

Answers may vary.

a) For permutations, order matters. For example, select five out of eight for five different offices
of the committee.

b) For combinations, order does not matter. For example, select five out of eight for a
committee.

Chapter 3 Section 2 R2 Page 113

Answers may vary. Examples: Selecting groceries, selecting toppings for a sandwich

Chapter 3 Section 2 R3 Page 113

A situation in which order matters (permutations) will have more possibilities.

P
By definition, n Cr  n r
r!
For each combination of r items there are r! permutations. So, the number of combinations is r!
times smaller than the number of permutations.

MHR  Data Management 12 Solutions 15

Chapter 3 Section 2 Question 1 Page 113

9! 8!
a) C5  b) C4 
(9  5)!5! (8  4)!4!
9 8

9! 8!
 
4!5! 4!4!
 126  70

c) C (12,3) 
12! 11 11!
d)   
(12  3)!3!  5  (11  5)!5!
12! 11!
 
9!3! 6!5!
 220  462
7! 6! 101 101 101! 101!
e) 7 C2  6 C3   f)    
(7  2)!2! (6  3)!3!  98   3  (101  98)!98! (101  3)!3!
7! 6! 101! 101!
   
5!2! 3!3! 3!98! 98!3!
 420  27 772 222 500

Chapter 3 Section 2 Question 2 Page 113

P3
10 C3  10

3!
10!

(10  3)!3!
10! 10!
 or
7!3! 3!7!
10P3
The incorrect way to write 10 C3 is . Answer B.
7!

Chapter 3 Section 2 Question 3 Page 113

There are 9 C3 , or 84 ways to form three-member committees from a group of nine people.
Answer B.

Chapter 3 Section 2 Question 4 Page 113

There are 10 C6 , or 210 ways to choose 6 online subscriptions from 10 magazines.

Chapter 3 Section 2 Question 5 Page 113

There are 11 C4 , or 330 ways to choose 4 packages of pasta from 11 different types.

16 MHR  Data Management 12 Solutions

Chapter 3 Section 2 Question 6 Page 113

There is 10 C0 , or 1 way to choose no marbles from a bag of 10 marbles.

Chapter 3 Section 2 Question 7 Page 113

1! 2! 3!
a) C0  b) C0  c) C0 
(1  0)!0! (2  0)!0! (3  0)!0!
1 2 3

1! 2! 3!
  
1!0! 2!0! 3!0!
1 1 1

15! n!
d) C0  e) C0 
(15  0)!0! (n  0)!0!
15 n

15! n!
 
15!0! n !0!
1 1

Chapter 3 Section 2 Question 8 Page 113

Treat each section of the exam separately. Since the two groups are being selected together, the
fundamental counting principle applies.
8! 4!
8 C6  4 C2  
(8  6)!6! (4  2)!2!
8! 4!
 
2!6! 2!2!
 168
A student can answer six out of eight questions in Part A and two out of four questions in Part B
of the exam in 168 ways.

Chapter 3 Section 2 Question 9 Page 114

a) There are 26 black cards in a deck, n = 26 and r = 5.

26!
26 C5 
(26  5)!5!
26!

21!5!
 65 780
There are 65 780 five-card hands containing only black cards.

b) There are 12 face cards in a deck, n = 12 and r = 5.

12!
12 C5 
(12  5)!5!
12!

71!5!
 792

MHR  Data Management 12 Solutions 17

There are 792 five-card hands containing only face cards.

c) There are 39 non-heart cards in a deck, n = 39 and r = 5.

39!
39 C5 
(39  5)!5!
39!

34!5!
 575 757
There are 575 757 five-card hands containing no heart cards.

d) There are 26 red cards in a deck, n = 26 and r = [Link] are 26 black cards in a deck, n = 26
and r = 3.
26! 26!
26 C2  26 C3  
(26  2)!2! (26  3)!3!
26! 26!
 
24!2! 23!3!
 845 000
There are 845 000 five-card hands containing two red and three black cards.

e) There are 12 face cards in a deck, n = 12 and r = 1. There are 40 non-face cards in a deck,
n = 40 and r = 4.
12! 40!
12 C1  40 C4  
(12  1)!1! (40  4)!4!
12! 40!
 
11!1! 36!4!
 1 096 680
There are 1 096 680 five-card hands containing one face card.

Chapter 3 Section 2 Question 10 Page 114

a) There are 40 C12 , or 5 586 853 480 ways to form a 12-person jury from 40 people.

b) There are 40 C6 , or 3 838 380 ways to form a 6-person jury from 40 people.

c) There is a larger number of ways to choose a 12-person jury than a 6-person jury. This is the
case because the denominator in part a) (28!12!) is smaller than that in part b) (34!6!).

Chapter 3 Section 2 Question 11 Page 114

a) There are a total of 11 vehicle models available. There are 11 C4 , or 330 ways Wayne can sell
four vehicles without restrictions.

b) There are 6 truck models, n = 6 and r = 2. There are five car models, n = 5 and r = 2.

18 MHR  Data Management 12 Solutions

 6! 5!
C2  5 C2  
(6  2)!2! (5  2)!2!
6

6! 5!
 
4!2! 3!2!
 150
There are 150 ways Wayne can sell two trucks and two cars.

c) There are 6 truck models, n = 6 and r = 1. There are five car models, n = 5 and r = 3.
6! 5!
6 C1  5 C3  
(6  1)!1! (5  3)!3!
6! 5!
 
5!1! 2!3!
 60
There are 60 ways Wayne can sell one truck and three cars.

d) There are five car models, n = 5 and r = 4.

5!
5 C4 
(5  4)!4!
5!

1!4!
5
There are 5 ways Wayne can sell four cars.

e) There are six truck models, n = 6 and r = 4.

6!
6 C4 
(6  4)!4!
6!

2!4!
 15
There are 15 ways Wayne can sell four trucks.

f) Parts b) to e) are subsets of part a). The combinations sum to 230. With the inclusion of a
three truck and one car option, the total is 330.

Chapter 3 Section 2 Question 12 Page 114

a) This is a combination situation, since the order does not matter.

b) For a family with 14 members, there will be 14 C2 , or 91 video chats.

Chapter 3 Section 2 Question 13 Page 114

a) Select four points for a quadrilateral, n = 10 and r = 4.

MHR  Data Management 12 Solutions 19

 10!
C4 
(10  4)!4!
10

10!

6!4!
 210
There are 210 quadrilaterals that can be drawn using 10 points on the circumference of a circle.

b) Select five points for a quadrilateral, n = 10 and r = 5.

10!
10 C5 
(10  5)!5!
10!

5!5!
 252
There are 252 pentagons that can be drawn using 10 points on the circumference of a circle.

c) Select n points, 3 ≤ n ≤ 10.

10!
10 Cn 
(10  n)!n!
There are 10 Cn , 3 ≤ n ≤ 10 polygons of n sides that can be drawn using 10 points on the
circumference of a circle.

Chapter 3 Section 2 Question 14 Page 114

7! 7!
a) i) 7 C2  C5 
(7  2)!2! (7  5)!5!
7

7! 7!
 
5!2! 2!5!
 21  21

4! 4!
ii) C3  C1 
(4  3)!3! (4  1)!1!
4 4

4! 4!
 
1!3! 3!1!
4 4

12! 12!
iii) C4  C8 
(12  4)!4! (12  8)!8!
12 12

12! 12!
 
8!4! 4!8!
 495  495

The values in each pair are the same.

20 MHR  Data Management 12 Solutions

b) My observation from part a) is that n Cr  n Cn r . The only difference is the order of the terms
in the denominator. The number of combinations of n items taken r at a time is equivalent to the
number of combinations of n items taken n – r at a time.

n!
c) Cr 
(n  r )!r !
n

n!

r !(n  r )!
n!

(n  (n  r ))!(n  r )!
 n Cn  r

Chapter 3 Section 2 Question 15 Page 114

a) From 18 students, select nine actors (n = 18, r = 9). From the remaining nine students, select
five set builders (n = 9, r = 5), and then four stage hands: n = 4, r = 4.
18! 9! 4!
18 C9  9 C5  4 C4   
(18  9)!9! (9  5)!5! (4  4)!4!
18! 9! 4!
  
9!9! 4!5! 0!4!
 6126120
The class can be divided up in 6 126 120 ways selecting the actors first.

b) From 18 students, select five set builders (n = 18, r = 5). From the remaining 13 students,
select nine actors (n = 13, r = 9), and then four stage hands: n = 4, r = 4.
18! 13! 4!
18 C5  13 C9  4 C4   
(18  5)!5! (13  9)!9! (4  4)!4!
18! 13! 4!
  
13!5! 4!9! 0!4!
 6126120
The class can be divided up in 6 126 120 ways selecting the set builders first.

c) The results for parts a) and b) are the same. The order in which the jobs are assigned is
irrelevant.

Chapter 3 Section 2 Question 16 Page 115

n(n  3)
a) Using the formula with n = 8, there are 20 diagonals in any convex octagon.
2
Using combinations, select two points from the eight vertices: 8 C2 . However, this also includes
consecutive vertices that form a side of the octagon. So, subtract eight, the number of sides.
There are 8 C2  8 , or 20 diagonals in any convex octagon.

n(n  3)
b) The general formula for the number of diagonals in a polygon with n sides is .
2

MHR  Data Management 12 Solutions 21

Using combinations, select two points from the n vertices: n C2 . However, this also includes
consecutive vertices that form a side of the polygon. So, subtract n, the number of sides.
There are n C2  n diagonals in an n-sided convex polygon.

Chapter 3 Section 2 Question 17 Page 115

a) There are 25 C10 , or 3 268 760 ways 10 playing pieces can be placed on the board without
restrictions.

b) There are two pieces in each row with 5 spots: 5 C2 .

The number of ways the 10 playing pieces can be arranged with two in each row is
5 C2  5 C2  5 C2  5 C2  5 C2 , or 50.

c) If the playing pieces were all different, then order within a row would matter as well as row
number. The results would be much larger.

Chapter 3 Section 2 Question 18 Page 115

There are 15! ways to assign the 15 people. Order of assignment does not matter. So, there are 5!
ways for the same people to be assigned to each group.
15!
The number of ways that 15 people can be assigned to three groups is or 756 756.
5!5!5!
Using combinations: 15 C5  10 C5  5 C5 = 756 756.

Chapter 3 Section 2 Question 19 Page 115

There are 20 C2  18 C2  16 C2  14 C2  12 C2  10 C2  8 C2  6 C2  4 C2  2 C2 , or
2 375 880 867 360 000 ways a team of 20 hockey players can be accommodated in 10 two-person
hotel rooms.

Chapter 3 Section 2 Question 20 Page 115

As noted in the solution to question 18, the techniques from the two sections result in the same
answer.

Chapter 3 Section 2 Question 21 Page 115

There are 30 C5  25 C5  20 C5  15 C5  10 C5  5 C5 ways to divide a class of 30 students into six

teams of five members.
The number of ways to arrange a total of 30 flags with five of six different colours is also
30 C5  25 C5  20 C5  15 C5  10 C5  5 C5 .

Chapter 3 Section 2 Question 22 Page 115

For r > 0, there will always be more r-permutations of n items than r-combinations or n items.
P
By definition, n Cr  n r
r!

22 MHR  Data Management 12 Solutions

In permutations order matters, not in combinations. For each combination of r items there are
r! permutations. So, the number of combinations is r! times smaller than the number of
permutations.

Chapter 3 Section 2 Question 23 Page 115

There are several ways to form a triangle.

Corner point with and one point from the row and one point from the column: 1 4 C1  3 C1

Two points from the row and one point from the column: 4 C2  3 C1

One point from the row and two points from the column: 4 C1  3 C2

There are 1 4 C1  3 C1 + 4 C2  3 C1 + 4 C1  3 C2 , or 42 triangles that can be formed using the

points.

Chapter 3 Section 2 Question 24 Page 115

a) Let the three consecutive numbers be represented by n, n – 1, and n – 2.

n(n  1)(n  2) n(n  1)(n  2)(n  3)!

3! (n  3)!3!
 n C3

b) Let the r consecutive numbers be represented by n, n – 1, n – 2, …, (n – r + 1).

n(n  1)(n  2) (n  r  1) n(n  1)(n  2) (n  r  1)(n  r )!

r! (n  r )!r !
 n Cr

MHR  Data Management 12 Solutions 23

Chapter 3 Section 2 Question 25 Page 115

n !  12 n C2
n!
n !  12 
 n  2 !2!
n !  6n(n  1)
n(n  1)(n  2)!  6n( n  1)
(n  2)!  6
3!  6
So, n  2  3
n5

Chapter 3 Section 2 Question 26 Page 115

Use the indirect method: total number of ways to choose – 3 consecutive – 2 consecutive

The total number of ways to choose is 20C3, or 1140.

The number of ways to choose three consecutive (1, 2, 3 to 18, 19, 20) is 18.

The number of ways to choose two consecutive:

Case 1: (1, 2) or (19, 20)
There are 17 choices for the third number.
17 × 2 = 34

All Other Cases: (2, 3) to (18, 19)

There are 16 choices for the third number.
17 × 16 = 272

Using the indirect method, 1140 – 18 – 34 – 272 = 816.

There are 816 ways to choose three numbers from 1 to 20 so that no two are consecutive.

Chapter 3 Section 3 Problem Solving With Combinations

Chapter 3 Section 3 Example 1 Your Turn Page 117

Method 1: Use Combinations

Since you pull out at least one marble from the bag, determine the number of combinations of 1,
2, 3, 4, 5, 6, 7, and 8 marbles.

24 MHR  Data Management 12 Solutions

 8 C1  8 C2  8 C3  8 C4  8 C5  8 C6  8 C7  8 C8
8! 8! 8! 8! 8! 8! 8! 8!
       
(8  1)!1! (8  2)!2! (8  3)!3! (8  4)!4! (8  5)!5! (8  6)!6! (8  7)!7! (8  8)!8!
8! 8! 8! 8! 8! 8! 8! 8!
       
7!1! 6!2! 5!3! 4!4! 3!5 2!6! 1!7! 0!8!
 8  28  56  70  56  28  8  1
 255
Marbles can be pulled from the bag in 255 ways.

Method 2: Use the Indirect Method

You must pull out at least one marble. So, subtract 1 from the total number of possible ways to
pull out the marbles to account for pulling out no marbles (null set).
The value 28 indicates that each of the 8 marbles can be selected in 2 ways, either pulled out or
not pulled out.
28  1  256  1
 255
Marbles can be pulled from the bag in 255 ways.

Chapter 3 Section 3 Example 2 Your Turn Page 119

a) The hand can have either two, three, four, …, or thirteen hearts.
Use the indirect method by subtracting the number of hands with 0 or 1 heart.
The total number of hands possible is 52 C13 , or 635 013 559 600.
Case 1: No Hearts
13! 39!
13 C0  39 C13  
13!0! 26!13!
 8122 425 444
Case 2: One Hearts
13! 39!
13 C1  39 C12  
12!1! 27!12!
 50 840 366 668
The number of hands that contain at least two hearts is
635 013 559 600 – 8 122 425 444 – 50 840 366 668, or 576 050 767 488.

b) The hand can have either 10, 11, 12, or 13 hearts.

Case 1: 10 Hearts and 3 Other Cards
13! 39!
13 C10  39 C3  
3!10! 36!3!
 2 613 754
Case 2: 11 Hearts and 2 Other Cards
13! 39!
13 C11  39 C2  
2!11! 37!2!
 57 798

MHR  Data Management 12 Solutions 25

Case 3: 12 Hearts and 1 Other Card
13! 39!
13 C12  39 C1  
1!112! 38!1!
 507
Case 4: 13 Hearts and 0 Other Cards
13! 39!
13 C13  39 C0  
0!113! 39!0!
1
The number of hands that contain at least 10 hearts is 2 613 754 + 57 798 + 507 + 1, or
2 672 060.

c) The hand must have 5 clubs, 5 spades, and 3 other cards.

13! 13! 26!
13 C5  13 C5  26 C3   
8!5! 8!5! 23!3!
 4 306 559 400
The number of hands that contain 5 clubs and 5 spades is 4 306 559 400.

d) The hand must have 3 diamonds and 10 other cards.

13! 39!
13 C3  39 C10  
10!3! 29!10!
 181823183 256
The number of hands that contain 3 diamonds is 181 823 183 256.

e) The hand must have 5 clubs or 5 spades and 8 other cards.

Case 1: 5 Clubs and 8 Other Cards
13! 39!
13 C5  39 C8  
8!5! 31!8!
 79181 063 676
Case 5: 5 Spades and 8 Other Cards
13! 39!
13 C5  39 C8  
8!5! 31!8!
 79181 063 676
The number of hands that contain 5 clubs or 5 spades is 158 362 127 352.

Chapter 3 Section 3 Example 3 Your Turn Page 119

a) First, determine the number of ways of choosing the two different vowels and three different
consonants: 6C2 × 20C3.
Once chosen, these can be arranged in 5! ways.
There are 6C2 × 20C3 × 5!, or 2 052 000 ways a five-letter code can be formed from two different
vowels and three different consonants.

b) If the code must contain C, then there are 6C2 × 1C1 × 19C2 × 5!, or 307 800 codes.
Chapter 3 Section 3 R1 Page 120

When determining the total number of subsets of a set, you add the number of possibilities in
each case because the events are mutually exclusive.

26 MHR  Data Management 12 Solutions

Chapter 3 Section 3 R2 Page 120

When using cases to determine the number of ways of selecting objects from different sets, you
add because the events are mutually exclusive.

Chapter 3 Section 3 R3 Page 120

Answers may vary.

Chapter 3 Section 3 Question 1 Page 120

Determine the sums using the number of combinations of 1, 2, 3, and 4 different dollar bills.
4 C1  4 C2  4 C3  4 C4

4! 4! 4! 4!
   
(4  1)!1! (4  2)!2! (4  3)!3! (4  4)!4!
4! 4! 4! 4!
   
3!1! 2!2! 1!3! 0!4!
 4  6  4 1
 15
Alternatively, using the indirect method, 24 – 1 = 15.
There are 15 different sums of money that can be made.

MHR  Data Management 12 Solutions 27

Chapter 3 Section 3 Question 2 Page 120

Determine the number using combinations of 8, 9, or 10 people.

10 C8  10 C9  10 C10

10! 10! 10!

  
(10  8)!8! (10  9)!9! (10  10)!10!
10! 10! 10!
  
2!8! 1!9! 0!10!
 45  10  1
 56
There are 56 committees with at least 8 people. Answer B.

Chapter 3 Section 3 Question 3 Page 120

Use the indirect method.

212  1  4095
There are 4095 different subsets of 12 items. Answer C.

Chapter 3 Section 3 Question 4 Page 120

a) The panel must have 3 students and 3 other members.

10! 8!
10 C3  8 C3  
7!3! 5!3!
 6720
There are 6720 panels with three students.

b) The panel must have 4 students and 2 other members.

10! 8!
10 C4  8 C2  
6!4! 6!2!
 5880
There are 5880 panels with four students.

c) The panel must have 5 students and 1 other member.

10! 8!
10 C5  8 C1  
5!5! 7!1!
 2016
There are 2016 panels with five students.

d) There could be 3, 4, 5, or 6 students on the panel.

Combine the results of parts a) to c) with how many ways there could be 6 students on the panel.
The panel must have 6 students and 0 other members.
10! 8!
10 C6  8 C0  
4!6! 8!0!
 210
There are 210 panels with six students.

6720 + 5880 + 2016 + 210 = 14 826

28 MHR  Data Management 12 Solutions

There are 14 826 panels with at least three students.

Chapter 3 Section 3 Question 5 Page 120

a) The order in which the 5 committee members are chosen from 12 people does not matter.
This situation involves combinations.

b) Order matters, since each position holds an office. This situation involves permutations.

c) The order in which the members of the basketball team are chosen does not matter. When
arranging the team members for a photo, order matters. This situation involves combinations and
permutations.

d) The order matters because there are 3 different prizes. This situation involves permutations.

Chapter 3 Section 3 Question 6 Page 120

There are two choices per request, either accept or reject. So, there are 215 – 1, or 32 767 ways of
responding.

Chapter 3 Section 3 Question 7 Page 121

Determine the sum using 1, 2, or 3 different toppings for 8 choices.

8 C1  8 C2  8 C3

8! 8! 8!
  
(8  1)!1! (8  2)!2! (8  3)!3!
8! 8! 8!
  
7!1! 6!2! 5!3!
 8  28  56
 92
There are 92 different sandwiches that Tonya can make.

Chapter 3 Section 3 Question 8 Page 121

Assume Rohan buys at least one pair of pants. So, subtract 1 from the total number to account for
buying none (null set). Each pair of pants can either be purchased or not.
There are 26 – 1, or 63 different purchases that Rohan could make.

Chapter 3 Section 3 Question 9 Page 121

There is at least one prime factor. So, subtract 1 from the total number to account for no factors
chosen (null set). Each prime factor can either be chosen or not.
There are a total of 24 – 1, or 15 divisors of 210.

Chapter 3 Section 3 Question 10 Page 121

Choose two women from the four available: 4C2

Choose three men from the six available: 6C3
There are five positions available so there are 5! ways to arrange the executive.

MHR  Data Management 12 Solutions 29

4C2× 6C3 × 5! = 14 400
There are 14 400 ways to arrange two women and three men on the executive committee.

Chapter 3 Section 3 Question 11 Page 121

a) The hand can have 2, 3, or 4 queens.

Use the indirect method by subtracting the number of hands with 0 or 1 queen.
The total number of hands possible is 52 C6 , or 20 358 520.
Case 1: No Queens
4! 48!
4 C0  48 C6  
4!0! 26!13!
 12 271512
Case 2: One Queen
4! 48!
4 C1  48 C5  
3!1! 43!5!
 6 849 216
The number of hands that contain at least two queens is 20 358 520 – 12 271 512 – 6 849 216, or
1 237 792.

b) The hand can have 4, 5, or 6 red cards.

Case 1: 4 Red Cards
26! 26!
26 C4  26 C2  
22!4! 24!2!
 4 858 750
Case 2: 5 Red Cards
26! 26!
26 C5  26 C1  
21!5! 25!1!
 1 710 280
Case 3: 6 Red Cards
26! 26!
26 C6  26 C0  
20!6! 26!0!
 230 230
The number of hands that contain more than three red cards is 4 858 750 + 1 710 280 + 230 230,
or 6 799 260.

c) Case 1: 2 Hearts, 2 Spades, 2 Others

13! 13! 26!
13 C2  13 C2  26 C2   
11!2! 11!2! 24!2!
 1977 300

Case 2: 3 Hearts, 2 Spades, 1 Other

13! 13! 26!
13 C3  13 C2  26 C1   
10!3! 11!2! 25!1!
 580008

30 MHR  Data Management 12 Solutions

Case 3: 2 Hearts, 3 Spades, 1 Other
13! 13! 26!
13 C3  13 C2  26 C1   
10!3! 11!2! 25!1!
 580008

Case 4: 3 Hearts and 3 Spades

13! 13! 26!
13 C3  13 C3  26 C0   
10!3! 10!3! 26!0!
 81 796
The number of hands that contain at least two hearts and two spades is 1 977 300 + 580 008 +
580 008 + 81 796, or 3 219 112.

Chapter 3 Section 3 Question 12 Page 121

a) The group to call can have 12 men or 12 women from a list of names containing 20 men and
25 women.
Case 1: 12 Men
20! 25!
20 C12  25 C0  
8!12! 25!0!
 125 970
Case 2: 12 Women
25! 20!
25 C12  20 C0  
13!12! 20!0!
 5 200 300
The telemarketer has 125 970 + 5 200 300, or 5 326 270 ways to select 12 men or 12 women.

b) The telemarketer has 20 C6  25 C6 , or 6 864 396 000 ways to select 6 men and 6 women.

Chapter 3 Section 3 Question 13 Page 121

Since the six girls and six boys are assigned to rooms with the same gender, there are only four
possible scenarios.

Case 1: Girls are in the Two 3-Bed Rooms = 6 C3  3 C3

Case 2: Boys are in the Two 3-Bed Rooms = 6 C4  2 C2

Case 3: Boys are in the Two 3-Bed Rooms = 6 C3  3 C3

Case 4: Girls are in the Two 3-Bed Rooms = 6 C4  2 C2

Case 1 and Case 2 occur together, and Case 3 and Case 4 occur together.
6 C3  3 C3  6 C4  2 C2  6 C3  3 C3  6 C4  2 C2

6! 3! 6! 2! 6! 3! 6! 2!
       
3!3! 0!3! 2!4! 0!2! 3!3! 0!3! 2!4! 0!2!
 20  1  15  20  1 15 
 600
The rooms can be assigned in 600 ways.

MHR  Data Management 12 Solutions 31

Chapter 3 Section 3 Question 14 Page 121

Choose two students from the six pre-selected students. Repeat four times, one for each grade.
There are 8! ways to give out the prizes.

6C2× 6C2 × 6C2 × 6C2 × 8! = 2 041 200 000

There are 2 041 200 000 ways for two students from each grade to win.

Chapter 3 Section 3 Question 15 Page 121

For a product of four integers to be negative, there must be an odd number of negative values.
There are 6 negative values and 5 positive values, for a total of 11 integers.
Case 1: One Negative Value
6! 5!
6 C1  5 C3  
5!1! 2!3!
 60
Case 2: Three Negative Values
6! 5!
6 C3  5 C1  
3!3! 4!1!
 100
There are 100 + 60, or 160 ways to choose four numbers so that their product is negative.

Chapter 3 Section 3 Question 16 Page 121

a) Each three-of-a-kind occurs twice and there are six options. So, there are 2(6), or 12 slots
with three-of-a-kind.

b) Each of the six pairs combines with one of the other five symbols: 6  1C1  1C1  5 C1 . So,
there are 6(1)(1)(5), or 30 slots with two-of-a-kind.

c) The only scenarios allowed for three different symbols are two suits with a crown or an
anchor: 4 C2  2 C1  2 . So, there are 6(2)/2, or 6 slots with three different symbols.
The total number of slots on the wheel is 12 + 30 + 6, or 48.

Chapter 3 Section 3 Question 17 Page 121

The convex polygon can be drawn using 3, 4, 5, 6, 7, 8, 9, or 10 points.

Refer to the solution for question 13 of Section 3.2.
Select 3 points: 10 C3  120
Select 4 points: 10 C4  210
Select 5 points: 10 C5  252
Select 6 points: 10 C6  210
Select 7 points: 10 C7  120
Select 8 points: 10 C8  45
Select 9 points: 10 C9  10
Select 10 points: 10 C10  1
There are 968 convex polygons that can be drawn using these points.

32 MHR  Data Management 12 Solutions

Chapter 3 Section 3 Question 18 Page 121

The 5 men and 5 women can be selected in 8 C5  9 C5  7056 ways. Each of these selections can
be seated around a circle table in (10 – 1)!, or 362 880 ways. There is a total of 7056(362 880), or
2 560 481 280 ways the 10 people can be seated around the table.

Chapter 3 Section 4 Combinations With Pascal’s Triangle

Chapter 3 Section 4 Example 1 Your Turn Page 123

The sum of the first five terms of diagonal 6 is 1 + 7 + 28 + 84 + 210 = 330.

Comparing the terms in Pascal’s triangle to combinations gives
6C6 + 7C6 + 8C6 + 9C6 + 10C6 = 11C7.

Chapter 3 Section 4 Example 2 Your Turn Page 124

Method 1: Use Pascal’s Method

Each point of intersection can be reached only when Bill travels north or west. Use a diagram.

Bill can take 210 different routes to school.

Method 2: Use Combinations

Bill needs to travel 10 blocks to school. Select any four of these ten blocks to travel westbound.
The remaining six blocks will be northbound.

MHR  Data Management 12 Solutions 33

 10! 6!
10 C4  6 C6  
6!4! 0!6!
 210
Bill can take 210 different routes to school.

Chapter 3 Section 4 Example 3 Your Turn Page 125

a) For n = 4,
(a  b)4  4 C0 a 4b0  4 C1a 3b1  4 C2 a 2b 2  4 C3 a1b3  4 C4 a 0b 4
 1a 4b0  4a 3b1  6a 2b 2  4a1b3  1a 0b 4
 a 4  4a 3b  6a 2b 2  4ab3  b 4
The terms 4Cr, where r = 0 to 4 correspond to row 4 in Pascal’s triangle.
The degree of each term is 4, which is the exponent of the binomial.

b) For n = 5,
( p  q)5  5 C0 p 5 q 0  5 C1 p 4 q1  5 C2 p 3q 2  5 C3 p 2 q 3  5 C4 p1q 4  5 C5 p 0 q 5
 1 p5 q 0  5 p 4 q1  10 p 3 q 2  10 p 2 q3  5 p1q 4  1 p 0 q 5
 p5  5 p 4 q  10 p3 q 2  10 p 2 q3  5 pq 4  q5
The terms 5Cr, where r = 0 to 5 correspond to row 5 in Pascal’s triangle.
The degree of each term is 5, which is the exponent of the binomial.

Chapter 3 Section 4 R1 Page 126

Answers may vary.

By convention, the term labels begin with t0,0. This maintains the pattern of first and last terms in
each row both being 1, since there is only one term.

Chapter 3 Section 4 R2 Page 126

The terms in row n of Pascal’s triangle correspond to the combinations tn,r = nCr. Each row in
Pascal’s triangle represents the combinations of choosing 0 items, 1 item, 2 items, and so on, out
of n items.

Chapter 3 Section 4 R3 Page 126

Yes. Finding the number of arrangements of n items with p of one type identical and q of another
9!
type identical is a valid solution. The result is the same .
4!5!

Chapter 3 Section 4 Question 1 Page 126

a) The terms in row 9 of Pascal’s triangle are:

9 C0 9 C1 9 C2 9 C3 9 C4 9 C5 9 C6 9 C7 9 C8 9 C9

b) The first five terms in diagonal 4 of Pascal’s triangle are:

4C4 5C4 6C4 7C4 8C4 …

34 MHR  Data Management 12 Solutions

Chapter 3 Section 4 Question 2 Page 126

Using Pascal’s method:

a = 286 + 78 b = 1001 – 286 c = a + 1001
= 364 = 715 = 364 + 1001
= 1365

Chapter 3 Section 4 Question 3 Page 126

Using the binomial theorem, the first three terms in the expansion of (x + y)7 are
( x  y )7  7 C0 x 7 y 0  7 C1 x 6 y1  7 C2 x 5 y 2 
 1x 7 y 0  7 x 6 y1  21x5 y 2 
 x 7  7 x 6 y  21x5 y 2 
Answer D.

Chapter 3 Section 4 Question 4 Page 126

Use combinations. There is a total of 7 blocks from A to B. Select any four of these 7 blocks to
travel eastbound. The remaining three blocks will be southbound.
7! 3!
7 C4  3 C3  
3!4! 0!3!
 35
There are 35 routes from A to B. Answer B.

Chapter 3 Section 4 Question 5 Page 126

a) Using Pascal’s method, 5C2 + 5C3 = 6C3 = 20.

b) Using Pascal’s method, 7C3 + 7C4 = 8C4 = 70.

c) Using Pascal’s method, 5C4 – 4C4 = 4C3 = 4.

d) Using Pascal’s method, 8C6 – 7C5 = 7C6 = 7.

MHR  Data Management 12 Solutions 35

Chapter 3 Section 4 Question 6 Page 126

a) i) 2C2 + 3C2 = 1 + 3 ii) 3C2 + 4C2 = 3 + 6 iii) 4C2 + 5C2 = 6 + 10

=4 =9 = 16

b) The results of part a) are perfect squares.

c) These pairs of terms occur in diagonal 2 of Pascal’s triangle.

d) Each perfect square greater than 1 is equal to the sum of a pair of adjacent terms on diagonal
2 of Pascal’s triangle: n2 = nC2 + n + 1C2, n > 1

Chapter 3 Section 4 Question 7 Page 1216

a) The sum of the first four terms of diagonal 7 is 1 + 8 + 36 + 120 = 165.

Comparing the terms in Pascal’s triangle to combinations gives
7C7 + 8C7 + 9C7 + 10C7 = 11C8.

b) Comparing the terms in Pascal’s triangle to combinations gives

rCr + r +1Cr + r +2Cr + … + r + k –1Cr = r + k Cr + 1.

Chapter 3 Section 4 Question 8 Page 126

Record the number of paths to each square.

The number of routes to the bottom of the board is

1 + 6 + 14 + 14 = 35.

Chapter 3 Section 4 Question 9 Page 126

Record the number of paths to each square.

There is a total of 1 + 5 + 10 + 11, or 27 routes for the black checker

to get to the top of the board.

36 MHR  Data Management 12 Solutions

Chapter 3 Section 4 Question 10 Page 127

Record the number of paths to each intersection.

Chapter 3 Section 4 Question 11 Page 127

a) Record the number of paths to each letter.

There are 1 + 5 + 10 + 10 + 5 + 1, or 32 paths that spell PASCAL. Since this is a triangular array,
combinations can be used to solve this question. The values in the sum are the terms in row 5.

b) Record the number of paths to each letter.

Since this is not a triangular array, combinations cannot be used to solve this question.

Chapter 3 Section 4 Question 12 Page 127

a) The natural numbers are located in diagonal 1. The sums of the first n natural numbers are
located in diagonal 2 of Pascal’s triangle.

b) 1 + 2 = 3C2 1 + 2 + 3 = 4C2 1 + 2 + 3 + 4 = 5C2

The sum of the first n natural numbers is n + 1C2.

c) Example 1 involved sums of terms in diagonal 2. This question involves sums of terms in
diagonal 1.

MHR  Data Management 12 Solutions 37

Chapter 3 Section 4 Question 13 Page 127

a)
( x  y )8  8 C0 x 8 y 0  8 C1 x 7 y1  8 C2 x 6 y 2  8 C3 x 5 y 3  8 C4 x 4 y 4  8 C5 x 3 y 5  8 C6 x 2 y 6  8 C7 x1 y 7  8 C8 x 0 y 8
 1x8 y 0  8 x 7 y1  28 x 6 y 2  56 x 5 y 3  70 x 4 y 4  56 x 3 y 5  28 x 2 y 6  8 x1 y 7  1x 0 y 8
 x8  8 x 7 y  28 x 6 y 2  56 x 5 y 3  70 x 4 y 4  56 x 3 y 5  28 x 2 y 6  8 xy 7  y 8

b) Use x and –y.

( x  y )5  5 C0 x5 ( y )0  5 C1 x 4 ( y )1  5 C2 x 3 ( y ) 2  5 C3 x 2 ( y )3  5 C4 x1 ( y ) 4  5 C5 x 0 ( y )5
 1x5 ( y )0  5 x 4 ( y )1  10 x3 ( y ) 2  10 x 2 ( y)3  5 x1 (  y) 4  1x 0 (  y) 5
 x5  5 x 4 y  10 x3 y 2  10 x 2 y 3  5 xy 4  y 5

c) Substitute x = 2a and y = b.
(2a  b) 4  4 C0 (2a) 4 b0  4 C1 (2a)3 b1  4 C2 (2a) 2 b 2  4 C3 (2a)1 b3  4 C4 (2a) 0 b 4
 1(2a) 4 b0  4(2a)3 b1  6(2a) 2 b 2  4(2a)1 b3  1(2a) 0 b 4
 16a 4  32a3b  24a 2b 2  8ab3  b 4

d) Use x2 and –2.

( x 2  2)3  3 C0 ( x 2 )3 (2)0  3 C1 ( x 2 )2 (2)1  3 C2 ( x 2 )1 (2)2  3 C3 ( x 2 )0 (2)3
 1( x 2 )3 (2)0  3( x 2 )2 (2)1  3( x 2 )1 (2) 2  1( x 2 )0 (2)3
 x 6  6 x 4  12 x 2  8

Chapter 3 Section 4 Question 14 Page 127

a) Use a table to organize and look for a pattern. Each new line should cut every other line.

n(n  1)
The values being added represent the triangular numbers, whose sum is .
2
n(n  1)
Then, the formula for the number of regions is R(n)  1  .
2
From the solution to question 12, part b), the sum of the first n natural numbers is n + 1C2.
So, the formula can be written as R(n)  1  n1C2 .

38 MHR  Data Management 12 Solutions

b) For n = 20,
R(n)  1  n 1 C2
R(20)  1  20 1 C2
R(20)  1  21 C2
 211
The maximum number of regions inside the circle is 211.

Chapter 3 Section 4 Question 15 Page 127

a)
Sum of Squares
n 12 + 22 + … + n2 tn+1,3 + tn+2,3
2
1 1 =1
2 12 + 22 = 5 t3,3 + t4,3 = 1 + 4 = 5
3 12 + 22 + 32 = 14 t4,3 + t5,3 = 4 + 10 = 14
4 12 + 22 + 32 + 42 = 30 t5,3 + t6,3 = 10 + 20 = 30
5 12 + 22 + 32 + 42 + 52 = 55 t6,3 + t7,3 = 20 + 35 = 55
6 12 + 22 + 32 + 42 + 52 + 62 = 91 t7,3 + t8,3 = 35 + 56 = 91

b) The values in the columns two and three of the table are the same.

c) The sum of the first n squares is n + 1C3 + n + 2C3, n > 1.

d) The sum of squares of the first 50 natural number is 51C3 + 52C3, or 42 925.

Chapter 3 Section 4 Question 16 Page 127

a)
Layer, Total Number of
n Oranges tn+1,2 + tn+1,3
1 1
2 1+3=4 t3,2 + t3,3 = 3 + 1 = 4
3 1 + 3 + 6 = 10 t4,2 + t4,3 = 6 + 4 = 10
4 1 + 3 + 6 + 10 = 20 t5,2 + t5,3 = 10 + 10 = 20

b) The total number of oranges needed for a stack of n layers can be found in diagonal 3 of
Pascal’s triangle.

c) The total number of oranges needed for a stack of n layers is n + 1C2 + n + 1C3, n > 1.

d) The number of oranges needed for a 10-layer stack is 11C2 + 11C3, or 220.

MHR  Data Management 12 Solutions 39

Chapter 3 Section 4 Question 17 Page 127

a)
Row n Sum of Squares Term in Pascal’s Triangle
2 6 t4,2
3 20 t6,3
4 70 t8,4
5 252 t10,5

b) The sum of the squares of row n equals the middle term of row 2n.

c) The sum of the squares of row 2 is 4C2.

The sum of the squares of row 3 is 6C3.
The sum of the squares of row 4 is 8C4.
The sum of the squares of row 5 is 10C5.

d) The sum of the squares of row n equals 2nCn.

Chapter 3 Section 4 Question 18 Page 127

(h  t )5  5 C0 h5t 0  5 C1h 4t1  5 C2 h3t 2  5 C3 h 2t 3  5 C4 h1t 4  5 C5 h 0t 5

 1h5t 0  5h 4t1  10h3t 2  10h 2t 3  5h1t 4  1h0t 5
 1h5t 0  5h 4t1  10h3t 2  10h 2t 3  5h1t 4  1h0t 5
If a coin is tossed five times, there is
1 way to get 5 heads and 0 tails
5 ways to get 4 heads and 1 tails
10 ways to get 3 heads and 2 tails
10 ways to get 2 heads and 3 tails
5 ways to get 1 heads and 4 tails
1 way to get 0 heads and 5 tails

Chapter 3 Section 4 Question 19 Page 127

1
a) Substitute x = p and y =  .
p
5 0 1 2 3 4 5
 1 5 1 4 1 3 1 2 1 1 1 0 1
 p    5 C0 p     5 C1 p     5 C2 p     5 C3 p     5 C4 p     5 C5 p   
 p   p   p   p   p   p   p
0 1 2 3 4 5
 1  1  1  1  1  1
 1 p 5     5 p 4     10 p 3     10 p 2     5 p1     1 p 0   
 p   p   p   p   p   p
10 5 1
 p 5  5 p 3  10 p   3  5
p p p

40 MHR  Data Management 12 Solutions

 2
b) Substitute x = 3m2 and y = .
m2
4 0 1 2 3 4
 2 2  2 4 2  2 3 2  2 2 2  2 1 2  2 0 2 
 3m  2   4 C0 (3m )  2   4 C1 (3m )  2   4 C2 (3m )  2   4 C3 (3m )  2   4 C4 (3m )  2 
 m  m  m  m  m  m 
0 1 2 3 4
 2   2   2   2   2 
 1(3m 2 ) 4  2   4(3m 2 )3  2   6(3m 2 ) 2  2   4(3m 2 )1  2   1(3m 2 )0  2 
 m   m   m   m  m 
96 16
 81m8  216m 4  216  4  8
m m

Chapter 3 Section 5 Probabilities Using Combinations

Chapter 3 Section 5 Example 1 Your Turn Page 129

a) The total number of possible outcomes is n(S) = 27C7. There is only one successful outcome;
matching all seven of the winning numbers. So, n(A) = 7C7 = 1.
n( A)
P (all seven selected) 
n( S )
1

27 C7

1

888 030
 0.000 001126...
 0.000113%
There is approximately a 0.000 113% chance of having all seven winning numbers.

b) The total number of possible outcomes is n(S) = 27C7. Six of your numbers will match the
winners, but the seventh does not, so it needs to be chosen from the remaining 20 numbers.
n(A) = 7C6 × 20C1
n( A)
P (six successes) 
n( S )
C  C
 7 6 20 1
27 C7

140

888 030
 0.000157 652...
 0.015 765%
There is approximately a 0.015 765% chance of winning second prize.

c) Use the indirect method. The probability of not winning first or second prize is
1 – 0.000 001 13 – 0.000 157 65, or approximately 0.999 841 22 or 99.984122%.

d) Answers may vary. It is extremely unlikely that anyone will win the lottery prizes.

MHR  Data Management 12 Solutions 41

Chapter 3 Section 5 Example 2 Your Turn Page 130

a) Six students are chosen, without regard to order, from a total of 23 people: n(S) = 23C6.
Three males and three females are chosen.
n(A) = 12C3 × 11C3
C  C
P(equal number)  12 3 11 3
23 C6

 0.359 594...
The probability that an equal number of male and female students is chosen is approximately
0.36.

b) More female than male students could be four, five, or six. The remaining presenters are
male.
n(A) = (12C2 × 11C4) + (12C1 × 11C5) + (12C0 × 11C6)
( C  C )  ( 12 C1  11 C5 )  ( 12 C0  11 C6 )
P(more females)  12 2 11 4
23 C6

21 780  5544  462


100 947
 0.275 253...
The probability that more female students are chosen is approximately 0.28.

c) P(equal numbers) > P(more females). Therefore, it is more likely that there will be equal
numbers of male and female students than more female than male students.

Chapter 3 Section 5 Example 3 Your Turn Page 131

Using Pascal’s triangle, the total number of paths to the bottom of the board is 1 + 3 + 3 + 1 = 8.

1 3
P(A) = P(F) = 0 P(B) = P(E) = P(C) = P(D) =
8 8
1 3 3 1
The probability of the disc ending up in each slot from the left is 0, , , , , 0.
8 8 8 8

Chapter 3 Section 5 R1 Page 132

Answers may vary.

Example: A student selects three cards in order, without replacement, from a standard deck. What
is the probability that the student selects a king, then two queens?

What is the probability that a hand of three cards contains only face cards?

42 MHR  Data Management 12 Solutions

Chapter 3 Section 5 R2 Page 132

If you interpret the language to mean Jake is first and Hamid is second, order matters. There are
8P2 ways of selecting the top two finishers. There are 2P2 ways that Jake and Hamid are the top
P
two finishers. So, the probability that two are the top two finishers is 2 2 .
8 P2

If you interpret the language to mean Jake and Hamid are top two with no assigned place (first or
second), order does not matters. There are 8C2 ways of selecting the top two finishers. There are
2C2 ways that Jake and Hamid are the top two finishers. So, the probability that two are the top
C 1
two finishers is 2 2 . Both expressions result in the same probability of .
C
8 2 28

Chapter 3 Section 5 Question 1 Page 132

a) The total number of possible outcomes is n(S) = 52C5. For a hand of only hearts n(A) = 13C5.
C
P(all hearts)  13 5
52 C5

 0.000 495198...
The probability that a hand of five cards contains only hearts is approximately a 0.000 495.

b) The total number of possible outcomes is n(S) = 52C5. For a hand of only red cards
n(A) = 26C5.
C
P(all red cards)  26 5
52 C5

 0.025 310...
The probability that a hand of five cards contains only red cards is approximately a 0.025.
c) The total number of possible outcomes is n(S) = 52C5. For a hand of only face cards
n(A) = 12C5.
C
P(all face cards)  12 5
52 C5

 0.000 304 737...

The probability that a hand of five cards contains only face cards is approximately a 0.000 305.

Chapter 3 Section 5 Question 2 Page 132

2 C2 1
The probability that the wolf could blow down two randomly chosen houses is , or .
3 C2 3
Chapter 3 Section 5 Question 3 Page 132

2C2 1
The probability that both Sarah and Dan will be selected from 10 employees is , or .
10 C2 45
Answer B.

MHR  Data Management 12 Solutions 43

Chapter 3 Section 5 Question 4 Page 132

6 C6 1
The probability of winning the grand prize is , or . Answer C.
C
45 6 8145 060

Chapter 3 Section 5 Question 5 Page 132

a) The total number of possible outcomes is n(S) = 52C7. For a hand of three kings,
n(A) = 4C3 × 48C4.
C  C
P(three kings)  4 3 48 4
52 C7

 0.005 817...
The probability that a hand of seven cards contains three kings is approximately a 0.006.

b) Assume that the other four cards can be anything. The total number of possible outcomes is
n(S) = 52C7. For a hand of three-of-a-kind, select a denomination, select three of the four, select
four cards from the remaining other denominations.
n(A) = 13C1 × 4C3 × 48C4
C  C  C
P(three-of-a-kind)  13 1 4 3 48 4
52 C7

 0.075 630...
The probability that a hand of seven cards contains three-of-a-kind is approximately a 0.076.

c) Assume the other four cards can be anything. The total number of possible outcomes is
n(S) = 52C7. For a hand with 4, 5, 6 of spades, select the three spades, select four other cards
n(A) = 3C3 × 49C4
C  C
P(4, 5, 6 spades)  3 3 49 4
52 C7

 0.001583...
The probability that a hand of seven cards contains 3, 4, 5 of spades is approximately a 0.002.

d) The total number of possible outcomes is n(S) = 52C7. For a hand with a run of exactly three
cards, select the suit, select three of these cards, select four cards from remaining suits
n(A) = 4C1 × 13C3 × 39C4
C  C  C
P(run of exactly 3)  4 1 13 3 39 4
52 C7

 0.703 333...
The probability that a hand of seven cards contains a run of exactly three cards is approximately a
0.7.

Chapter 3 Section 5 Question 6 Page 132

The probability that each of the four players receives 13 cards of the same suit is
13 C13  13 C13  13 C13  13 C13
, or approximately 1.575 × 10–12.
52 C13

44 MHR  Data Management 12 Solutions

Chapter 3 Section 5 Question 7 Page 132

Four people are selected from a total of 11 people: n(S) = 11C4.

Three girls and one boy are chosen.
n(A) = 12C3 × 11C3
C  C
P(3 girls and 1 boy)  6 3 5 1
11 C4

 0.303 030...
The probability that the committee will have three girls and one boy is approximately 0.30.

Chapter 3 Section 5 Question 8 Page 132

Four different numbers are selected from 1 to 15: n(S) = 15C4.

Two numbers divisible by 5 are chosen.
n(A) = 3C2 × 12C2
C  C
P( A)  3 2 12 2
15 C4

 0.145 054...
 0.145
Then, P(A′) is 1 – 0.145, or 0.855. Odds in favour of A = P(A):P(A′).
The odds in favour of exactly two numbers being divisible by 5 are 0.145:0.855.

Chapter 3 Section 5 Question 9 Page 132

Use Pascal’s Triangle to consider the number of routes to the perimeter.

There are 60 possible ways for the spider to reach the perimeter, and only 1 way to reach point B.
1
So, the probability is , or about 0.167.
60

Chapter 3 Section 5 Question 10 Page 133

a) Record the number of paths to each square.

Total number of paths is 28 + 34 + 21 + 6, or 89.

The space with the greatest probability as the destination is D at
34
, or about 0.38.
89

MHR  Data Management 12 Solutions 45

b) If the checker begins in a different location, the number of possible paths ending at each
destination will be different. See solution to Section 3.4, question 8 for another scenario.

Chapter 3 Section 5 Question 11 Page 133

Use the indirect method.

Determine the number of teams without any grade 11 students.
The total number of teams of 4 from 15 students is 15 C4 .
Then, choose all 4 members from grade 12. This can be done in 9 C4  6 C0 ways.
C  C
P(all grade 12)  9 4 6 0
15 C4

 0.092 307...
 0.092
So, the probability that the team has at least one grade 11 student is 1 – 0.092, or 0.908.

Chapter 3 Section 5 Question 12 Page 133

The probability of the disc landing in each slot at the bottom of the board depends on its starting
slot. Dropping the disc from one of two centre slots (3 or 4) will give the most paths.

The total number of paths to the bottom of the board is 1 + 5 + 10 + 10 + 5 + 1 = 32.

If the disc starts in slot 3,
1 5 10 5
P(A) = P(F) = P(B) = P(E) = P(C) = P(D) =  P(G) = 0
32 32 32 16
1 5 5 5 5 1
The probability of the disc ending up in each slot from the left is , , , , , , 0.
32 32 16 16 32 32

Chapter 3 Section 5 Question 13 Page 133

The total number of groups of 5 from 8 students is 8 C5 .

Determine the number of groups with Fariba or Sana, but not both. Select Fariba and then four
others from the remaining group excluding Sana. Similarly for starting with Sana.
n( A)  1C1  6 C4  1C1  6 C4

46 MHR  Data Management 12 Solutions

 C1  6 C4  1 C1  6 C4
P( A)  1

8 C5

 0.535 714...
 0.54
So, the probability that the group has Fariba or Sana, but not both is approximately 0.54.

Chapter 3 Section 5 Question 14 Page 133

Assume both students can be in the study group.

The total number of groups of 4 from 15 students is 15 C4 .
Choose Reg or Carlos: 13C4
13 C4
The probability of neither Reg nor Carlos being chosen is .
15 C4
Use the indirect method.
C4
Total number of groups  neither Reg or Carlos  1  13
15 C4
715
1
1365
 0.476

So, the probability that the group has Reg or Carlos is approximately 0.476.

Chapter 3 Section 5 Question 15 Page 133

a) The total number of possible outcomes is n(S) = 20C6. There is only one successful outcome;
matching all six of the winning numbers. So, n(A) = 6C6 = 1.
1
P(all six selected) 
20 C6

 0.000 025 799...

 0.002 580%
There is approximately a 0.002 580% chance of having all six winning numbers.

b) The total number of possible outcomes is n(S) = 20C6. Five of your numbers will match the
winners, but the sixth does not, so it needs to be chosen from the remaining 14 numbers.
n(A) = 6C5 × 14C1
C  C
P(five successes)  6 5 14 1
20 C6

140

888 030
 0.002167 182...
 0.216 718%
There is approximately a 0.216 718% chance of winning second prize.

c) The total number of possible outcomes is n(S) = 20C6. Four of your numbers will match the
winners, but the fifth and sixth do not, so they need to be chosen from the remaining 14 numbers.

MHR  Data Management 12 Solutions 47

n(A) = 6C4 × 14C2
C4  14 C2
P(four successes)  6

20 C6

140

888 030
 0.035 216 718...
 3.521 672%
There is approximately a 3.521 672% chance of winning third prize.

d) The probability of winning a prize is the sum of parts a) through c), or approximately
0.037 410. Then, P(A′) is 1 – 0.037 410, or 0.962 59.
Odds against A = P(A′):P(A).
The odds against wining are 0.962 59:0.037 410.

e) Answer may vary. The number of meals would be more than a person’s health or wallet could
stand. This is not a sensible strategy. There are 38 760 possible combinations of numbers, and
only one possible first prize winning set of numbers, 84 possible second prize winning sets of
numbers, and 1365 possible third prize winning sets of numbers. Over 96% of the possible
number selections will lose.

Chapter 3 Section 5 Question 16 Page 133

The binomial expansion of (x – y)8 has 9 terms, eight of which include a power of x. All of the
first 7 terms are divisible by x2. The probability that a randomly selected term is divisible by x2 is
7
.
9

Chapter 3 Section 5 Question 17 Page 133

a) The product of three numbers will be even as long as one of the numbers is even.
Use the indirect method.
The total number of possible outcomes is n(S) = 9C3.
For all numbers odd, n(A) = 4C3.
C
P( A)  4 3
9 C3

 0.047 619...
 0.048
The probability that the product is even is 1 – 0.048, or 0.952.

b) Any even product is divisible by 2. The probability that the product is divisible by 2 is 0.952.

c) The total number of possible outcomes is n(S) = 9C3 = 84.

Case 1: Groups with a 3 and one even number:

5C1 × 3C1 = 15

Case 2: Groups with a 3 and two even numbers:

5C2 = 10

48 MHR  Data Management 12 Solutions

Case 3: Groups with a 6 but no 3:
7C2 = 21

15  10  21
P(divisible by 6) 
84
 0.548

The probability that the product is divisible by 6 is approximately 0.548.

Chapter 3 Section 5 Question 18 Page 133

Use conditional probability.

P(all 3 are spades)
P  3rd a spade | 1st 2 are spades  
P(1st 2 are spades)
 13 P3 
 
  51 P3 

 13 P2 
 
 51 P2 
 0.225

The probability that the missing card is a spade is 0.225.

Chapter 3 Review

Chapter 3 Review Question 1 Page 134

Treat the girls in order of height as like elements. Arrange GGGB1B2B3B4.

n=7 p=3
7!
The number of arrangements is , or 840.
3!
There are 840 ways to arrange the boys and girls for a photo.

Chapter 3 Review Question 2 Page 134

a) There are a total of 7 letters, so n = 7. There are Three As, so p = 3. The rest are all different.
7!
The number of permutations of the letters in ANAGRAM is , or 840.
3!

b) There are a total of 11 letters, so n = 11. There are three Ss and two Es, so p = 3 and q = 2,
respectively. The rest are all different.
11!
The number of permutations of the letters in EXPRESSIONS is , or 3 326 400.
3!2!

c) There are a total of 11 letters, so n = 11. There are three Es, three Ns, two Gs, and two Is, so
p = 3, q = 3, r = 2, and s = 2, respectively. The rest are all different.

MHR  Data Management 12 Solutions 49

 11!
The number of permutations of the letters in ENGINEERING is , or 277 200.
3!3!2!2!

Chapter 3 Review Question 3 Page 134

Kendra can paint her apartment in 14 C10  4 C4 , or 1001 ways.

Chapter 3 Review Question 4 Page 134

8!
a) i) Look for the smallest denominator for C (8, r )  . This occurs when r = 4. The
(8  r )!r !
greatest number of combinations is 70.

10!
ii) Look for the smallest denominator for C (10, r )  . This occurs when r = 5. The
(10  r )!r !
greatest number of combinations is 252.

7!
iii) Look for the smallest denominator for C (7, r )  . This occurs when r = 3 or r = 4.
(7  r )!r !
The greatest number of combinations is 35.

15!
iv) Look for the smallest denominator for C (15, r )  . This occurs when r = 7 or r = 8.
(15  r )!r !
The greatest number of combinations is 6435.
n
b) The greatest number of combinations when n is even occurs at r = .
2
n
The greatest number of combinations when n is odd occurs at r =  0.5 .
2

Chapter 3 Review Question 5 Page 134

a) An octet of three sopranos, two altos, two tenors, and a bass can be selected in
10 C3  8 C2  7 C2  5 C1 , or 352 800 ways.

b) A barbershop quartet of two tenors and two basses can be selected in 7 C2  5 C2 , or 210 ways.

Chapter 3 Review Question 6 Page 134

a) A committee of four people can be chosen from a list of 10 people in 10 C4 , or 210 ways.

b) Answers may vary.

A committee has 10 people. In how many ways could a president and vice president be chosen?

c) Answers may vary.

From a committee of 10 people, there are 10 P2 , or 90 ways to choose a president and vice
president.

50 MHR  Data Management 12 Solutions

Chapter 3 Review Question 7 Page 134

Case 1: 3 envelopes in 1 box, 1 in each of the others.

Arrange the groupings of the envelopes representing which boxes they are in.
5C3 × 2C1 × 1C1 × 3! = 120

Case 2: 2 envelopes in each of 2 boxes, 1 in the other. Arrange the groupings.

5C2 × 3C2 × 1C1 × 3! = 180

120 + 180 = 300

Five different envelopes can be distributed into three mailboxes in 300 ways.

Chapter 3 Review Question 8 Page 134

Determine the sum using the number of combinations of 1, 2, 3, 4, and 5 different dollar bills.
5 C1  5 C2  5 C3  5 C4  5 C5

5! 5! 5! 5! 5!
    
4!1! 3!2! 2!3! 1!4! 0!5!
 5  10  10  5  1
 31
Alternatively, using the indirect method, 25 – 1 = 31.
There are 31 different sums of money that can be made.

Chapter 3 Review Question 9 Page 135

a) The password can have 2, 3, 4, 5, 6, 7, or 8 letters.

Use the indirect method by subtracting the number of passwords with 0 or 1 letter.
The total number of passwords possible is 36 C8 , or 30 260 340.
Case 1: No Letters
26! 10!
26 C0  10 C8  
26!0! 2!8!
 45
Case 2: One Letter
26! 10!
26 C1  10 C7  
25!1! 3!7!
 3120
The number of passwords that contain at least two letters is 30 260 340 – 45 – 3120, or
30 257 175.

b) The password can have 2, 3, 4, 5, 6, 7, or 8 numbers.

Use the indirect method by subtracting the number of passwords with 0 or 1 number.
The total number of passwords possible is 36 C8 , or 30 260 340.
Case 1: No Numbers
26! 10!
26 C8  10 C0  
18!8! 10!0!
 1562 275

MHR  Data Management 12 Solutions 51

Case 2: One Number
26! 10!
26 C7  10 C1  
19!7! 9!1!
 6 578 000
The number of passwords that contain at least two numbers is
30 260 340 – 1 562 275 – 6 578 000, or 22 120 065.

c) Use the indirect method by subtracting the number of passwords with 0 or 1 number and 0 or
1 letter.
The number of passwords that contain at least two letters and two numbers is
30 257 175 – 45 – 120 – 1 562 275 – 6 578 000, or 22 116 900.

Chapter 3 Review Question 10 Page 135

Using Pascal’s method:

a = 330 + 462 b = 924 – 462
= 792 = 462

Chapter 3 Review Question 11 Page 135

a) i) Select four points for a quadrilateral, n = 4 and r = 4.

4!
4 C4 
0!4!
1
There is 1 quadrilateral that can be drawn using 4 points on the circumference of a circle.

ii) Select four points for a quadrilateral, n = 5 and r = 4.

5!
5 C4 
1!4!
5
There are 5 quadrilaterals that can be drawn using 5 points on the circumference of a circle.

iii) Select four points for a quadrilateral, n = 6 and r = 4.

6!
6 C4 
2!4!
 15
There are 15 quadrilaterals that can be drawn using 6 points on the circumference of a circle.

b) These values are entries in diagonal 4 of Pascal’s triangle.

c) These numbers are represented by n C4 .

52 MHR  Data Management 12 Solutions

d) For n = 12,
12!
12 C4 
8!4!
 495
There are 495 quadrilaterals that can be drawn using 12 points on the circumference of a circle.

Chapter 3 Review Question 12 Page 135

a) The sum of the entries in row n of Pascal’s triangle is 2n. Since 512 = 29, this is the sum for
row 9.

b) The sum of the entries in row n of Pascal’s triangle is 2n. Since 4096 = 212, this is the sum for
row 12.

Chapter 3 Review Question 13 Page 135

Method 1: Use Pascal’s Method

Use a diagram. Each point of intersection can be reached only when Stephen travels south or
west.

Stephen can take 330 different routes to school.

Method 2: Use Combinations

Stephen needs to travel 11 blocks to school. Select any four of these eleven blocks to travel
westbound. The remaining seven blocks will be southbound.
11! 7!
11 C4  7 C7  
7!4! 0!7!
 330
Stephen can take 330 different routes to school.

Chapter 3 Review Question 14 Page 135

a) For (a + b)5, the coefficients are the terms in row 5 of Pascal’s triangle: 1, 5, 10, 10, 5, and 1.
These terms correspond to combinations 5Cr, where r = 0 to 5.
(a  b)5  5 C0 a 5b0  5 C1a 4b1  5 C2 a 3b 2  5 C3 a 2b3  5 C4 a1b 4  5 C5 a 0b5
 1a5b0  5a 4b1  10a 3b 2  10a 2b3  5a1b 4  1a 0b5
 a5  5a 4b  10a 3b 2  10a 2b3  5ab 4  b5

MHR  Data Management 12 Solutions 53

b) For (2x + y)4, the coefficients are the terms in row 4 of Pascal’s triangle: 1, 4, 6, 4, and 1.
These terms correspond to combinations 4Cr, where r = 0 to 4.
(2 x  y ) 4  4 C0  2 x  y 0  4 C1  2 x  y1  4 C2  2 x  y 2  4 C3  2 x  y 3  4 C4  2 x  y 4
4 3 2 1 0

 1 16  x 4 y 0   4  8  x3 y1   6  4  x 2 y 2   4  2  x1 y 3  1x 0 y 4
 16 x 4  32 x3 y  24 x 2 y 2  8 xy 3  y 4

Chapter 3 Review Question 15 Page 135

a) The total number of possible outcomes is n(S) = 52C5. For a hand with jack, queen, king of
hearts, but no other hearts, n(A) = 3C3 × 39C2.
C  C
P( A)  3 3 39 2
52 C5

 0.000 285114...
The probability that a hand of five cards contains with jack, queen, king of hearts, but no other
hearts is approximately a 0.000 285.

b) The total number of possible outcomes is n(S) = 52C5. For a hand of five hearts n(A) = 13C5.
C
P(all hearts)  13 5
52 C5

 0.000 495198...
The probability that a hand of five cards contains five hearts is approximately a 0.000 495.

Chapter 3 Review Question 16 Page 135

a) Five people are selected from a total of 13 people: n(S) = 13C5.

Five girls and no boys are chosen.
n(A) = 6C5 × 7C0
C  C
P(all girls)  6 5 7 0
13 C5

 0.004 662...
The probability that the group will have all girls is approximately 0.005.

b) Five people are selected from a total of 13 people: n(S) = 13C5.

More boys than girls is 3 boys, 4 boys, or 5 boys.
n(A) = 6C2 × 7C3 + 6C1 × 7C4 + 6C0 × 7C5
C  C  C  C  C  C
P(more boys than girls)  6 2 7 3 6 1 7 4 6 0 7 5
13 C5

 0.587 412...
The probability that the group will more boys than girls is approximately 0.587.

Chapter 3 Review Question 17 Page 135

a) Five photos are selected from a total of 25 photos: n(S) = 25C5.

Your three photos are chosen and two others: n(A) = 3C3 × 22C2

54 MHR  Data Management 12 Solutions

 C3  22 C2
P( A)  3

25 C5

 0.004 347...
The probability that your three photos are chosen is approximately 0.004.

b) Five photos are selected from a total of 25 photos: n(S) = 25C5.

None of your three photos are chosen and five others: n(A) = 3C0 × 22C5
C  C
P( A)  3 0 22 5
25 C5

 0.495 652...
The probability that none of your photos are chosen is approximately 0.496.

c) Five photos are selected from a total of 25 photos: n(S) = 25C5.

Use the indirect method by subtracting the probability of 0 of your photos is chosen.

The probability that at least one of your photos are chosen is 1 – 0.496, or 0.504.

Chapter 3 Test Yourself

Chapter 3 Test Yourself Question 1 Page 136

There are 9C4, or 126 ways to select four people from a group of nine without regard to order.
Answer C.

Chapter 3 Test Yourself Question 2 Page 136

The total number of subsets of a set of 10 elements is 210 – 1, or 1023. Answer B.

Chapter 3 Test Yourself Question 3 Page 136

Using Pascal’s method, 7C3 + 7C4 = 8C4. Answer B.

Chapter 3 Test Yourself Question 4 Page 136

There are five blocks, n = 5. Since three are red and two green blocks, p = 3 and q = 2.
5!
The number of arrangements of three red and two green blocks is . Answer A.
2!3!

Chapter 3 Test Yourself Question 5 Page 136

Choose the president and secretary, and then four members from the remaining 14 members.
A 6-member committee can be formed from a 16-member club, with the president and secretary
on the committee in 2 C2  14 C4 , or 1001 ways.

Chapter 3 Test Yourself Question 6 Page 136

Four out of seven library books can be chosen in 7C4, or 35 ways.

MHR  Data Management 12 Solutions 55

Chapter 3 Test Yourself Question 7 Page 136

Select four points for a quadrilateral, n = 8 and r = 4.

8!
8 C4 
4!4!
 70
There are 70 quadrilaterals that can be drawn using 8 vertices of an octagon.

Chapter 3 Test Yourself Question 8 Page 136

You can place the vowels in any position but you must keep them in the order EAIO.
Since you cannot arrange the vowels in a different order, treat them as like elements, using V for
each vowel. Rewrite the letters as RVLVTVVNS.
n=9 p=4
9!
The number of arrangements of RVLVTVVNS is , or 15 120.
4!
There are 15 120 ways to arrange the letters, keeping the vowels in the original order.

Chapter 3 Test Yourself Question 9 Page 136

P
a) 8 C3  8 3

3!

b) Both 8C3 and 8P3 represent the number of arrangements of 3 items from 8. However,
combinations have no regard for order, while permutations do.
Example Combination: A committee of three people can be chosen from a list of 8 people in 8 C3 ,
or 56 ways.
Example Permutation: From a committee of 8 people, there are 8 P3 , or 336 ways to choose a
president, vice president, and secretary.

Chapter 3 Test Yourself Question 10 Page 136

Two balls are selected from a bag of 14 balls: n(S) = 14C2.

Two black are chosen.
n(A) = 9C2 × 5C0
C  C
P(all girls)  9 2 5 0
14 C2

 0.395 604...
The probability that both balls are black is approximately 0.396.

Chapter 3 Test Yourself Question 11 Page 136

For (p + q)10, the coefficients are the terms in row 10 of Pascal’s triangle. These terms correspond
to combinations 10Cr, where r = 0 to 10. Use the pattern in the exponents to determine that p4q6 is
the seventh term in the expansion with coefficient 10C6, or 210.

56 MHR  Data Management 12 Solutions

Chapter 3 Test Yourself Question 12 Page 136

Method 1: Use Permutations With Like Objects

There are 18! ways to assign the rugby players. Order of assignment does not matter. For
example, ABC is the same as BAC, ACB, BCA, CBA, and CAB. So, there are 3! ways for the
same players to be assigned to each room.
18!
The number of ways that 18 rugby players can be assigned to six triple rooms is or
3!3!3!3!3!3!
137 225 088 000.

Method 2: Use Combinations

Continue to choose 3 rugby players until all are assigned.
18 C3  15 C3  12 C3  9 C3  6 C3  3 C3

 816  455  220  84  20  1

 137 225 088 000
The number of ways that 18 rugby players can be assigned to six triple rooms is 137 225 088 000.

Chapter 3 Test Yourself Question 13 Page 136

a) Each row in Pascal’s triangle represents the combinations of choosing 0 items, 1 item, 2
items, and so on, out of n items.

b) The terms of Pascal’s triangle are generated by adding two adjacent terms and placing the
result immediately below them in the next row.
tn,r + tn,r+1 = tn+1,r+1
Using combinations, nCr + nCr+1 = n+1Cr+1

Chapter 3 Test Yourself Question 14 Page 136

a) Row 2: 1 – 2 + 1 = 0
Row 3: 1 – 3 + 3 – 1 = 0
Row 4: 1 – 4 + 6 – 4 + 1 = 0
Row 5: 1 – 5 + 10 – 10 + 5 – 1 = 0
Alternately subtracting and adding successive terms in a row of Pascal’s triangle results in 0.

b) For n > 0, nC0 – nC1 + nC2 − . . . nCn

Chapter 3 Test Yourself Question 15 Page 136

a) Use the indirect method.

There are 15C3 ways to get three toppings.

There are 13C3 ways to get neither olives nor mushrooms.

15C3 − 13C3 = 169

There are 169 ways for mushrooms or olives to be included.

MHR  Data Management 12 Solutions 57

b) It would be greater, since there are more chances to get olives or mushrooms.
15C4 – 13C4 = 650 > 169

Chapter 3 Test Yourself Question 16 Page 137

a) Two computer chips are selected from a package of 50: n(S) = 50C2.
None of the 5 defective is chosen.
n(A) = 45C2 × 5C0
C  C
P( A)  45 2 5 0
50 C2

 0.808163...
The probability that neither is defective is approximately 0.81.

b) Two computer chips are selected from a package of 50: n(S) = 50C2.
Two of the 5 defective are chosen.
n(A) = 45C0 × 5C2
C  C
P( A)  45 0 5 2
50 C2

 0.008163...
The probability that both are defective is approximately 0.008.

c) Two computer chips are selected from a package of 50: n(S) = 50C2.
One of the 5 defective is chosen.
n(A) = 45C1 × 5C1
C  C
P( A)  45 1 5 1
50 C2

 0.183 673...
The probability that one is defective is approximately 0.184.

Chapter 3 Test Yourself Question 17 Page 137

a) There are 20 cards in the reduced deck so n = 20.

r=4

20!
20 C4 
16! 4!
 4845

1
P(all queens) 
4845
 0.0002

b) There are 10 red cards in the reduced deck, n = 10 and r = 4.

10!
10 C4 
6!4!
 210

58 MHR  Data Management 12 Solutions

 210
P(all red) 
4845
 0.043

c) There are 12 face cards in the reduced deck, n = 12 and r = 2. Select the two cards from the
remaining non-face cards, n = 8 and r = 2.
12! 8!
12 C2  8 C2  
10!2! 6!2!
 1848

1848
P(two face cards) 
4845
 0.381

d) There can be 1, 2, 3, or 4 aces in the hand. Use the indirect method.

Total number of four-card hands is 20C4, or 4845. The number of hands without aces is 16C4, or
1820. So, there are 4845 – 1820, or 3025 four-card hands containing at least one ace.

3025
P(at least one ace) 
4845
 0.624

e) Use the indirect method. Total number of four-card hands is 20C4, or 4845. The number of
hands without aces is 16C4, or 1820. Similarly, the number of hands without kings is 16C4, or 1820.
Add back the subtracted duplicates, number of no aces and no kings, 12C4, or 495.

There are 4845 – 1820 – 1820 + 495, or 1700 four-card hands containing at least one ace and one
king.

1700
P(at least one ace and one king) 
4845
 0.351

Chapters 1 to 3 Cumulative Review

Cumulative Review Question 1 Page 138

a) For n(T) = 210 and n(A) = 140,

n( A)
P ( A) 
n(T )
140

210
2

3
2
The experimental probability that a randomly selected taster will pick Koala Cola is .
3

MHR  Data Management 12 Solutions 59

b) For n(T) = 210 and n(A) = 210 – 140 = 70,
n( A)
P ( A) 
n(T )
70

210
1

3
1
The experimental probability that a randomly selected taster will pick Brand X is .
3

Cumulative Review Question 2 Page 138

a) The total number of possible outcomes is n(S) = 20 + 30 + 50 = 100. Twenty songs are blues
songs: n(A) = 20.
n( A)
P ( A) 
n( S )
20

100
 0 .2
P(A′) = 1 – 0.2 = 0.8
P ( A) 0.2

P ( A) 0.8
1

4
The odds in favour of the player randomly playing a blues songs are 1:4.

b) The total number of possible outcomes is n(S) = 20 + 30 + 50 = 100. Fifty songs are hard
rock songs: n(A) = 50.
n( A)
P ( A) 
n( S )
50

100
 0 .5
P(A′) = 1 – 0.5 = 0.5
P ( A) 0.5

P ( A) 0.5
1

1
The odds in favour of the player randomly playing a hard rock song are 1:1.

60 MHR  Data Management 12 Solutions

Cumulative Review Question 3 Page 138

a) Experimental probability is based on experimental trials, while theoretical probability is

based on the analysis of all outcomes. Experimental probability shows what actually happens,
while theoretical probability shows what should happen. Experimental probability approaches
theoretical probability as the number of trials increase.

b) Experimental probability approaches theoretical probability as a very large number of trials

are conducted.

Cumulative Review Question 4 Page 138

Recall a table of possible outcomes for rolling a standard pair of dice. The total number of
possible outcomes is n(S) = 36. A sum of 7 or 11: n(A) = 8.
n( A)
P (7 or 11) 
n( S )
8

36
2

9
2
The probability of rolling a sum of 7 or 11 is .
9

Cumulative Review Question 5 Page 138

Apply the principle of inclusion and exclusion, since ace and red card are not mutually exclusive.
There are 52 cards in a standard deck: n(S) = 52.
The number of aces in a standard deck is 4: n(A) = 4.
The number of red cards in a standard deck is 26: n(R) = 26.
The number of aces that are red cards is 2: n(A and R) = 2.
n(A or R) = n(A) + n(R) – n(A and R)
= 4 + 26 – 2
= 28
n( A or R)
P( A or R ) 
n( S )
28

52
7

13
7
The probability of randomly drawing an ace or red card is .
13

MHR  Data Management 12 Solutions 61

Cumulative Review Question 6 Page 138

3
a) These are independent events. The probability of selecting a yellow marble is .
5
3 3 9
So, the probability of selecting yellow followed by another yellow is  , or .
5 5 25

b) If the first marble is not replaced, the events are dependent. Then, the probability of selecting
3 2 3
yellow followed by another yellow is  , or .
5 4 10

c) The answers to parts a) and b) are different because one deals with replacement and the other
does not. If the yellow marble is placed back in the bag, there are better chances of drawing
another yellow marble again.

Cumulative Review Question 7 Page 138

62 MHR  Data Management 12 Solutions

A list of all possible routes Kaan can take to Jamaica is shown.
OTcNJ OTcPJ OTcAJ OTcMJ OTcJ
OTbNJ OTbPJ OTbAJ OTbMJ OTbJ
OTtNJ OTtPJ OTtAJ OTtMJ OTtJ

Cumulative Review Question 8 Page 138

a) Rolling one standard die has six possible outcomes. Rolling three dice has 6(6)(6), or 216
different outcomes.

b) Rolling one standard die has six possible outcomes. Rolling four dice has 6(6)(6)(6), or 1296
different outcomes.

c) Rolling one 8-sided die has eight possible outcomes. Rolling two 8-sided dice has 8(8), or 64
different outcomes.

d) Rolling one 12-sided die has 12 possible outcomes. Rolling three 12-sided dice has
12(12)(12), or 1728 different outcomes.

Cumulative Review Question 9 Page 138

a) There are eight colours available, and the four adjacent countries must be different colours.
These can be coloured in 8(7)(6)(5), or 1680 ways.

b) Adjacent countries share boundaries. These boundaries are more visible if the countries are
different colours. With only 8 colours available, there could be many countries that are coloured
the same colour, but adjacent countries should not be.

Cumulative Review Question 10 Page 138

Order is important. There are 500P3, or 124 251 000 ways the three prizes could be awarded to 500
people.

Cumulative Review Question 11 Page 139

Order is important. There are 8P4, or 1680 ways a president, vice president, secretary, and
treasurer can be elected from a condominium board of 8 members.

Cumulative Review Question 12 Page 139

There are 12! ways to seat the 12 people.

The number of ways to arrange with the hosts seated together is 11!.

The hosts can be arranged together in 2! ways.

So, there are 11! × 2! ways to seat the 12 guests with the hosts together.

Use the indirect method.

12! − 11! × 2! = 399 168 000

There are 399 168 000 to arrange the guests so that the hosts are not seated together.

MHR  Data Management 12 Solutions 63

Cumulative Review Question 13 Page 139

a) Five different digits can be arranged in 5!, or 120 ways. Only one of those will have the digits
1
in the correct order. So, the probability of winning is .
120

b) Winning would be more probable if the digits could be repeated, because there would be
fewer possible outcomes.

Cumulative Review Question 14 Page 139

Factor 255 255 into 3 × 5 × 7 × 11 × 13 × 17.

There is at least one prime factor. So, subtract 1 from the total number to account for no factors
chosen (null set). Each prime factor can either be chosen or not.
There are a total of 26 – 1, or 63 divisors of 255 255.

Cumulative Review Question 15 Page 139

From the five hip hop songs, there are 5C3 options.
From the seven R&B songs, there are 7C3 options.
From the eight rock songs, there are 8C3 options.
From the nine pop songs, there are 9C3 options.
So, there are 5C3 × 7C3 × 8C3 × 9C3, or 1 646 400 different playlists the DJ could generate.

Cumulative Review Question 16 Page 139

a) Use combinations. You need to travel 10 blocks to school. Select any four of these ten blocks
to travel southbound. The remaining six blocks will be westbound.
10! 6!
10 C4  6 C6  
6!4! 0!6!
 210
You can take 210 different routes to school.

b) Answers may vary. 10C6 = 210. Pascal’s method will arrive at the same result by adding the
number of paths to the adjacent grid points to determine the number of paths to the given point.

Cumulative Review Question 17 Page 139

a)
n nC2 ÷ nC1 Result
2 1÷2 0.5
3 3÷3 1
4 6÷4 1.5
5 10 ÷ 5 2
6 15 ÷ 6 2.5
7 21 ÷ 7 3
8 28 ÷ 8 3.5
9 36 ÷ 9 4

b) When n is odd, nC2 is divisible by nC1.

64 MHR  Data Management 12 Solutions

c) When n is odd, nC2 is divisible by nC1. These rows have an even number of terms.

d) Yes, 15C2 is divisible by 15C1, because n is odd.

Cumulative Review Question 18 Page 139

One envelope is to contain five tickets and the other envelope is to contain three tickets. Then,
eight tickets can be put into two envelopes in 8C5 × 3C3, or 56 ways.

Cumulative Review Question 19 Page 139

a) Determine the sums using the number of combinations of 1, 2, 3, 4, and 5 different dollar
bills.
5 C1  5 C2  5 C3  5 C4  5 C5

5! 5! 5! 5! 5!
    
4!1! 3!2! 2!3! 1!4! 0!5!
 5  10  10  5  1
 31
There are 31 different sums of money that can be made.

b) Using the indirect method, 25 – 1 = 31.

There are 31 different sums of money that can be made.

Cumulative Review Question 20 Page 139

a) Record the number of paths to each corner of the cube.

The spider can take 6 different paths to get to its destination.

b) Yes, combinations can be used to solve this problem. Let the three directions the spider can
move be right, left, and down. The spider needs to travel 3 edges to its destination. Select any one
of these three edges to travel, say right. From two remaining edges, select another direction, say
left. Then, the last edge travel down.
3! 2! 1!
3 C1  2 C1  1 C1   
2!1! 1!1! 0!1!
6
The spider can take 6 different paths to get to its destination.

Cumulative Review Question 21 Page 139

a) Twelve people are selected from a total of 50 people: n(S) = 50C12.

Six women and six men are chosen.
n(A) = 30C6 × 20C6

MHR  Data Management 12 Solutions 65

 C6  20 C6
P( A)  30

50 C12

 0.189 578...
The probability that the jury will have an equal number of men and women is approximately
0.190.

b) Twelve people are selected from a total of 50 people: n(S) = 50C12.

The jury can have 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, or 12 men.
Use the indirect method by subtracting the number of juries with 0 or 1 man.
n(A) = 20C0 × 30C12 + 20C1 × 30C11
C  C  C  C
P( A)  20 0 30 12 20 1 30 11
50 C12

 0.009 712...
 0.0097
So, the probability that the jury will have at least two men is 1 – 0.0097, or 0.9903.

66 MHR  Data Management 12 Solutions