Saturday, February 3, 2018 Mathematics 1228B

Page 1 CODE 111 Test 1

PART A (18 marks)

1 1. If n(U ) = 90, n(A) = 25 and n(Ac ∩ B) = 5, find n(Ac ∩ B c ).

mark
A: 65 B: 60 C: 70 D: 20 E: 85

Solution: We see that n(Ac ) = n(U ) − n(A) = 90 − 25 = 65. So partitioning Ac we get

n(Ac ∩ B c ) = n(Ac ) − n(Ac ∩ B) = 65 − 5 = 60

1 2. Let B be the set of all black-haired students in a college, F be the set of all first-year students, and E
mark be the set of students in Engineering. Michael is a third-year student in Engineering who has black hair.
Which one of the following sets is Michael not in?

A: B ∪ F B: (B c ∩ F c ) ∪ E C: (B ∪ F ) ∩ E D: (B c ∪ F ) ∩ E E: B ∩ F c

Solution: Michael is not a first-year student, so he’s in F c . And he’s an Engineering student, and has
black hair, so he’s in both E and B and therefore is in B ∩ F . Since Michael is in set B, then he’s also in
the union of this set with any other set. For instance, he’s in B ∪ F , and also (since he’s in E as well) in
(B ∪ F ) ∩ E. Likewise, he’s in the union of set E with any other set, so he’s in (B c ∩ F c ) ∪ E. But since
Michael is in both B and F c , then he’s not in either of B c or F , so he’s not in B c ∪ F ), which means that
he’s not in the intersection of that set with any set and hence isn’t in (B c ∪ F ) ∩ E.

1 3. All of the 75 participants at a conference in Montreal speak English or French (or both). If 45 of them
mark speak English and 65 speak French, how many of the participants speak exactly one of these two languages?

A: 30 B: 10 C: 75 D: 35 E: 40

Solution: Of the 75 participants, 45 speak English, so the other 30 don’t. All of those 30 must speak
French, since everyone does speak English or French. Similarly, since there are 65 who speak French, there
are 10 who don’t and all of those must speak English. And that gives 30 who speak only French plus 10
who speak only English (of these 2 languages) for a total of 40 who speak exactly one of the 2 languages.
Or looked at another way, since everyone at the conference does speak English and/or French, then having
45 English-speakers and 65 French-speakers among the 75 participants means there must be 45 + 65 − 75 =
35 who speak both languages, leaving each of the other 40 people speaking only one of the 2 languages.

1 4. Sam wants to spend all of the $4.50 change in his pocket at a small coffee shop in the airport before getting
mark on the plane. The coffee shop sells small chocolate candies for 50 cents each, croissants for $1 each and
slices of apple pie for $3 each. In how many ways can Sam spend exactly $4.50 selecting from just these
items?
Note: Sam may buy more than one of the same item.

A: 8 B: 7 C: 6 D: 5 E: 3

Solution: We consider the items that Sam could buy in decreasing order of cost. He is going to spend
$4.50, so he can buy at most 1 slice of apple pie, i.e. 0 or 1 of these. If he does buy one, that leaves him
with only $1.50 to spend on croissants and chocolates. He might buy 1 croissant and one chocolate, or he
might buy no croissants and buy 3 chocolates. So that’s 2 possibilities when he does buy 1 slice of apple
pie. But if he doesn’t buy a slice of apple pie, then he will spend the whole $4.50 on croissants and/or
chocolates. He could buy 0 or 1 or 2 or 3 or 4 croissants, and for each of these he would spend the rest
on chocolates (buying 9 or 7 or 5 or 3 or 1 of them). So that’s 5 possibilities if he doesn’t buy a slice of
apple pie. In total, there are 2 + 5 = 7 different ways he can spend his change.
 Mathematics 1228B Saturday, February 3, 2018
Test 1 CODE 111 Page 2

Note: You probably drew a tree and counted the number of terminal points (or if you didn’t, you should
have). The tree represents exactly what was described above, with a terminal point for each of the 7
possibilities.

1 5. There are 10 wrestlers competing in an international league, and a medal will be awarded to each of the
mark best three wrestlers. In how many ways can the winners of the gold medal, the silver medal and the bronze
medal be determined?
 
10 10!
A: 10 3
B: 3 × 10 C: 10 × 9 × 8 D: E:
3 3!

Solution: There are 10 choices for who wins the gold medal, and once that winner has been selected there
are only 9 choices for who wins the silver medal, after which there are only 8 choices for who wins the
bronze medal. So by the Fundamental Counting Principle the total number of ways in which the medal
winners can be determined is 10 × 9 × 8.
Or the number of ways of arranging 3 of the 10 competitors among the 3 medals is given by

10! 10! 10 × 9 × 8 × 7!
= = = 10 × 9 × 8
(10 − 3)! 7! 7!

1 6. Little Nadia is going to put 16 different toys into 3 different toy boxes. Each toy could be put into any
mark one of the boxes. In how many ways can she put the toys in the boxes if she is not going to put all the
toys into one box?

A: 316 B: 163 C: 316 − 3 D: 3 × 163 E: 163 − 3

Solution: For each toy, there are 3 choices of which toy box to put that toy in. So by the FCP, the number
of ways in which Nadia can decide, for each toy, which box to put it in is given by multiplying 16 copies
of 3 together, which is 316 . However, it says that she is not going to put them all into one box. There are
3 different choices for which one box she could put them all in, which means that 3 of the ways previously
counted are the things she will not do. Therefore the number of ways she can put the toys in the boxes is
316 − 3.

1 7. How many subsets of the set S = {1, 2, 3, 4, 5, 6, 7, 8, 9} contain all of the odd numbers?
mark
A: 24 B: 2 5 C: 29 D: 5 × 24 E: 4 × 25

Solution: The given set contains 5 odd numbers and 4 even numbers. A subset containing all of the odd
numbers could also contain any number of the even numbers. That is, although decisions have already
been made for each odd number (that it will be in the subset), there are still 4 elements of S (the even
numbers) about which decisions must still be made (whether or not to include it in the subset). Since
there are 2 choices for each of these 4 decisions, the number of ways to make the subset is 2 × 2 × 2 × 2 = 24 .
That is, any subset of S which contains all of the odd numbers has the form {1, 3, 5, 7, 9} ∪ A, where A
is some subset of {2, 4, 6, 8}. Since that set contains 4 elements, it has 24 subsets, so there are 4 different
sets A that could be included in the subset being formed.

1 8. In how many ways can 4 Engineers, 5 Lawyers and 6 Teachers stand in a line, so that people in the same
mark profession all stand together side-by-side?

15! 15!
A: 4!5!6! B: 3!4!5!6! C: D: E: 4! + 5! + 6!
4!5!6! 3!4!5!6!
 Saturday, February 3, 2018 Mathematics 1228B
Page 3 CODE 111 Test 1

Solution: We need to arrange a group of 4 Engineers, a group of 5 Lawyers and a group of 6 Teachers in
a line. That’s 3 objects being arranged, which can be done in 3! different ways. But we must also arrange
the people in each profession within their group. There are 4! ways the 4 Engineers could be arranged, 5!
ways the 5 Lawyers could be arranged and 6! ways the 6 Teachers could be arranged. So by the FCP, the
number of different ways of forming the line is 3! × 4! × 5! × 6! = 3!4!5!6!.

1 9. In how many ways can 4 Doctors and 4 Nurses take seats around a table so that Sherry and Sandy, two
mark of the four Doctors, sit opposite one another?

A: 3!3! B: 2!4! C: 2!6! D: 7! E: 6!

Solution: We can think of arranging everyone except Sandy around the table. That means 7 people being
arranged in a circle, which can be done in (7 − 1)! = 6! different ways. And now, there’s only one choice
for where Sandy can be: directly opposite Sherry. So the number of ways of arranging the 8 people is
6! × 1 = 6!.

1 10. In how many ways can 5 identical red candles and 5 identical blue candles be arranged in a circle on a
mark birthday cake so that their colours alternate?

A: 4!5! B: 10 C: 4! + 5! D: 1 E: 9!

Solution: Since the blue candles are all identical, there’s only 1 way to arrange them in a circle. And since
the red candles are all identical, there’s only 1 way to arrange them with 1 in between each pair of bule
candles, to make the colours alternate around the circle. So there’s only 1 × 1 = 1 way to arrange the 10
candles on the cake.

1 11. Which one of the following statements is not true?

mark
           
7 8 8 8 15 15
A: =1 B: =1 C: =8 D: =7 E: =
0 8 1 7 8 7

Solution: There are 8 different ways to choose a subset of 7 objects from a
set of 8 distinct objects. (That
is, 8 choices for which 1 of the objects not to include in the subset.) So 87 = 8, not 7. (The other answer
choices are all true.)

1 12. A standard deck of cards has 52 cards, of which 26 are red and 26 are black. How many hands of 12 cards
mark are there which contain exactly 4 red cards and exactly 8 black cards?
        
52 26 26 52 26 26
A: B: C:
12 4 8 12 4 8
         
52 26 26 26 26
D: + + E: +
12 4 8 4 8

Solution: There are 26 26

4 ways to choose which 4 red cards will be in the hand, and 8 ways to choose
which 8 black

cards

will
be in

the hand. So by the FCP the number of ways to choose the hand of 12
cards is 26
4 × 26
8 = 26 26
4 8 .

1 13. Adam has 5 different Math books and 6 different English Literature books. He is going to donate some
mark of these books to the school library. In how many ways can he choose which books to donate if he has
decided to donate exactly 2 Math books, but has not yet decided if he will donate some (or even all) of
the English books?
   
5 5! 5 5!
A: × 26 B: × 6! C: 2 × 5! + 6! D: + 26 E: + 6!
2 2! 2 2!
 Mathematics 1228B Saturday, February 3, 2018
Test 1 CODE 111 Page 4

Solution: There are 52 different ways in which Adam could decide which 2 Math books to donate. And

there are 26 different subsets of the set of 6 English Literature books that Adam could choose to donate.
So by the FCP, the number of ways Adam can choose which books to donate is 52 × 26 .

1 14. In how many ways can a committee of 7 be selected from 12 students and 10 teachers, if there must be at
mark least one student and at least one teacher on the committee?
               
12 10 20 12 10 20 22 12 10
A: B: + + C: − −
1 1 5 1 1 5 7 7 7
         
12 10 12 10 10 12
D: + E: +
7 7 1 6 1 6

Solution: In total, the number of ways to select a committee of 7 from the 22 people is 22


7 . Of these,
there are 12 10



7 committees which contain only students (i.e. no teachers) and there are also 7 which
contain only teachers (i.e. no students). That is, any committee which does not contain at least one
student
and at
least one teacher must either contain only students or else contain only teachers, and there
are 12 10
7 + 7 of these. Therefore the number of committees which do contain at least one student and
at least one teacher is
           
22 12 10 22 12 10
− + = − −
7 7 7 7 7 7

1 15. In how many ways can 3 copies of a History book, 4 copies of an Accounting book and 5 copies of a
mark Psychology book be arranged on a bookshelf if copies of the same book are identical to one-another?

12!
A: 3!4!5! B: 12! C: 3! + 4! + 5! D: 3 × 4 × 5 E:
3!4!5!

Solution: The number of distinct permutations of 12 books, where there are 3 identical History books, 4
identical Accounting books and 5 identical Psychology books is given by the multinomial coefficient
 
12 12!
=
3 4 5 3!4!5!

(That is, when the 12 books are lined up on the shelf, there are 12 positions in the line. We need to
divide these 12 positions into a group of 3 positions for the History books, a group of 4 positions for the
Accounting books and a group of 5 positions for the Psychology books.)

1 16. Find the number of permutations of all the letters in the word FREEZER if the two Rs must be side-by-
mark side.

6! 7!
A: B: C: 2! × 6! D: 7! E: 2! + 6!
3! 2!3!

Solution: We need to count the number of permutations of one F, one group of 2 Rs, 3 individual (but
identical) Es and one Z. The number of ways to arrange these 6 objects is
 
6 6! 6!
= =
1 1 3 1 1!1!3!1! 3!
 Saturday, February 3, 2018 Mathematics 1228B
Page 5 CODE 111 Test 1

1 17. Liam, Nicole and Tyler are organizing a party. They have created a shopping list of 18 different items
mark which they need to buy for the party, but haven’t yet decided who will buy which items. In how many
ways can they divide the items on the list between themselves if Liam agrees to buy 8 items, while Nicole
and Tyler will each buy 5 items?
               
18 18 18 18 18 18 18 18 18
A: ÷ 2! B: ÷ 3! C: D: E: + +
8 5 5 8 5 5 8 5 5 8 5 5 8 5 5

Solution: They need to divide the set of 18 items on the shopping list into a group of 8 for Liam to buy,
a group of 5 for Nicole to buy and a group of 5 for Tyler to
buy. These groups are all distinguishable, so
the number of ways of forming the groups is given by 8 185 5 .

1 18. At the party Liam, Nicole and Tyler are enjoying themselves with 12 guests. The 15 friends decide to
mark form 3 groups of 5, and each group will play a different board game. In how many ways can they decide
which friends will play together ?
         
15 15 15 15 15
A: ÷ 3! B: C: × 3! D: × 5! E: ×3
5 5 5 5 5 5 5 5 5 5 5 5 5 5 5

Solution: The 15 friends must be divided into 3 groups of 5. Each group will be doing the same thing:
playing together. That is, we’re not asked for the number of ways in which the 15 friends can decide who
will play each of the 3 different games (which would be 3 distinguishable groups of 5) but instead to count
the number of ways in which the 15 friends can decide who will play together, which means we need to
count
the number of ways to form 3 indistinguishable groups of 5. The number of ways of doing this is
15
5 5 5 ÷ 3!.

PART B (7 marks)

3 19. Philip is a Business student who is interested in investing in the stock market. In order to build a portfolio
marks of stocks, he creates a preliminary list of 60 companies with stocks traded on the Toronto Stock Exchange.
He then researches 3 attributes for each company: the size of the company (large or small), whether it
pays dividends, and whether it is in the Technology sector. He finds the following information.

There are 18 large companies, 24 dividend-paying companies and 10 companies in the Technology sector on
his list. Among the large companies, 7 pay dividends, while among the companies in the Technology sector,
only 1 pays dividends. And his list does not include any small companies which are in the Technology
sector.

(a) Let L be the set of large companies on Philip’s list, D be the set of companies which pay dividends,
and T be the set of companies which are in the Technology sector. Complete the counting tree below
by placing the appropriate numbers on all the branches.

Solution: We have n(U ) = 60, with n(L) = 18 large companies, n(D) = 24 dividend paying companies
and n(T ) = 10 technology companies. We’re told that n(L ∩ D) = 7 and that n(T ∩ D) = 1, as well
as that n(Lc ∩ T ) = 0. We start by putting 60 at the root and 18 on the L branch. We can’t put
n(D) or n(T ) directly on the tree, but we can put 7 on the D branch that follows the L branch. And
since n(Lc ∩ T ) = 0 then both n(Lc ∩ D ∩ T ) = 0 and n(Lc ∩ Dc ∩ T ) = 0. (That is, if there are
no small Tech companies, then there are none that pay dividends and also none that don’t.) So we
can put 0s on both of the T branches that follow the Lc branch. Also, this tells us that the one Tech
company that pays dividends must be large, so we put n(L ∩ D ∩ T ) = 1 on the T branch at the end
of the L then D then T path. The tree so far is shown on the next page.
Mathematics 1228B Saturday, February 3, 2018
Test 1 CODE 111 Page 6

T
1

X
D
7  XX
XX
 X Tc

L H
H
HH T

H
H Dc 
18 XXX
XX
X Tc
60
@
T
0 
@

@ D XXX
@  XX
X Tc

@@ Lc 
H
HH
T
0 
HH c
HD 
XXX
XX
X Tc

Now, we can use the other information we were told, and also use the fact that the number arriving
at any point in the tree must equal the number leaving, i.e. the numbers on the branches growing
from a particular point must sum to the number arriving at that point.

We know that there are n(D) = 24 companies that pay dividends, and that 7 of them are large, so
the other 24 − 7 = 17 are small. That is, we can put n(Lc ∩ D) = 17 on the other D branch. Also,
we know that there are 10 Tech companies, so if only 1 pays dividends and none are small then the
other 10 − 1 = 9 must be large companies that don’t pay dividends, so we have n(L ∩ Dc ∩ T ) = 9,
which we put on the one T branch that doesn’t yet have a number on it.

Since there are 60 companies, of which 18 are large, the other 60 − 18 = 42 must be small, so
n(Lc ) = 42 goes on the Lc branch. Of the 18 large companies, 7 pay dividends, so the other 11 don’t,
i.e. n(L ∩ Dc ) = 11 goes on the Dc branch following the L branch. Also, we saw that 17 of the
small companies pay dividends, so knowing that there are 42 small companies in total (i.e. on the Lc
branch), the other 42 − 17 = 25 don’t pay dividends. So n(Lc ∩ Dc ) = 25 which we put on the Dc
branch following the Lc branch.

The second level is now complete, and we have a number on each of the T branches, so we get the
numbers on the T c branches by subtracting the number on the T branch growing from the same point
from the number arriving at that point, i.e. the number on the branch that ends at that point. We
see that n(L ∩ D ∩ T c ) = 7 − 1 = 6, n(L ∩ Dc ∩ T c) = 11 − 9 = 2, n(Lc ∩ D ∩ T c) = 17 − 0 = 17 and
n(Lc ∩ Dc ∩ T c ) = 25 − 0 = 25. Putting these numbers on the T c branches (in the order mentioned,
from top to bottom), we get the completed tree shown here:
T
1

X

7 
D XXX

 6 X
X Tc

L H
H
HH 9 T

18 11 H X
H Dc XX
XX c
2 X T
60
@
T
0 
@

42@ D XXX
17  XX c
@  17 X T
@@ Lc 
HH
HH T
0 
25 H
H Dc 
XXX
XX c
25 X T
 Saturday, February 3, 2018 Mathematics 1228B
Page 7 CODE 111 Test 1

(b) Use your tree to find the number of companies on Philip’s list which are not in the Technology sector
and do not pay dividends.
Solution: To find the number of non-Tech companies that don’t pay dividends, i.e. n(T c ∩ Dc ) =
n(Dc ∩ T c ), we just need to add up the numbers on all T c branches that follow Dc branches. There
are two of these, so we see that

n(Dc ∩ T c ) = 2 + 25 = 27

2 20. A teacher is going to assign grades of A, B, C, D or F to the 25 students in her class. In how many ways
marks can she assign the grades so that at most one student gets F?
Solution: The teacher may assign a grade of F to either 0 or 1 of the students. If no student is assigned a
grade of F, then all 25 students get grades of A, B, C or D. That is, the teacher must make a decision for
each of the 25 students, choosing one of 4 grades for each. By the Fundamental Counting Principle, the
number of ways the teacher could make these 25 decisions, i.e. assign the grades with no student getting
an F is 4 × 4 × ... × 4 = 425 .
On the other hand, if one student receives a grade of F, the teacher must first decide which one of the 25
students this will be, and then for each of the other 24 students must decide which one of the other 4 grades
that student will receive. So the number of ways of assigning one student an F is 25×4×4×...×4 = 25×424 .
The teacher is only going to assign the grades in one of these ways. That is, there will either be no Fs
assigned or there will be one F assigned. So the total number of ways of assigning the grades so that at
most one student gets an F is obtained by adding these two numbers: 425 + 25 × 424 .

2 21. In how many ways can all of 14 different candies be distributed among Ben, Peter and Sarah if the only
marks restrictions are that Peter must receive at least 3 candies and Sarah must receive exactly twice as many
candies as Peter?
Solution: We are told that Sarah must receive exactly twice as many candies as Peter, so if Peter receives
x candies, Sarah must get 2x, and the rest must be given to Ben. Peter must receive at least 3 candies. If
Peter gets exactly 3 candies, then Sarah must get 6, leaving 14 − (3 + 6) = 5 for Ben. If Peter gets exactly
4 candies, then Sarah must get 8, leaving 14 − (4 + 8) = 2 for Ben. And now we can see that Peter cannot
receive more than 4 candies, because there aren’t enough candies for him to get 5 and Sarah to get 10.
Therefore there are just 2 possibilities: Peter gets 3, Sarah gets 6 and Ben gets 5, or Peter gets 4, Sarah
gets 8 and Ben gets 2.
To count the number of ways to distribute the 14 different candies in either of these ways, the 14 candies
need to be divided into a group for Peter, a group for Sarah and a group for Ben, so we use the multinomial
coefficient. And of course we add the number of ways for each of the two cases. So the total number of
ways of dividing up the 14 different candies so that Peter gets at least 3 and Sarah gets exactly twice as
many as Peter is    
14 14
+
3 6 5 4 8 2