May/June 2026 Paper 12

2026 · 29 questions · 51 parts · 80 marks

0/80 marks

0Correct0Partial0Wrong51Unattempted

Filters0 active

Questions

Select a part to jump to its question

–/1 mk

–/2 mks

–/2 mks

–/1 mk

–/2 mks

–/2 mks

–/3 mks

–/1 mk

–/3 mks

–/4 mks

–/2 mks

–/3 mks

–/3 mks

–/2 mks

–/2 mks

–/2 mks

–/3 mks

–/4 mks

19(a)19(b)(i)19(b)(ii)

–/4 mks

–/2 mks

21(a)21(b)21(c)

–/6 mks

–/4 mks

–/2 mks

–/3 mks

–/3 mks

–/2 mks

–/3 mks

–/2 mks

29(a)(i)29(a)(ii)29(b)

–/7 mks

21(a)Sequences Recurrence RelationsEasy1 mark

These are the first four diagrams in a sequence. The diagrams are made using grey squares and white squares.

Diagrams 1 to 4 of a sequence of grey and white squares: each diagram n has a horizontal row of n grey squares with columns of white squares above and below them; diagram 1 is 1 grey square, diagram 2 has 2 grey and 2 white, diagram 3 has 3 grey and 6 white, diagram 4 has 4 grey and 12 white

Draw diagram 5 on the grid.

Diagram to annotate

Draw with the mouse or a finger.

21(b)Sequences Recurrence RelationsMedium4 marks

Complete the table for diagram 4 and diagram

n

.

diagram	1	2	3	4	n
number of grey squares	1	2	3	Table answer grey_4	Table answer grey_n
number of white squares	0	2	6	Table answer white_4	$n (n - 1)$
total number of squares	1	4	9	Table answer total_4	Table answer total_n

21(c)Sequences Recurrence RelationsMedium1 mark

Complete this statement. A diagram in this sequence can not have a total number of 120 squares because

Answer

0 words