Please write clearly in block capitals.
Centre number Candidate number
Surname __________________________________________________________________________
Forename(s) __________________________________________________________________________
Candidate signature __________________________________________________________________________
I declare this is my own work.
A-level
FURTHER MATHEMATICS
Paper 3 Discrete
Friday 12 June 2026 Afternoon Time allowed: 2 hours
Materials For Examiner’s Use
l You must have the AQA Formulae and statistical tables booklet for
A‑level Mathematics and A‑level Further Mathematics. Question Mark
l You should have a graphical or scientific calculator that meets the 1
requirements of the specification.
2
l You must ensure you have the other optional Question Paper/Answer Book
for which you are entered (either Mechanics or Statistics). You will have 3
2 hours to complete both papers. 4
Instructions 5
l Use black ink or black ball‑point pen. Pencil should only be used for drawing. 6
l Fill in the boxes at the top of this page.
7
l Answer all questions.
l You must answer each question in the space provided for that question. 8
If you require extra space for your answer(s), use the lined pages at the end 9
of this book. Write the question number against your answer(s).
l Do not write outside the box around each page or on blank pages. TOTAL
l Show all necessary working; otherwise marks for method may be lost.
l Do all rough work in this book. Cross through any work that you do not want
to be marked.
Information
l The marks for questions are shown in brackets.
l The maximum mark for this paper is 50.
Advice
l Unless stated otherwise, you may quote formulae, without proof, from the booklet.
l You do not necessarily need to use all the space provided.
(JUN2673673D01)
G/LM/Jun26/G4008/V5 7367/3D
, 2
Do not write
outside the
There are no questions printed on this page box
DO NOT WRITE ON THIS PAGE
ANSWER IN THE SPACES PROVIDED
(02)
G/Jun26/7367/3D
, 3
Do not write
outside the
Answer all questions in the spaces provided. box
1 A salesperson needs to visit four cities: A, B, C and D
The cost, in £, of travelling between each pair of cities is shown in Table 1
Table 1
A B C D
A – 25 15 18
B 25 – 18 20
C 15 18 – 22
D 18 20 22 –
The salesperson wants to determine a lower bound for the total cost of visiting all four
cities, starting and finishing in city A, by using the lower bound algorithm.
They begin by deleting A from Table 1
They correctly find that the total weight of the minimum spanning tree of the network
only involving B, C and D is £38
They then correctly complete the lower bound algorithm and find this lower bound
to be £ L
Determine the value of L
Circle your answer.
[1 mark]
53 71 81 96
Turn over U
(03)
G/Jun26/7367/3D
Centre number Candidate number
Surname __________________________________________________________________________
Forename(s) __________________________________________________________________________
Candidate signature __________________________________________________________________________
I declare this is my own work.
A-level
FURTHER MATHEMATICS
Paper 3 Discrete
Friday 12 June 2026 Afternoon Time allowed: 2 hours
Materials For Examiner’s Use
l You must have the AQA Formulae and statistical tables booklet for
A‑level Mathematics and A‑level Further Mathematics. Question Mark
l You should have a graphical or scientific calculator that meets the 1
requirements of the specification.
2
l You must ensure you have the other optional Question Paper/Answer Book
for which you are entered (either Mechanics or Statistics). You will have 3
2 hours to complete both papers. 4
Instructions 5
l Use black ink or black ball‑point pen. Pencil should only be used for drawing. 6
l Fill in the boxes at the top of this page.
7
l Answer all questions.
l You must answer each question in the space provided for that question. 8
If you require extra space for your answer(s), use the lined pages at the end 9
of this book. Write the question number against your answer(s).
l Do not write outside the box around each page or on blank pages. TOTAL
l Show all necessary working; otherwise marks for method may be lost.
l Do all rough work in this book. Cross through any work that you do not want
to be marked.
Information
l The marks for questions are shown in brackets.
l The maximum mark for this paper is 50.
Advice
l Unless stated otherwise, you may quote formulae, without proof, from the booklet.
l You do not necessarily need to use all the space provided.
(JUN2673673D01)
G/LM/Jun26/G4008/V5 7367/3D
, 2
Do not write
outside the
There are no questions printed on this page box
DO NOT WRITE ON THIS PAGE
ANSWER IN THE SPACES PROVIDED
(02)
G/Jun26/7367/3D
, 3
Do not write
outside the
Answer all questions in the spaces provided. box
1 A salesperson needs to visit four cities: A, B, C and D
The cost, in £, of travelling between each pair of cities is shown in Table 1
Table 1
A B C D
A – 25 15 18
B 25 – 18 20
C 15 18 – 22
D 18 20 22 –
The salesperson wants to determine a lower bound for the total cost of visiting all four
cities, starting and finishing in city A, by using the lower bound algorithm.
They begin by deleting A from Table 1
They correctly find that the total weight of the minimum spanning tree of the network
only involving B, C and D is £38
They then correctly complete the lower bound algorithm and find this lower bound
to be £ L
Determine the value of L
Circle your answer.
[1 mark]
53 71 81 96
Turn over U
(03)
G/Jun26/7367/3D
