AQA A-LEVEL FURTHER MATHEMATICS Paper 3 7367/3D DISCRETE||QUESTIONS & MARKING SCHEME MERGED||GRADEDA+||

A-level FURTHER MATHEMATICS Paper 3 Discrete Time allowed: 2 hours Materials l You must have the AQA Formulae and statistical tables booklet for A‑level Mathematics and A‑level Further Mathematics. l You should have a graphical or scientific calculator that meets the requirements of the specification. 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 2 hours to complete both papers. Instructions l Use black ink or black ball‑point pen. Pencil should only be used for drawing. l Fill in the boxes at the top of this page. l Answer all questions. l You must answer each question in the space provided for that question. If you require extra space for your answer(s), use the lined pages at the end 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. 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. Please write clearly in block capitals. Centre number Candidate number Surname ________________________________________________________________________ Forename(s) ________________________________________________________________________ Candidate signature ________________________________________________________________________ For Examiner’s Use Question Mark 1 2 3 4 5 6 7 8 9 TOTAL I declare this is my own work. 2 Answer all questions in the spaces provided. 1 The simple-connected graph G is shown below. The graph G has n faces. State the value of n Circle your answer. [1 mark] 2 34 5 2 Jonathan and Hoshi play a zero-sum game. The game is represented by the following pay-off matrix for Jonathan. Hoshi Strategy H1 H2 H3 Jonathan J1 23 2 J2 320 J3 4 1 3 J4 310 The game does not have a stable solution. Which strategy should Jonathan never play? Circle your answer. [1 mark] J1 J2 J3 J4 Jun23/7367/3D Do not write outside the box (02) 3 3 A student is solving a maximising linear programming problem. The graph below shows the constraints, feasible region and objective line for the student’s linear programming problem. 0 50 100 150 200 250 y 25 75 125 175 225 50 Objective line 250 x A D C Feasible region B Which vertex is the optimal vertex? Circle your answer.