Adithya-demo [42 marks]

1. [Maximum mark: 7]
A group of 10 children includes one pair of brothers, Alvin and Bobby, and one pair of sisters,
Catalina and Daniela.

The children are to be seated at 10 desks which are arranged in two rows of five as shown in the
following diagram.

Alvin and Bobby must be seated next to each other in the same row.

(a) Find the total number of ways the children can be seated. [3]

Markscheme

METHOD 1

the number of ways Alvin and Bobby can be seated is 2 × 8(= 16) (A1)

the number of ways the other children can be seated is 8!(= 40320) (A1)

Note: These A1 marks may be awarded independently.

total number of ways is (16 × 8! =) 645120 A1

Note: Accept 16 × 8! and 645 000.

METHOD 2
 the number of ways children can be seated in a row of 10 seats is 2 × 9!(= 725 760)

(A1)

the number of ways the children can be seated with Alvin and Bobby in seats 5 and 6 is
2 × 8!(= 80 640) (A1)

Note: These A1 marks may be awarded independently.

total number of ways is (2 × 9! − 2 × 8! =) 645 120 A1

Note: Accept 16 × 8! and 645 000.

[3 marks]

After an argument, Catalina and Daniela must not be seated next to each other. Alvin and Bobby
must still be seated next to each other.

(b) Find the total number of ways the children can be seated. [4]

Markscheme

METHOD 1

attempt to find number of ways that A and B are seated next to each other AND C and D are
seated next to each other and subtract from part a) (M1)

Case 1: A and B are sat at the end of a row (8 ways)

6(2) = 12 ways to seat C and D together

12 × 6!(= 8640) ways (A1)

the total number of ways is 8 × 12 × 6!(= 69 120)

Case 2: A and B are not sat at the end of a row (8 ways)

5(2) = 10 ways to seat C and D together

10 × 6! = 7200 ways (A1)

the total number of ways is 8 × 10 × 6!(= 57 600)

total number of ways is 645 120 − (69 120 + 57 600)

= 518 400 A1

Note: Accept 518 000 or 518 280 (from use of 645 000).

METHOD 2

attempt to split into cases based on position of A and B and adding all possibilities (M1)

Case 1: A and B are sat at the end of a row (8 ways)

the number of ways C and D can be seated:

with at least one in the same row as A and B 2(1 + 15) = 32

with both in a different row to A and B 2(6) = 12

the number of ways C and D can be seated is 44 × 6!(= 31 680) (A1)

the total number of ways is 8 × 31 680 = 253 440

Case 2: A and B are not sat at the end of a row (8 ways)

the number of ways C and D can be seated:

with at least one in the same row as A and B 2(2 + 15) = 34

with both in a different row to A and B 2(6) = 12

the number of ways C and D can be seated is 46 × 6!(= 33 120) (A1)

the total number of ways is 8 × 33 120 = 264 960

total number of ways is 253 440 + 264 960

 = 518 400 A1

Note: Accept 518 000.

[4 marks]

2. [Maximum mark: 6]
A junior baseball team consists of six boys and three girls.

The team members are to be placed in a line to have their photograph taken.

(a) In how many ways can the team members be placed if

(a.i) there are no restrictions. [1]

Markscheme

(9! =) 362880 A1

Note: Accept 9! or 363000.

[1 mark]

(a.ii) the girls must be placed next to each other. [2]

Markscheme

attempt to consider girls as a single object (M1)

(3! × 7! =) 30240 A1

Note: Accept 30200.

[2 marks]

(b) Five members of the team are selected to attend a baseball summer camp. Find
the number of possible selections that contain at least two girls. [3]
 Markscheme

METHOD 1

recognition of the two different cases for 2 girls and 3 girls (M1)

exactly 2 girls is 6C 3 ×
3
C2 = 60 and exactly 3 girls (3C 3x) 6
C
2
= 15

(A1)

total (= 60 + 15) = 75 A1

METHOD 2

recognition of the three different cases: total choices, 1 girl and no girl (M1)

total choices 126, one girl case 45, no girl case

9 3 6 6
C = C × C = C = 6
5 1 4 5

(A1)

total (= 126 − 45 − 6) = 75 A1

[3 marks]

3. [Maximum mark: 7]
Mary, three female friends, and her brother, Peter, attend the theatre. In the theatre there is a row
of 10 empty seats. For the first half of the show, they decide to sit next to each other in this row.

(a) Find the number of ways these five people can be seated in this row. [3]

Markscheme

6 × 5! (A1)(A1)

= 720 (accept 6!) A1

[3 marks]

For the second half of the show, they return to the same row of 10 empty seats. The four
girls decide to sit at least one seat apart from Peter. The four girls do not have to sit next to each
other.
(b) Find the number of ways these five people can now be seated in this row. [4]

Markscheme

METHOD 1

(Peter apart from girls, in an end seat) 8

P (= 1680) OR
4

(Peter apart from girls, not in end seat) 7

P (= 840)
4
(A1)

case 1: Peter at either end

2 ×
8
P (= 3360)
4
OR 2 ×
8
C
4
× 4!(= 3360) (A1)

case 2: Peter not at the end

8 ×
7
P (= 6720)
4
OR 8 ×
7
C
4
× 4!(= 6720) (A1)

Total number of ways = 3360 + 6720

= 10080 A1

METHOD 2

(Peter next to girl, in an end seat) 4 × OR

8
P (= 1344)
3

(Peter next to one girl, not in end seat) 2 × 4 × 7P 3(= 1680) OR

(Peter next to two girls, not in end seat) 4 × 3 ×

7
P (= 504)
2
(A1)

case 1: Peter at either end

2 × 4 ×
8
P (= 2688)
3
(A1)

case 2: Peter not at the end

8(2 × 4 ×
7
P
3
+ 4 × 3 ×
7
P )(= 17472)
2
(A1)

Total number of ways =

10
P − (2688 + 17472)
5

= 10080 A1
 [4 marks]

4. [Maximum mark: 4]
Consider the set of six-digit positive integers that can be formed from the digits
0, 1, 2, 3, 4, 5, 6, 7, 8 and 9.

Find the total number of six-digit positive integers that can be formed such that

(a) the digits are distinct. [2]

Markscheme

9 × 9 × 8 × 7 × 6 × 5 (= 9 × 9P 5) (M1)

= 136080 (= 9 ×
9!

4!
) A1

10!
Note: Award M1A0 for 10 × 9 × 8 × 7 × 6 × 5 (= 10P 6 = 151200 =
4!
).

Note: Award M1A0 for 9P 6 = 60480

[2 marks]

(b) the digits are distinct and are in increasing order. [2]

Markscheme

METHOD 1

EITHER

every unordered subset of 6 digits from the set of 9 non-zero digits can be arranged in
exactly one way into a 6-digit number with the digits in increasing order. A1

OR

9
C (×1)
6
A1
 THEN

= 84 A1

METHOD 2

EITHER

removes 3 digits from the set of 9 non-zero digits and these 6 remaining digits can be
arranged in exactly one way into a 6-digit number with the digits in increasing order.
A1

OR

9
C (×1)
3
A1

THEN

= 84 A1

[2 marks]

5. [Maximum mark: 8]
A farmer has six sheep pens, arranged in a grid with three rows and two columns as shown in the
following diagram.

Five sheep called Amber, Brownie, Curly, Daisy and Eden are to be placed in the pens. Each pen is
large enough to hold all of the sheep. Amber and Brownie are known to fight.

Find the number of ways of placing the sheep in the pens in each of the following cases:
(a) Each pen is large enough to contain five sheep. Amber and Brownie must not
be placed in the same pen. [4]

Markscheme

METHOD 1

B has one less pen to select (M1)

EITHER

A and B can be placed in 6 × 5 ways (A1)

C, D, E have 6 choices each (A1)

OR

A (or B), C, D, E have 6 choices each (A1)

B (or A) has only 5 choices (A1)

THEN

5 × 6
4
(= 6480) A1

METHOD 2

total number of ways = 5

6 (A1)

number of ways with Amber and Brownie together = 4

6 (A1)

attempt to subtract (may be seen in words) (M1)

5 4
6 − 6

= 5 × 6
4
(= 6480) A1

[4 marks]
 (b) Each pen may only contain one sheep. Amber and Brownie must not be placed
in pens which share a boundary. [4]

Markscheme

METHOD 1

total number of ways = 6!(= 720) (A1)

number of ways with Amber and Brownie sharing a boundary

= 2 × 7 × 4!(= 336) (A1)

attempt to subtract (may be seen in words) (M1)

720 − 336 = 384 A1

METHOD 2

case 1: number of ways of placing A in corner pen

3 × 4 × 3 × 2 × 1

Four corners total no of ways is 4 × (3 × 4 × 3 × 2 × 1) = 12 × 4!(= 288)

(A1)

case 2: number of ways of placing A in the middle pen

2 × 4 × 3 × 2 × 1

two middle pens so 2 × (2 × 4 × 3 × 2 × 1) = 4 × 4!(= 96) (A1)

attempt to add (may be seen in words) (M1)

total no of ways = 288 + 96

= 16 × 4!(= 384) A1

[4 marks]

6. [Maximum mark: 5]
Eight runners compete in a race where there are no tied finishes. Andrea and Jack are two of the
eight competitors in this race.

Find the total number of possible ways in which the eight runners can finish if Jack finishes

(a) in the position immediately after Andrea. [2]

Markscheme

Jack and Andrea finish in that order (as a unit) so we are considering the arrangement of 7
objects (M1)

7! (= 5040) ways A1

[2 marks]

(b) in any position after Andrea. [3]

Markscheme

METHOD 1

the number of ways that Andrea finishes in front of Jack is equal to the number of ways that
Jack finishes in front of Andrea (M1)

total number of ways is 8! (A1)

8!

2
(= 20160) ways A1

METHOD 2

the other six runners can finish in 6! (= 720) ways (A1)

when Andrea finishes first, Jack can finish in 7 different positions

when Andrea finishes second, Jack can finish in 6 different positions etc

7 + 6 + 5 + 4 + 3 + 2 + 1 (= 28) ways (A1)

hence there are (7 + 6 + 5 + 4 + 3 + 2 + 1) × 6! ways

 28 × 6! (= 20160) ways A1

[3 marks]

7. [Maximum mark: 5]
A team of four is to be chosen from a group of four boys and four girls.

(a) Find the number of different possible teams that could be chosen. [3]

Markscheme

* This question is from an exam for a previous syllabus, and may contain minor differences
in marking or structure.

METHOD 1

8
( ) (A1)
4

8! 8×7×6×5
=
4!4!
=
4×3×2×1
= 7 × 2 × 5 (M1)

= 70 A1

METHOD 2

recognition that they need to count the teams with 0 boys, 1 boy… 4 boys M1

4 4 4 4 4 4
1 + ( ) × ( ) + ( ) × ( ) + ( ) × ( ) + 1
1 3 2 2 1 3

= 1 + (4 × 4) + (6 × 6) + (4 × 4) + 1 (A1)

= 70 A1

[3 marks]
(b) Find the number of different possible teams that could be chosen, given that
the team must include at least one girl and at least one boy. [2]

Markscheme

EITHER

recognition that the answer is the total number of teams minus the number of teams with
all girls or all boys (M1)

70 − 2

OR

recognition that the answer is the total of the number of teams with 1 boy,

2 boys, 3 boys (M1)

4 4 4 4 4 4
( ) × ( ) + ( ) × ( ) + ( ) × ( ) = (4 × 4) + (6 × 6) + (4 × 4)
1 3 2 2 1 3

THEN

= 68 A1

[2 marks]

© International Baccalaureate Organization, 2024