
HL Paper 1
A garden has a triangular sunshade suspended from three points and , relative to an origin in the corner of the garden. All distances are measured in metres.
Find .
Find .
Find .
Hence find the area of the triangle .
Markscheme
A1
[1 mark]
A1
[1 mark]
(M1)A1
Note: Do not award (M1) if less than 2 entries are correct.
[2 marks]
area is (M1)A1
[2 marks]
Examiners report
The position of a helicopter relative to a communications tower at the top of a mountain at time (hours) can be described by the vector equation below.
The entries in the column vector give the displacements east and north from the communications tower and above/below the top of the mountain respectively, all measured in kilometres.
Find the speed of the helicopter.
Find the distance of the helicopter from the communications tower at .
Find the bearing on which the helicopter is travelling.
Markscheme
* This sample question was produced by experienced DP mathematics senior examiners to aid teachers in preparing for external assessment in the new MAA course. There may be minor differences in formatting compared to formal exam papers.
(M1)
A1
[2 marks]
(M1)
A1
[2 marks]
Bearing is or (M1)
A1
[2 marks]
Examiners report
An ant is walking along the edges of a wire frame in the shape of a triangular prism.
The vertices and edges of this frame can be represented by the graph below.
Write down the adjacency matrix, , for this graph.
Find the number of ways that the ant can start at the vertex , and walk along exactly edges to return to .
Markscheme
A1A1A1
Note: Award A1 for each two correct rows.
[3 marks]
calculating (M1)
A1
[2 marks]
Examiners report
The following diagram shows the graph .
Verify that satisfies the handshaking lemma.
Show that cannot be redrawn as a planar graph.
State, giving a reason, whether contains an Eulerian circuit.
Markscheme
* This question is from an exam for a previous syllabus, and may contain minor differences in marking or structure.
METHOD 1
sum of degrees of vertices A1
number of edges A1
the sum is equal to twice the number of edges which
verifies the handshaking lemma R1
METHOD 2
degrees of vertices A1
there are vertices of odd order A1
there is an even number of vertices of odd order
which verifies the handshaking lemma R1
[3 marks]
if planar then M1
A1
inequality not satisfied R1
therefore is not planar AG
Note: method explaining that the graph contains is acceptable.
[3 marks]
there are vertices of odd degree R1
hence it does not contain an Eulerian circuit A1
Note: Do not award R0A1.
[2 marks]
Examiners report
An engineer plans to visit six oil rigs in the Gulf of Mexico, starting and finishing at . The travelling time, in minutes, between each of the rigs is shown in the table.
The data above can be represented by a graph .
Use Prim’s algorithm to find the weight of the minimum spanning tree of the subgraph of obtained by deleting and starting at . List the order in which the edges are selected.
Hence find a lower bound for the travelling time needed to visit all the oil rigs.
Describe how an improved lower bound might be found.
Markscheme
use of Prim’s algorithm M1
A1
A1
Total A1
Note: Award M0A0A0A1 for without correct working e.g. use of Kruskal’s, or with no working.
Award M1A0A0A1 for by using Prim’s from an incorrect starting point.
[4 marks]
(M1)
minutes A1
[2 marks]
delete a different vertex A1
[1 mark]
Examiners report
Points in the plane are subjected to a transformation in which the point is transformed to the point where
.
Describe, in words, the effect of the transformation .
Show that the points form a square.
Determine the area of this square.
Find the coordinates of , the points to which are transformed under .
Show that is a parallelogram.
Determine the area of this parallelogram.
Markscheme
* This question is from an exam for a previous syllabus, and may contain minor differences in marking or structure.
a stretch of scale factor in the direction
and a stretch of scale factor in the direction A1
[1 mark]
the four sides are equal in length A1
A1
so product of gradients , therefore is perpendicular to A1
therefore is a square AG
[3 marks]
area of square A1
[1 mark]
the transformed points are
A2
Note: Award A1 if one point is incorrect.
[2 marks]
A1
therefore is parallel to R1
A1
therefore is parallel to
therefore is a parallelogram AG
[3 marks]
(M1)
A1
[2 marks]
Examiners report
A geometric transformation is defined by
.
Find the coordinates of the image of the point .
Given that , find the value of and the value of .
A triangle with vertices lying on the plane is transformed by .
Explain why both and its image will have exactly the same area.
Markscheme
(M1)
OR A1
[2 marks]
(M1)
(A1)
solve simultaneously:
A1
Note: Award A0 if and are not labelled or are labelled the other way around.
[3 marks]
A1
scale factor of image area is therefore (and the translation does not affect the area) A1
[2 marks]
Examiners report
A ship is travelling with a constant velocity, , measured in kilometres per hour, where
.
At time the ship is at a point relative to an origin , where distances are measured in kilometres.
A lighthouse is located at a point .
Find the position vector of the ship at time hours.
Find the value of when the ship will be closest to the lighthouse.
An alarm will sound if the ship travels within kilometres of the lighthouse.
State whether the alarm will sound. Give a reason for your answer.
Markscheme
A1
[1 mark]
attempt to find the vector from to (M1)
A1
EITHER
(M1)(A1)
minimize to find on GDC (M1)
OR
closest when (M1)
(M1)(A1)
OR
closest when (M1)
(A1)
Solving simultaneously (M1)
THEN
A1
[6 marks]
the alarm will sound A1
R1
Note: Do not award A1R0.
[2 marks]
Examiners report
Part (a) was generally well answered. Following that there were several possible approaches to this question. It was clear that many candidates understood that the closest approach could be found using the scalar product to find orthogonal vectors. However, typical efforts involved attempting to find the value of by assuming that and are perpendicular. Other methods incorrectly applied were equating and . Of course, this led to separate values of for each component. The method of minimizing was not commonly employed.
Part (a) was generally well answered. Following that there were several possible approaches to this question. It was clear that many candidates understood that the closest approach could be found using the scalar product to find orthogonal vectors. However, typical efforts involved attempting to find the value of by assuming that and are perpendicular. Other methods incorrectly applied were equating and . Of course, this led to separate values of for each component. The method of minimizing was not commonly employed.
Part (a) was generally well answered. Following that there were several possible approaches to this question. It was clear that many candidates understood that the closest approach could be found using the scalar product to find orthogonal vectors. However, typical efforts involved attempting to find the value of by assuming that and are perpendicular. Other methods incorrectly applied were equating and . Of course, this led to separate values of for each component. The method of minimizing was not commonly employed.
The diagram below shows a network of roads in a small village with the weights indicating the distance of each road, in metres, and junctions indicated with letters.
Musab is required to deliver leaflets to every house on each road. He wishes to minimize his total distance.
Musab starts and finishes from the village bus-stop at . Determine the total distance Musab will need to walk.
Instead of having to catch the bus to the village, Musab’s sister offers to drop him off at any junction and pick him up at any other junction of his choice.
Explain which junctions Musab should choose as his starting and finishing points.
Markscheme
Odd vertices are A1
Consider pairings: M1
Note: Award (M1) if there are four vertices not necessarily all correct.
has shortest route and
so repeated edges
Note: Condone in place of giving .
has shortest route and
so repeated edges
has shortest route and ,
so repeated edges A2
Note: Award A1 if only one or two pairings are correctly considered.
so best pairing is
weight of route is therefore A1
[5 marks]
least value of the pairings is therefore repeat R1
and A1
Note: Do not award R0A1.
[2 marks]
Examiners report
Two lines and are given by the following equations, where .
It is known that and are perpendicular.
Find the possible value(s) for .
In the case that , determine whether the lines intersect.
Markscheme
setting a dot product of the direction vectors equal to zero (M1)
(A1)
A1
[3 marks]
a common point would satisfy the equations
(M1)
METHOD 1
solving the first two equations simultaneously
A1
substitute into the third equation: M1
so lines do not intersect. R1
Note: Accept equivalent methods based on the order in which the equations are considered.
METHOD 2
attempting to solve the equations using a GDC M1
GDC indicates no solution A1
so lines do not intersect R1
[4 marks]
Examiners report
The following diagram shows a corner of a field bounded by two walls defined by lines and . The walls meet at a point , making an angle of .
Farmer Nate has of fencing to make a triangular enclosure for his sheep. One end of the fence is positioned at a point on , from . The other end of the fence will be positioned at some point on , as shown on the diagram.
He wants the enclosure to take up as little of the current field as possible.
Find the minimum possible area of the triangular enclosure .
Markscheme
METHOD 1
attempt to find using cosine rule M1
(A1)
attempt to solve a quadratic equation (M1)
AND (A1)
Note: At least must be seen, or implied by subsequent working.
minimum area M1
Note: Do not award M1 if incorrect value for minimizing the area has been chosen.
A1
METHOD 2
attempt to find using the sine Rule M1
(A1)
OR (A1)
EITHER
(A1)
area M1
OR
sine rule or cosine rule to find (A1)
minimum area M1
THEN
A1
Note: Award A0M1A0 if the wrong length or the wrong angle selected but used correctly finding a value of for the area.
[6 marks]
Examiners report
As has often been the case in the past, trigonometry is a topic that is poorly understood and candidates are poorly prepared for. Approaches to this question required the use of the cosine or sine rules. Some candidates tried to use right-angled trigonometry instead. A minority of candidates used the cosine rule approach and were more likely to be successful, navigating the roots of the quadratic equation formed. When using the sine rule the method involved the ambiguous case as the required angle was obtuse. Few candidates realized this and this was the most common mistake. In a few instances, the word “minimum” led candidates to attempt an approach using calculus.
The following diagram shows a frame that is made from wire. The total length of wire is equal to . The frame is made up of two identical sectors of a circle that are parallel to each other. The sectors have angle radians and radius . They are connected by lengths of wire perpendicular to the sectors. This is shown in the diagram below.
The faces of the frame are covered by paper to enclose a volume, .
Show that .
Find an expression for in terms of .
Find the expression .
Solve algebraically to find the value of that will maximize the volume, .
Markscheme
M1
A1
Note: Award A1 for any reasonable working leading to expected result e,g, factorizing .
AG
[2 marks]
attempt to use sector area to find volume (M1)
volume
A1
[2 marks]
M1A1A1
[3 marks]
M1
Note: Award this M1 for simplified version equated to zero. The simplified version may have been seen in part (b)(ii).
A1
[2 marks]
Examiners report
Several candidates missed that the angle was in radians and used arc and sector formulas with degrees instead. This aside, part (a) was often well done. Part (b)(i) was also correctly answered by many candidates, but their failure to make any attempt to simplify their answer often led to difficulties in part (b)(ii). Again, failing to simplify the result in part (b)(ii) led to yet more difficulties in part (b)(iii). Some candidates used the product rule to differentiate as rather than the quotient rule. This was fine but made solving the equation in (b)(iii) less straightforward.
Several candidates missed that the angle was in radians and used arc and sector formulas with degrees instead. This aside, part (a) was often well done. Part (b)(i) was also correctly answered by many candidates, but their failure to make any attempt to simplify their answer often led to difficulties in part (b)(ii). Again, failing to simplify the result in part (b)(ii) led to yet more difficulties in part (b)(iii). Some candidates used the product rule to differentiate as rather than the quotient rule. This was fine but made solving the equation in (b)(iii) less straightforward.
Several candidates missed that the angle was in radians and used arc and sector formulas with degrees instead. This aside, part (a) was often well done. Part (b)(i) was also correctly answered by many candidates, but their failure to make any attempt to simplify their answer often led to difficulties in part (b)(ii). Again, failing to simplify the result in part (b)(ii) led to yet more difficulties in part (b)(iii). Some candidates used the product rule to differentiate as rather than the quotient rule. This was fine but made solving the equation in (b)(iii) less straightforward.
Several candidates missed that the angle was in radians and used arc and sector formulas with degrees instead. This aside, part (a) was often well done. Part (b)(i) was also correctly answered by many candidates, but their failure to make any attempt to simplify their answer often led to difficulties in part (b)(ii). Again, failing to simplify the result in part (b)(ii) led to yet more difficulties in part (b)(iii). Some candidates used the product rule to differentiate as rather than the quotient rule. This was fine but made solving the equation in (b)(iii) less straightforward.
At a ship is east and north of a harbour. A coordinate system is defined with the harbour at the origin. The position vector of the ship at is given by .
The ship has a constant velocity of kilometres per hour ().
Write down an expression for the position vector of the ship, hours after .
Find the time at which the bearing of the ship from the harbour is .
Markscheme
A1
Note: Do not condone the use of or any other variable apart from .
[1 mark]
when the bearing from the port is , the distance east from the port is equal to the distance north from the port (M1)
(A1)
( hour minutes) (A1)
time is A1
[4 marks]
Examiners report
Most candidates were able to answer part (a) correctly but there were some very poor examples of vector notation. The question asked for an expression of in terms of and although a failure to write was condoned the use of or some other variable was penalized. In part (b) few candidates recognized that the eastern and northern distances would be equal with a bearing of 045°. Those who correctly obtained a value of often did not use this to find the time as required.
Consider the following directed network.
Write down the adjacency matrix for this network.
Determine the number of different walks of length that start and end at the same vertex.
Markscheme
A2
Note: Award A2 for the transposed matrix. Presentation in markscheme assumes columns/rows ordered A-E; accept a matrix with rows and/or columns in a different order only if appropriately communicated. Do not FT from part (a) into part (b).
[2 marks]
raising their matrix to a power of (M1)
(A1)
Note: The numbers along the diagonal are sufficient to award M1A1.
(the required number is ) A1
[3 marks]
Examiners report
This was well answered by the majority of candidates with most writing down the correct adjacency matrix and then raising it to the power 5.
A vertical pole stands on a sloped platform. The bottom of the pole is used as the origin, , of a coordinate system in which the top, , of the pole has coordinates . All units are in metres.
The pole is held in place by ropes attached at .
One of these ropes is attached to the platform at point . The rope forms a straight line from to .
Find .
Find the length of the rope.
Find , the angle the rope makes with the platform.
Markscheme
A1
[1 mark]
(M1)
A1
[2 marks]
EITHER
A1
(A1)
(M1)
(A1)
Note: If is used in place of then will be negative.
Award A1(A1)(M1)(A1) as above. In order to award the final A1, some justification for changing the resulting obtuse angle to its supplementary angle must be seen.
OR
(A1)
(M1)(A1)
(A1)
THEN
OR A1
[5 marks]
Examiners report
Many candidates appeared unfamiliar with the notation for a vector and interpreted it to mean the magnitude of the vector. This notation is defined in the notation list in the subject guide. Candidates are recommended to be aware of this list and to use it throughout the course; this list indicates notation that will be used in the examination questions without introduction and thus it is important that candidates are familiar. It was also common to see in place of . Often, candidates were able to find the magnitude correctly even though they failed to write the vector. Correct answers to part (c) were more elusive. The use of scalar product or cosine rule was common although some incorrectly assumed that was a right angle. Other errors were to find one of the other angles of the triangle. Some candidates using the scalar product found the obtuse angle between and , but failed to find its supplementary angle. In a question like this, it is important that a suitable level of accuracy is maintained throughout so that early rounding will not affect subsequent parts of the question. Candidates must also learn to final round answers and not to truncate them.
The position vector of a particle, , relative to a fixed origin at time is given by
.
Find the velocity vector of .
Show that the acceleration vector of is never parallel to the position vector of .
Markscheme
attempt at chain rule (M1)
A1
[2 marks]
attempt at product rule (M1)
A1
METHOD 1
let and
finding using
M1
if is the angle between them, then
A1
so therefore the vectors are never parallel R1
METHOD 2
solve
M1
then
Note: Condone candidates not excluding the division by zero case here. Some might go straight to the next line.
A1
this is never true so the two vectors are never parallel R1
METHOD 3
embedding vectors in a 3d space and taking the cross product: M1
A1
since the cross product is never zero, the two vectors are never parallel R1
[5 marks]
Examiners report
In part (a), many candidates found the velocity vector correctly. In part (b), however, many candidates failed to use the product rule correctly to find the acceleration vector. To show that the acceleration vector is never parallel to the position vector, a few candidates put presumably hoping to show that no value of the constant k existed for any t but this usually went nowhere.
A submarine is located in a sea at coordinates relative to a ship positioned at the origin . The direction is due east, the direction is due north and the direction is vertically upwards.
All distances are measured in kilometres.
The submarine travels with direction vector .
The submarine reaches the surface of the sea at the point .
Assuming the submarine travels in a straight line, write down an equation for the line along which it travels.
Find the coordinates of .
Find .
Markscheme
A1A1
Note: Award A1 for each correct vector. Award A0A1 if their “” is omitted.
[2 marks]
(M1)
(M1)
has coordinates A1
Note: Accept the coordinates of in vector form.
[3 marks]
(M1)
A1
[2 marks]
Examiners report
The cost adjacency matrix below represents the distance in kilometres, along routes between bus stations.
All the values in the matrix are positive, distinct integers.
It is decided to electrify some of the routes, so that it will be possible to travel from any station to any other station solely on electrified routes. In order to achieve this with a minimal total length of electrified routes, Prim’s algorithm for a minimal spanning tree is used, starting at vertex A.
The algorithm adds the edges in the following order:
AB AC CD DE.
There is only one minimal spanning tree.
Find with a reason, the value of .
If the total length of the minimal spanning tree is 14, find the value of .
Hence, state, with a reason, what can be deduced about the values of , , .
Markscheme
AB must be the length of the smallest edge from A so . R1A1
[2 marks]
M1A1
[2 marks]
The last minimal edge chosen must connect to E , so since each of , , must be ≥ 9. R1A1
[2 marks]
Examiners report
A particle P moves with velocity v = in a magnetic field, B = , .
Given that v is perpendicular to B, find the value of .
The force, F, produced by P moving in the magnetic field is given by the vector equation F = v × B, .
Given that | F | = 14, find the value of .
Markscheme
(M1)
A1
[2 marks]
(M1)
A1
magnitude is M1
A1
[4 marks]
Examiners report
The equation of the line can be expressed in vector form .
The matrix is defined by .
The line (where ) is transformed into a new line using the transformation described by matrix .
Find the vectors and in terms of and/or .
Find the value of .
Show that the equation of the resulting line does not depend on or .
Markscheme
(one vector to the line is therefore) A1
the line goes up for every across
(so the direction vector is) A1
Note: Although these are the most likely answers, many others are possible.
[2 marks]
(from GDC OR ) A1
[1 mark]
METHOD 1
M1A1
A1
therefore the new line has equation A1
which is independent of or AG
Note: The AG line (or equivalent) must be seen for the final A1 line to be awarded.
METHOD 2
take two points on the line, e.g and M1
these map to
and A1
therefore a direction vector is
(since ) a direction vector is
the line passes through therefore it always has the origin as a jump-on vector A1
the vector equation is therefore A1
which is independent of or AG
Note: The AG line (or equivalent) must be seen for the final A1 line to be awarded.
METHOD 3
M1A1
A1
where is an arbitrary parameter. A1
which is independent of or (as can take any value) AG
Note: The AG line (or equivalent) must be seen for the final A1 line to be awarded.
[4 marks]
Examiners report
In part (a), most candidates were unable to convert the Cartesian equation of a line into its vector form. In part (b), almost every candidate showed that the value of the determinant was zero. In part (c), the great majority of candidates failed to come up with any sort of strategy to solve the problem.
The diagram shows a sector, , of a circle with centre and radius , such that .
Sam measured the value of to be and the value of to be .
It is found that Sam’s measurements are accurate to only one significant figure.
Use Sam’s measurements to calculate the area of the sector. Give your answer to four significant figures.
Find the upper bound and lower bound of the area of the sector.
Find, with justification, the largest possible percentage error if the answer to part (a) is recorded as the area of the sector.
Markscheme
(M1)
A1
Note: Do not award the final mark if the answer is not correct to 4 sf.
[2 marks]
attempt to substitute any two values from or into area of sector formula (M1)
A1
A1
Note: Given the nature of the question, accept correctly rounded OR correctly truncated significant figure answers.
[3 marks]
A1
A1
so the largest percentage error is A1
Note: Accept (), from use of full accuracy answers. Given the nature of the question, accept correctly rounded OR correctly truncated significant figure answers. Award A0A1A0 if is the only value found.
[3 marks]
Examiners report
In part (a), the area was almost always found correctly although some candidates gave the answer 1.0472 which is correct to 4 decimal places, not 4 significant figures as required. In part (b), many candidates failed to realize that the upper bounds for r and θ were 2.5 and 35° and lower bounds were 1.5 and 25°. Consequently, the bounds for the area were incorrect. In many cases, the incorrect values in part (b) were followed through into part (c) although in the percentage error calculations, many candidates had 1.047 in the denominator instead of the appropriate bound.
The above diagram shows the weighted graph G.
Write down the adjacency matrix for G.
Find the number of distinct walks of length 4 beginning and ending at A.
Starting at A, use Prim’s algorithm to find and draw the minimum spanning tree for G.
Your solution should indicate clearly the way in which the tree is constructed.
Markscheme
M = A1
[1 mark]
We require the (A, A) element of M4 which is 13. M1A2
[3 marks]
A1A1A1A1A1
[5 marks]
Examiners report
Sameer is trying to design a road system to connect six towns, A, B, C, D, E and F.
The possible roads and the costs of building them are shown in the graph below. Each vertex represents a town, each edge represents a road and the weight of each edge is the cost of building that road. He needs to design the lowest cost road system that will connect the six towns.
Name an algorithm that will allow Sameer to find the lowest cost road system.
Find the lowest cost road system and state the cost of building it. Show clearly the steps of the algorithm.
Markscheme
EITHER
Prim’s algorithm A1
OR
Kruskal’s algorithm A1
[1 mark]
EITHER
using Prim’s algorithm, starting at A
A1A1A1A1A1
lowest cost road system contains roads AC, CD, CF, FE and AB A1
cost is 20 A1
OR
using Kruskal’s algorithm
A1A1A1A1A1
lowest cost road system contains roads CD, CF, FE, AC and AB A1
cost is 20 A1
Note: Accept alternative correct solutions.
[7 marks]
Examiners report
The diagram below shows a weighted graph.
Use Prim’s algorithms to find a minimal spanning tree, starting at J. Draw the tree, and find its total weight.
Markscheme
(C4)
OR
(C4)
Total weight = 17 (A2)
Note: There are other possible spanning trees.
[6 marks]
Examiners report
Let G be a weighted graph with 6 vertices L, M, N, P, Q, and R. The weight of the edges joining the vertices is given in the table below:
For example the weight of the edge joining the vertices L and N is 3.
Use Prim’s algorithm to draw a minimum spanning tree starting at M.
What is the total weight of the tree?
Markscheme
M → Q (M1)
Q → L (A1)
M → P (A1)
P → N → R (A1)
(A1)
Note: There are other correct answers.
[5 marks]
The total weight is 2 + 1 + 3 + 2 + 3 = 11. (A1)
[1 mark]
Examiners report
In the following diagram, = a, = b. C is the midpoint of [OA] and .
It is given also that and , where .
Find, in terms of a and b .
Find, in terms of a and b .
Find an expression for in terms of a, b and ;
Find an expression for in terms of a, b and .
Show that , and find the value of .
Deduce an expression for in terms of a and b only.
Given that area , find the value of .
Markscheme
b A1
[1 mark]
(M1)
b – a A1
[2 marks]
a M1A1
[2 marks]
a M1A1
[2 marks]
equating coefficients: M1
A1
solving simultaneously: M1
A1AG
[4 marks]
M1A1
[2 marks]
METHOD 1
(M1)
(M1)
A1
(M1)
A1
METHOD 2
A1
or M1
(M1)
A1
A1
[5 marks]
Examiners report
Consider the lines and defined by
r and where is a constant.
Given that the lines and intersect at a point P,
find the value of ;
determine the coordinates of the point of intersection P.
Markscheme
* This question is from an exam for a previous syllabus, and may contain minor differences in marking or structure.
METHOD 1
r M1
M1A1
A1
METHOD 2
M1
attempt to solve M1
A1
A1
[4 marks]
(M1)
A1
[2 marks]
Examiners report
Nymphenburg Palace in Munich has extensive grounds with points of interest (stations) within them.
These nine points, along with the palace, are shown as the vertices in the graph below. The weights on the edges are the walking times in minutes between each of the stations and the total of all the weights is minutes.
Anders decides he would like to walk along all the paths shown beginning and ending at the Palace (vertex A).
Use the Chinese Postman algorithm, clearly showing all the stages, to find the shortest time to walk along all the paths.
Markscheme
* This sample question was produced by experienced DP mathematics senior examiners to aid teachers in preparing for external assessment in the new MAA course. There may be minor differences in formatting compared to formal exam papers.
Odd vertices are B, F, H and I (M1)A1
Pairing the vertices M1
BF and HI
BH and FI
BI and FH A2
Note: award A1 for two correct totals.
Shortest time is (minutes) M1A1
[7 marks]
Examiners report
Find the value of .
Show that where .
Use the principle of mathematical induction to prove that
where .
Hence or otherwise solve the equation in the interval .
Markscheme
* This question is from an exam for a previous syllabus, and may contain minor differences in marking or structure.
(M1)A1
Note: Award M1 for 5 equal terms with \) + \) or signs.
[2 marks]
M1
A1
AG
[2 marks]
let
if
which is true (as proved in part (b)) R1
assume true, M1
Notes: Only award M1 if the words “assume” and “true” appear. Do not award M1 for “let ” only. Subsequent marks are independent of this M1.
consider :
M1
A1
M1
M1
A1
A1
so if true for , then also true for
as true for then true for all R1
Note: Accept answers using transformation formula for product of sines if steps are shown clearly.
Note: Award R1 only if candidate is awarded at least 5 marks in the previous steps.
[9 marks]
EITHER
M1
A1
M1
M1
or A1
and
OR
M1A1
M1A1
of A1
and
THEN
and A1
Note: Do not award the final A1 if extra solutions are seen.
[6 marks]
Examiners report
The weights of the edges in a simple graph G are given in the following table.
Use Prim’s Algorithm, starting with vertex F, to find and draw the minimum spanning tree for G. Your solution should indicate the order in which the edges are introduced.
Markscheme
The edges are introduced in the following order:
FD, FC, CB, BA, CE A2A2A2A2A2
A2
[12 marks]
Examiners report
Apply Prim’s algorithm to the weighted graph given below to obtain the minimal spanning tree starting with the vertex A.
Find the weight of the minimal spanning tree.
Markscheme
We start with point A and write S as the set of vertices and T as the set of edges.
The weights on each edge will be used in applying Prim’s algorithm.
Initially, S = {A}, T = Φ. In each subsequent stage, we shall update S and T.
Step 1: Add edge h: So S = {A, D}, T = {h}
Step 2: Add edge e: So S = {A, D, E} T = {h, e}
Step 3: Add edge d: Then S = {A, D, E, F} T = {h, e, d}
Step 4: Add edge a: Then S = {A, D, E, F, B} T = {h, e, d, a}
Step 5: Add edge i: Then S = {A, D, E, F, B, G} T = {h, e, d, a, i}
Step 6: Add edge g: Then S = (A, D, E, F, B, G, C} T = {h, e, d, a, I, g} (M4)(A3)
Notes: Award (M4)(A3) for all 6 correct,
(M4)(A2) for 5 correct;
(M3)(A2) for 4 correct,
(M3)(A1) for 3 correct;
(M1)(A1) for 2 correct,
(M1)(AO) for 1 correct
OR
(M2) for the correct definition of Prim’s algorithm,
(M2) for the correct application of Prim’s algorithm,
(A3) for the correct answers at the last three stages.
Now S has all the vertices and the minimal spanning tree is obtained.
The weight of the edges in T is 5 + 3 + 5 + 7 + 5 + 6
= 31 (A1)
[8 marks]
Examiners report
In this part, marks will only be awarded if you show the correct application of the required algorithms, and show all your working.
In an offshore drilling site for a large oil company, the distances between the planned wells are given below in metres.
It is intended to construct a network of paths to connect the different wells in a way that minimises the sum of the distances between them.
Use Prim’s algorithm, starting at vertex 3, to find a network of paths of minimum total length that can span the whole site.
Markscheme
(R2)(A4)(M1)
(A1)
Note: Award (R2) for correct algorithms, (R1) for 1 error, (R0) for 2 or more errors.
Award (A4) for correct calculations, (A3) for 1 error, (A2) for 2 errors, (A1) for 3 errors, (A0) for 4 or more errors.
Award (M1) for tree/table/method.
Award (A1) for minimum weight.
[8 marks]
Examiners report
Let a = and b = , .
Given that a and b are perpendicular, find the possible values of .
Markscheme
* This question is from an exam for a previous syllabus, and may contain minor differences in marking or structure.
a • b =
A1
a • b = 0 (M1)
attempt at solving their quadratic equation (M1)
A1
Note: Attempt at solving using |a||b| = |a × b| will be M1A0A0A0 if neither answer found M1(A1)A1A0
for one correct answer and M1(A1)A1A1 for two correct answers.
[4 marks]
Examiners report
The lengths of two of the sides in a triangle are 4 cm and 5 cm. Let θ be the angle between the two given sides. The triangle has an area of cm2.
Show that .
Find the two possible values for the length of the third side.
Markscheme
* This question is from an exam for a previous syllabus, and may contain minor differences in marking or structure.
EITHER
A1
OR
height of triangle is if using 4 as the base or if using 5 as the base A1
THEN
AG
[1 mark]
let the third side be
M1
valid attempt to find (M1)
Note: Do not accept writing as a valid method.
A1A1
or A1A1
[6 marks]
Examiners report
Solve the equation .
Markscheme
* This question is from an exam for a previous syllabus, and may contain minor differences in marking or structure.
METHOD 1
use of M1
(M1)
A1
A1A1
METHOD 2
M1
M1A1
A1A1
Note: Award A1A0 if extra solutions given or if solutions given in degrees (or both).
[5 marks]
Examiners report
Three points in three-dimensional space have coordinates A(0, 0, 2), B(0, 2, 0) and C(3, 1, 0).
Find the vector .
Find the vector .
Hence or otherwise, find the area of the triangle ABC.
Markscheme
A1
Note: Accept row vectors or equivalent.
[1 mark]
A1
Note: Accept row vectors or equivalent.
[1 mark]
METHOD 1
attempt at vector product using and . (M1)
±(2i + 6j +6k) A1
attempt to use area M1
A1
METHOD 2
attempt to use M1
A1
attempt to use area M1
A1
[4 marks]
Examiners report
The weights of the edges of a complete graph G are shown in the following table.
Starting at B, use Prim’s algorithm to find and draw a minimum spanning tree for G. Your solution should indicate the order in which the vertices are added. State the total weight of your tree.
Markscheme
Different notations may be used but the edges should be added in the following order.
Using Prim’s Algorithm, (M1)
BD A1
DF A1
FA A1
FE A1
EC A1
A2
Total weight = 12 A2
[10 marks]
Examiners report
A sector of a circle with radius cm , where > 0, is shown on the following diagram.
The sector has an angle of 1 radian at the centre.
Let the area of the sector be cm2 and the perimeter be cm. Given that , find the value of .
Markscheme
* This question is from an exam for a previous syllabus, and may contain minor differences in marking or structure.
use of the correct formula for area and arc length (M1)
perimeter is (A1)
Note: A1 independent of previous M1.
A1
(as > 0) A1
Note: Do not award final A1 if is included.
[4 marks]
Examiners report
The vectors a and b are defined by a = , b = , where .
Find and simplify an expression for a • b in terms of .
Hence or otherwise, find the values of for which the angle between a and b is obtuse .
Markscheme
* This question is from an exam for a previous syllabus, and may contain minor differences in marking or structure.
a • b = (M1)
= A1
[2 marks]
recognition that a • b = |a||b|cos θ (M1)
a • b < 0 or < 0 or cos θ < 0 R1
Note: Allow ≤ for R1.
attempt to solve using sketch or sign diagram (M1)
A1
[4 marks]
Examiners report
Helen is building a cabin using cylindrical logs of length 2.4 m and radius 8.4 cm. A wedge is cut from one log and the cross-section of this log is illustrated in the following diagram.
Find 50° in radians.
Find the volume of this log.
Markscheme
A1
[1 mark]
volume M1M1M1
Note: Award M1 240 × area, award M1 for correctly substituting area sector formula, award M1 for subtraction of the angles or their areas.
= 45800 (= 45811.96071) A1
[4 marks]