Solutions and Comments
 7.

Let
S = 
1^{2} 1 ·3

+ 
2^{2} 3 ·5

+ 
3^{2} 5 ·7

+ ¼+ 
500^{2} 999·1001

. 

Find the value of S.
Solution. [Miranda Holmes] Each term of S is of the
form

i^{2} (2i  1)(2i + 1)

= 
1 4


æ ç
è


i 2i  1

+ 
i 2i + 1


ö ÷
ø

. 

Thus
S = 
1 4


500 å
i = 1


æ ç
è


i 2i  1

+ 
i 2i + 1


ö ÷
ø

. 

4S = 
500 å
i = 1


æ ç
è


i 2i  1

+ 
i 2i + 1


ö ÷
ø

= 
1 1

+ 
1 3

+ 
2 3

+ 
2 5

+ 
3 5

+ 
3 7

+ ¼+ 
500 999

+ 
500 1001

. 

Since

i 2i + 1

+ 
i + 1 2i + 1

= 1 , 

we can combine all such terms to get
4S = 1 + 499 + 
500 1001

= 
501000 1001

. 

Thus,
 8.

The sequences { a_{n} } and { b_{n} } are such
that, for every positive integer n,
a_{n} > 0 , b_{n} > 0 , a_{n+1} = a_{n} + 
1 b_{n}

, b_{n+1} = b_{n} + 
1 a_{n}

. 

Prove that a
_{50} + b
_{50} > 20.
Solution. Note that x + (1/x) ³ 2 for every positive
real x. Consider the sequence c_{n} = (a_{n} + b_{n})^{2}.
Since
c_{2} = (a_{2} + b_{2})^{2} = 
æ ç
è

a_{1} + 
1 b_{1}

+b_{1} + 
1 a_{1}


ö ÷
ø

2

= 
é ê
ë


æ ç
è

a_{1} + 
1 a_{1}


ö ÷
ø

+ 
æ ç
è

b_{1} + 
1 b_{1}


ö ÷
ø


ù ú
û

2

, 

we find that c
_{2} ³ (2 + 2)
^{2} = 16.
For each positive integer n,


= (a_{n+1} + b_{n+1})^{2} = 
æ ç
è

a_{n} + 
1 b_{n}

+b_{n} + 
1 a_{n}


ö ÷
ø

2


 
= [(a_{n}^{2} + b_{n}^{2} + 2a_{n}b_{n}) + 
æ ç
è


1 a_{n}^{2}

+ 
1 b_{n}^{2}

+2· 
1 a_{n}

· 
1 b_{n}


ö ÷
ø


 
+ 2 ·a_{n} · 
1 a_{n}

+ 2 ·b_{n} · 
1 b_{n}

+ 2 
æ ç
è


a_{n} b_{n}

+ 
b_{n} a_{n}


ö ÷
ø


 
= c_{n} + 
æ ç
è


1 b_{n}

+ 
1 a_{n}


ö ÷
ø

2

+ 2 + 2 + 2 · 
æ ç
è


a_{n} b_{n}

+ 
b_{n} a_{n}


ö ÷
ø

> c_{n} + 8 , 

 

Thus, c
_{n+1} > c
_{n} + 8 . It follows that
c_{50} > c_{49} + 8 > c_{48} + 2 ·8 > ¼ > c_{2} + 48 ·8 ³ 16 + 48 ·8 = 400 . 

Since a
_{50} + b
_{50} > 0, it follows that
a
_{50} + b
_{50} > 20.
 9.

There are six points in the plane,
no three of them collinear. Any three of them
are vertices of a triangle whose sides are of different length.
Prove that there exists a triangle whose smallest side is the
largest side of another triangle.
Comment. Before giving the solution to the problem, we
present a result that you should be aware of; pay also close
attention to the proof.
Proposition. There are six points in the plane or in
space, no
three of them collinear. Each of the segments between two of
them is coloured in one of two colours. There exists a
triangle whose vertices are three of the given points and
whose sides are of the same colour.
Proof. Let A be one of the points. There are five
segments joining A to the other points. Since they
have one of two colours, by the Pigeonhole Principle, at
least three of them must have the same colour. Wolog,
suppose that AB, AC, AD are coloured the same.
If any of the segments BD, BC, CD has this colour,
then we will have a triangle in this colour. Otherwise,
BCD must be a triangle all of whose edges have the
other colour.
Note 1: The minimum number of points with such a property is
6. If there are five points, it is possible to colour the
segments between any two of them so that a triangle with
edges of a single colour does not exist. For example, for
a regular pentagon, we can colour all the sides with one
colour and all the diagonals with the other.
Note 2: A triangle of onecolour always exists when we have
17 points in the plane (no three collinear) and three colours
are used for the segments. This can be given a similar proof.
>From any point, at least six of the segments emanating from
it have the same colour. Now look at the six points
terminating these segments.
Now we can solve the problem.
Solution. Consider the six points and all triangles whose
vertices are any three of them. Colour the
(uniquely determined) largest side of each
triangle black, and colour the remaining edges red.
There must be a triangle all of whose edges are the same
colour. This colour cannot be red. (Why?) So there must
be a triangle all of whose edges are black; its smallest
edge must be the largest edge of some other triangle.
 10.

In a rectangle, whose sides are 20 and 25 units of
length, are placed 120 squares of side 1 unit of length.
Prove that a circle of diameter 1 unit can be placed in the
rectangle, so that it has no common points with the squares.
Solution. [Miranda Holmes] If a circle of diameter 1 can
be placed, it means that there must be a point in the rectangle
such that every point of every square is more than 1/2 units
away from it to the centre of the circle. The maximum area A
around each square in which the centre of the circle cannot be
located is the area of the figure F formed by
(a) the square;
(b) four rectangles of dimensions 1 ×^{1}/_{2} external
to the sides of the square;
(c) four quarters of circles with radius 1/2 units
external to the square with and centres at
the vertices of the square.
Hence, A = 1 + ^{1}/_{2}·1 ·4 +(^{1}/_{2})^{2} p = 3 + [(p)/4]. As there are
120 squares, the sum of all such areas within the
rectangle does not exceed 120·(3 +[(p)/4]) < 455.
As the circle should be placed inside of the rectangle, its centre
cannot be less than 1/2 units away from the rectangle's sides,
i.e., it can be only in the rectangle with sides 19 and 24
units of length, whose sides are parallel to the rectangle's sides
on the distance 1/2 units from them. The area of this rectangle
is 19 ×24 = 456. But 456  455 > 0, so at least one point
is not covered by any of the 120 figures F described above.. This
point can be the centre of a circle of diameter 1 lying within the
rectangle and having no point in common with any of the squares.
 11.

Each of nine lines divides a square into two quadrilaterals,
such that the ratio of their area is 2:3. Prove that at
least three of these lines are concurrent.
Solution. [Miranda Holmes] Since the lines divide the square into
two quadrilaterals, they cut opposite sides of the square.
Let the vertices of the square be A, B, C, D (counterclockwise),
and let one of the lines intersect AB at M and CD at N.
We can represent these points in an appropriate coordinate plane
as A(0, 0), B(1, 0), C(1, 1), D(0, 1), M(m, 0),
N(n, 1).
Let [AMND]:[MBCN] = 2:3. Then [AMND] = (m + n)/2 = 2/5, because
the area of the whole square is 1. The midpoint of MN is the point
S(^{1}/_{2}(m + n), ^{1}/_{2}) = S(^{2}/_{5}, ^{1}/_{2}), which
does not depend on the points of intersection of M and N and, hence,
is the same for all such lines. So, each line which divides the square
into two quadrilaterals in this way, must go through the point S.
Because of the symmetry, there are three other possible points
in the square (^{3}/_{5}, ^{1}/_{2}), (^{1}/_{2},^{2}/_{5}), (^{1}/_{2}, ^{3}/_{5}), and each of the
given 9 points must pass through one of them. Applying the
Pigeonhole Principle for 9 lines and 4 points, we find that at
least three of the lines must pass through the same point, and
because of that, they are concurrent.
 12.

Each vertex of a regular 100sided polygon is
marked with a number chosen from among the natural numbers
1, 2, 3, ¼, 49. Prove that there are four
vertices (which we can denote as A, B, C, D with
respective numbers a, b, c, d) such that
ABCD is a rectangle, the points A and B are two
adjacent vertices of the rectangle and a + b = c + d.
Solution. Since the given polygon is regular, it can be inscribed
in a circle. There are exactly 50 diagonals of the polygon which
pass through the centre of the circle. As they are diameters,
they are of equal length. Consider the positive differences of
two vertices which are endpoints of the same diagonal. Since the
mark numbers are from among 1, 2,
¼, 49, the range of the
differences is between 0 and 48. So, we have 49 possible values
for 50 differences. Hence, there are at least two diagonals
with the same difference. Without loss of generality, denote
these diagonals as as AC and BD and suppose that
a
³ c and d
³ b. Then a  c = d  b, so that
a + b = c + d. The quadrilateral ABCD has two diagonals
of equal length and with the same midpoint, so it is a rectangle,
which satisfies all of the required conditions.