February/March 2026 Paper 32

2026 · 25 questions · 40 parts · 80 marks

0/80 marks

0Correct0Partial0Wrong40Unattempted

Filters0 active

Questions

Select a part to jump to its question

–/1 mk

–/1 mk

–/2 mks

–/3 mks

–/2 mks

–/4 mks

–/4 mks

–/2 mks

9(a)9(a)(i)9(a)(ii)9(b)

–/5 mks

10(a)10(b)10(c)

–/3 mks

–/4 mks

–/3 mks

–/3 mks

–/3 mks

–/2 mks

16(a)16(b)16(c)16(d)

–/9 mks

–/5 mks

–/3 mks

–/3 mks

–/4 mks

–/3 mks

–/3 mks

–/3 mks

–/2 mks

–/3 mks

Context for question 16

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

Grid showing diagrams 1 to 4 of a sequence of grey and white squares and an empty space for diagram 5: diagram 1 has 2 grey squares, diagram 2 has 4 grey and 2 white, diagram 3 has 6 grey and 6 white, diagram 4 has 8 grey and 12 white

16(a)Sequences Recurrence RelationsEasy1 mark

Draw diagram 5 on the grid.

Diagram to annotate

Draw with the mouse or a finger.

16(b)Sequences Recurrence RelationsHard5 marks

Complete the table for diagram 4 and diagram n. Write your answers for diagram n in their simplest form.

diagram	1	2	3	4	n
number of grey squares	2	4	6	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	2	6	12	Table answer total_4	Table answer total_n

16(c)Sequences Recurrence RelationsEasy1 mark

Complete this statement by writing an expression in terms of n. The total number of squares in diagram n are the same as the number of white squares in diagram

Diagram number

16(d)Sequences Recurrence RelationsMedium2 marks

Mae has 1000 white squares but only 44 grey squares. She makes the largest possible diagram with her squares. Work out the number of white squares she uses.