2024 A-Level · Paper 1 · Question 12
The last question on the 2024 Paper 1 puts an aircraft and a drone on straight paths above an air traffic control tower. Below is the full solution — and, beside it, the scene itself, built to scale and yours to turn around. Every number in the working is a number you can watch move.
Find the coordinates of the aircraft at its closest point to the air traffic controllers.
Approach
The controllers are not at the origin. The origin is the base of the tower; the controllers sit 0.1 km above it, at . Everything in part (a) is measured from there, and a solution that forgets the 0.1 loses the marks even though the method is right.
A general point on the aircraft's path is
Writing for the controllers' position, the vector from the controllers to the aircraft is
At the closest point this vector is perpendicular to the direction of the path, so their scalar product is zero:
Substituting back into the path:
To check your answer:
At the vector is , and , so it really is perpendicular to the direction vector.
the aircraft is closest to the controllers at .
Note
That last coordinate is km, about 67 m. The aircraft is nearly at ground level when it passes closest — turn the model to a low angle and you can see it skim in over the tower's own height.
Hence determine whether the controllers will see this aircraft, given they can only see aircraft within 4 km.
Thought process
"Hence" is doing real work here. Part (i) found the point where the distance is smallest. If even the smallest distance is more than 4 km, then no point of the whole path is within range — one calculation settles the entire flight.
The distance from the controllers to that closest point is
To check your answer:
and , agreeing to 4 decimal places.
Since , the aircraft never comes within 4 km of the controllers.
the air traffic controllers will not see this aircraft.
Determine the possible values of the positive constant if the two paths do not intersect.
The trap in the first line
is not , and it is not either. The coefficient of must be 1 before you can read off a direction vector. Setting the whole expression equal to a parameter avoids the question entirely, which is why it is the safer route.
Setting the common value of the drone's Cartesian equation to :
So the drone's path in vector form is
If the paths intersect, there are values of and satisfying all three coordinates at once:
Equations (1) and (2) involve only and , so solve those first:
Equation (3) then fixes the only value of that lets the paths meet:
To check your answer:
Putting into (1) gives , matching (2). With , both paths pass through .
the paths intersect only when , so they do not intersect for .
Note — what is happening geometrically
The two directions are not parallel, so for every other the paths are skew: one passes over the other with a gap of km. Raising lifts the whole drone path, and the gap closes to zero exactly at before opening again.
Find the acute angle between the paths of the aircraft and the drone.
The angle between two paths is the angle between their direction vectors:
Since the angle asked for is acute, take the magnitude of the scalar product:
To check your answer:
, so and — acute, as required.
the acute angle between the paths is (1 d.p.).
Note
Dropping the modulus signs gives . That is the angle between the direction vectors as drawn, and it is obtuse — the two answers add to . The paths themselves cross at both angles; the question names the one it wants.
With , find the distance between the aircraft at and the drone at .
The vector from the aircraft to the drone at that instant is
so the distance between them is
To check your answer:
, and Both given points do lie on their paths: is the aircraft at , and is the drone at when .
the distance between them at that instant is km (3 s.f.).
By considering the vector between them, determine whether that distance is the shortest distance between the two paths.
Approach
The shortest distance between two paths is measured along a line perpendicular to both of them. So there is nothing to calculate beyond a scalar product: test the joining vector against a direction vector, and a single non-zero answer settles it.
Testing against the aircraft's direction vector:
To check your answer:
The drone's direction fails too: . Either non-zero value is enough to answer the question; showing one is what earns the marks.
Since , the joining vector is not perpendicular to the aircraft's path.
the distance found in (d)(i) is not the shortest distance between the two paths.
Note
Using the gap formula from part (b) with , the true shortest distance is km — shorter than the 2.35 km measured on radar, exactly as "not the shortest" requires. The model draws both segments so you can see the radar reading is taken at a slight slant.
Every Ten-Year Series question, worked in full — with the reasoning written out, the traps named, and the geometry you can actually turn around in your hands.