Combination

Practice
 Question 1

Find the number of ways in which ten different books can be given to Ethan, Henry, Joshua and Lucy,
if Ethan is to receive 4 books, Henry is to receive 3 books, Joshua is to receive 2 books and Lucy is to
receive 1 book.

Solution:
Choose 4 from 10 books for Ethan, then choose 3 from 6 remaining books for Henry, then choose 2 from 3
remaining books for Joshua and give the last book which is left to Lucy. Hence the total number of ways is
    
10 6 3 1 10! 6! 3!
= · · ·1
4 3 2 1 4! · 6! 3! · 3! 2! · 1!
10!
=
4! · 3! · 2! · 1!
= 12600

Question 2

Find the number of ways in which twelve different baseball cards can be given to Emily, Harry, John and
Olivia, if Emily is to receive 5 cards, Harry is to receive 3 cards, John is to receive 3 cards and Olivia is
to receive 1 card.

Solution:
Choose 5 from 12 baseball cards for Emily, then choose 3 from 7 remaining cards for Harry, then choose 3
from 4 remaining cards for John and give the last card which is left to Olivia. Hence the total number of ways is
    
12 7 4 1 12! 7! 4!
= · · ·1
5 3 3 1 5! · 7! 3! · 4! 3! · 1!
12!
=
5! · 3! · 3! · 1!
= 110880

Question 3

A school basketball team of 5 students is selected from 8 boys and 4 girls.

a) Determine how many possible teams can be chosen.
b) Determine how many teams can be formed consisting of 3 boys and 2 girls?
c) Determine how many teams can be formed consisting of at most 3 girls?

Solution:
a) We choose 5 students from 8 + 4 = 12 boys and girls.
Hence the number of possible teams is
 
12 12!
=
5 5! · 7!
= 792
b) We choose 3 students from 8 boys and then we choose 2 more students from 4 girls. Hence the number
of teams consisting of 3 boys and 2 girls is
  
8 4 8! 4!
= ·
3 2 3! · 5! 2! · 2!
= 336
c) A team of 5 students can either have 0, 1, 2, 3 or 4 girls. The number of teams consisting of 1 boy and
4 girls is   
8 4
=8
1 4
1
 Hence the number of teams consisting of at most 3 girls is

792 − 8 = 784

Question 4

A police department has 4 male and 7 female officers. A special group of 5 officers is to be assembled for
an undercover operation.
a) Determine how many possible groups can be chosen.
b) Determine how many groups can be formed consisting of 2 males and 3 females.
c) Determine how many groups can be formed consisting of at least one male.

Solution:
a) We choose 5 people from 4 + 7 = 11 males and females.
Hence the number of possible groups is
 
11 11!
=
5 5! · 6!
= 462

b) We choose 2 officers from 4 males and then we choose 3 more officers from 7 females. Hence the number
of groups consisting of 3 males and 2 females is
  
4 7 4! 7!
= ·
2 3 2! · 2! 3! · 4!
= 210

c) The number of groups consisting of ( 0 males and )5 females is

  
4 7 4! 7!
= ·
0 5 0! · 4! 5! · 2!
= 21

Hence the number of groups consisting of at least 1 male is

462 − 21 = 441

Question 5

Peter needs to decide the order in which to schedule 14 exams for his school. Two of these exams are
Chemistry (1 SL and 1HL ).
Find the number of different ways Peter can schedule the 14 exams given that the two Chemistry subjects
must not be consecutive.

Solution:
Let 𝑛 be the number of different ways in which the 14 exams can be scheduled such that the two Chemistry
subjects are not consecutive. To find 𝑛, subtract from 14 ! the number of possible ways to order the 14 exams
such that the two Chemistry subjects are consecutive.
   
2 13
𝑛 = 14! − 12! × × 2! × × 1!
2 1
= 14! − 12! × 2! × 13
≈ 7.47 × 1010

2
 Question 6

There are 11 players on a football team who are asked to line up in one straight line for a team photo.
Three of the team members named Adam, Brad and Chris refuse to stand next to each other. There is no
restriction on the order in which the other team members position themselves.
Find the number of different orders in which the 11 team members can be positioned for the photo.

Solution:
Let 𝑛 be the number of different orders in which the 11 team members can be positioned for the photo.
To find 𝑛, subtract from 11 ! the number of possible ways to order the 11 team members such that exactly two
and exactly three of Adam, Brad and Chris stand next to each.
       
3 9 3 9
𝑛 = 11! − 8! × × 2! × × 2! − 8! × × 3! × × 1!
2 2 3 1
= 11! − 8! × 3 × 2! × 9 × 8 − 8! × 3! × 9
= 20321280

Question 7

The barcode strings of a new product are created from four letters 𝐴, 𝐵, 𝐶, 𝐷 and ten digits 0, 1, 2, . . . , 9.
No three of the letters may be written consecutively in a barcode string. There is no restriction on the
order in which the numbers can be written.
Find the number of different barcode strings that can be created.

Solution:
Let 𝑛 denote the number of different barcode strings that can be created. Four letters and ten digits can
be ordered in 14 ! ways. To find 𝑛, subtract from 14 ! the number of possible barcode strings with exactly three
and exactly four consecutive letters.
       
4 11 4 11
𝑛 = 14! − 10! × × 3! × × 2! − 10! × × 4! × × 1!
3 2 4 1
= 14! − 10! × 4 × 3! × 11 × 10 − 10! × 4! × 11
= 7.66 × 1010

3
 Question 8

Jack and John have decided to play a game. They will be rolling a die seven times. One roll of a die is
considered as one round of the game. On each round, John agrees to pay Jack $4 if 1 or 2 is rolled, Jack
agrees to pay John $2 if 3, 4, 5 or 6 is rolled, and who is paid wins the round. In the end, who earns money
wins the game.
a) Show that the probability that Jack wins exactly two rounds is 224 729 .
b) (i) Explain why the total number of outcomes for the results of the seven rounds is 128 .
(ii) Expand (1 + 𝑦)7 and choose a suitable value of 𝑦 to prove that
               
7 7 7 7 7 7 7 7
128 = + + + + + + + .
0 1 2 3 4 5 6 7

(iii) Give a meaning of the equality above in the context of the seven rounds.
c) (i) Find the expected amount of money earned by each player in the game.
(ii) Who is expected to win the game?
(iii) Is this game fair? Justify your answer.
d) Jack and John have decided to play the game again.
(i) Find an expression for the probability that John wins five rounds on the first game and two rounds
on the second game. Give your answer in the form
 2   𝑠  𝑡
7 1 2
𝑟 3 3

where the values of 𝑟, 𝑠 and 𝑡 are to be found.

(ii) Use your answer to (d) (i) and seven similar expressions to write down the probability that John
wins a total of seven rounds over two games as the sum of eight probabilities.
(iii) Hence prove that
  7  2
14 Õ 7
= .
7 𝑘
𝑘=0

e) Now Jack and John roll a die 12 times. Let 𝐴 denote the number of rounds Jack wins. The expected
value of 𝐴 can be written as
12
𝑎
   12−𝑟 
Õ 12
E[𝐴] = 𝑟
𝑟 𝑏 12 𝑟=0

(i) Find the value of 𝑎 and 𝑏.

(ii) Differentiate the expansion of (1 + 𝑦)12 to prove that the expected number of rolls Jack wins is 4 .

Solution:
a) The probability that Jack wins a round is 13 .
Hence the probability that Jack wins exactly two rounds is
   2  5    
7 1 2 7·6 1 25
=
2 3 3 2 32 35
7 · 25
=
36
224
=
729
b) (i) On each round, either Jack wins or John wins. Hence in seven rounds, there are 27 = 128 possible
outcomes.
(ii) Using the binomial theorem, we have
7  
Õ 7
(1 + 𝑦)7 = 𝑦𝑘
𝑘
𝑘=0
4
Hence, if we substitute 𝑦 = 1 in the equation (1), we get
7  
Õ 7
128 =
𝑘
𝑘=0

(iii) The total number of outcomes equals to the sum of the number of ways Jack can win 𝑘 rounds over
𝑘 = 0, 1, 2, . . . , 7.
c) (i) The expected amount of money earned by Jack in the game is
 
1 2
E[$ earned by Jack ] = 7 ($4) · + (−$2) ·
3 3
= $0.00

The expected amount of money earned by John in the game is

 
1 2
E[$ earned by John ] = 7 (−$4) · + ($2) ·
3 3
= $0.00

(ii) Since no one is expected to earn money in the game, no one is expected to win the game.
(iii) Yes, this game is fair because no one is expected to win or lose the game.
d) (i) The probability that John wins a round is 32 .
Hence the probability that John wins five rounds on the first game and two rounds on the second game is
"    5   2# "     2   5#  2  7  7
7 2 1 7 2 1 7 2 1
=
5 3 3 2 3 3 5 3 3

(ii) Similarly as in (d) (i), the probability that John wins a total of seven rounds over two games is
7  2  7  7  7 
 2
Õ 7 2 1 27 Õ 7
= 14
𝑘 3 3 3 𝑘
𝑘=0 𝑘=0

(iii) Equivalently, the probability that John wins 7 rounds out of 14 is

   7  7   
14 2 1 14 27
=
7 3 3 7 314
Hence we obtain   7 
  7 Õ 2
14 27 2 7
= 1𝑥
7 31𝑥 3 𝑘
𝑘=0
  7  2
14 Õ 7
=
7 𝑘
𝑘=0

e) (i) The expected value of 𝐴 is

12     𝑟   12−𝑟
Õ 12 1 2
E[𝐴] = 𝑟
𝑟 3 3
𝑟=0
12
212−𝑟
  
Õ 12
= 𝑟
𝑟 312
𝑟=0

Hence 𝑎 = 2 and 𝑏 = 3
(ii) Using the binomial theorem, we have
12  
Õ 12
(1 + 𝑦)12 = 𝑦𝑘
𝑘
𝑘=0
5
 Hence, if we differentiate both sides of the equation (2), we get
" 12   #
d  d Õ 12
(1 + 𝑦) 12
𝑦𝑟

=
d𝑦 d𝑦 𝑟=0 𝑟
12  
Õ 12
12(1 + 𝑦) 11
= 𝑟 𝑦 𝑟−1
𝑟
𝑟=0

12
To obtain 2311 on the left hand side and 21−𝑟 on the right hand side of the equation (3), we need to substitute
𝑦= 1
2 in this equation.
  11 12     𝑟−1
1 Õ 12 1
12 1 + = 𝑟
2 𝑟 2
𝑟=0
12  
312 Õ 12
𝑟 21−𝑟
 
4· =
211 𝑟
𝑟=0

Hence, if we rewrite the equation (4), we obtain

12    12−𝑟 
Õ 12 2
4= 𝑟
𝑟 312
𝑟=0
4 = E[𝐴]

Question 9

Ten students are to be arranged in a new chemistry lab. The chemistry lab is set out in two rows of five
desks as shown in the following diagram.

Desk 1 Desk 2 Desk 3 Desk 4 Desk 5

Desk 6 Desk 7 Desk 8 Desk 9 Desk 10
a) Find the number of ways the ten students may be arranged in the lab.
Two of the students, Hugo and Leo, were noticed to talk to each other during previous lab sessions.
b) Find the number of ways the students may be arranged if Hugo and Leo must sit so that one is directly
behind the other. For example, Dest 1 and Desk 6.
c) Find the number of ways the students may be arranged if Hugo and Leo must not sit next to each other
in the same row.

Solution:
a) 10! = 3628800
b) Hugo and Leo may be arranged in the lab first in (5)(2) = 10 ways so that one is directly behind the
other. Then the rest of the students may be arranged in 8! = 40320 ways.
In this case, the number of ways the ten students may be arranged in the lab is

(10)(8!) = 403200

c) Hugo and Leo may be arranged in the lab first in (8)(2) = 16 ways so that they sit next to each other.
Then the rest of the students may be arranged in 8! = 40320 ways.
In this case, the number of ways the ten students may be arranged in the lab is

(16)(8!) = 645120

Hence, if Hugo and Leo must not sit next to each other, the number of ways is

10! − (16)(8!) = 3628800 − 645120

= 2983680

6
 Question 10

Sophie and Ella play a game. They each have five cards showing roman numerals I, V, X, L, C. Sophie
lays her cards face up on the table in order I, V, X, L, C as shown in the following diagram.

Ella shuffles her cards and lays them face down on the table. She then turns them over one by one to see
if her card matches with Sophie’s card directly above. Sophie wins if no matches occur; otherwise Ella
wins.
11
a) Show that the probability that Sophie wins the game is 30 .
Sophie and Ella repeat their game so that they play a total of 90 times. Let the discrete random variable
𝑋 represent the number of times Sophie wins.
b) Determine:
(i) the mean of 𝑋;
(ii) the variance of 𝑋.

Solution:
a) We have

exact # of matches # of possible

 ways
 to lay down cards
5
1 × 9 = 45
1
 
5
2 × 2 = 20
2
 
5
3 × 1 = 10
3
 
5
4 ×0=0
4
 
5
5 ×1=1
5
There are 5! = 120 possible ways to lay down five cards in order on the table. Hence the number of possible
ways to lay down five cards with no matches is

120 − (45 + 20 + 10 + 0 + 1) = 120 − 76

= 44

Hence the probability that Sophie wins the game is

44
P( Sophie wins ) =
120
11
=
30

7
 b) (i) Since 𝑋 ∼ 𝐵(90, 11/30), we get
E[𝑋] = 𝑛𝑝
11
= 90 ×
30
= 33
(ii) Using the formula for the variance of 𝑋 ∼ B(90, 11/30), we obtain

Var(𝑋) = 𝑛𝑝(1 − 𝑝)
 
11 11
= 90 × × 1−
30 30
= 20.9

Question 11

Six women and two men wait in a grocery store checkout line. Determine the number of possible ways
these customers can stand in line, given that
a) the men do not stand together;
b) the men do not stand on either end;
c) the men do not stand together and do not stand on either end.

Solution:
a) Let 𝑘 be the number of possible ways the 8 customers can stand in line such that the men do not stand
together.
To find 𝑘, subtract from 8 ! the number of possible ways the 8 customers can stand in line such that the
men stand together.
𝑘 = 8! − 2 × 7!
= 30240
b) Let 𝑚 be the number of possible ways the 8 customers can stand in line such that the men do not stand
on either end.
Let one of the 6 women stand on one end, and one of the 5 women left stand on the other end, and let the
other 6 customers stand in between.
Hence we find
𝑚 = 6 × 5 × 6!
= 21600
c) Let 𝑛 be the number of possible ways the 8 customers can stand in line such that the men do not stand
together and do not stand on either end.
Using similar counting techniques as in parts (a)-(b), we find

𝑛 = 6 × 5 × (6! − 2 × 5!)
= 14400

Question 12

Julie works at a book store and has nine books to display on the main shelf of the store. Four of the books
are non-fiction and five are fiction. Each book is different. Determine the number of possible ways Julie
can line up the nine books on the main shelf, given that
a) the non-fiction books should stand together;
b) the non-fiction books should stand together on either end;
c) the non-fiction books should stand together and do not stand on either end.

8
Solution:
a) Let 𝑘 be the number of possible ways that the 9 books can be ordered with the 4 non-fiction books being
arranged together.
To find 𝑘, we can consider a two steps process. First, we can treat the 4 non-fiction books as a single item,
and so there are 6 ! permutations of the 5 fiction books and the block of non-fiction books. After that, we can
arrange the non-fiction books in 4 ! different ways. Thus, by the multiplication rule, we get

𝑘 = 6! × 4!
= 17280

b) Let 𝑚 be the number of possible ways that the non-fiction books can stand together on either end.
There are 2 ways in which the non-fiction books can be on one end, and 5 ! ways to order the fiction books next
to them. Finally, the non-fiction books can be ordered in 4 ! ways. Hence, we find

𝑚 = 2 × 5! × 4!
= 5760

c) Let 𝑛 be the number of possible ways that the non-fiction books can stand together and do not stand
on either end.
Using the results found in parts (a)-(b), we find

𝑛 = 𝑘−𝑚
= 11520

Question 13

Sophia and Zoe compete in a freestyle swimming race where there are no tied finishes and there is a total
of 10 competitors.
Find the total number of possible ways in which the ten swimmers can finish if Zoe finishes
a) in the position immediately after Sophia;
b) in any position after Sophia.

Solution:
a) Let 𝑛 be the number of possible ways in which Zoe finishes immediately after Sophia. To find 𝑛, we can
treat Sophia followed by Zoe as one item. We can then order the 9 items in any order. Hence, the value of 𝑛 is

𝑛 = 9!
= 362880

b) Let 𝑚 be the number of possible ways in which Zoe finishes in any position after Sophia. Hence, we get
           
9 8 7 6 5 1
𝑚= × 8! + × 8! + × 8! + × 8! + × 8! + . . . . . . × 8!
1 1 1 1 1 1
= (9 + 8 + 7 + 6 + 5 + · · · + 1) × 8!
= 1814400

Question 14

A music company announces that they are going to release a list of their top 10 artists. If 5 of them are
pop artists, 3 of them are rock artists and 2 are hip-hop artists, find the total number of possible ways in
which
a) the rock artists are listed consecutively;
b) the rock artists and the hip-hop artists are both listed consecutively, with the 3 rock artists listed
immediately below the 2 hip-hop artists.

9
Solution:
a) Let 𝑛 be the number of possible ways in which the rock artists are listed consecutively. Hence, we get
 
8
𝑛 = 7! × × 3!
1
= 8! × 3!
= 241920

10
 b) Let 𝑚 be the number of possible ways in which the rock and hip-hop artists are listed consecutively and
the rock artists are listed immediately below the hip-hop artists. Hence, we get
 
6
𝑚 = 5! × × 2! × 3!
1
= 6! × 2! × 3!
= 8640

Question 15

There are six office cubicles arranged in a grid with two rows and three columns as shown in the following
diagram. Aria, Bella, Charlotte, Danna, and Emma are to be stationed inside the cubicles to work on
various company projects.

Find the number of ways of placing the team members in the cubicles in each of the following cases.
a) Each cubicle is large enough to contain the five team members, but Danna and Emma must not be
placed in the same cubicle.
b) Each cubicle may only contain one team member. But Aria and Bella must not be placed in cubicles
which share a boundary, as they tend to get distracted by each other.

Solution:
a) We start counting the number of ways we can place each of the team members. Aria, Bella, Charlotte
and Danna can be placed in any of the six cubicles, but once Danna is placed, Emma can be placed in the
remaining five cubicles. Hence, the total number of ways of placing the team members in this case is

6 × 6 × 6 × 6 × 5 = 6480

b) Let’s label the cubicles as follows

1 2 3
4 5 6
We have several ways of placing Aria and Bella:

Aria’s cubicle Bella’s cubicle

1 3, 5, 6
2 4,6
3 1, 4, 5
4 2, 3, 6
5 1,3
6 1, 2, 4
Thus, there are 16 ways of placing Aria and Bella in cubicles that do not share a boundary.
After that, Charlotte can be placed in any of the 4 remaining cubicles, Danna in any of the 3 remaining
cubicles, and Emma in any of the 2 remaining cubicles.
Therefore, the total number of arrangements in this case is

16 × 4 × 3 × 2 = 384

11