Questions - A-Level Maths

Browse by module

All questions AEA AS Paper 1 AS Paper 2 AS Pure C1 C12 C2 C3 C34 C4 CP AS CP1 CP2 D1 D2 F1 F2 F3 FD1 FD1 AS FD2 FD2 AS FM1 FM1 AS FM2 FM2 AS FP1 FP1 AS FP2 FP2 AS FP3 FS1 FS1 AS FS2 FS2 AS Further AS Paper 1 Further AS Paper 2 Discrete Further AS Paper 2 Mechanics Further AS Paper 2 Statistics Further Additional Pure Further Additional Pure AS Further Discrete Further Discrete AS Further Extra Pure Further Mechanics Further Mechanics A AS Further Mechanics AS Further Mechanics B AS Further Mechanics Major Further Mechanics Minor Further Numerical Methods Further Paper 1 Further Paper 2 Further Paper 3 Further Paper 3 Discrete Further Paper 3 Mechanics Further Paper 3 Statistics Further Paper 4 Further Pure Core Further Pure Core 1 Further Pure Core 2 Further Pure Core AS Further Pure with Technology Further Statistics Further Statistics A AS Further Statistics AS Further Statistics B AS Further Statistics Major Further Statistics Minor Further Unit 1 Further Unit 2 Further Unit 3 Further Unit 4 Further Unit 5 Further Unit 6 H240/01 H240/02 H240/03 M1 M2 M3 M4 M5 Mechanics 1 P1 P2 P3 P4 PMT Mocks PURE Paper 1 Paper 2 Paper 3 Pure 1 S1 S2 S3 S4 Stats 1 Unit 1 Unit 2 Unit 3 Unit 4

Browse by board

AQA AS Paper 1 AS Paper 2 C1 C2 C3 C4 D1 D2 FP1 FP2 FP3 Further AS Paper 1 Further AS Paper 2 Discrete Further AS Paper 2 Mechanics Further AS Paper 2 Statistics Further Paper 1 Further Paper 2 Further Paper 3 Discrete Further Paper 3 Mechanics Further Paper 3 Statistics M1 M2 M3 Paper 1 Paper 2 Paper 3 S1 S2 S3 CAIE FP1 FP2 Further Paper 1 Further Paper 2 Further Paper 3 Further Paper 4 M1 M2 P1 P2 P3 S1 S2 Edexcel AEA AS Paper 1 AS Paper 2 C1 C12 C2 C3 C34 C4 CP AS CP1 CP2 D1 D2 F1 F2 F3 FD1 FD1 AS FD2 FD2 AS FM1 FM1 AS FM2 FM2 AS FP1 FP1 AS FP2 FP2 AS FP3 FS1 FS1 AS FS2 FS2 AS M1 M2 M3 M4 M5 P1 P2 P3 P4 PMT Mocks Paper 1 Paper 2 Paper 3 S1 S2 S3 S4 OCR AS Pure C1 C2 C3 C4 D1 D2 FD1 AS FM1 AS FP1 FP1 AS FP2 FP3 FS1 AS Further Additional Pure Further Additional Pure AS Further Discrete Further Discrete AS Further Mechanics Further Mechanics AS Further Pure Core 1 Further Pure Core 2 Further Pure Core AS Further Statistics Further Statistics AS H240/01 H240/02 H240/03 M1 M2 M3 M4 Mechanics 1 PURE Pure 1 S1 S2 S3 S4 Stats 1 OCR MEI AS Paper 1 AS Paper 2 C1 C2 C3 C4 D1 D2 FP1 FP2 FP3 Further Extra Pure Further Mechanics A AS Further Mechanics B AS Further Mechanics Major Further Mechanics Minor Further Numerical Methods Further Pure Core Further Pure Core AS Further Pure with Technology Further Statistics A AS Further Statistics B AS Further Statistics Major Further Statistics Minor M1 M2 M3 M4 Paper 1 Paper 2 Paper 3 S1 S2 S3 S4 WJEC Further Unit 1 Further Unit 2 Further Unit 3 Further Unit 4 Further Unit 5 Further Unit 6 Unit 1 Unit 2 Unit 3 Unit 4

Sort by: Default | Easiest first | Hardest first

OCR MEI Paper 2 Specimen Q1

5 marks Easy -1.2

1 In this question you must show detailed reasoning. Find the coordinates of the points of intersection of the curve \(y = x ^ { 2 } + x\) and the line \(2 x + y = 4\).

OCR MEI Paper 3 2022 June Q10

5 marks Standard +0.3

10 In this question you must show detailed reasoning. Fig. C2.2 indicates that the curve \(\mathrm { y } = \frac { 4 \mathrm { x } ( \pi - \mathrm { x } ) } { \pi ^ { 2 } } - \sin \mathrm { x }\) has a stationary point near \(x = 3\).

Verify that the \(x\)-coordinate of this stationary point is between 2.6 and 2.7.
Show that this stationary point is a maximum turning point.

the roots of the equation,
the value of \(k\).

OCR MEI Further Pure Core AS Specimen Q8

9 marks Challenging +1.8

8 In this question you must show detailed reasoning.

Explain why all cubic equations with real coefficients have at least one real root.
Points representing the three roots of the equation \(z ^ { 3 } + 9 z ^ { 2 } + 27 z + 35 = 0\) are plotted on an Argand diagram. Find the exact area of the triangle which has these three points as its vertices.

OCR MEI D1 Q2

Moderate -0.3

2 Answer this question on the insert provided.

Use Dijkstra's algorithm to find the least weight route from A to G in the network shown in Fig. 2.1. Show the order in which you label vertices, give the route and its weight. \begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{5d8d35b7-e4ba-4bc0-93a1-0cae58093a02-003_458_586_525_758} \captionsetup{labelformat=empty} \caption{Fig. 2.1}
\end{figure}
Fig. 2.2 shows a partially completed application of Kruskal's algorithm to find a minimum spanning tree for the network. \begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{5d8d35b7-e4ba-4bc0-93a1-0cae58093a02-003_417_524_1309_786} \captionsetup{labelformat=empty} \caption{Fig. 2.2}
\end{figure} Complete the algorithm and give the total weight of your minimum spanning tree.

OCR MEI D1 2005 January Q2

8 marks Moderate -0.3

2 Answer this question on the insert provided.

Use Dijkstra's algorithm to find the least weight route from \(A\) to \(G\) in the network shown in Fig. 2.1. Show the order in which you label vertices, give the route and its weight. \begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{b9ee9306-18ca-42b3-9f2e-b23849374b5e-3_458_584_525_760} \captionsetup{labelformat=empty} \caption{Fig. 2.1}
\end{figure}
Fig. 2.2 shows a partially completed application of Kruskal's algorithm to find a minimum spanning tree for the network. \begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{b9ee9306-18ca-42b3-9f2e-b23849374b5e-3_421_533_1307_779} \captionsetup{labelformat=empty} \caption{Fig. 2.2}
\end{figure} Complete the algorithm and give the total weight of your minimum spanning tree.

OCR MEI D1 2005 January Q4

16 marks Moderate -0.8

4 Answer this question on the insert provided. The table shows activities involved in a "perm" in a hair salon, their durations and immediate predecessors. \begin{table}[h]

	Activity	Duration (mins)	Immediate predecessor(s)
A	shampoo	5	-
B	prepare perm lotion	2	-
C	make coffee for customer	3	-
D	trim	5	A
E	clean sink	3	A
F	put rollers in	15	D
G	clean implements	3	D
H	apply perm lotion	5	B, F
I	leave to set	20	C,H
J	clean lotion pot and spreaders	3	H
K	neutralise and rinse	10	I, E
L	dry	10	K
M	wash up and clean up	15	K
N	style	4	G, L

\captionsetup{labelformat=empty} \caption{Table 4}

\end{table}

Complete the activity-on-arc network in the insert to represent the precedences.
Perform a forward pass and a backward pass to find early and late event times. Give the critical activities and the time needed to complete the perm.
Give the total float time for the activity \(G\). Activities \(\mathrm { D } , \mathrm { F } , \mathrm { H } , \mathrm { K }\) and N require a stylist.
Activities \(\mathrm { A } , \mathrm { B } , \mathrm { C } , \mathrm { E } , \mathrm { G } , \mathrm { J }\) and M are done by a trainee.
Activities \(I\) and \(L\) require no-one in attendance.
A stylist and a trainee are to give a perm to a customer.
Use the chart in the insert to show a schedule for the activities, assuming that all activities are started as early as possible.
Which activity would be better started at its latest start time?

OCR MEI D1 2005 June Q1

8 marks Easy -1.8

1 Answer this question on the insert provided. The nodes in the unfinished graph in Fig. 1 represent six components, A, B, C, D, E, F and the mains. The components are to be joined by electrical cables to the mains. Each component can be joined directly to the mains, or can be joined via other components. \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{03df7d9e-63d4-48fb-9cf3-e92003f44788-2_486_879_623_607} \captionsetup{labelformat=empty} \caption{Fig. 1}

\end{figure} The total number of connections that the electrician has to make is the sum of the orders of the nodes in the finished graph.

Draw arcs representing suitable cables so that the electrician has to make as few connections as possible. Give this number. The electrician has a junction box. This can be represented by an eighth node on the graph.
What is the minimum number of connections which the electrician will have to make if he uses the junction box?
The electrician has to make more connections if he uses his junction box. Why might he choose to use it anyway? The electrician decides not to use the junction box. He measures each of the distances between pairs of nodes, and records them in a complete graph. He then constructs a minimum connector for his graph to find which nodes to connect.
Will this result in the minimum number of connections? Justify your answer.

OCR MEI D1 2005 June Q2

8 marks Moderate -0.8

2 Answer this question on the insert provided. A maze is constructed by building east/west and north/south walls so that there is a route from the entrance to the exit. The maze is shown in Fig. 2.1. \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{03df7d9e-63d4-48fb-9cf3-e92003f44788-3_495_717_470_671} \captionsetup{labelformat=empty} \caption{Fig. 2.1}

\end{figure} On entering the maze Janet says "I'm always going to keep a hand in contact with the wall on the right." John says "I'm always going to keep a hand in contact with the wall on the left."

On the insert for this question show Janet's route through the maze. On the insert show John's route.
Will these strategies always find a way through such mazes? Justify your answer. In some mazes the objective is to get to a marked point before exiting. An example is shown in Fig. 2.2, where \(\mathbf { X }\) is the marked point. \begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{03df7d9e-63d4-48fb-9cf3-e92003f44788-3_497_716_1672_669} \captionsetup{labelformat=empty} \caption{Fig. 2.2}
\end{figure} In the maze shown in Fig. 2.2 Janet's algorithm takes her to \(\mathbf { X }\). John's algorithm does not take him to \(\mathbf { X }\). John modifies his algorithm by saying that he will turn his back on the exit if he arrives there without visiting \(\mathbf { X }\). He will then move onwards, continuing to keep a hand in contact with the wall on the left.
Will this modified algorithm take John to the point \(\mathbf { X }\) in the maze in Fig. 2.2?
Will this modified algorithm take John to any marked point in the maze in Fig. 2.2? Justify your answer.

OCR MEI D1 2005 June Q4

16 marks Standard +0.3

4 Answer parts (i) and (ii) on the insert provided. Fig. 4 shows a network of roads giving direct connections between a city, C , and 7 towns labelled P to V. The weights on the arcs are distances in kilometres. The local coastline is also shown. \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{03df7d9e-63d4-48fb-9cf3-e92003f44788-5_536_828_573_642} \captionsetup{labelformat=empty} \caption{Fig. 4}

\end{figure}

Use Dijkstra's algorithm on the insert to find the shortest distances from each of the towns to the city, C. List those distances and give the shortest route from P to C and from V to C. [8]
Use Kruskal's algorithm to find a minimum connector for the network. List the order in which you include arcs and give the length of your connector. A bridge is built giving a direct road between P and Q of length 12 km .
What effect does the bridge have on the shortest distances from the towns to the city? (You do not need to use an algorithm to answer this part of the question.)
What effect does the bridge have on the minimum connector for the network? (You do not need to use an algorithm to answer this part of the question.)
Before the bridge was built it was possible to travel from P to C using every road once and only once. With the bridge in place, it is possible to travel from a different town to C using every road once and only once. Give this town and justify your answer.

OCR MEI D1 2006 June Q1

8 marks Moderate -0.3

1 Answer this question on the insert provided. \begin{figure}[h]

\includegraphics[alt={},max width=\textwidth]{c429bfed-9241-409a-9cd5-9553bf16c9df-2_658_739_466_662} \captionsetup{labelformat=empty} \caption{Fig. 1}

\end{figure}

Apply Dijkstra's algorithm to the copy of Fig. 1 in the insert to find the least weight route from A to D. Give your route and its weight.
Arc DE is now deleted. Write down the weight of the new least weight route from A to D , and explain how your working in part (i) shows that it is the least weight.
[0pt] [2]

OCR MEI D1 2006 June Q6

16 marks Moderate -0.5

6 Answer parts (ii)(A) and (iii)(B) of this question on the insert provided. A particular component of a machine sometimes fails. The probability of failure depends on the age of the component, as shown in Table 6.

Probability of failure during year,

given no earlier failure

\section*{Table 6} You are to simulate six years of machine operation to estimate the probability of the component failing during that time. This will involve you using six 2-digit random numbers, one for each year.

Give a rule for using a 2-digit random number to simulate failure of the component in its first year of life. Similarly give rules for simulating failure during each of years 2 to 6 .
(A) Use your rules, together with the random numbers given in the insert, to complete the simulation table in the insert. This simulates 10 repetitions of six years operation of the machine. Start in the first column working down cell-by-cell. In each cell enter a tick if there is no simulated failure and a cross if there is a simulated failure. Stop and move on to the next column if a failure occurs.
(B) Use your results to estimate the probability of a failure occurring. It is suggested that any component that has not failed during the first three years of its life should automatically be replaced.
(A) Describe how to simulate the operation of this policy.
(B) Use the table in the insert to simulate 10 repetitions of the application of this policy. Re-use the same random numbers that are given in the insert.
(C) Use your results to estimate the probability of a failure occurring.
How might the reliability of your estimates in parts (ii) and (iii) be improved?

OCR Further Statistics AS 2018 June Q6

5 marks

6 In this question you must show detailed reasoning. The random variable \(T\) has a binomial distribution. It is known that \(\mathrm { E } ( T ) = 5.625\) and the standard deviation of \(T\) is 1.875 . Find the values of the parameters of the distribution.

OCR Further Pure Core 1 2022 June Q1

6 marks Standard +0.8

1 In this question you must show detailed reasoning.

Show that \(\cosh ( 2 \ln 3 ) = \frac { 41 } { 9 }\). The region \(R\) is bounded by the curve with equation \(\mathrm { y } = \sqrt { \operatorname { sinhx } }\), the \(x\)-axis and the line with equation \(x = 2 \ln 3\) (see diagram). The units of the axes are centimetres. \includegraphics[max width=\textwidth, alt={}, center]{23e58e5e-bbaa-4932-aad0-89b3de6647b2-2_652_668_740_242} A manufacturer produces bell-shaped chocolate pieces. Each piece is modelled as being the shape of the solid formed by rotating \(R\) completely about the \(x\)-axis.
Determine, according to the model, the exact volume of one chocolate piece.

OCR Further Pure Core 2 2021 November Q2

8 marks Moderate -0.3

2 In this question you must show detailed reasoning. The complex numbers \(z _ { 1 }\) and \(z _ { 2 }\) are given by \(z _ { 1 } = 3 - 7 \mathrm { i }\) and \(z _ { 2 } = 2 + 4 \mathrm { i }\).

Express each of the following as exact numbers in the form \(a + b \mathrm { i }\).
1. \(3 z _ { 1 } + 4 z _ { 2 }\)
2. \(z _ { 1 } z _ { 2 }\)
3. \(\frac { Z _ { 1 } } { Z _ { 2 } }\)
Write \(z _ { 1 }\) in modulus-argument form giving the modulus in exact form and the argument correct to \(\mathbf { 3 }\) significant figures.