Counting Principles 2008-2014 HL with MS

1a. [3 marks]
Fifteen boys and ten girls sit in a single line.
In how many ways can they be seated in a single line so that the boys and girls are in two separate
groups?
1b. [3 marks]
Two boys and three girls are selected to go the theatre. In how many ways can this selection be
made?
2a. [3 marks]
On Saturday, Alfred and Beatrice play 6 different games against each other. In each game, one of the
two wins. The probability that Alfred wins any one of these games is .

Show that the probability that Alfred wins exactly 4 of the games is .
2b. [4 marks]
(i) Explain why the total number of possible outcomes for the results of the 6 games is 64.

(ii) By expanding and choosing a suitable value for x, prove

(iii) State the meaning of this equality in the context of the 6 games played.
2c. [9 marks]
The following day Alfred and Beatrice play the 6 games again. Assume that the probability that
Alfred wins any one of these games is still .
(i) Find an expression for the probability Alfred wins 4 games on the first day and 2 on the second

day. Give your answer in the form where the values of r, s and t are to be found.
(ii) Using your answer to (c) (i) and 6 similar expressions write down the probability that Alfred
wins a total of 6 games over the two days as the sum of 7 probabilities.

(iii) Hence prove that .

2d. [6 marks]
Alfred and Beatrice play n games. Let A denote the number of games Alfred wins. The expected

value of A can be written as .

(i) Find the values of a and b.
(ii) By differentiating the expansion of , prove that the expected number of games Alfred
wins is .
3a. [3 marks]
Three boys and three girls are to sit on a bench for a photograph.
Find the number of ways this can be done if the three girls must sit together.
3b. [4 marks]
Find the number of ways this can be done if the three girls must all sit apart.
4a. [4 marks]
(i) Express the sum of the first n positive odd integers using sigma notation.
1
 (ii) Show that the sum stated above is .
(iii) Deduce the value of the difference between the sum of the first 47 positive odd integers and the
sum of the first 14 positive odd integers.
4b. [7 marks]
A number of distinct points are marked on the circumference of a circle, forming a polygon.
Diagonals are drawn by joining all pairs of non-adjacent points.
(i) Show on a diagram all diagonals if there are 5 points.

(ii) Show that the number of diagonals is if there are n points, where .
(iii) Given that there are more than one million diagonals, determine the least number of points for
which this is possible.
5. [5 marks]
Six people are to sit at a circular table. Two of the people are not to sit immediately beside each
other. Find the number of ways that the six people can be seated.
6. [4 marks]
Find the number of ways in which seven different toys can be given to three children, if the
youngest is to receive three toys and the others receive two toys each.

2
Counting Principles 2008-2014 HL MS
1a. [3 marks]
Markscheme
number of arrangements of boys is and number of arrangements of girls is (A1)

total number of arrangements is M1A1

Note: If 2 is omitted, award (A1)M1A0.
[3 marks]
Examiners report
A good number of correct answers were seen to this question, but a significant number of
candidates forgot to multiply by 2 in part (a) and in part (b) the most common error was to add the
combinations rather than multiply them.
1b. [3 marks]
Markscheme

number of ways of choosing two boys is and the number of ways of choosing three girls is

(A1)

number of ways of choosing two boys and three girls is M1A1

[3 marks]
Examiners report
A good number of correct answers were seen to this question, but a significant number of
candidates forgot to multiply by 2 in part (a) and in part (b) the most common error was to add the
combinations rather than multiply them.
2a. [3 marks]
Markscheme
(M1)

A1

A1

AG
[3 marks]
Examiners report
This question linked the binomial distribution with binomial expansion and coefficients and was
generally well done.
(a) Candidates need to be aware how to work out binomial coefficients without a calculator
2b. [4 marks]
Markscheme
(i) 2 outcomes for each of the 6 games or R1

3
 (ii) A1
Note: Accept notation or
setting x = 1 in both sides of the expression R1
Note: Do not award R1 if the right hand side is not in the correct form.

AG
(iii) the total number of outcomes = number of ways Alfred can win no games, plus the number of
ways he can win one game etc. R1
[4 marks]
Examiners report
This question linked the binomial distribution with binomial expansion and coefficients and was
generally well done.
(b) (ii) A surprising number of candidates chose to work out the values of all the binomial
coefficients (or use Pascal’s triangle) to make a total of 64 rather than simply putting 1 into the left
hand side of the expression.
2c. [9 marks]
Markscheme
(i) Let be the probability that Alfred wins x games on the first day and y on the second.

M1A1

or A1
r = 2 or 4, s = t = 6
(ii) P(Total = 6) =
P(0, 6) + P(1, 5) + P(2, 4) + P(3, 3) + P(4, 2) + P(5, 1) + P(6, 0) (M1)

A2

Note: Accept any valid sum of 7 probabilities.

(iii) use of (M1)

(can be used either here or in (c)(ii))

P(wins 6 out of 12) A1

A1

therefore AG
[9 marks]
4
 Examiners report
This question linked the binomial distribution with binomial expansion and coefficients and was
generally well done.
2d. [6 marks]
Markscheme

(i)
(a = 2, b = 3) M1A1
Note: M0A0 for a = 2, b = 3 without any method.

(ii) A1A1
(sigma notation not necessary)
(if sigma notation used also allow lower limit to be r = 0)
let x = 2 M1

multiply by 2 and divide by (M1)

AG
[6 marks]
Examiners report
This question linked the binomial distribution with binomial expansion and coefficients and was
generally well done.
(d) This was poorly done. Candidates were not able to manipulate expressions given using sigma
notation.
3a. [3 marks]
Markscheme
the three girls can sit together in 3! = 6 ways (A1)
this leaves 4 ‘objects’ to arrange so the number of ways this can be done is 4! (M1)
so the number of arrangements is A1
[3 marks]
Examiners report
Some good solutions to part (a) and certainly fewer completely correct answers to part (b). Many
candidates were able to access at least partial credit, if they were showing their reasoning.
3b. [4 marks]
Markscheme
Finding more than one position that the girls can sit (M1)
Counting exactly four positions (A1)
number of ways M1A1 N2
[4 marks]
Examiners report

5
 Some good solutions to part (a) and certainly fewer completely correct answers to part (b). Many
candidates were able to access at least partial credit, if they were showing their reasoning.
4a. [4 marks]
Markscheme

(i) (or equivalent) A1

Note: Award A0 for or equivalent.

(ii) EITHER

M1A1
OR

M1A1
OR

M1A1
THEN
AG
(iii) A1
[4 marks]
Examiners report
In part (a) (i), a large number of candidates were unable to correctly use sigma notation to express
the sum of the first n positive odd integers. Common errors included summing from 1 to n
and specifying sums with incorrect limits. Parts (a) (ii) and (iii) were generally well done.
4b. [7 marks]
Markscheme
(i) EITHER
a pentagon and five diagonals A1
OR
five diagonals (circle optional) A1
(ii) Each point joins to n – 3 other points. A1
a correct argument for R1

a correct argument for R1

(iii) attempting to solve for n. (M1)

(A1)
A1
[7 marks]
Examiners report
Parts (b) (i) and (iii) were generally well done. In part (b) (iii), many candidates unnecessarily
simplified their quadratic when direct GDC use could have been employed. A few candidates gave
as their final answer. While some candidates displayed sound reasoning in part (b) (ii),
many candidates unfortunately adopted a ‘proof by example’ approach.
5. [5 marks]
6
 Markscheme
EITHER
with no restrictions six people can be seated in ways A1
we now count the number of ways in which the two restricted people will be sitting next to each
other
call the two restricted people and
they sit next to each other in two ways A1
the remaining people can then be seated in ways A1
the six may be seated and next to each other) in ways M1
with and ( not next to each other the number of ways A1 N3
[5 marks]
OR
person seated at table in way A1
then sits in any of seats (not next to ) M1A1
the remaining people can then be seated in ways A1
number ways with not next to ways A1 N3
Note: If candidate starts with instead of , potentially leading to an answer of , do not
penalise.
[5 marks]
Examiners report
Very few candidates provided evidence of a clear strategy for solving such a question. The problem
which was set in a circular scenario was no more difficult than an analogous linear one.
6. [4 marks]
Markscheme

the number of ways of allocating presents to the first child is (A1)

multiplying by (M1)(A1)
Note: Award M1 for multiplication of combinations.

A1
[4 marks]