0% found this document useful (1 vote)
4K views

June 2024 A Level D2 MS

Uploaded by

Qingran
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (1 vote)
4K views

June 2024 A Level D2 MS

Uploaded by

Qingran
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 23

Mark Scheme (Results)

Summer 2024

Pearson Edexcel GCE


In A Level Further Mathematics (9FM0)
Paper 4D Pure Mathematics
Edexcel and BTEC Qualifications

Edexcel and BTEC qualifications are awarded by Pearson, the UK’s largest awarding body. We provide
a wide range of qualifications including academic, vocational, occupational and specific programmes
for employers. For further information visit our qualifications websites at www.edexcel.com or
www.btec.co.uk. Alternatively, you can get in touch with us using the details on our contact us page
at www.edexcel.com/contactus.

Pearson: helping people progress, everywhere

Pearson aspires to be the world’s leading learning company. Our aim is to help everyone progress
in their lives through education. We believe in every kind of learning, for all kinds of people, wherever
they are in the world. We’ve been involved in education for over 150 years, and by working across
70 countries, in 100 languages, we have built an international reputation for our commitment to high
standards and raising achievement through innovation in education. Find out more about how we
can help you and your students at: www.pearson.com/uk

Summer 2024
Question Paper Log P72803A
Publications Code 9FM0_4D_2406_MS*
All the material in this publication is copyright
© Pearson Education Ltd 2024
General Marking Guidance

• All candidates must receive the same treatment. Examiners


must mark the first candidate in exactly the same way as they
mark the last.
• Mark schemes should be applied positively. Candidates must
be rewarded for what they have shown they can do rather than
penalised for omissions.
• Examiners should mark according to the mark scheme not
according to their perception of where the grade boundaries
may lie.
• There is no ceiling on achievement. All marks on the mark
scheme should be used appropriately.
• All the marks on the mark scheme are designed to be awarded.
Examiners should always award full marks if deserved, i.e. if
the answer matches the mark scheme. Examiners should also
be prepared to award zero marks if the candidate’s response
is not worthy of credit according to the mark scheme.
• Where some judgement is required, mark schemes will
provide the principles by which marks will be awarded and
exemplification may be limited.
• When examiners are in doubt regarding the application of the
mark scheme to a candidate’s response, the team leader must
be consulted.
• Crossed out work should be marked UNLESS the candidate has
replaced it with an alternative response.
EDEXCEL GCE MATHEMATICS

General Instructions for Marking

1. The total number of marks for the paper is 75.

2. The Edexcel Mathematics mark schemes use the following types of marks:

• M marks: method marks are awarded for ‘knowing a method and attempting to
apply it’, unless otherwise indicated.
• A marks: Accuracy marks can only be awarded if the relevant method (M) marks
have been earned.
• B marks are unconditional accuracy marks (independent of M marks)
• Marks should not be subdivided.

3. Abbreviations

These are some of the traditional marking abbreviations that will appear in the mark
schemes.

• bod – benefit of doubt


• ft – follow through
• the symbol will be used for correct ft
• cao – correct answer only
• cso - correct solution only. There must be no errors in this part of the
question to obtain this mark
• isw – ignore subsequent working
• awrt – answers which round to
• SC: special case
• oe – or equivalent (and appropriate)
• dep – dependent
• indep – independent
• dp decimal places
• sf significant figures
•  The answer is printed on the paper
• The second mark is dependent on gaining the first mark

4. For misreading which does not alter the character of a question or materially
simplify it, deduct two from any A or B marks gained, in that part of the question
affected.

5. Where a candidate has made multiple responses and indicates which response
they wish to submit, examiners should mark this response.
If there are several attempts at a question which have not been crossed out,
examiners should mark the final answer which is the answer that is the most
complete.
6. Ignore wrong working or incorrect statements following a correct answer.

7. Mark schemes will firstly show the solution judged to be the most common
response expected from candidates. Where appropriate, alternatives
answers are provided in the notes. If examiners are not sure if an answer is
acceptable, they will check the mark scheme to see if an alternative answer is
given for the method used.
Question Scheme Marks AOs

1(a) (i) x = 10 B1 1.1b

(ii) y = 7 B1 1.1b

(2)

(b) 32 B1 1.1b

(1)

(c) Cut B1 1.1b

(1)

(d) SCDFET B1 1.1b

(1)

(e) Use of max-flow min-cut theorem


Identification of cut through AE, DE, DT, EF and FT M1 2.1
Value of flow = 36 A1 3.1a
It follows that flow is maximal A1 2.2a

(3)

(f)

B1 3.3

(ii) maximum flow = 33 B1ft 2.2a

(2)
(10 marks)
Notes for Question 1
(a) B1: CAO for x
B1: CAO for y
(b) B1: CAO
(c) B1: CAO
(d) B1: CAO
(e) M1: Construct argument based on max-flow min-cut theorem (e.g. attempt to find a cut through
saturated arcs). The cut may be drawn or stated in terms of arcs but not as nodes. (Note the only
saturated arc not in the cut is SB)
A1: Use appropriate process of finding a minimum cut: cut + value correct
dA1: Must have stated the value of the flow and correct deduction that the flow is maximal.
Must use max flow = min cut all 4 words
dependent on previous A mark so M1 A0 A1 is not possible
(f) B1: Flows into E go to EIN and flows out of E go from EOUT and arc of capacity 12 from EIN to
EOUT All arcs must have the correct arrow and capacity shown. Split node must be labelled as EIN
and EOUT or E1 and E2
B1ft: Value of their maximum flow – 3
Question Scheme Marks AOs

2 B1 1.1b

M1 1.1b

A1 1.1b

(3)

Alternative 1

B1

Particular solution

M1

A1

(3)
Alternative 2
B1

Compares coefficients
M1

A1

(3)
(3 marks)
Notes for Question 2

B1: any correct expression for


M1: eliminating A to form a first order recurrence relation containing and
A1: CAO for (need not explicitly state )

Alternative 1

B1: Considers the C.F. and deduces with no other values stated
M1: Obtains P.S. and forms equation using
A1: CAO for (need not explicitly state )

Alternative 2

B1: Forms the correct equation for


M1: Attempts to compare coefficients – at least three terms seen
A1: CAO
Question Scheme Marks AOs

3(a) (total) demand (total) supply B1 1.2

(1)

(b) A B C Dummy Supply


E 23 28 22 0 21
F 26 19 29 0 32
B1 1.1b
G 29 24 20 0 29
H 24 26 19 0 23
Demand 45 19 23 18
(1)

(c) A B C D A B C D M1 2.1
E E 21
F A1 1.1b
F 13 19
G G 23 6
H
H 11 12

Exiting cell is GB

M1 1.1b
23 16 19
A B C D
A1 1.1b
0 E X 12 3 1
3 F X X 7
1 G 5 7 X X
1 H X 9 X

A B C D A B C D
E E 21
F F 1 19 12 M1 1.1b
G G 23 6
H H 23 A1 2.2a

Entering cell is FD and exiting cell is HD

(6)

(d) (£)1882 B1 1.1b


(1)
(e)
23 16 17
A B C D
0 E X 12 5 3 M1 2.1
3 F X X 9 X A1 1.1b
3 G 3 5 X X
1 H X 9 1 2
All II are non-negative so solution is optimal A1 2.4

(3)
(12 marks)

Notes for Question 3

(a) B1: CAO (or to make demand = supply or because (total) supply > (total) demand (oe))
Accept e.g. A dummy demand of 18 is needed to meet supply
or there is a total of 105 supply but only 87 demand
(b) B1: CAO Check 18 in demand row
(c) M1: A valid route, only one empty square (GD) used, s balance
A1: Correct route, up to an improved solution (seven numbers no zeros)
M1: Finding 8 shadow costs and 9 improvement indices
A1: Shadow costs and II correct (alternatives columns 0 -7 -4 -24 rows 23 26 24 24)
M1: A valid route, their most negative II chosen, only one empty square used, s balance
A1: CSO (for part (c)) so all previous marks in this part must have been awarded – including
exiting cells (GB and HD) and entering cell (FD) stated correctly (seven numbers no zeros)
(d) B1: CAO
(e) M1: Finding 8 shadow costs and all 9 improvement indices (or 8 SC and at least 1 negative II)
A1: CAO for shadow costs and the 9 improvement indices (alternatives columns 0 -7 -6 -26
rows 23 26 26 24)
A1: CSO (for part (e)) + reason + optimal) accept positive instead of non-negative
Question Scheme Marks AOs

4(a) (i) Subtracting each entry from a constant value e.g. to convert
from maximisation problem to minimisation B1 3.5c

Add a sufficiently large number ( > 12) to cells BQ and DR B1 1.1b


(ii)

e.g. B1 1.1b

(3)

(b) Let be 0 or 1
B1 3.3

where and B1 2.5


minimise
M1 3.3
A1 1.1b

Subject to M1 3.3
A1 1.1b

(6)
(9 marks)
Notes for Question 4
(a) B1: correct reasoning for how to convert from maximisation to minimisation
B1: adding a large number (at least 13) to cells BQ and DR
B1: CAO
(b) B1: defining correctly
B1: correct definition of the values that i and j can take
M1: Attempt at a 15 (or 16) term expression in terms of x (or their defined variable), coefficients
‘correct’, 2 ‘large’ values included, condone 2 slips. If more than 2 errors in (a) ft exactly their table
for this mark only.
A1: CAO including ‘minimise’ (or equivalent 14 term expression with ‘maximise’)
M1: At least four equations, each in three or four variables, unit coefficients, equal to 1 Do not
accept inequalities
A1: CAO (all eight equations)

Maximise

Note: if maximising they must not include a large number for BQ and DR, so only 14 terms
Question Scheme Marks AOs

5(a) Note arcs must show delay time and probability

Plane
M1 3.3
A1 1.1b
M1 3.4
A1 1.1b
M1 3.4

A1 1.1b

(6)

(b) Travel option is Train


dB1 2.2a

(1)

(c) M1 1.1b
Utility values are 7.2427…, 7.2820…, 7.3282…
A1 1.1b
Therefore, the travel option with the best expected utility is Plane A1 2.2a

(3)
(10 marks)
Notes for Question 5

(a) Condone additional arcs seen with 0 probability (plane 3 hours, train 3 and 24 hours, coach
24 hours)
M1: tree diagram with at least eight end pay-offs, one decision node and three chance nodes
(condone missing triangles from end pay offs and incorrect shapes for decision and chance nodes)
A1: correct structure of tree diagram with the non-zero probability 11 arcs labelled correctly
(including probabilities)
M1: at least three end-pay offs consistent with their stated probabilities (must include ticket
price, cost for travel time and cost for delay – may be implied by correct values); at least eight
attempted
A1: all eleven end-pay offs correct including triangles and no incorrect extra (condone if not
fully simplified) (values may be negative as costs)
M1: all three chance nodes attempted with their probabilities
A1: CAO for chance and decision nodes including double line through inferior options – must
have the correct shapes
(b) dB1: deduction of correct travel option (dependent on all method marks earned in (a))
(c) M1: At least one (of the three) utility values correct (FT their end pay offs)
A1: At least two correct
A1: Correct travel option (Plane) together with all three correct values (to at least 3 sf – rounded
or truncated)
Question Scheme Marks AOs

6(a)

Stage State Action Dest Value B1 3.1a


1 H HT T 2*
I IT T 3*
J JT T 4* M1 3.1a
2 F FH H 5 + 2 = 7*
FI I 4 + 3 = 7* A1 1.1b
FJ J 6 + 4 = 10
G GH H 5+2=7
GI I 3 + 3 = 6*
M1 1.1b
3 C CF F 3 + 7 = 10*
CG G 4 + 6 = 10*
A1 1.1b
D DF F 3 + 7 = 10
DG G 1 + 6 = 7*
E EG G 2 + 6 = 8*
M1 1.1b
4 A AC C 4 + 10 = 14
AE E 5 + 8 = 13*
B BC C 4 + 10 = 14 A1ft 1.1b
BD D 7 + 7 = 14
BE E 4 + 8 = 12* A1 1.1b
5 S SA A 3 + 13 = 16
SB B 2 + 12 = 14*

Latest time that Elena can start her journey is 7 am A1 3.2a

(9)

(b) Route: SBEGIT B1 2.2a

(1)
(10 marks)
Notes for Question 6

All M marks – must bring earlier optimal results into calculations. Ignore extra rows. Penalise
lack of * only once per question.

B1: CAO for first stage

M1: Second stage completed. At least 4 rows, something in each cell.


A1: CAO for second stage exactly 5 rows

M1: Third stage completed. At least 4 rows, something in each cell.


A1: CAO for third stage exactly 5 rows

M1: Fourth stage completed. 5 rows, something in each cell.


A1ft: correct ft their optimal values from third stage
A1: CAO for fifth stage

A1: Correct latest start time in context (e.g. 7 am, 07:00, etc.)

(b)
B1: Correct route (dependent on all previous M marks)
Special Case – Maximin or Minimax
Stage State Action Dest Value Value
1 H HT T 2* 2*
I IT T 3* 3*
J JT T 4* 4*
2 F FH H Min (5, 2) = 2 Max (5, 2) = 5
FI I Min (4, 3) = 3 Max (4, 3) = 4*
FJ J Min (6, 4) = 4* Max (6, 4) = 6
G GH H Min (5, 2) = 2 Max (5, 2) = 5*
GI I Min (3, 3) = 3* Max (3, 3) = 3
3 C CF F Min (3, 4) = 3* Max (3, 4) = 4*
CG G Min (4, 3) = 3* Max (4, 5) = 5
D DF F Min (3, 4) = 3* Max (3, 4) = 4*
DG G Min (1, 3) = 1 Max (1, 5) = 5
E EG G Min (2, 3) = 2* Max (2, 5) = 5*
4 A AC C Min (4, 3) = 3* Max (4, 4) = 4*
AE E Min (5, 2) = 2 Max (5, 5) = 5
B BC C Min (4, 3) = 3* Max (4, 4) = 4*
BD D Min (7, 3) = 3* Max (7, 4) = 7
BE E Min (4, 2) = 2 Max (4, 5) = 5
5 S SA A Min (3, 3) = 3* Max (3, 4) = 4*
SB B Min (2, 3) = 2 Max (2, 4) = 4*

B1 M1 A0 M1 A0 M1 A0 A0 A0 B0 - Max 4/10
Question Scheme Marks AOs

7(a) Row minima: (max is )


M1 1.1b
Column maxima: 4, 3, 6 (min is 3)
Row maximin ( ) Column minimax (3) (so not stable) A1 2.4

(2)

(b)
B1 1.1b

M1 2.1
A1 2.5
(P – V = 0)

b.v. V r s t u Value
r 1 1 0 0 0 0
s 1 0 1 0 0 0 M1 3.3
t 1 0 0 0 1 0 0 A1 2.2a
u 0 1 1 1 0 0 0 1 1
P 0 0 0 0 0 0 0 0

(5)

(c) A should play R with probability option S with probability


B1 3.2a
and option T with probability

Value of the game to player A is M1 1.1b

So, value of the game to player B is A1 2.2a

(3)

(d)
M1 2.1
or
A1 1.1b

B should play X with probability option Y with probability


A1 3.2a
and option Z with probability

(3)
(13 marks)

Notes for Question 7

(a) M1: Attempt to calculate row minima and column maxima – condone one error (note row max
are 3, 4, 6 and column min are -1, -2, -3 so we must see where values come from)
A1: Correct reasoning that the game is not stable (accept 3) – dependent on correct row
maximin and column minimax

(b) Note – a fully correct tableau implies all marks in (b)


B1: Correct augmentation – possibly implied by later working in tableau
M1: At least three equations in and at least one dummy variable seen (must be
using columns)
A1: CAO for all four equations (possibly implied by later working in tableau)
M1: Any two (numerical in nature) row correct (ignore labelling of b.v. column)
A1: CAO

(c) B1: Correct optimal strategy in context (dependent on both M marks in (b))
M1: For

A1: CAO

(d) M1: Attempt to set up at least three equations in using the value of the game from (c)
A1: CAO (for any three of the four correct equations)
A1: CAO in context (must have at least three correct equations)
Question Scheme Marks AOs

8 (a) aux. equation is M1 2.1

complementary function is A1 1.1b


Particular solution try and substitute into recurrence
M1 1.1b
relation
and by comparing
linear and constant terms gives
dM1 1.1b

A1ft 1.1b

(5)

(b) leading to A = … and B = … ddM1 3.4

and setting their


dddM1 3.1a

A1 2.2a

(3)

(8 marks)
Notes for Question 8

Note mark (a) and (b) together


(a) M1: correct auxiliary equation and attempt to solve (leading to two distinct values of m)
A1: CAO for complementary function (accept if seen in subsequent working)
M1: correct form for particular solution and substituted into recurrence relation
dM1: compares coefficients and setting up both equations in (so one equation in a only and one
equation in a and b (although a may have already been found from the first equation)) – dependent
on previous M mark (a = 2 and b = - 4)
A1ft: correct general solution following through their complementary function (must be their C.F. +
2n – 4 ) Please award for a fully correct solution seen either here or being used in (b)

(b) ddM1: use correct initial conditions correctly to form simultaneous equations in their A, B and k
and attempt to solve for A and B – dependent on the previous two M marks. Award this mark for
Either
• eliminating either A or B from the correct two equations leading to one of
or (accept any equivalent form)
Or
• eliminating both A and B from their equations using the initial conditions and obtaining
expressions in terms of k

If correct

dddM1: setting coefficient (which must be a linear expression in k) of their equal to zero –
dependent on the previous three M marks (and at least one root of the auxiliary equation being
negative)
A1: CAO (must be from correct working)
Pearson Education Limited. Registered company number 872828

with its registered office at 80 Strand, London, WC2R 0RL, United Kingdom

You might also like