9709/62/F/M/19/Q7

1 Find the number of different arrangements that can be made of all 9 letters in the word CAMERAMAN
in each of the following cases.

(i) There are no restrictions. [2]

(ii) The As occupy the 1st, 5th and 9th positions. [1]
(iii) There is exactly one letter between the Ms. [4]
Three letters are selected from the 9 letters of the word CAMERAMAN.

(iv) Find the number of different selections if the three letters include exactly one M and exactly
one A. [1]
(v) Find the number of different selections if the three letters include at least one M. [3]

9709/61/M/J/19/Q8
2 Freddie has 6 t oy cars and 3 t oy buses, all different. He chooses 4 t oys t o t ake on holiday with him.

(i) In how many different ways can Freddie choose 4 toys? [1]
(ii) How many of these choices will include both his favourite car and his favourite bus? [2]
Freddie arranges these 9 toys in a line.

(iii) Find the number of possible arrangements if the buses are all next to each other. [3]
(iv) Find the number of possible arrangements if there is a car at each end of the line and no buses
are next to each other. [3]

9709/62/M/J/19/Q7
3 (a) A group of 6 teenagers go boating. There are three boats available. One boat has room for 3 people, one has
room for 2 people and one has room for 1 person. Find the number of different ways the group of 6 teenagers can be
divided between the three boats. [3]
(b) Find the number of different 7-digit numbers which can be formed from the seven digits 2, 2, 3,
7, 7, 7, 8 in each of the following cases.
(i) The odd digits are together and the even digits are together. [3]
(ii) The 2s are not together. [4]

9709/63/M/J/19/Q3
4 Mr and Mrs Keene and their 5 children all go to watch a football match, together with their friends
Mr and Mrs Uzuma and their 2 children. Find the number of ways in which all 11 people can line up
at the entrance in each of the following cases.

(i) Mr Keene stands at one end of the line and Mr Uzuma stands at the other end. [2]
(ii) The 5 Keene children all stand together and the Uzuma children both stand together. [3]
 9709/63/M/J/19/Q4
5 (i) Find the number of ways a committee of 6 people can be chosen from 8 men and 4 women if
there must be at least twice as many men as there are women on the committee. [3]
(ii) Find the number of ways a committee of 6 people can be chosen from 8 men and 4 women if 2
particular men refuse to be on the committee together. [3]
9709/61/O/N/19/Q6
6 (i) Find the number of different ways in which all 12 letters of the word STEEPLECHASE can be
arranged so that all four Es are together. [1]
(ii) Find the number of different ways in which all 12 letters of the word STEEPLECHASE can be
arranged so that the Ss are not next to each other. [4]
Four letters are selected from the 12 letters of the word STEEPLECHASE.

(iii) Find the number of different selections if the four letters include exactly one S. [4]
9709/62/O/N/19/Q7
7 (i) Find the number of different ways in which the 9 letters of the word TOADSTOOL can be
arranged so that all three Os are together and both Ts are together. [1]
(ii) Find the number of different ways in which the 9 letters of the word TOADSTOOL can be
arranged so that the Ts are not together. [4]
(iii) Find the probability that a randomly chosen arrangement of the 9 letters of the word TOADSTOOL
has a T at the beginning and a T at the end. [2]
(iv) Five letters are selected from the 9 letters of the word TOADSTOOL. Find the number of different
selections if the five letters include at least 2 Os and at least 1 T. [4]
9709/63/O/N/19/Q2
8 (i) How many different arrangements are there of the 9 letters in the word CORRIDORS? [2]
(ii) How many different arrangements are there of the 9 letters in the word CORRIDORS in which
the first letter is D and the last letter is R or O? [3]
9709/63/O/N/19/Q3
9 A sports team of 7 people is to be chosen from 6 attackers, 5 defenders and 4 midfielders. The team
must include at least 3 attackers, at least 2 defenders and at least 1 midfielder.

(i) In how many different ways can the team of 7 people be chosen? [4]
The team of 7 that is chosen travels to a match in two cars. A group of 4 travel in one car and a group
of 3 travel in the other car.

(ii) In how many different ways can the team of 7 be divided into a group of 4 and a group of 3? [2]
9709/52/F/M/20/Q1
10 The 40 members of a club include Ranuf and Saed. All 40 members will travel to a concert.
35 members will travel in a coach and the other 5 will travel in a car. Ranuf will be in the coach and
Saed will be in the car.

In how many ways can the members who will travel in the coach be chosen? [3]
9709/52/F/M/20/Q4
11 Richard has 3 blue candles, 2 red candles and 6 green candles. The candles are identical apart from
their colours. He arranges the 11 candles in a line.

(a) Find the number of different arrangements of the 11 candles if there is a red candle at each end.
[2]
(b) Find the number of different arrangements of the 11 candles if all the blue candles are together
and the red candles are not together. [4]
 9709/51/M/J/20/Q2
12 (a) Find the number of different arrangements that can be made from the 9 letters of the word
JEWELLERY in which the three Es are together and the two Ls are together. [2]

(b) Find the number of different arrangements that can be made from the 9 letters of the word
JEWELLERY in which the two Ls are not next to each other. [4]
9709/51/M/J/20/Q4
13 In a music competition, there are 8 pianists, 4 guitarists and 6 violinists. 7 of these musicians will be
selected to go through to the final.

How many different selections of 7 finalists can be made if there must be at least 2 pianists, at least
1 guitarist and more violinists than guitarists? [4]

9709/52/M/J/20/Q6
14 (a) Find the number of different ways in which the 10 letters of the word SUMMERTIME can be
arranged so that there is an E at the beginning and an E at the end. [2]
(b) Find the number of different ways in which the 10 letters of the word SUMMERTIME can be
arranged so that the Es are not together. [4]
(c) Four letters are selected from the 10 letters of the word SUMMERTIME. Find the number of
different selections if the four letters include at least one M and exactly one E. [3]
9709/53/M/J/20/Q7
15 (a) Find the number of different possible arrangements of the 9 letters in the word CELESTIAL.
[1]
(b) Find the number of different arrangements of the 9 letters in the word CELESTIAL in which the
first letter is C, the fifth letter is T and the last letter is E. [2]
(c) Find the probability that a randomly chosen arrangement of the 9 letters in the word CELESTIAL
does not have the two Es together. [4]
5 letters are selected at random from the 9 letters in the word CELESTIAL.

(d) Find the number of different selections if the 5 letters include at least one E and at most one L.
[3]
9709/51/O/N/20/Q7
16 (a) Find the number of different ways in which the 10 letters of the word SHOPKEEPER can be
arranged so that all 3 Es are together. [2]
(b) Find the number of different ways in which the 10 letters of the word SHOPKEEPER can be
arranged so that the Ps are not next to each other. [4]
(c) Find the probability that a randomly chosen arrangement of the 10 letters of the word
SHOPKEEPER has an E at the beginning and an E at the end. [2]
Four letters are selected from the 10 letters of the word SHOPKEEPER.

(d) Find the number of different selections if the four letters include exactly one P. [3]
9709/52/O/N/20/Q6
17 Mr and Mrs Ahmed with their two children, and Mr and Mrs Baker with their three children, are
visiting an activity centre together. They will divide into groups for some of the activities.

(a) In how many ways can the 9 people be divided into a group of 6 and a group of 3? [2]
5 of the 9 people are selected at random for a particular activity.

(b) Find the probability that this group of 5 people contains all 3 of the Baker children. [3]
All 9 people stand in a line.

(c) Find the number of different arrangements in which Mr Ahmed is not standing next to Mr Baker.
(d) Find the number of different arrangements in which there is exactly one person between [3]
Mr Ahmed and Mr Baker. [3]
9709/53/O/N/20/Q3
18 A committee of 6 people is to be chosen from 9 women and 5 men.

(a) Find the number of ways in which the 6 people can be chosen if there must be more women than
men on the committee. [3]
The 9 women and 5 men include a sister and brother.

(b) Find the number of ways in which the committee can be chosen if the sister and brother cannot
both be on the committee. [3]

9709/53/O/N/20/Q5
19 The 8 letters in the word RESERVED are arranged in a random order.

(a) Find the probability that the arrangement has V as the first letter and E as the last letter. [3]
(b) Find the probability that the arrangement has both Rs together given that all three Es are together.
[4]
9709/52/F/M/21/Q6
20 (a) Find the total number of different arrangements of the 11 letters in the word CATERPILLAR.
[2]
(b) Find the total number of different arrangements of the 11 letters in the word CATERPILLAR in
which there is an R at the beginning and an R at the end, and the two As are not together. [4]
(c) Find the total number of different selections of 6 letters from the 11 letters of the word
CATERPILLAR that contain both Rs and at least one A and at least one L. [4]

9709/51/M/J/21/Q1
21 A bag contains 12 marbles, each of a different size. 8 of the marbles are red and 4 of the marbles are
blue.

How many different selections of 5 marbles contain at least 4 marbles of the same colour? [4]

9709/51/M/J/21/Q3
22 (a) How many different arrangements are there of the 8 letters in the word RELEASED? [1]
(b) How many different arrangements are there of the 8 letters in the word RELEASED in which the
letters LED appear together in that order? [3]
(c) An arrangement of the 8 letters in the word RELEASED is chosen at random.

Find the probability that the letters A and D are not together. [4]

9709/52/M/J/21/Q6
23 (a) Find the total number of different arrangements of the 8 letters in the word TOMORROW. [2]
(b) Find the total number of different arrangements of the 8 letters in the word TOMORROW that
have an R at the beginning and an R at the end, and in which the three Os are not all together.
Four letters are selected at random from the 8 letters of the word TOMORROW. [3]

(c) Find the probability that the selection contains at least one O and at least one R. [5]

9709/53/M/J/21/Q6
24 (a) How many different arrangements are there of the 11 letters in the word REQUIREMENT? [2]
(b) How many different arrangements are there of the 11 letters in the word REQUIREMENT in
which the two Rs are together and the three Es are together? [1]
(c) How many different arrangements are there of the 11 letters in the word REQUIREMENT in
which there are exactly three letters between the two Rs? [3]
 Five of the 11 letters in the word REQUIREMENT are selected.

(d) How many possible selections contain at least two Es and at least one R? [4]
9709/52/O/N/21/Q2
25 A group of 6 people is to be chosen from 4 men and 11 women.

(a) In how many different ways can a group of 6 be chosen if it must contain exactly 1 man? [2]
Two of the 11 women are sisters Jane and Kate.

(b) In how many different ways can a group of 6 be chosen if Jane and Kate cannot both be in the
group? [3]

9709/53/O/N/21/Q5
26 A security code consists of 2 letters followed by a 4-digit number. The letters are chosen from
{A, B, C, D, E} and the digits are chosen from {1, 2, 3, 4, 5, 6, 7}. No letter or digit may appear more
than once. An example of a code is BE3216.

(a) How many different codes can be formed? [2]

(b) Find the number of different codes that include the letter A or the digit 5 or both. [3]
A security code is formed at random.

(c) Find the probability that the code is DE followed by a number between 4500 and 5000. [3]
9709/52/F/M/22/Q5
27 A group of 12 people consists of 3 boys, 4 girls and 5 adults.

(a) In how many ways can a team of 5 people be chosen from the group if exactly one adult is
included? [2]
(b) In how many ways can a team of 5 people be chosen from the group if the team includes at least
2 boys and at least 1 girl? [4]
The same group of 12 people stand in a line.

(c) How many different arrangements are there in which the 3 boys stand together and an adult is at
each end of the line? [4]

9709/51/M/J/22/Q1
28 (a) Find the number of different arrangements of the 8 letters in the word DECEIVED in which all
three Es are together and the two Ds are together. [2]
(b) Find the number of different arrangements of the 8 letters in the word DECEIVED in which the
three Es are not all together. [4]

9709/51/M/J/22/Q2
29 There are 6 men and 8 women in a Book Club. The committee of the club consists of five of its
members. Mr Lan and Mrs Lan are members of the club.

(a) In how many different ways can the committee be selected if exactly one of Mr Lan and Mrs Lan
must be on the committee? [2]
(b) In how many different ways can the committee be selected if Mrs Lan must be on the committee
and there must be more women than men on the committee? [4]

9709/52/M/J/22/Q6
30 (a) Find the number of different arrangements of the 9 letters in the word CROCODILE. [1]
(b) Find the number of different arrangements of the 9 letters in the word CROCODILE in which
there is a C at each end and the two Os are not together. [3]
 (c) Four letters are selected from the 9 letters in the word CROCODILE.

Find the number of selections in which the number of Cs is not the same as the number of Os.
[3]
(d) Find the number of ways in which the 9 letters in the word CROCODILE can be divided into
three groups, each containing three letters, if the two Cs must be in different groups. [3]
9709/53/M/J/22/Q7
31 A group of 15 friends visit an adventure park. The group consists of four families.
• Mr and Mrs Kenny and their four children
• Mr and Mrs Lizo and their three children
• Mrs Martin and her child
• Mr and Mrs Nantes

The group travel to the park in three cars, one containing 6 people, one containing 5 people and one
containing 4 people. The cars are driven by Mr Lizo, Mrs Martin and Mr Nantes respectively.

(a) In how many different ways can the remaining 12 members of the group be divided between the
three cars? [3]
The group enter the park by walking through a gate one at a time.

(b) In how many different orders can the 15 friends go through the gate if Mr Lizo goes first and
each family stays together? [3]
In the park, the group enter a competition which requires a team of 4 adults and 3 children.

(c) In how many ways can the team be chosen from the group of 15 so that the 3 children are all
from different families? [2]
(d) In how many ways can the team be chosen so that at least one of Mr Kenny or Mr Lizo is
included? [3]

9709/51/O/N/22/Q6
32 A Social Club has 15 members, of whom 8 are men and 7 are women. The committee of the club
consists of 5 of its members.

(a) Find the number of different ways in which the committee can be formed from the 15 members
if it must include more men than women. [4]
The 15 members are having their photograph taken. They stand in three rows, with 3 people in the
front row, 5 people in the middle row and 7 people in the back row.

(b) In how many different ways can the 15 members of the club be divided into a group of 3, a group
of 5 and a group of 7? [3]
In one photograph Abel, Betty, Cally, Doug, Eve, Freya and Gino are the 7 members in the back row.

(c) In how many different ways can these 7 members be arranged so that Abel and Betty are next to
each other and Freya and Gino are not next to each other? [3]

9709/52/O/N/22/Q7
33 (a) Find the number of different arrangements of the 9 letters in the word ALLIGATOR in which the
two As are together and the two Ls are together. [2]
(b) The 9 letters in the word ALLIGATOR are arranged in a random order.

Find the probability that the two Ls are together and there are exactly 6 letters between the
two As. [5]
(c) Find the number of different selections of 5 letters from the 9 letters in the word ALLIGATOR
which contain at least one A and at most one L. [3]
9709/53/O/N/22/Q6
34 (a) Find the number of different arrangements of the 9 letters in the word ACTIVATED. [2]
(b) Find the number of different arrangements of the 9 letters in the word ACTIVATED in which
there are at least 5 letters between the two As. [3]
Five letters are selected at random from the 9 letters in the word ACTIVATED.

(c) Find the probability that the selection does not contain more Ts than As. [5]

9709/52/F/M/23/Q7
35 (a) Find the number of different arrangements of the 9 letters in the word DELIVERED in which the
three Es are together and the two Ds are not next to each other. [4]
(b) Find the probability that a randomly chosen arrangement of the 9 letters in the word DELIVERED
has exactly 4 letters between the two Ds. [5]
Five letters are selected from the 9 letters in the word DELIVERED.

(c) Find the number of different selections if the 5 letters include at least one D and at least one E.
[3]
9709/51/M/J/23/Q2
36 (a) Find the number of ways in which a committee of 6 people can be chosen from 6 men and
8 women if it must include 3 men and 3 women. [2]
A different committee of 6 people is to be chosen from 6 men and 8 women. Three of the 6 men are
brothers.

(b) Find the number of ways in which this committee can be chosen if there are no restrictions on
the numbers of men and women, but it must include no more than two of the brothers. [3]
9709/51/M/J/23/Q3
37 (a) Find the number of different arrangements of the 8 letters in the word COCOONED. [1]
(b) Find the number of different arrangements of the 8 letters in the word COCOONED in which the
first letter is O and the last letter is N. [2]
(c) Find the probability that a randomly chosen arrangement of the 8 letters in the word COCOONED
has all three Os together given that the two Cs are next to each other. [3]
9709/52/M/J/23/Q6
38 In a group of 25 people there are 6 swimmers, 8 cyclists and 11 runners. Each person competes in only
one of these sports. A team of 7 people is selected from these 25 people to take part in a competition.

(a) Find the number of different ways in which the team of 7 can be selected if it consists of exactly
1 swimmer, at least 4 cyclists and at most 2 runners. [4]
For another competition, a team of 9 people consists of 2 swimmers, 3 cyclists and 4 runners. The
team members stand in a line for a photograph.

(b) How many different arrangements are there of the 9 people if the swimmers stand together, the
cyclists stand together and the runners stand together? [2]
(c) How many different arrangements are there of the 9 people if none of the cyclists stand next to
each other? [4]

9709/53/M/J/23/Q7
39 (a) Find the number of different arrangements of the 10 letters in the word CASABLANCA in which
the two Cs are not together. [3]
(b) Find the number of different arrangements of the 10 letters in the word CASABLANCA which
have an A at the beginning, an A at the end and exactly 3 letters between the 2 Cs. [3]
Five letters are selected from the 10 letters in the word CASABLANCA.

(c) Find the number of different selections in which the five letters include at least two As and at
most one C. [3]
40 9709/51/O/N/23/Q6

Table X Table Y

In a restaurant, the tables are rectangular. Each table seats four people: two along each of the longer
sides of the table (see diagram). Eight friends have booked two tables, X and Y . Rajid, Sue and Tan
are three of these friends.

(a) The eight friends will be divided into two groups of 4, one group for table X and one group for
table Y .

Find the number of ways in which this can be done if Rajid and Sue must sit at the same table as
each other and Tan must sit at the other table. [3]
When the friends arrive at the restaurant, Rajid and Sue now decide to sit at table X on the same side
as each other. Tan decides that he does not mind at which table he sits.

(b) Find the number of different seating arrangements for the 8 friends. [3]
As they leave the restaurant, the 8 friends stand in a line for a photograph.

(c) Find the number of different arrangements if Rajid and Sue stand next to each other, but neither
is at an end of the line. [4]

9709/52/O/N/23/Q7
41 (a) Find the number of different arrangements of the 9 letters in the word ANDROMEDA in which
no consonant is next to another consonant. (The letters D, M, N and R are consonants and the
letters A, E and O are not consonants.) [3]
(b) Find the number of different arrangements of the 9 letters in the word ANDROMEDA in which
there is an A at each end and the Ds are not together. [3]
Four letters are selected at random from the 9 letters in the word ANDROMEDA.

(c) Find the probability that this selection contains at least one D and exactly one A. [4]

9709/53/O/N/23/Q6
42 Jai and his wife Kaz are having a party. Jai has invited five friends and each friend will bring his wife.

(a) At the beginning of the party, the 12 people will stand in a line for a photograph.
(i) How many different arrangements are there of the 12 people if Jai stands next to Kaz and
each friend stands next to his own wife? [3]
(ii) How many different arrangements are there of the 12 people if Jai and Kaz occupy the two
middle positions in the line, with Jai’s five friends on one side and the five wives of the
friends on the other side? [2]
(b) For a competition during the party, the 12 people are divided at random into a group of 5, a group
of 4 and a group of 3.

Find the probability that Jai and Kaz are in the same group as each other. [5]
1(i) 9! M1 9! alone on numerator, 2! and/or 3! on denominator
2!3!

= 30240 A1 Exact value, final answer

(ii) A^^^A^^^A B1 Final answer

6!
Arrangements = . 360
2!

(iii) M^M^^^^^^ M1 7! in numerator, (considering letters not M)

7!
= ×7
3!

M1 Division by 3! only (removing repeated As)

M1 Multiply by 7 (positions of M-M)

= 5880 A1 Exact value, final answer

Method 2 (choosing letter between Ms)

6! 6! M1 6! in sum of 2 expressions . 6! + 6!
1× ×7 4× ×7
2! 3!

M1 Multiply by 7 in both expressions (positions of M-M)

= 2520 + 3360 M1
seen (removing repeated As)
2! 3!

= 5880 A1 Exact value

(iii) Method 3

(MAM) ^ ^ ^ ^ ^ ^ = 7!/2! = 2520 M1 7! in numerator (considering 6 letters + block)

(MA’M) ^ ^ ^ ^ ^ ^ = 7!/3! × 4 = 840 × 4 = 3360 M1 Division by 2! and 3! seen in different terms

Total = 2520 + 3360 M1 Summing 5 correct scenarios only

= 5880 A1 Exact value

(iv) M A ^ = 4C1 = 4 B1 Final answer

(v) M ^ ^ : 4C2 = 6 M1 Either option M M ^ or M ^ ^ correct, accept unsimplified

M M ^ : 4C1 = 4

MMA: =1 M1 Add 4 or 5 correct scenarios only

MAA: =1
(M A _ :4C1 = 4)

Total = 16 A1 Value must be clearly stated

Method 2

M M ^ = 5C1 =5 M1 Either option M M ^ or M ^ ^ correct, accept unsimplified

M ^ ^ = 5C2 = 10 M1 Adding 2 or 3 correct scenarios only

MAA= =1 Total = 16 A1 Value must be clearly stated

3
 9
2(i) C4 =) 126 B1

1
7 7
(ii) C2 B1 Cx or yC2 (implied by correct answer) or 7Px or 7Py, seen alone

= 21 B1 correct answer

iii C1 (B1 B2 B3 ) C2 _ C3 _ C4 _ C5 _ C6 B1 3! or 6! seen alone or multiplied by k > 1 need not be an integer

3! × 6! × 7 B1 3! and 6! seen multiplied by k > 1, integer, no division

= 30240 B1 Exact value

Alternative method for question 8(iii)

C1 (B1 B2 B3 ) C2 C3 C4 C5 C6 B1 3! or 7! seen alone or multiplied by k > 1 need not be an integer

3! × 7! B1 3! and 7! seen multiplied by k > or = 1, no division

= 30240 B1 Exact value

(iv) C1 _ C2 _ C3 _ C4 _ C5 _C6 B1 6! or 4! X 6P2 seen alone or multiplied by k > 1, no division

(arrangements of cars)

6! × 5P3 or 6! × 5 × 4 × 3 or 6! x 3! x10 B1 Multiply by 5P3 oe i.e. putting Bs in between 4 of the Cs

OR multiply by 3! x n where n = 7, 8, 9, 10 (number of options)

= 43200 B1 Correct answer

3
 3(a) 6
C3 × 3C2 × 1C1 M1 6
Ca × 6–aCb × 6–a–bC6–a–b seen oe 6–a–bC6–a–b can be implied by 1 or omission,
condone use of permutations,

= 20 × 3 A1 Any correct method seen no addition/additional scenarios

= 60 A1 Correct answer

Alternative method for question 7(a)

6
6
P6 6! M1 P6 / (nPn x k) with 3 ⩾ n > 1and 6 ⩾ k an integer ⩾ 1, not 6!/1
3 2 1
=
P3 × P2 × P1 3!× 2!
A1 Correct method with no additional terms

= 60 A1 Correct answer

(b)(i) 4! 3! M1 A single expression with either 4!/3! × k or 3!/2! × k, k a positive integer

× ×2
3! 2! seen oe (condone 2 identical expressions being added)

M1 Correctly multiplying their single expression by 2 or 2 identical

expressions being added.

= 24 A1 Correct answer

3
(b)(ii) 7! B1 Accept unsimplified
Total no of arrangements = = 420 (A)
2!3!

6! B1 Accept unsimplified
No with 2s together = = 120 (B)
3!

With 2s not together: their (A) – their (B) M1 Subtraction indicated, possibly by their answer, no additional terms
present

= 300 ways A1 Exact value www

Alternative method for question 7(b)(ii)

3_7_7_7_8_

5! 6 × 5 B1 k x 5! in numerator, k a positive integer

×
3! 2
B1 m x 3! In denominator, m a positive integer

M1 Their 5!/3! multiplied by 6C2 only (no additional terms)

= 300 ways A1 Exact value www

4(i) 9! × 2 B1 9! seen multiplied by k ⩾ 1, no addition

= 725760 B1 Exact value

(ii) (K1K2K3K4K5) A A A (U1U2) A B1 2! or 5! seen mult by k > 1, no addition (arranging Us or Ks)

= 5! × 2! × 6! B1 6! Seen mult by k > 1, no addition (arranging AAAAKU)

= 172800 B1 Exact value

3
5(i) M(8) W(4) B1 One unsimplified product correct
4 2 in 8C4 × 4C2 = 420 ways
5 1 in 8C5 × 4C1 = 224 ways
6 0 in 8C6 × 4C0 = 28 ways

M1 Summing the number of ways for 2 or 3 correct scenarios (can be

unsimplified), no incorrect scenarios

Total 672 ways A1 Correct answer

(ii) Total number of selections = 12C6 = 924 (A) M1 12

Cx – (subtraction seen), accept unsimplified

Selections with males together = 10C4 = 210 (B) A1 Correct unsimplified expression

Total = (A) – (B) = 714 A1 Correct answer

Alternative method for question 4(ii)

10
No males + Only male 1 + Only male 2 M1 Cx + 2 x 10Cy , x ≠ y seen, accept unsimplified
= 10C6 + 10C5 + 10C5

= 210 + 252 + 252 A1 Correct unsimplified expression

= 714 A1 Correct answer

Alternative method for question 4(ii)

Pool without male 1 + Pool without male 2 – Pool without either M1 2 x 11Cx – 10Cx
male

= 11C6 + 11C6 – 10C6 A1 Correct unsimplified expression

= 462 + 462 – 210

= 714 A1 Correct answer

3
6(i) 9! B1 Exact value
= 181 440
2!

(ii) 12! B1 Accept unevaluated

Total no of ways = = 9 979 200 (A)
2!4!

11! B1 Accept unevaluated

With Ss together = = 1 663 200 (B)
4!

With Ss not together = (B) – (A) M1 12! 8!

Correct or − , m, n integers > 1
m n
or their identified total – their identified Ss together

8 316 000 A1 Exact value

Alternative method for question 6(ii)

_T_E_E_P_L_E_C_H_A_E_ B1 10! × k in numerator k integer ⩾ 1

10! 11×10 B1 4! × k in numerator k integer ⩾ 1

×
4! 2!

their 10! 11 M1 OE
× C2 or 11P2
their 4!

8 316 000 A1 Exact value

4
6
(iii) SEEE:1 M1 Cx seen alone or times K > 1
6
SEE_: 6
C1 = 6 B1 C3 or 6C2 or 6C1 alone
6
SE__: C2 = 15
6
S___: C3 = 20

Add 3 or 4 correct scenarios M1 No extras

Total = 42 A1

4
7(i) 6! = 720 B1 Evaluated

(ii) 9! B1 Accept unevaluated

Total no of arrangements: = 30240
2!3!

8! B1 Accept unevaluated
No with Ts together = = 6720
3!

With Ts not together: 30 240 – 6720 M1 9! 8!

correct or − , m, n integers > 1
m n
or their identified total – their identified Ts together

23 520 A1 CAO

Alternative method for question 7(ii)

7! 8 × 7 B1 7! × (k > 0) in numerator, cannot be implied by 7P2, etc.

×
3! 2

B1 3! × (k > 0) in denominator

M1 their 7!
× 8C2 or 8P2
their 3!

23 520 A1 CAO

(iii) 7! M1 their identified number of arrangements with T at ends

Number of arrangements =
3! their identified total number of arrangements
7! 7!
their
3! = 840
Probability =
9! 30240 or m m, n integers > 1
their 9!
3!2! n

1 A1 Final answer
or 0.0278
36

2
 4
(iv) OOT_ _ 4
C2 = 6 M1 Cx seen alone or 4Cx x k ≥1, k an integer, 0< x <4
4
OOTT_ C1 = 4 4
OOOT_ 4
C1 = 4 A1 C2 x k, k = 1 oe or 4C1 x m, m = 1 oe alone
OOOTT

M1 Add 3 or 4 identified correct scenarios only, accept unsimplified

(Total) = 15 A1 CAO, WWW

Only dependent on 2nd M mark

8(i) 9! B1 9! Divided by at least one of 2! or 3!

= 30240
2!3!

B1 Exact value

(ii) 7! B1 7! Seen alone or as numerator in a term, can be multiplied

D _ _ _ _ _ _ _ R: = 1260 not + or –
2!2!
7!
D _ _ _ _ _ _ _ O: = 840
3!

B1 One term correct, unsimplified

Total = 2100 B1 Final answer

3
9(i) 3A 2D 2M : 6C3 × 5C2 × 4C2 (= 1200) M1 6
Cx × 5Cy × 4Cz, x + y + z = 7
4A 2D 1M : 6C4 × 5C2 × 4C1 (= 600)
3A 3D 1M : 6C3 × 5C3 × 4C1 (= 800)

A1 2 correct products, allow unsimplified

M1 Summing their totals for 3 correct scenarios only

Total = 2600 A1 Correct answer

SC1 6C3 × 5C2 × 4C1 × 9C1 = 7200

4
7
(ii) 7
C4 × 1 B1 C3 or 7C4 seen anywhere

35 B1

38
10 Cr or nC34 M1 Either expression seen OE, no other terms, condone x1
38
C34 A1 Correct unsimplified OE

73815 A1 If M0, SCB1 38C34 x k, k an integer

3
11(a) R^^^^^^^^^R M1 9! Alone on numerator,
9! 3! × k or 6! × k on denominator
3!6!

= 84 A1

(b) ^ (B B B) ^ ^ ^ ^ ^ M1 7!
× k or 7k seen, k an integer > 0
6!

7! 8× 7 M1 m × n ( n –1) or m × nC2 or m × n P2 , n=7, 8 or 9, m an integer > 0

×
6! 2

M1 n = 8 used in above expression

= 196 A1

Alternative for question 4(b)

[Arrangements, blues together – Arrangements with blues M1 9! Seen alone or as numerator with subtraction
together and reds together =]
9! 8!
−
2!6! 6!

= [252 – 56] M1 8! Seen alone or as numerator in a second term and no other

terms

M1 All terms divided by 6! x k, k an integer

= 196 A1

4
12(a
)(a) M1

720 A1

(b) 9! M1
Total number: ( 30240 )
3!2!

8! M1
Number with Ls together = ( 6720 )
3!

9! 8! M1
Number with Ls not together = −
3!2! 3!
= 30 240 – 6720

23 520 A1

Alternative method for question 2(b)

7! 8× 7
×
3! 2

7! × k in numerator, k integer ≥ 1 M1

8 × 7 × m in numerator or 8C2 × m, m integer ≥ 1 M1

3! in denominator M1

23 520 A1

4
13 Scenarios: M1
8
2P 3V 2G C2 × 4C2 × 6C3 = 28 × 6 × 20 = 3360
8
2P 4V 1G C2 × 4C1 × 6C4 = 28 × 4 × 15 = 1680
8
3P 3V 1G C3 × 4C1 × 6C3 = 56 × 4 × 20 = 4480
8
4P 2V 1G C4 × 4C1 × 6C2 = 70 × 4 × 15 = 4200
(M1 for Cr × Cr × 6Cr with ∑ = 7)
8 4

Two unsimplified products correct B1

Summing the number of ways for 3 or 4 correct scenarios M1

Total: 13 720 A1

4
14(a) 8! M1
3!

6720 A1

(b) 10! B1
Total number = ( 302400 ) (A)
2!3!

9! B1
With Es together = ( 60480 ) ( B)
3!

Es not together = their (A) – their (B) M1

241920 A1

Alternative method for question 6(b)

_^_^_^_^_^_^_^_^_
8! 9 × 8
×
3! 2

8! × k in numerator, k integer ≥ 1, denominator ≥ 1 B1

3! × m in denominator, m integer ≥ 1 B1

8! M1
Their Multiplied by 9C2 (OE) only (no additional terms)
3!

241920 A1

(c) Scenar M1
5
EMMM C0 = 1
5
EMM_ C1 = 5
5
EM__ C2 = 10

Summing the number of ways for 2 or 3 correct scenarios M1

Total = 16 A1
15(a) 9! B1
= 90 720
2!2!

(b) 6! M1
2!

360 A1

(c) 8! M1
2 Es together = ( = 20160 )
2!

Es not together = 90720 – 20160 = 70560 M1

70560 M1
Probability =
90720

7 A1
or 0.778
9

Alternative method for question 7(c)

_^_^_^_^_^_^_^_

7! 8× 7
× = 70560
2! 2

7! × k in numerator, k integer ⩾ 1, denominator ⩾ 1 M1

Multiplying by 8C2 OE M1

70560 M1
Probability =
90720

7 A1
or 0.778
9

4
 (d) Scenar are: M1
E L _ _ _ 5C3 10
E E L _ _ 5C2 10
E _ _ _ _ 5C4 5
E E _ _ _ 5C3 10

Summing the number of ways for 3 or 4 correct scenarios M1

Total = 35 A1

16(a) 8! M1 8! 7!× 8 a!
≡ , where k ∈ , , where a ∈ 
2! k k 2 (!)

20160 A1

(b) 10! B1 Accept unsimplified

Total number of ways: ( = 302 400 ) (A)
2!3!

9! B1 Accept unsimplified
With Ps together: (= 60 480) (B)
3!

With Ps not together: 302 400 – 60 480 M1 10! 9!

− , m, n integers or (A) – (B) if clearly identified
m n

241 920 A1

Alternative method for question 7(b)

8! B1 k × 8! in numerator, k a positive integer, no ±

3!
B1 m × 3! in denominator, m a positive integer, no ±

9×8 M1 8!
× Their multiplied by 9C2 or 9P2 no additional terms
2 3!

241 920 A1 Exact value, WWW

4
(c) Number of ways Es at beginning and end M1  8! 
Probability =  
Total number of ways  k !  1 ⩽ k, l ∈ ℕ ⩽ 3, FT denominator from 7(b) or correct
8! 10!
20160 k !l !
Probability = 2! =
10! 302 400
2!× 3!

1 A1
, 0·0667
15

Alternative method for question 7(c)

3 2 M1 a a −1
Probability = × × a = 3, 2
10 9 10 9

1 A1
, 0·0667
15

Alternative method for question 7(c)

1 1 M1 1 1
Probability = × × 3! × × m!, m = 3, 2
10 9 10 9

1 A1
, 0.0667
15

(d) Scenar M1 5
Cx seen alone, 1 ⩽ x ⩽ 4
5
PEEE C0 = 1
PEE_ 5
C1 = 5 M1 Summing the number of ways for 3 or 4 correct scenarios (can
PE__ 5
C2 = 10 be unsimplified), no incorrect scenarios
5
P___ C3 = 10

Total = 26 A1

3
 9
17(a) C6 (× 3C3) M1 9
Ck × n, k = 6, 3, n = 1,2 oe
Condone 9C6 + 3C3, 9P6 × 3P3

84 A1 Accept unevaluated.

(b) Number with 3 Baker children = 6C2 or 15 B1 Correct seen anywhere, not multiplied or added

Total no of selections = 9C5 or 126 M1 Seen as denominator of fraction

number of selections with 3 Baker children
Probability =
total number of selections

15 A1 5
, 0·119 OE, e.g.
126 42

Alternative method for question 6(b)

5
3 2 1  6  5  5 B1 C3 (OE) or 10 seen anywhere, multiplied by fractions only, not
× ×  ×  ×  × C3 added
9 8 7  6  5 
M1 3 2  6  5 
× ×  ×  ×  × k , 1 ⩽ k, k integer
9 8 7  6  5 

15 A1 5
, 0·119 OE, e.g.
126 42

3
(c) [Total no of arrangements = 9!] M1 9! – k or 362880 – k, k an integer<362 880
[Arrangements with men together = 8! × 2]

Not together: 9! –

8! × 2 B1 8! × 2(!) or 80 640 seen anywhere

282 240 A1 Exact value

Alternative method for question 6(c)

7! × 8 × 7 B1 7! × k, k positive integer > 1

M1 m × 8 × 7, m × 8P2, m × 8C2 m positive integer > 1

282 240 A1 Exact value

(d) 7! × 2 × 7 M1 7! × k, k positive integer > 1

If 7! not seen, condone 7 × 6 × 5 × 4 × 3 × 2 × (1) × k
or 7 × 6! × k only

M1 m × 2 × 7, m positive integer > 1

70 560 A1

3
18(a) Scenar M1 Correct number of ways for either 5 or 4 women, accept
6W 0M 9C6 = 84 unsimplified
5W 1M 9C5 × 5C1 = 126 × 5 = 630
4W 2M 9C4 × 5C2 = 126 × 10 = 1260 M1 Summing the number of ways for 2 or 3 correct scenarios (can
be unsimplified), no incorrect scenarios.

Total = 1974 A1

b) Total number of ways = 14C6 (3003) M1 14

C6 – a value
Number with sister and brother = 12C4 (495)
Number required = 14C6 –
12 12
C4 = 3003 – 495 M1 Cx or nC4 seen on its own or subtracted from their total, x ⩽ 6,
n ⩽ 13

2508 A1

Alternative method for question 3(b)

Number of ways with neither = 12C6 = 924 M1 12

C6 + a value

Number of ways with either brother or sister (not both) M1 12

Cx × 2 or nC5 × 2 seen on its own or added to their number of
= 12C5 × 2 (= 792 × 2) = 1584 ways with neither, x ⩽ 5, n ⩽ 12

Number required = 924 + 1584 A1

= 2508

3
19(a) 8! B1 Correct unsimplified expression for total number of ways
Total number of ways = (= 3360)
3!2!

6! B1 6!
Number of ways with V and E in correct positions = (= 180) alone or as numerator in an attempt to find the number of
2!× 2! 2!× 2!
ways with V and E in correct positions.
No ×, ±

180  3  B1 FT 6!
Probability =  =  or 0.0536 Final answer from their divided by their total number of
3360  56  2!× 2!
ways

Alternative method for question 5(a)

1 3 M1 a b
× × seen, no other terms (correct denominators)
8 7 8 7

M1 1 3
× seen, no other terms (correct numerators)
c d

3 A1
or 0.0536
56

3
(b) Rs together and Es together: 5! (120) B1 Alone or as numerator of probability to represent the number of
ways with Rs and Es together, no ×, +, –

6! B1 Alone or as denominator of probability to represent the number

Es together: ( = 360 ) of ways with Es together, no ×, + or –
2!

5! M1 their 5!
Probability = seen
6! 6!
their
2! 2!

1 A1 OE
3

Alternative method for question 5(b)

5!  1  B1
P(Rs together and Es together): = 
their total number of ways  28 

6!  3  B1 Alone or as numerator of probability to represent the

P(Es together): =  P(Rs and Es together), no ×, +, –
2!  28 
their total number of ways

1 M1 Alone or as denominator of probability to represent the

P(Es together), no ×, + or –
Probability = 28
3
28

1 A1 1
their
3 OE, 28 seen
3
their
28

20(a) 11! M1 11! alone as numerator.

2!2!2! 2! × m! × n! on denominator, m = 1, 2, n = 1, 2.
no additional terms, no additional operations.

4989600 A1 Exact answer only.

2
(b) Method 1 R ^ ^ ^ ^ ^ ^ ^ R

7! B1 7!
Arrange the 7 letters CTEPILL = × k seen, k an integer > 1.
2! 2!
8
Number of ways of placing As in non-adjacent places = C2
7! 8
M1 m× n( n −1) or m× nC2 or m× nP2 , n = 7, 8 or 9, m an
× C2
2! integer > 1.

M1 7! 8 7! 8 , p integer ⩾ 1, condone 2520×28.

× C 2 or × P2
p! p!

= 70560 A1 Exact answer only.

SC B1 70560 from M0, M1 only.

Method 2 [Arrangements Rs at ends – Arrangements Rs at ends and As together]

9! M1 9!
Total arrangements with R at beg. and end = – k, 90720 > k integer > 1, m = 1, 2.
2!2! 2!m !
8!
Arrangements with R at ends and As together = B1 8!
2! s– , s an integer >1
9! 8! 2!
With As not together = −
2!2! 2!
M1 9 ! 8 ! , p, q integers ⩾ 1, condone 90720 – 20160.
−
p q

[90720 – 20160] = 70560 A1 Exact answer only.

SC B1 70560 from M0, M1 only.

4
(c) Method 1
5 5
RRAL__ C2 = 10 M1 Cx seen alone or 5Cx × k, 2⩾ k ⩾ 1, k an integer, 0 < x < 5
5
RRALL_ C1 =5 linked to an appropriate scenario.
5
RRAAL_ C1 =5
5
RRAALL =1 A1 C2 × k, k = 1 oe or 5C1 × m, m = 1,2 oe alone.
SC if 5Cx not seen.
B2 for 5 or 10 linked to the appropriate scenario WWW.

M1 Add outcomes from 3 or 4 identified correct scenarios only,

accept unsimplified.
2
Cw × 2Cx × 2Cy × 5Cz, w+x+y+z=6 identifies w Rs, × As and
y Ls.

[Total =] 21 A1 WWW, only dependent on 2nd M mark.

Note: 5C2 + 5C1 + 5C1 + 1 = 21 is sufficient for 4/4.

SC not all (or no) scenarios identified.

B1 10 + 5 + 5 + 1
DB1 = 21

Method 2 – Fixing RRAL first.

N.B. No other scenarios can be present anywhere in solution.

R R A L ^ ^ = 7C2 M1 7
Cx seen alone or 7Cx × k, 2⩾ k⩾ 1, k an integer, 0<x<7.
Condone 7Px or 7Px × k, 2⩾ k⩾ 1, k an integer, 0<x<7.
7
M1 C2 × k, 2⩾ k⩾ 1oe
7
A1 C2 × k, k = 1oe no other terms.

[Total =] 21 A1 Value stated.

4
21 RRRRB 8C4 × 4C1 = 280 M1 8
Cx × 4Cy with x + y = 5. x, y both integers, 1 ⩽ x ⩽ 5,
BBBBR 8C1 × 4C4 = 8 0 ⩽ y ⩽ 4 condone 8C1 × 1
RRRRR 8C5 = 56
A1 Two correct outcomes evaluated

M1 Add 2 or 3 identified correct scenarios only (no

additional terms, not probabilities)

[Total =] 344 A1 WWW, only dependent on 2nd M mark

4 SC not all (or no) scenarios identified

B1 280 + 8 + 56 DB1 344

22(a)  8! B1 NFWW, must be evaluated

 3! = 6720
 

(b) 6! M1 6! 5!x6
_ _ _ L E D _ _ : With LED together: or k ⩾ 1 and no other terms
2! k k

M1 m
, m an integer, m ⩾ 5
2!

360 A1 CAO

3
(c) Method using _ _ _ A _ D _ _ : *M1 6!
× k seen, k an integer > 0
6! 3!
Arrange the 6 letters RELESE = [= 120]
3!

Multiply by number of ways of placing AD in non-adjacent places *M1 m × n ( n −1) or m × nC2 or m × n P2 , n = 6, 7 or 8, m an

= their 120 × 7P2 [= 5040]
integer > 0

their 5040 DM1 Denominator = their (a) or correct, dependent on at least

[Probability =] one M mark already gained.
their 6720

5040 3 A1
or or 0.75
6720 4

Alternative method for Question 3(c)

Method using ‘Total arrangements – Arrangements with A and D *M1 Their 6720 – k, k a positive integer
together’:
7!×2 *M1 7!× k
Their 6720 – [= 5040] ( m −) , k = 1, 2
3! 3!

their 5040 DM1 With denominator = their (a) or correct, dependent on at

[Probability =] least one M mark already gained.
their 6720

5040 3 A1
or or 0.75
6720 4

Alternative method for Question 3(c)

Method using ‘1 – Probability of arrangements with A and D together’: *M1 7!× k

, k = 1, 2
7!×2 3!
[= 1680]
3!

their 1680 *M1 With denominator = their (a) or correct

[Probability =]
their 6720

their 1680 DM1 1 – m, 0 < m < 1 , dependent on at least one M mark

1– already gained
their 6720

5040 3 A1
or or 0.75
6720 4

4
23(a) 8! M1 8!
k = 1 or 2, m = 1 or 3, not k = m = 1
2!3! k !× m!
no additional terms

3360 A1

(b) Method 1 Arrangements Rs at ends – Arrangements Rs at ends and Os together

6! M1 6!  6! 
[Os not together = ] – 4! – m, 1 ⩽ k ⩽ 3, m an integer, condone 2 ×   − m .
3! k!  k!

M1 w – 4! or w – 24, w an integer
Condone w – 2 × 4!

96 A1

Method 2 identified scenarios R _ _ _ R, Arrangement No Os together + 2Os and a single O

4
C3 × 3! + 4C2 × 2 × 3! M1 4C3 × 3! + r or 4× 3! + r or 4P3 × 3! + r, r an integer.
Condone 2 × 4C3 × 3! + r. 2 × 4× 3! + r or 2 × 4P3 × 3! + r.

M1 q + 4C2 × 3! × k or q + 4P2 × 3! × k, k = 1,2, q an integer

[24 + 72 =] 96 A1

(c) Method 1 Identified scenarios

OORR 3
C 2 × 2 C 2 ×  3 C0  = 3×1 = 3 B1 Outcomes for 2 identifiable scenarios correct, accept
unsimplified.
3
ORR_ C1 × 2 C 2 × 3 C1 = 3×1× 3 = 9
OOR_ 3
C 2 × 2 C1 × 3 C1 = 3× 2 × 3 = 18 M1 Add 4 or 5 identified correct scenarios only values, no additional
incorrect scenarios, no repeated scenarios, accept unsimplified,
3
OR_ _ C1 × 2 C1 × 3 C 2 = 3× 2 × 3 = 18 condone use of permutations.
OOOR 3 C3 × 2 C1 ×  3 C0  = 1× 2 = 2

Total 50 A1 All correct and added

50 M1 their '50'
Probability = 8 8
, accept numerator unevaluated
C4 C4
(c) cont’d 50 A1
or 0.714
70

Method 2 Identified outcomes

ORTM 3
C1 × 2 C1 = 6 B1 Outcomes for 5 identifiable scenarios correct, accept
3 unsimplified.
ORTW C1 × 2 C1 = 6
ORMW 3
C1 × 2 C1 = 6 M1 Add 9, 10 or 11 identified correct scenarios only values, no
3 2 additional incorrect scenarios, no repeated scenarios, accept
ORRM C1 × C2 = 3
unsimplified, condone use of permutations.
3
ORRW C1 × 2 C2 = 3
3
ORRT C1 × 2 C2 = 3
3
OROR C2 × 2 C2 = 3
3
OROT C2 × 2 C1 = 6
3
OROM C2 × 2 C1 = 6
3
OROW C2 × 2 C1 = 6
3
OROO C3 × 2 C1 = 2

Total 50 A1 All correct and added

50 M1 their '50'
Probability = 8 8
, accept numerator unevaluated.
C4 C4

50 A1
or 0.714
70

5
24(a) 11! M1 11! alone on numerator – must be a fraction.
2!3! k! × m! on denominator, k = 1, 2, m = 1, 3, 1 can be
implied but cannot both = 1.
No additional terms

3326400 A1 Exact value only

(b) 8! = 40320 B1 Evaluate, exact value only

(c) 9! M1 9!
×7 × k seen, k an integer > 0, no +, – or ÷
3! 3!

M1 7 × an integer seen in final answer, no +, – or ÷

423360 A1 Exact value only

Alternative method for Question 6(c)

3! M1 9C3× k seen, k an integer > 0, no + or –

9
C3 × 7! (× )
3!
M1 7! × k seen, , k an integer > 0, no + or –

423360 A1 3!
Exact value only but there must be evidence of ×
3!
(c) cont’d Alternative method for Question 6(c)

8! M1 8!
3× 7 × 3× × k seen, k an integer > 0, no + or –
2! 2!

M1 7 × an integer seen in final answer, no +, – or ÷

423360 A1 Exact value only

Alternative method for Question 6(c)

2 9 8 7 1 M1 Product of correct five fractions × k seen, k an integer

7× × × × × × total no. of arrangements > 0, no + o –
11 10 9 8 7
M1 7×’total no of arrangements’ ×k seen, k an integer > 0,
no + or –

423360 A1 Exact value only

Alternative method for Question 6(c)

6
C3 × 3!× 7! M1 Finding the correct number of ways for no, 1 or 2 Es
No E between the Rs – = 100800 between the Rs, accept unsimplified.
3!
6
C2 × 3!× 7! M1 Adding the number of ways for 3 or 4 correct scenarios
1E between the Rs – = 226800
2!
2Es between the Rs – 6C1 × 3!× 7! = 90720
3Es between the Rs – 7! = 5040

Total = 7!× ( 20 + 45 +18 +1) = 7!× 84 = 423360

A1 CAO

3
 6
(d) EER__ C2 = 15 M1 Identifying four correct scenarios only.
6
EERR_ C1 = 6
6
EEER_ C1 = 6 B1 Correct number of selections unsimplified for 2 or
6
EEERR C0 = 1 more scenario.

M1 Adding the number of selections for 3 or 4 identified

correct scenarios only, accept unsimplified.
3
Cx ×2Cy × 6Cz, x+y+z=5 correctly identifies x Es and y
Rs

[Total =] 28 A1 WWW, only dependent upon 2nd M mark.

Alternative method for Question 6(d) – Fixing EER first. No other scenarios can be present anywhere in solution.

E E R ^ ^ = 8C2 M1 8
Cx seen alone or 8Cx × k, , k = 1 or 2, 0<x<8
Condone 8Px or 8Px × k, k = 1 or 2, 0<x<8
8
B1 C2 × k, k = 1 or 2 OE
8
M1 C2 × k, k = 1 OE and no other terms

[Total =] 28 A1 Value stated

4
 11
25(a) C5 × 4C1 M1 11
C5 × 4C1 condone 11P5 × 4P1 no +, –, × or ÷.

1848 A1 CAO as exact.

(b) Method 1 [Identifying scenarios]

[Neither selected =] 13C6 [= 1716] M1 Either 13C6 seen alone or 13C5 seen alone or × 2
[Only Jane selected =] 13C5 [= 1287] (condone 13Pn, n = 5,6).
[Only Kate selected =] 13C5 [= 1287]

[Total =] 1716 + 1287 + 1287 M1 Three correct scenarios only added, accept unsimplified (values may be
incorrect).

4290 A1

Method 2 [Total number of selections – selections with Jane and

Kate both picked]
15
C6 - 13C4 [= 5005 – 715] M1 15
C6 – k, k a positive integer < 5005, condone 15P6.

M1 m – 13C4, m integer > 715,

condone n – 13P4, n > 17 160.

4290 A1

SC Where the condition of 2(a) is also applied in 2(b), the final answer
is 1512 SC M1 M1 A0 max.
The method marks can be earned for the equivalent stages in each
method.
Method 1 4C1 × 9C5 + 4C1 × 9C4 × 2
Method 2 4C1 × 11C5 – 4C1 × 9C3
26(a) 5
P2 × 7P4 or 5 × 4 × 7 × 6 × 5 × 4 M1 5
Px × 7Py, 1⩽ x ⩽ 4, 1 ⩽ y ⩽ 6

16 800 A1

(b) Method 1 [Identify scenarios]

With A and no 5: 8 × 6P4 or (1 × 4 × 6 ×5 × 4 × 3) ×2 or 4C1 × 2! × 6P4 = M1 One number of ways correct, accept unsimplified.
2880
With 5 and no A: 4P2 × 4 × 6P3 or (4 × 3 × 1 × 6 × 5 × 4) × 4 or 4P2 × 6C3 × M1 Add 2 or 3 identified correct scenarios only, accept
4! = 5760 unsimplified.
With A and 5: 8× 4 × 6P3 or (4 × 1 × 1 × 6 × 5 × 4) × 8 or 4C1 × 2! × 6C3 ×
4! = 3840

[Total =] 12 480 A1 CAO

Method 2 [total number of codes – number of codes with no A or 5]

4
No A or 5 : (4 × 3 ) ×( 6 × 5 × 4 × 3) = 4320 M1 P2 × 6P4 or 4C2 × 6C4 seen, accept unsimplified.

Required number = their (a) – their 4320 M1 Their 5(a) (or correct) – their (No A or 5) value.

12 480 A1

Method 3 [subtracting double counting]

With A 4P1 × 7P4 × 2 or 4C1 × 2 × 7C4 × 4! = 6720 M1 One outcome correct, accept unsimplified.
With 5 5P2 × 6P3 × 4 or 5C2 × 2 × 6C3 × 4! = 9600
With A and 5 = 4P1 × 6P3 × 8or 4C1 × 2! × 6C3 × 4! × 8 = 3840

Required number = 6720 + 9600 – 3840 M1 Adding ‘with a’ to ‘with 5’ and subtracting ‘A and 5’.

12 480 A1 CAO

3
(c) Method 1 – number of successful codes divided by total

(1 ×) 3 × 5P2 M1 3 × 5Pn, n = 2, 3. Condone 3 × 5C2, no + or –.

their 3 × 5P2 M1 their 60

Probability = Probability = .
their 16 800 their 16 800

1 A1
, 0.00357
280

Method 2 – product of probabilities of each part of code

1 1 1 3 5 4 1 1 3× 5P2 M1 1 1
× × ×  × ×  or × × × × k where 0 < k < 1 for considering letters.
5 4 7 6 5 4 5 4 7P4 5 4

M1 1 3 3 × 5P 2
t × × or t × where 0 < t < 1 .
7 6 7 P4

1 A1 CAO
280

27(a) 5
C1 × 7C4 M1 7
C4 × k, k integer ⩾ 1
Condone 5P1 for M1 only

175 A1

2
3
(b) 2B 1G 2A C2 × 4C1 × 5C2 = 120 M1 3
Cx × 4Cy × 5Cz , x + y + z = 5, x,y,z integers ⩾1
3
2B 2G 1A C2 × 4C2 × 5C1 = 90 Condone use of permutations for this mark
3
2B 3G C2 × 4C3 = 12
3
3B 1G 1A C3 × 4C1 × 5C1 = 20 B1 2 appropriate identified outcomes correct, allow unsimplified
3
3B 2G C3 × 4C2 =6
M1 Summing their values for 4 or 5 correct identified scenarios
only (no repeats or additional scenarios), condone
identification by unsimplified expressions

[Total =] 248 A1 Note: Only dependent upon M marks

4
28(a) 5! M1 k! where k = 5, 6 or 7
Condone  1 OE

120 A1

(b) 8! M1 8!
[Total no of ways =] [= 3360] , a  1, 2 b  1,3 a  b
2!3! a !b!

6! M1 6!
[With 3Es together =] [= 360] , c  1, 2 seen in an addition/subtraction
2! c!

[With 3Es not together] = 3360 – 360 M1 8! 6!

 where d , f  1, 2 & e  1,3
d !e! f !

3000 A1

29(a) 12
C4  2 M1 g
C4  h g = 12, 13, h = 1,2

990 A1

Alternative method for question 2(a)

[total – both on – neither on] 14C5 – ( 12C3 + 12C5) = [2002 – 220 – 792] M1 k
C5 – (aC3 + aC5)
a = 12, 13 and k = 13, 14

990 A1

(b) [Mrs Lan plus] M1 7

Cr  6C4-r for r = 2, 3 or 4
2W 2M 7C2  6C2 = 315
3W 1M 7C3  6C1 = 210 B1 Outcome for one identifiable scenario correct,
4W 7
C4 = 35 accept unevaluated

M1 Add outcomes for 3 identifiable correct scenarios

Note: if scenarios not labelled, they may be
identified by seeing7Cr  6Cs r + s = 4 to imply
r women and s men for both B & M marks only

[Total =] 560 A1

4
30(a)  9!  B1
 2!2!   90 720
 

(b) Method 1 Arrangements Cs at ends – Arrangements Cs at ends and Os together

7! M1 w!
[Os not together =]  6! [= 2520 – 720] – y, w = 6, 7 y an integer.
2! 2!
 w! 
Condone 2     y .
 2! 

M1 a – 6! or a – 720, a an integer resulting in a positive answer.

1800 A1

Method 2 identified scenarios R ^ ^ ^ R

65 M1 5! × b, b integer >1.

[Os not together =] 5! =
2!
M1  65 6 6
P 
c or C 2 or 2 or15  , c integer > 1.
 2! 2! 

1800 A1

3
5
(c) CCO _ C1 = 5 B1 Correct outcome/value for 1 identified scenario.
5
CC _ _ C2 = 10 Accept unsimplified.
5
OOC _ C1 = 5 WWW
5
OO _ _ C2 = 10
5
C___ C3 = 10 M1 Add 5 or 6 values of appropriate scenarios only, no additional
5
O___ C3 = 10 incorrect scenarios, no repeated scenarios.
Accept unsimplified.
Condone use of permutations.

[Total =] 50 A1

3
 5
(d) Both Os in group with a C C2 = 10 B1 A correct scenario calculated accurately.
5
Both Os in group without a C C2 × 3C2 = 30 Accept unsimplified.
5
One O in a C group, one not C1 × 4C2 = 30
One O with each C (5C1 × 4C1) ÷2! = 10 M1 Add 3 or 4 correct scenario values, no incorrect scenarios,
accept repeated scenarios.
Accept unsimplified.

[Total =] 80 A1

Alternative method for question 6(d)

CCO O^^ ^^^ = 5C2 = 10 B1 A correct scenario calculated accurately.

CC^ O^^ O^^ = 5C1 ×4C2 = 30 Accept unsimplified.
CC^ OO^ ^^^ = 5C1 × 4C1 = 20

9
C6  6 C3 M1 Total subtract 2 or 3 correct scenario values, no incorrect
Total ways of making three groups = 140 scenarios.
2 23
Accept unsimplified.
140 – (their 10+ their 30+ their 20)

80 A1

31(a) 12
C5 × 7C4 [× 3C3] M1 12
Cr × q, r = 3, 4, 5 q a positive integer > 1,
no + or − .__
12
M1 Cs × 12–sCt [× 12-s–tCu]
s = 3, 4, 5; t = 3, 4, 5 ≠ s; u = 3, 4, 5 ≠ s ,t

Alternative method for question 7(a)

12! M1 12!  by a product of three factorials.

5! 3! 4!
M1 n!
5! 3! 4!

[792 × 35 =] 27 720 A1 CAO

3
(b) 4! (Lizo) × 6! (Kenny) × 2! (Martin) × 2! (Nantes) M1 Product involving at least 3 of 4!, 6!, 2!, 2!

× 3! (orders of K, M and N) M1 w × 3! , w integer > 1.

414 720 A1 WWW CAO

3
7
(c) C4 (adults) × 4C1 × 3C1 M1 7
C4 × b, b integer > 1 no + or – .

420 A1

2
5
(d) K not L C3 × 8C3 = 560 M1 8
C3(or 8P3) × c for one of the products
5
L not K C3 × 8C3 = 560 or 5C3 (or 5P3)× c, positive integer >1 for first 2
5
L and K C2 × 8C3= 560 products only.

M1 Add 2 or 3 correct scenarios only values, no

additional incorrect scenarios, no repeated
scenarios. Accept unsimplified.

[Total or Difference=] 1680 A1

Alternative method for question 7(d)

8
Total no of ways – neither L nor K M1 C3 × c, c a positive integer >1.
Total = 7C4 × 8C3 = 1960
Neither K nor L = 5C4  8C3 =280 M1 Subtracting the number of ways with neither from
their total number of ways.

[Total or Difference=] 1680 A1

(d) Alternative method for question 7(d)

8
Subtracting K and L from sum of K and L M1 C3 × c, c a positive integer >1.
6
K C3 × 8C3 = 1120
6
L C3 × 8C3 = 1120 M1 Subtracting number of ways with both from sum of
L and K 5C2 × 8C3= 560 number of ways with K and number of ways with
1120 + 1120 – 560 = 1680 L.

[Total or Difference=] 1680 A1

3
32(a) 5M0W 8C5 [× 7 C0] = 56 M1 8
Cx × 7 C5-x for x = 1, 2, 3, 4,or 5
4M1W 8C4 × 7 C1 = 490
3M2W 8C3 × 7 C2 = 1176 B1 Outcome for 4M1W or 3M2W correct and identified, accept
unsimplified.

M1 Add 3 values of appropriate scenarios, no incorrect scenarios, no

repeated scenarios, accept unsimplified.
Addition may be implied by final answer.

[Total =] 1722 A1 Value stated WWW.

Alternative method for Question 6(a)

2M3W 8C2 × 7 C3 = 980 M1 8

Cx × 7 C5-x for x = 1, 2, 3, 4,or 5
1M4W 8C1 × 7 C4 = 280
0M5W 8C0 × 7 C5 = 21 B1 Outcome for 2M3W or 1M4W correct and identified, accept
unsimplified.

[Total = 15C5 – (980 + 280 + 21)] M1 Subtract 3 values of appropriate scenarios from their identified
3003 – (980 + 280 + 21) total or correct,
no incorrect scenarios, no repeated scenarios, accept unsimplified.

[Total =] 1722 A1 Value stated WWW.

4
15
(b) C3 × 12 C5 [× 7C7] [= 455 × 792 ] M1 15
Cr × q, r = 3, 5, 7; q a positive integer >1

M1 15
Cs × 15-sCt [× 15-s-tCu] s = 3,5,7; t = 3,5,7 ≠ s; u = 3,5,7 ≠ s,t

360360 A1 Final answer.

If A0 awarded SC B1 for final answer 360360.

3
(c) Method 1: Total number of arrangements with AB together – Arrangements with AB and FG together

6! × 2 – 5! ×2 ×2 M1 a! × 2! × b, a = 5, 6; b = 1,2 seen.
[ = 1440 – 480 ]
M1 Either 6! × 2 – c ¸1 < c < 1440
or d – 5! ×2 ×2, 1440 < d

960 A1

Method 2: arrangements with AB together with F and G not together.

2 × 4! × 5 × 4 M1 2 × 4! × e, e positive integer >1

M1 f × 5 × 4, f positive integer >1

condone f × 20, f × 5C2, f positive integer >1

960 A1

33(a) 7! M1 7!
b,c = 1,2
b ! c !
2! 2!
7!   oe, no further terms present.
2! 2!

5040 A1

2
(b) Method 1 for first 3 marks: Arrangements of 6 letters including Ls between As

5!  5  2 M1 5!  d, d integer > 1

M1 e!  f  g, e = 5, 6, 7; f = 1, 5; g = 1, 2; f ≠ g,
1 can be implicit.

1200 A1

Method 2 for first 3 marks: Number of arrangements of LL^^^^^ – number of arrangements with the Ls split by an A

6!  2 – 5!  2 M1 6!  2 – h h an integer 1 < h < 1440

M1 k – 5!  2 k an integer k > 240

1200 A1

Method 3 for first 3 marks: Alternative approaches to Method 1

^A ^ ^ ^ ^ ^ A 5
P1  1P1  5P5  1P1 = 600 M1 LL treated as a single unit.

M1

1200 A1

(b) Final 2 marks of Question 7(b)

 9!  B1 Accept unsimplified.
[Total number of arrangements =]  =  90720 May be seen as denominator of probability.
 2!2! 

1200 5 B1 FT their 1200

Probability = , , 0.0132 unsimplified B1 FT if their 1200 and their 90 720
90720 378 their 90720
supported by work in this part.

5
(c) Method 1: Scenarios identified Both As and Ls removed
5
A____ C4 = 5 B1 1 correct, identified outcome/value
5
AA _ _ _ C3 = 10 for A, AL or AAL scenario, accept unsimplified
5 5
AL _ _ _ C3 = 10 C5–x cannot be used in place of 5Cx
5
AAL _ _ C2 = 10
M1 Add 4 values of appropriate scenarios,
no incorrect scenarios, no repeated scenarios, accept unsimplified,
condone use of permutations.

[Total =] 35 A1 Value stated WWW.

Method 2: 1 A fixed, 1 L removed

No other scenarios can be present anywhere in solution
7 7
A^^^^ C4 M1 Ch, 3 ⩽ h ⩽ 5
7
B1 C4 oe, no other terms, scenario identified.

[Total =] 35 A1 Value stated.

Method 3: 1 A fixed, both Ls removed

A ^ ^ ^ ^ = 6C4 = 15 B1 Correct outcome/value for 1 identified scenario, accept

A L ^ ^ ^ = 6C3 = 20 unsimplified. WWW

M1 Add 2 values of appropriate scenarios,

no incorrect scenarios, no repeated scenarios, accept unsimplified,
condone use of permutations.

[Total =] 35 A1 Value stated.

3
34(a) 9! M1 h!
, h = 7, 8, 9; j = 1, 2
2!2! 2! j!

90720 A1

(b) Arrangements with 5 letters between As + Arrangements with 6 letters between As + Arrangements with 7 letters between As

7! M1 7!
With gap of 5:  3 [= 7560]  k, k positive integer 1< k < 7
2! 2!
7!
With gap of 6:  2 [= 5040] M1 Add their no of ways for 3 identified correct scenarios, no
2!
additional incorrect scenarios, accept unsimplified.
7!
With gap of 7: 1 [= 2520]
2!

7! A1
[Total no =  6 =] 15120
2!

3
(c) Method 1: Summing number of ways

AT _ _ _ 2×2× 5C3 40 B1 Correct no of ways for 4 correctly identified scenarios,

A____ 2×5C4 10 accept unsimplified.
5
AATT _ C1 5
AAT _ _ 2×5C2 20 M1 Add no of ways for 5 or 6 identified correct scenarios, no
5
AA _ _ _ C3 10 additional incorrect scenarios, no repeated scenarios, accept
5
_____ C5 1 unsimplified.

[Total no of ways not containing more Ts than As = ] A1 All correct and added
= 40+10+5+20+10+1 [=86]

86 M1 their 86
Probability = 9
accept numerator unevaluated
C5 9C 5 or their identified total

86 43 A1
, , 0.683
126 63

Method 2: Subtracting no of ways with more Ts from total

T____ 2×5C4 10 B1 Correct no of ways for 2 correctly identified scenarios, no

TTA _ _ 2×5C2 20 additional incorrect scenarios, no repeated scenarios, accept
5
TT _ _ _ C3 10 unsimplified, condone use of permutations

M1 Add no of ways for 2 or 3 correct scenarios and subtract from

their total no of ways
All correct and subtracted

Total no of ways with more Ts than As =40 A1

9
C5 − 40 = 86

86 M1 their 86
Probability = 9
accept numerator unevaluated
C5 9C 5 or their identified total

(c) 43 A1
, 0.683
63

5
35(a) Method 1: Arrangements with 3 Es together – arrangements with 3 Es together and 2 Ds together

7! B1 7!
− 6! – e, e a positive integer (including 0).
2! 2!

M1 f – 6!, f > 6!

M1 7! 6!
− , a,c = 1, 2 and b,d = 1, 3.
a!b! c!d !

1800 A1

Method 2: Identified scenarios ^ EEE ^ ^ ^

65 B1 5! × j, j a positive integer (j = 1 may be implied).

5!
2 M1 k! 65 k! 6 k ! 6 P2 76
 ,  C2 ,  or k ! ,
m! 2 m! m! 2 n
k a positive integer (k = 1 may be implied),
m = 1, 2 n = 1, 2, 3.

M1 m  ( m − 1)
k ! k a positive integer > 1, m = 10, 9, 8, 7, 6 and
n
n = 1, 2.

1800 A1
(b) First 2 marks: Method 1 – Number of arrangements with 2 Ds in one position with 4 letters in between – repeats allowed

7! × 4 × 2 M1 7! × s, s = positive integer > 1.

M1 t! × 4 × 2, t = 8, 7, 6.
Condone t! × 8.

First 2 marks: Method 2 – Picking 2Ds, arranging 4 letters from remaining letters between and then arranging terms
7
P4  4!2! M1 7
P4  a! b! , 1 ⩽ a ⩽ 6 and b = 1, 2, 3.

M1 7
Pc  4!2! , c = 3, 4, 5.

First 2 marks: Method 3 – Identified scenarios involving Es between Ds

D ^ ^ ^ ^ D E E E = 4C4 × 4! × 4! ×2! = 1152 M1 1 identified scenario value correct.

D E ^ ^ ^ D E E ^ = 4C3 × 4! × 4! × 3 ×2! = 13824
D E E ^ ^ D E ^ ^ = 4C2 × 4! × 4! × 3 ×2! = 20736 M1 4 appropriate scenarios added, no incorrect.
D E E E ^ D ^ ^ ^ = 4C1 × 4! × 4! ×2! = 4608
(b) Final 3 marks for Methods 1, 2 and 3

40320 A1 If A0 scored, SC B1 for 40320 WWW.

[Total number of arrangements =] 9! = 362880 B1 Accept unsimplified.

May be seen as denominator of probability.

40320 1 B1FT their 40320

Probability = = , accept unsimplified.
362880 9 their 362880
B1FT if their 40320 and their 362880 supported by work in
this part.
Condone their 362880 supported by calculation in 7(a).

(c) Scenarios B1 1 correct unsimplified outcome/value for one identified

4
DE___ C3 4 scenario excluding DDEEE.
4
DEE__ C2 6 Note: 4C1 cannot be used for 4C3 .
4
DEEE_ C1 4
4 M1 Add values of 6 appropriate scenarios, no additional, incorrect
DDE__ C2 6
4 or repeated scenarios. Accept unsimplified.
DDEE_ C1 4
DDEEE [4C0] 1

[Total =] 25 A1

3
36(a) 6
C3  8C3 M1 6
C3  b or c  8C3 seen. b, c integers ⩾ 1 (1 may be
implied).

1120 A1

(b) Method 1

0 brothers [3C0]  11C6 462 B1 3

Cx  11C6 – x, with x = 1 or 2 seen.
1 brother 3
C1  11C5 1386
2 brothers 3
C2  11C4 990 M1 Add values of 3 correct scenarios, (may be identified by
the appropriate calculations) no incorrect/repeated
scenarios, condone use of permutations.

2838 A1 Only dependent on the M mark.

SC B1 for the correct calculation or 2838 seen WWW.

Method 2
14
C6 – 11C3 B1 14
C6 – d, where d a positive integer.
3003 – 165
M1 e – 11C3, where e is a positive integer >165.

= 2838 A1

3
37(a)  8!  B1
 2!3!   3360
 

(b) 6! M1 6!
; f = 1, 2, 3.
2!2! 2! f !

180 A1

(c)  P  OOO  CC   M1 5!
g a positive integer, g  3360, 1.
 P  OOO|CC   
 P  CC   g
5! 5!
Condone numerator of .
7! 3360g
3!
M1 h h
or , where h is a positive integer.
7! 8!
3! 3!
Condone division by 3360 in denominator.

120 1 A1 0.1428571… to at least 3SF.

= , , 0.143 1
840 7 If M0 scored SC B1 for WWW.
7

3
38(a) S + 4C + 2R 6C1  8C4  11C2 [= 6  70  55] = 23 100 M1 6Ce  8Cf  11Cg, with e + f + g = 7 seen.
S + 5C + 1R 6C1  8C5  11C1 [= 6  56  11]  3696
S + 6C [+ 0R] 6C1  8C6 [ 11C0][= 6  28] = 168 B1 Correct outcome/value for 1 identified scenario, accept
unsimplified, www.

M1 Add values of 3 correct scenarios.

No incorrect scenarios, no repeated scenarios.
Condone 6Ce  8Cf  11Cg, with e + f + g = 7 to identify S,
C, R.

[Total =] 26964 A1 cao

(b) 2!  3!  4!  6 M1 2!  3!  4!  k, k an integer > 0. 1 can be implied.

=1728 A1 If A0 scored SC B1 for 1728 www.

2
(c) Method 1

6!  7  6  5 M1 6!  k, k an integer > 0. 1 can be implied.

M1 m!
 7  n  r; 6 ⩽ m ⩽ 9; a = 1, 2; b = 1, 4;
a!  b!
1 ⩽ n, r ⩽ 6, n ≠ r.

M1 m!
 7  6  5; 6 ⩽ m ⩽ 9; a =1, 2; b = 1, 4.
a!  b!

151 200 A1 Condone 151 000.

If A0 scored SC B1 for 151 200 www.

Method 2

6!  7P3 M1 6!  k, k an integer > 0. 1 can be implied.

M1 m! m!
× 7Pq, or × 7 Cq  q ! ; 6 ≤ m ≤ 9; a =1, 2;
a!  b! a!  b!
b = 1, 4; 1 ≤ q ≤ 6.

M1 m! m!
× 7P3, or × 7 C3  3! ; 6 ≤ m ≤ 9; a =1, 2;
a!  b! a!  b!
b = 1, 4.

151 200 A1 Condone 151 000.

If A0 scored SC B1 for 151 200 www.
(c) Method 3

6!  35  3! M1 6!  k, k an integer > 0. 1 can be implied.

M1 m!
 35  q!; 6 ⩽ m ⩽ 9; a =1, 2; b = 1, 4;
a!  b!
1 ⩽ q ⩽ 3.

M1 m!
 35  6; 6 ⩽ m ⩽ 9; a =1, 2; b = 1, 4.
a!  b!

151 200 A1 Condone 151 000.

If A0 scored SC B1 for 151 200 www.

Method 4

9! – 7!3! – 3P2  6!  7  6 M1 9! – 7!r! – q, r an integer > 1, q an integer ⩽ 0. 0 and 1

Or may be implied.
9! – 7!3! – 3!  7!  6
M1 s!
– 7!3! – q; s = 8, 9; a =1, 2; b = 1, 3; c = 1, 4;
[= 362 880 – 30 240 – 181 440] a !  b!  c!
q an integer ⩾ 0. 0 and 1 may be implied.

M1 s!
– 7!3! – 3P2  6!  6  7, 6 ⩽ s ⩽ 9,
a !  b!  c!
s!
or – 7!3! – 3!  7!  6, 6 ⩽ s ⩽ 9.
a !  b!  c!
a =1, 2 b = 1, 3 c = 1, 4. 1 may be implied.

151 200 A1 Condone 151 000.

If A0 scored SC B1 for 151 200 www.

4
39(a) Method 1: Total number of arrangements – number of arrangements with Cs together

10! 9! M1 10!
 [75600-15120]  c, a ≠ b, a = 1, 2, b = 1, 4, with c being a positive integer.
2!4! 4! a !b !

M1 e!
d , e = 8, 9, 10, with d being a positive integer.
4!

= 60480 A1 Exact value only.

SC B1 for final answer 60480 www.

Method 2: Arrangements ^ ^ C ^ C ^ ^ ^ ^ ^

8! 9  8 M1 8!
  f seen, with f being a positive integer.
4! 2 4!

M1 98
g , with g being a positive integer, h = 1, 2.
h
g × 9C2 and g × 9P2 are acceptable.

= 60480 A1 Exact value only.

SC B1 for final answer 60480 www.

(b) AC^^^C^^^A M1 6!
× s, with s being a positive integer.
6! 2!
×4
2!
M1 t!
× 4, r = 1, 2, 3 and t = 8, 7, 6.
r!

1440 A1

Alternative Method for Question 7(b)

4  6 P3  3! M1 6
P3
× k, with k being a positive integer.
2! 2!

M1 6
Pm
4 × 3! × , m = 2, 3 and n = 1, 2, 3.
n!

1440 A1

3
 (c)
(7c) Scena B1 Correct number of ways for identified scenarios of 2 or 3 As,
5
AA _ _ _ C3 = 10 accept unsimplified, www.
5
AAA _ _ C2 = 10
5
AAAA _ C1 = 5 M1 Add 3 values for 2, 3 and 4 As, no additional, incorrect or
repeated scenarios. Accept unsimplified.

25 A1

Alternative Method 2 for Question 7(c)

Scenarios: B1 Correct total number of ways for identified scenarios of 2 or 3 As,

4
AAC _ _ C2 = 6 accept unsimplified, www (e.g., both values for AAC^^ and
4
AA _ _ _ C3 = 4 AA^^^ shown would be fine for 2As).
4
AAAC _ C1 = 4
4
AAA _ _ C2 = 6 M1 Add 6 values of appropriate scenarios only, no additional,
AAAAC 1 incorrect or repeated scenarios. Accept unsimplified.
AAAA _ 4

25 A1

40(a) 5
C2 × 2 M1 5
C2 × r, r = positive integer, 1 implied, no addition.

M1 s × 2, s = 5C2 or 5P2
or if 5C2 or 5P2 not present, s = a single integer > 1
or t! × 2, 2 ⩽ t ⩽ 8, no other terms.

20 A1

3
(b) Method 1
6 6
C2 × 2 × 2× 2 × 4! M1 C2 × 2 × 2× 2 × t, t = positive integer ⩾ 1.
6
P2 × 2 × 2 × t, t = positive integer ⩾ 1.

M1 u × 4!, u = positive integer > 1.

2880 A1 If A0 scored, SC B1 for 2880 nfww.

Method 2

6! × 2 × 2 M1 6! × v, v = positive integer ⩾ 1.

M1 w × 2 × 2, w = positive integer > 1.

condone w × 4, w = positive integer > 1.

2880 A1 If A0 scored, SC B1 for 2880 nfww.

3
(c) Method 1: Number of arrangements with Rajid and Sue together – Number of arrangements with Rajid and Sue together and at end of line

7! 2 − 6! 4 M1 7! × 2 – a, a = positive integer > 1.

M1 b – 6! × 4, b = positive integer > 2880.

M1 7! × c – 6! × d, c = 1,2 and d = 1, 4.

= 7200 A1 If A0 scored, SC B1 for 7200 nfww.

Method 2: Arrangements of 6 people and then place Rajid and Sue

6! 2 5 M1 6! × e × f, e, f = positive integers ⩾ 1.

M1 6! × 2 × f, f = positive integer ⩾ 1.
If 5! Used, SC B1 5! × 2 × f, f = positive integer > 1.

M1 6! × e × 5, e = positive integer ⩾ 1.

7200 A1 If A0, scored SC B1 for 7200 nfww.

Method 3: Friends at ends picked first F ^ RS ^ ^ ^ F

6 6
P2 × 5! × 2 M1 P2 × e× f, e, f = positive integers ⩾ 1.
6
M1 P2 × 5! × f, f = positive integer ⩾ 1.
Condone 6C2 × 5! × f, f = positive integer ⩾ 1.
6
M1 P2 × e × 2, e = positive integer ⩾ 1.
Condone 6C2 × e × 2, e = positive integer ⩾ 1.

7200 A1 If A0 scored, SC B1 for 7200 nfww.

(c) Method 4: RS placed in different possible positions

Pn × a × ( 6 − n )! , a = positive integer, 1 ⩽ n ⩽ 5 seen once.

6
^ RS ^ ^ ^ ^ ^ P1 × 2 × 5! = 1440 M1 6
6
^ ^ RS ^ ^ ^ ^ P2 × 2 × 4! = 1440
6
^ ^ ^ RS ^ ^ ^ P3 × 2 × 3! = 1440
^ ^ ^ ^ RS ^ ^ 6
P4 × 2 × 2! = 1440
M1 6
Pn × 2 × ( 6 − n )! , a = positive integer, 1 ⩽ n ⩽ 5 seen at least 3
6
^ ^ ^ ^ ^ RS ^ P5 × 2 × 1! = 1440 times in identified scenarios.

M1 Add 5 values of appropriate scenarios only. No additional, incorrec

or repeated scenarios. Accept unsimplified.

7200 A1 If A0 scored, SC B1 for 7200 nfww.

41(a) 5! 4! M1 5!  4!
, e a positive integer, 1 can be
2!  2! e
implied. No other terms on numerator. No
addition etc.

M1 f
, f a positive integer, g = 1, 2. No
2!  g !
other terms on denominator.

720 A1

3
(b) Method 1 Number of arrangements with A at each end – Number of arrangements with A at each end and 2 Ds together.

7! B1 7!
− 6! – e, 7 P5 − e, e a positive integer or 0.
2! 2!

M1 6!
d– , d > 720, r = 1, 2.
r!

= 1800 A1

Method 2 A ^ ^ ^ ^ ^ A and Ds inserted separately

6
P2 65 B1 5! × s, s a positive integer, 1 may be implied.
5!  or 5!  or 5!  6C2
2! 2
M1 65
t , t a positive integer > 1, u =1, 2.
u

= 1800 A1

Method 3 Number of arrangements with As at each end and Ds placed in different scenarios.

Scenario position of first D B1 Correct outcome/value for 1 identified

scenario, accept unsimplified, www.
AD^^^^^^A 5! × 5 600
A^D^^^^^A 5! × 4 480 M1 Add values of 5 correct scenarios, no
incorrect/repeated scenarios.
A^^D^^^^A 5! × 3 360
A^^^D^^^A 5! × 2 240
A^^^^D^^A 5! × 1 120

[Total =] 1800 A1

3
(c) Method 1:

M1 At least one correct unsimplified expression

Scenarios for an identified scenario.
AD^^ 2
C1  2C1  5C2 = 40

ADD^ 2
C1  [ 2C2 ] 5C1 = 10

[Total = ] 40 + 10 or 50 soi A1 www

If M0 scored, SC B1 [total =]50 www.

[Total number of selections =] 9C4 [= 126] B1 Accept evaluated, accept as denominator of

probability expression.
Do not condone 9C5 unless there is a clear
explanation for selecting the letters not in the
group.

50 25 B1 FT 0.396825… to at least 3SF.

[Probability =] ,
126 63
their attempted 40 +10
FT . Numerator must
126
be from an attempt to find the 2 appropriate
scenarios and must be evaluated.
(c) Method 2:

M1 Numerator for at least one correct

Scenarios
unsimplified expression for an identified
AD^^ scenario.
2 2 5 4 4 960 20
    P2 = , 2  2  5  4  12 2  2 1 512
9 8 7 6 3024 63 either or
abcd abcd
ADD^ seen, 6 ⩽ a,b,c,d ⩽ 9.
2 2 1 5 4 P3 240 5
    = ,
9 8 7 6 2! 3024 63 A1 2  2  5 412 2  2 1 512
+ ,
abcd abcd
20 5 6 ⩽ a,b,c,d ⩽ 9.
[Total Probability = ] + 1200 25
63 63 If M0 scored, SC B1 , g > 1200, or
g 63
seen.

B1 p q r s
   present in all scenarios
9 8 7 6
t
attempted, accept , t < 3024.
3024

1200 25 B1 FT 0.396825… to at least 3SF.

, oe
3024 63
their attempted 960 + 240
FT . Numerator
3024
must be from an attempt to find the 2
appropriate scenarios.
(c) Method 3: selecting the A and then selecting 3 any letters and removing selections without Ds.
2
C1 × (7C3 – 5C3) [= 2 × (35 – 10)] M1 a × (7C3 – 5C3), a = 1, 2.

[Total = ] 50 A1 www
If M0 scored, SC B1 [total =]50 www.

[Total number of selections =] 9C4 [= 126] B1 Accept evaluated, accept as denominator of

probability expression.
Do not condone 9C5 unless there is a clear
explanation for selecting the letters not in the
group.

50 25 B1 FT 0.396825… to at least 3SF.

[Probability =] ,
126 63 their attempted 40 +10
FT . Numerator must
126
be from an attempt to find the 2 appropriate
scenarios.

Method 4: Listing outcomes.

Either 10 correct outcomes for ADD^ listed or 40 correct outcomes for AD^^ listed M1

50 stated A1 www
If M0 scored, SC B1 [total =]50 www.

126 stated or correct outcomes listed B1

50 25 B1 0.396825… to at least 3SF.

[Probability =] ,
126 63 their attempted 40 +10
FT . Numerator must
126
be from an attempt to find the 2 appropriate
scenarios.

4
42(a)(i) Method 1

6!  26 M1 6!  a, a integer > 1.

M1 b  26 , b integer ⩾ 1.

= 46080 A1 Accurate answer required.

SC B1 for 46080 if M0 M0 www.

Alternative method for question 6(a)(i)

12  10  8  6  4  2 M1 c  d  e f  g  h
2 ⩽ c,d,e,f,g,h (different integers) ⩽ 12

M1 Correct unsimplified.

= 46080 A1 Accurate answer required.

SC B1 for 46080 if M0 M0 www.

(a)(ii) 5!  5!  2 2 M1 5!  5!  k, k positive integer, 1 may be implied (no

adding/subtracting).

= 57600 A1

2
(b) Method 1 probabilities of J & K being placed:

5 4
  20 5  B1 Correct probability for one identified scenario.
In the group of 5  = 132 , 33 
12 11   M1 Denominator 12 11 for all probabilities, (1, 2 or 3 scenarios).
4 3
  12 1 
In the group of 4  = 132 , 11 
12 11   A1 3 correct probabilities, accept unsimplified.
3 2
  6 1
In the group of 3  = 132 , 22 
12 11  

5 4 4 3 3 2 M1 Adding probabilities for 3 correct scenarios.

 +  + 
12 11 12 11 12 11

19 A1 0.2878787 to at least 3SF.

, 0.288
66

(b) Method 2 number of arrangements of J & K being placed:

B1 Correct value of one identified scenario seen, accept unsimplified.

In the group of 5 10
C3  7C4 [= 120  35 = 4200]
M1 12
Ca  12-aCb, a = 3, 4, 5; b = 3, 4, 5 (a ≠ b)
In the group of 4 10
C2  8C5 [= 45  56 = 2520]

In the group of 3 10
C1  9C5 [= 10  126 = 1260]

[Total number of ways of arranging the 3 groups =] A1 27720 Seen alone or as denominator of probability –accept
12
C5 7C4 = 792 35 = 27720 unsimplified.
or 12C3  9C4 or 12C4  8C5 SC B1 if M0.

4200 + 2520 + 1260 = 7980 M1 Values of 3 correct scenarios added, accept unsimplified – or
correct.

7980 19 A1 0.2878787 to at least 3SF.

[Probability =] , , 0.288
27720 66

5 Note, alternative arrangement calculations possible e.g.

In the group of 5 10
C3  7C4 [= 120  35 = 4200]

In the group of 4 10
C5 5C2 [= 252 10 = 2520]

In the group of 3 10
C5  5C4 [= 252  5 = 1260]