Question
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]
Additional Page
If you use the following lined page to complete the answer(s) to any question(s), the question number(s) must be clearly shown.
Mark scheme
6(a) C2 × 2 M1 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.
6(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
6(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.
6(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, incorrect
or repeated scenarios. Accept unsimplified.
7200 A1 If A0 scored, SC B1 for 7200 nfww.
4