Congratulations to Matthew Whitten from The Cavendish School, Markus Kuan from Northstowe Secondary College, Aarna Singh from Wallington High School for Girls, Henry Boulton and Ishaan Agarwal from Cambourne Village College for successfully solving the problem!
Question 1 — The Common Chord
(a)
We have
![]()
At the intersections,
![]()
Rearranging,
![]()
![]()
Hence
or
. Substituting into
, the intersection points are
and
.
The gradient of the line is
![]()
Using
and the point
,
![]()
Therefore, the line is
![]()
(b)
Method 1: Vieta’s Formulae (Not in GCSE):
We have
![]()
At the intersections,
![]()
so
![]()
Let the roots be
and
. By Vieta’s Formulae
![]()
The corresponding
-coordinates are
and
. The gradient of the line joining the points is
![]()
Therefore we can substitute the values in to form:
![]()
![]()
![]()
![]()
![]()
Method 2: Elimination of Quadratic Method
At the intersections,
![]()
and
![]()
Multiplying (1) by
,
![]()
Multiplying (2) by
,
![]()
Subtracting the second equation from the first eliminates
:
![]()
Rearranging,
![]()
Therefore, m = ![]()
(c)
The simplest solution is to set
.
![]()
Rearranging provides the required structure
![]()
(d)
![]()
![]()
![]()
![]()
![]()
![]()
As both sides are equal and both sides contain a constant value and a variant value dependent on
, the coefficients must be equal.
This leaves us with the result
![]()
(It is worthwhile to note that this can be done by inspection using sum of roots. However, the question asks us to figure this out with expansion instead.)
(e)
![]()
![]()
![]()
![]()
![]()
![]()
The second part follows:
![]()
![]()
![]()
![]()
![]()
![]()
![]()
(f)
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
The second part follows using information from (e):
![]()
![]()
![]()
![]()
![]()
(g)
![]()
![]()
![]()
![]()
from this
![]()
![]()
![]()
and
![]()
![]()
![]()
Substituting
![]()
![]()
General solution is
![]()
Question 2 — The Hidden Derivative
(a)
The coefficients are
,
,
respectively.
(Note: the coefficient of
for the
power of
is
)
(b)
The easiest few ways is to realise that this is very similar to differentiation, and simply “undifferentiate” the given expression.
Applying backwards logic from (a) was expected and results in the same form
![]()
(c)
Applying the same logic from previous part provides![]()
Question 3 — Consecutive Squares
(a)
For every positive integer (n),
![]()
Since
and
are consecutive integer squares,
cannot be a perfect square.
(b)
Expanding the first expression,
![]()
Expanding the second,
![]()
(c*)
The idea for this part was to apply the same logic from (a) but with a bit more working.
An example solution is shown below, but any valid proofs are awarded full credit.
![]()
![]()
![]()
![]()
![]()
then
![]()
![]()
then the next consecutive perfect square from
would be ![]()
![]()
![]()
Test values of
on
:
for
we get
. So,
is a perfect square.
for
, ![]()
![]()
Check
:
![]()
![]()
![]()
as all other values leave
nested between 2 consecutive perfect squares.
If
is not a square then neither is
a square, due to
being a square.
the only value of
giving perfect square of the form:
![]()
![]()