Maclaurin 2017 Solutions
Maclaurin 2017 Solutions
Maclaurin 2017 Solutions
Maclaurin
Solution
C
Q
P
A O B
Label the points as shown above, and join O to P, Q and C. Then OP is perpendicular to BC
and OQ is perpendicular to C A, since each of OP and OQ is a radius and each of BC and C A is
a tangent.
Method 1
The area of triangle AOC is 12 r b, that of triangle BOC is 21 ra and that of triangle ABC is 12 ab.
Hence, adding, we have
1
2 ab = 21 r b + 21 ra.
Dividing each term by 12 abr, we obtain
1 1 1
= + .
r a b
Method 2
Since OPCQ is a square, AQ = b − r. The triangles AOQ and ABC are similar (AA), so that
r a
= .
b−r b
Multiplying each side by b(b − r), we get
r b = ab − ar
2. How many triangles (with non-zero area) are there with each of
the three vertices at one of the dots in the diagram?
Solution
Method 1
There are 17
dots in the array, and we must choose 3 of them to obtain a triangle. This can be
done in 17
3 = 680 ways. However, some of these triangles have zero area.
The triangle will have zero area if we choose all three dots on the same line. Hence the number
of triangles of zero area is 2 × 93 = 2 × 84 = 168.
So there are 512 triangles of non-zero area.
Method 2
We may choose two points on the line across the page in 92 = 36 ways, and one point on the line
up the page (but not at the centre) in 8 ways. These choices give rise to 8 × 36 = 288 triangles of
non-zero area.
Similarly we obtain another 288 triangles from two points on the line up the page and one on the
line across the page.
But we have counted twice triangles with a vertex at the point where the lines meet, and there are
8 × 8 = 64 of these. So altogether we have 2 × 288 − 64 = 512 triangles.
Solution
By rewriting the equation in the form
m2 − 21 = ±(n2 − 4).
m2 − n2 = 21 − 4,
so that
(m − n)(m + n) = 17.
Therefore, because 17 is prime, m − n and m + n are equal to 1 and 17, or −1 and −17, in
some order.
Thus in this case there are four solutions for (m, n), namely (±9, ±8).
m2 − 21 = −(n 2 − 4)
In this case, we have
m2 + n2 = 21 + 4.
Hence
m2 + n2 = 52 .
P Q
Solution
Method 1
Method 2
(a + b) a2 − b2 = 4 and
5
(a − b) a2 + b2 = .
2
Solution
Since a2 − b2 = (a − b)(a + b), we may write the first equation as (a + b)2 (a − b) = 4.
Note that a − b , 0, since this would make the left-hand side of both equations zero, which is
false. Hence we can divide the first equation by the second and cancel the term a − b to produce
(a + b)2 8
= .
a2 + b2 5
Multiplying each side by 5 a2 + b2 , we get
5 (a + b)2 = 8 a2 + b2 .
so either a = 3b or b = 3a.
We substitute each of these in turn back into the first equation.
a = 3b
1
Then 4b × 8b2 = 4, so that b = 2 and a = 23 .
b = 3a
Then 4a × −8a2 = 4, so that a = − 21 and b = − 23 .
Solution
The first observation is that it is possible to add a further 36
tiles to the grid. The diagram shows one way of doing this: the
additional tiles are lighter grey and the uncovered squares are
indicated. u u
There are 36 additional tiles in the grid, and four squares are left u u
uncovered.
We show that you cannot improve on this.
Colour the grid like a chessboard with alternating grey and white cells, as shown in Figure 1.
Notice that any tile will cover one cell of each colour.
u
u
Figure 1 Figure 2 Figure 3
Suppose that two opposite corners are left uncovered, as shown in Figure 2. Then the remainder
of the board consists of two separate ‘staircases’.
The upper staircase has 17 grey and 20 white cells, so that at most seventeen 2 × 1 tiles may be
placed there. Similarly for the lower staircase: at most seventeen 2 × 1 tiles may be placed there.
In other words, with this arrangement, at most 34 additional tiles may be placed.
The only way to cover the corners whilst also reducing the ‘excess’ (the difference between the
number of cells of one colour and the number of cells of the other) in both staircases is to place
tiles in the corners as shown in Figure 3. This reduces the number of white cells in the upper
staircase by one, and reduces the number of grey cells in the lower staircase by one. Once again at
most seventeen tiles may be placed in each staircase, achieving at most 36 additional tiles in total.
Therefore the greatest number of additional 2 × 1 tiles that can be placed on the board is 36.