18

But this follows by applying the W–A.M.–G.M. to

 
X 2x X
1= [z + x] [z + x].
z+x

25. If ABCD is a quadrilateral inscribed in a circle, prove that the four lines
joining each vertex to the nine point centre of the triangle formed by the other
three vertices are concurrent.
Solution. The given result still holds if we replace the nine point centres by either
the orthocentres or the centroids.
A vector representation is particularly à propos here, since (with the circumcentre
O as an origin and F denoting the vector from O to any point F ) the orthocentre
Ha , the nine point centre Na , the centroid Ga of △BCD are given simply by
Ha = B + C + D, Na = (B + C + D)/2, Ga = (B + C + D)/3, respectively, and
similarly for the other three triangles. Since the proofs for each of the three cases
are practically identical, we just give the one for the orthocentres. The vector
equation of the line La joining A to Ha is given by La = A + λa [B + C + D − A]
where λa is a real parameter. By letting λa = 1/2, one point on the line is
[A + B + C + D]/2 and similarly this point is on the other three lines. For the
nine point centres, the point of concurrency will be 2[A + B + C + D]/3, while
for the centroids, the point of concurrency will be 3[A + B + C + D]/4.
26. How many six digit perfect squares are there each having the property that
if each digit is increased by one, the resulting number is also a perfect square?
Solution. If the six digit square is given by

m2 = a · 105 + b · 104 + c · 103 + d · 102 + e · 10 + f,

then

n2 = (a + 1) · 105 + (b + 1) · 104 + (c + 1) · 103 + (d + 1) · 102 + (e + 1) · 10 + (d + 1),

so that
n2 − m2 = 111, 111 = (111)(1, 001) = (3 · 37)(7 · 11 · 13).
Hence,
n + m = di and n − m = 111, 111/di
where di is one of the divisors of 111, 111. Since 111, 111 is a product of five primes
it has 32 different divisors. But since we must have di > 111, 111/di, there are at
most 16 solutions given by the form lm = 21 (di − 111, 111/di). Then since m2 is a
six digit number, we must have
√
632.46 ≈ 200 10 < 2m < 2, 000.

On checking the various divisors, there are four solutions. One of them corresponds
to di = 3 · 13 · 37 = 1, 443 so that m = 21 (1, 443 − 7 · 11) = 683 and m2 = 466, 489.