166

THE OLYMPIAD CORNER

No. 213

R.E. Woodrow

All communications about this column should be sent to Professor R.E.

Woodrow, Department of Mathematics and Statistics, University of Calgary,
Calgary, Alberta, Canada. T2N 1N4.
We start this number with a set of ve Klamkin Quickies. Many thanks
to Murray Klamkin for sending them to us.

FIVE KLAMKIN QUICKIES

1. Prove that
p p p
a + b + c  b2 + c2 ; a2 + c2 + a2 ; b2 + a2 + b2 ; c2 ,
where a, b, c are sides of a non-obtuse triangle.
2. Determine the extreme values of the area of a triangle ABC given
the lengths of the two altitudes ha , hb and the side BC = a.
3. Determine the maximum area of a triangle ABC given the perime-
ter p and the angle A.
4. Determine the minimum value of
X a2 + a3 + a4 + a5 1=2
a1
where the sum is cyclic over the positive numbers a1 , a2 , a3 , a4 , a5 .
5. ABCD and AB0C 0D0 are any two parallelograms in a plane with
A opposite to C and C 0. Prove that BB0 , CC 0 and DD0 are possible sides
of a triangle.

Next we give the problems of the two days of the Vietnamese Math-
ematical Olympiad 1997. My thanks go to Richard Nowakowski, Canadian
Team Leader at the IMO in Argentina for collecting them.
 167

VIETNAMESE MATHEMATICAL COMPETITION

1997
First Day | March 14, 1997
Time: 3 hours
1. In a plane, let there be given a circle with centre O, with radius R
and a point P inside the circle, OP = d < R. Among all convex quadrilat-
erals ABCD, inscribed in the circle such that their diagonals AC and BD
cut each other orthogonally at P , determine the ones which have the great-
est perimeter and the ones which have the least perimeter. Calculate these
perimeters in terms of R and d.
2. Let there be given a whole number n > 1, not divisible by 1997.
Consider two sequences of numbers fai g and fbj g dened by:
ni (i = 1, 2, 3, : : : , 1996) ,
ai = i + 1997
bj = j + 1997 j (j = 1, 2, 3, : : : , n ; 1) .
n
By arranging the numbers of these two sequences in increasing order, we get
the sequence c1  c2 


 c1995+n .
Prove that ck+1 ; ck < 2 for every k = 1, 2, : : : , 1994 + n.
3. How many functions f : N ! N are there that simultaneously
satisfy the two following conditions:
(i) f (1) = 1,
(ii) f (n)
f (n + 2) = (f (n + 1))2 + 1997 for all n 2 N?
(N denotes the set of all positive integers.)
Second Day | March 15, 1997
Time: 3 hours
4. (a) Find all polynomials of least degree, with rational coecients
such that p p p
f ( 3 3 + 3 9) = 3 + 3 3 .
(b) Does there exist a polynomial with integer coecients such that
p p p
f ( 3 3 + 3 9) = 3 + 3 3 ?
5. Prove that for every positive integer n, there exists a positive integer
k such that 19k ; 97 is divisible by 2n.
6. Let there be given 75 points, where no three of them are collinear,
inside a cube, of which the length of an edge is 1. Prove that there exists a
triangle whose vertices are among these 75 points and such that its area does
not exceed 727 .
168

The next problem set gives the problems of the Team Selection Exam-
ination for Turkey for the 38th IMO. My thanks go to Richard Nowakowski,
Canadian Team Leader to the IMO in Argentina for collecting them.
TURKEY TEAM SELECTION EXAMINATION
FOR THE 38th IMO
First Day | April 12, 1997
Time: 4.5 hours
1. In a triangle ABC which has a right angle at A, let H denote the
foot of the altitude belonging to the hypotenuse. Show that the sum of the
radii of the incircles of the triangles ABC , ABH and AHC is equal to jAH j.
2. The sequences fang1n=1, fbng1n=1 are dened through a1 = ,
b1 = , and an+1 = an ; bn, bn+1 = an + bn for all n  1. How
many pairs (;) of real numbers are there such that
a1997 = b1 and b1997 = a1 ?
3. In a soccer league, when a player is transferred from a team X with
x players to a team Y with y players, the federation is paid y ; x billion
liras by Y if y  x, while the federation pays x ; y billion liras to X if
x > y. A player is allowed to change as many teams as he wishes during a
season. In a league consisting of 18 teams, each team starts the season with
20 players. At the end of the season, 12 of these turn out again to have
20 players, while the remaining 6 teams end up having 16, 16, 21, 22, 22
and 23 players, respectively. What is the maximal amount the federation
may have won during this season?
Second Day | April 13, 1997
Time: 4.5 hours
4. The edge AE of a convex pentagon ABCDE whose vertices lie on
the unit circle passes through the centre of this circle. If jAB j = a, jBC j = b,
jCDj = c, jDEj = d and ab = cd = 41 , compute jAC j + jCEj in terms of
a, b, c, d.
5. Prove that, for each prime number p  7, there exists a positive
integer n and integers x1 , x2 , : : : , xn , y1 , y2, : : : , yn which are not divisible
by p, such that
x21 + y12  x22 (mod p) ,
x22 + y22  x23 (mod p) ,
..
.
xn;1 + yn;1  x2n (mod p) ,
2 2

x2n + yn2  x21 (mod p) .

 169

6. Given an integer n  2, nd the minimal value of

x51 + x25
+


+ xn
5

x2 + x3 +


+ xn x1 + x3 +


+ xn x1 + x2 +


+ xn;1
subject to x21 + x22 +


+ x2n = 1, where x1 , x2 , : : : , xn are positive real
numbers.

As a nal collection of problems this number we give those of the

Chilean Mathematical Olympiads 1994{1995. Thanks go to Raul A. Simon
Lamb, Santiago, Chile, for forwarding the set to us.
CHILEAN MATHEMATICAL OLYMPIADS 1994{95
1. Given three straight lines in a plane, that concur at point O, con-
sider the three consecutive angles between them (which, naturally, add up to
180 ). Let P be a point in the plane not on any of these lines and let A, B, C
be the feet of the perpendiculars drawn from P to the three lines. Show that
the internal angles of 4ABC are equal to those between the given lines.
E H
2. F G ABCDEFGH is a cube of edge 2. Let M
be the mid-point of BC and N the mid-point
D of EF . Compute the area of the quadrilateral
C AMHN .
A B
3. Given a trapezoid ABCD, where AB and DC are parallel, and
AD = DC = AB=2, determine \ACB.
4. In a circle of radius 1 are drawn six equal arcs of circles, radius 1,
cutting the original circle as in the gure. Calculate the shaded area.
B

O A

5. In right triangle ABC the altitude hc = CD is drawn to the

hypotenuse AB . Let P , P1 , P2 be the radii of the circles inscribed in the
triangles ABC , ADC , BCD respectively. Show that P + P1 + P2 = hc .
6. Consider the product of all the positive multiples of 6 that are less
than 1000. Find the number of zeros with which this product ends.
170

7. Let x be an integer of the form

x = 1| 1 1{z: : : 1} .
n
Show that, if x is a prime, then n is a prime.
8. Let x be a number such that
x + x1 = ;1 .
Compute
x1994 + x;1994
1 .

9. Let ABCD be an m  n rectangle, with m, n 2 N. Consider a ray

of light that starts from A, is re ected at an angle of 45 on another side of
the rectangle, and goes on re ecting in this way.
(a) Show that the ray will nally hit a vertex.
(b) Suppose m and n have no common factor greater than 1. Determine the
number of re ections undergone by the ray before it hits a vertex.
10. Let a be a natural number. Show that the equation
x2 ; y2 = a3
always has integer solutions for x and y .

Next we turn to readers' solutions to the problems of the Third

Macedonian Mathematical Olympiad given [1999 : 198].
1. Let ABCD be a parallelogram which is not a rectangle and E be
a point in its plane, such that AE ? AB and BC ? EC . Prove that
\DAE = \CEB . [Ed. We know this is incorrect | can any reader supply
the correct version?]
Correction and solution by Luyun-Zhong-Qiao, Columbia International
College, Hamilton, Ontario. [Ed. The solver considers only the case when E
is interior to the parallelogram.]
Try to prove that \DAE = \DCE .
A G D

E
F

B C
 171

Proof. Extend AE to meet CD at F ; CE to meet AD at G. Therefore,

ABCD is a parallelogram. Therefore, AB k DC , AD k BC , and
EC ? BC ==) EC ? AD ) (
CG ? AD ,
==)
AE ? AB ==) AE ? CD AF ? CD .
With base AC , and since \AGC = \AFC = 90 , we have that ACFG is a
cyclic quadrilateral. Therefore, \DAE = \DCE .
Next we give an analysis of what the question, as presented, entails,
and the resulting correction, provided by D.J. Smeenk, Zaltbommel, the
Netherlands.
Let M be the intersection point of AC and BD. Let S be the projection
point of D into AB . Then 4ABS ' 4ABD (See gure on page 172).
Let F be the projection of B onto AD, and G the re ection of S onto
AD (or its production).
Quadrilateral ABCE is inscribable. (1)

\BAD =  ==) \DAE = 90 ;  . (2)

Next, we see what must hold in order that
\DAE = \CEB = 90 ;  . (3)
(1), (2) and (3) ==) \CAB = 90 ; . Consider 4ABC .
\ABC = 180 ; 
)
(4)
\CAB = 90 ; 
(4) ==) \ACB = 2 ; 90 (so that  > 45 ). Apply the Sine Law to
4ABC ; AB = a, BC = b. a : b = sin(2 ; 90) : sin(90 ; ), or
a cos  + b cos 2 = 0 (5)
Thus, if \DAE = \CEB = 90 ; , then (5) holds, and the reverse holds
as well.
The geometrical meaning of (5) is the following: a cos  = AF signies
the projection onto AD of AB ; b cos 2 = AG signies the projection onto
AD of AS . F and G lie on dierent sides of A, or A is the mid-point of
segment FG.
M 0 is the mid-point of BS ==) AM 0 ? AD ==) AC ? AS.
Thus, AC ? AS is a geometrical translation of (5), and that is the
condition to be added to the hypotheses to correct the problem.
A trivial case is: ABCD is a rhombus, and \DAB = 60 .
172

E
90 
;

D a 90 ; C

F 2
;90
M b
90 ;


90 ;
A a B


b
G M 0

D C

2
;90
b
180 ;
90 ;
A a B

S
 173

2. Let P be the set of all polygons in the plane and let M : P ! R be

a mapping which satises:
(i) M (P )  0 for each polygon P ;
(ii) M (P ) = x2 if P is an equilateral triangle of side x;
(iii) If P is a polygon separated into two polygons S and T , then
M (P ) = M (S) + M (T ) ; and
(iv) If P and T are congruent polygons, then M (P ) = M (T ).
Find M (P ) if P is a rectangle with edges x and y .
Solution by Pierre Bornsztein, Courdimanche, France.
We will prove that, if P is a rectangle with edges x and y , then
M (P ) = 4pxy3 .
Lemma. Let apbe a positive real number. Denote by Ra the rectangle
with edges a and a 3. Then M (Ra ) = 4a2 .
Proof of the Lemma. Let T be an equilateral triangle with edges 2a.
From (ii), we have M (T ) = 4a2 . Using a median, we separate T into two
congruent right-angled triangles T1 and T2 .

T1
2a h 2a - h=ap3
T1 T2 T2
a a a

From (iii) we have

M (T ) = M (T1) + M (T2) .
two right-angled triangles, we can form a rectangle Ra with edges
With these p
a and h = 3a.
From (iii) and (iv) we have M (Ra ) = M (T1 ) + M (T2 ) = 4a2 .
Now, let x, y be two positive real numbers. Denote by P a rectangle
with edges x and y .
Let n 2 N such that
0 < n1 < x and 0 < n1 < py . (1)
3
174

Let p, q be the largest positive integers such that

p  x and q  py . (10 )
n n 3
It follows that
pq  pxy (2)
n2 3
and
x < p +n 1 , py3 < q +n 1 . (3)
Thus,
py3 ; n1 < npq2 .
  
x ; n1 (4)
From (1'), note that pq rectangles R1=n can be placed, without overlapping,
into P . Note that the part of P which is not covered by these rectangles is a
polygon P1 .
 p  n1 -
P
6
6
y q n3
p

? ?
 x -
From (iii) and (i), we have
M (P ) = pqM (R1=n) + M (P1)
 pqM (R1=n) from (i),
= 4npq2 from the lemma,
 4 x ; n1 py3 ; n1 from (4) .
  

From (3), P is covered by (p + 1)(q + 1) rectangles R1=n .

 175

As above, we have
M (P )  (p + 1)(q + 1)M (R1=n) = 4(p + 1)(
n2
q + 1)
= 4npq2 + n4p2 + n4q2 + n42
 4pxy3 + 4nx + n4py3 + n42
(from (10 ) and (2)).
Finally, we have
4 x ; n p ; n  M (P )  4pxy + 4nx + 4py + n42 .
y
  
1 1
3 3 n 3
As n tends to innity, we get
M (P ) = 4pxy3 ,
as claimed.
3. Prove that if ,  and are angles of a triangle, then
1 1 8
sin  + sin   3 + 2 cos .
Solutions by Pierre Bornsztein, Courdimanche, France; by Murray S.
Klamkin, University of Alberta, Edmonton, Alberta; by Luyun-Zhong-Qiao,
Columbia International College, Hamilton, Ontario; and by D.J. Smeenk,
Zaltbommel, the Netherlands. We give Klamkin's solution.
Since sin1 x is convex for 0  x   , we have
1 + 1  2 = 2 .
sin  sin  
sin 2
( +  ) cos 2
The problem will be done once we establish
2 8
cos 2  (3 + 2 cos ) .
Replacing cos by 2 cos2 2 ; 1 and cross multiplying, we get
2 cos 2 ; 1 2  0 .
;

There is equality if and only if = 23 ,  =  = 3 .

176

4. A polygon is called \good" if the following conditions are satised:

(i) all angles belong to (0;  ) [ (; 2 );
(ii) two non-neighbouring sides do not have any common point; and
(iii) for any three sides, at least two are parallel and equal.
Find all non-negative integers n such that there exists a \good" polygon with
n sides.
Solution by Pierre Bornsztein, Courdimanche, France.
We will prove that there exists a \good" polygon with n sides if and
only if n = 4k where k 2 N, k 6= 2.
Let n be a non-negative integer such that there exists a \good" polygon
Pn with n sides (such n will be called \good" too). Obviously we have n  4.
Denote by M1 , M2 , : : : , Mn the vertices of Pn (subscripts will be read
modulo n).
From (i), any two consecutive sides are never equal. And, from (iii), for
any three consecutive sides at least two are parallel and equal. It follows
that, for each i  1, we have
;;;;;;!
M ;;;;!
2i;1 M2i = "i M1 M2

and ;;;;;;!
M2iM2i+1 = "0i; M;;; ! where " ; "0 2 f;1, 1g .
2 M3 , i i
M ;;;;!
Consider the coordinate system with origin 1 and unit vectors M1 M2 , and
;M;;;!
2 M3 .

Then, for each i, Mi belongs to the \integer lattice".

;;;;;! ;;;;!
We will say that we have moved \to the right" when Mi Mi+1 = "M1 M2
with " 2 f;1, 1g. Movements to the left, up, and down are dened in
the same way. Then a move to the right (and horizontally) can be described
by (x; y ) 7! (x + 1; y ) (the others are (x; y ) 7! (x ; 1; y ) (left),
(x; y ) 7! (x; y + 1) (up), (x; y ) 7! (x; y ; 1) (down)).
Denote by h, v , r the numbers of moves made horizontally, vertically
and to the right, respectively.
From the above, as we alternate vertical and horizontal moves, from
M2 to M1, we have h = v. The total number of moves is n = h + v = 2h.
By the same reasoning, we have h = 2r because the number of right moves
equals the number of left moves. Thus, n = 4r.
Conversely:
Case 1. when n = 4, choose a rectangle;
Case 2. when n = 8, suppose for a contradiction that P8 exists.
 177

Using re ections, (and maybe renumbering the vertices...) we can sup-

pose that we are in one of the two following cases:
First Case.
p
M3
M1 - p p
M2
M8 p p
M7
p
M6
Then, the positions of M3 and M6 are xed. Thus, there are at least
three vertical moves: r  3, then n  12, a contradiction.
Second Case. [Ed. The two cases are disjoint, and cover all possibili-
ties.]
M3 - p p
M4
M1 - 6M2
p p

We use two right moves. Then we do not move to the right anymore.
If M5 is \under" M4 , then M6 = M2 , which contradicts (ii).
If M4 is \under" M5 , we have used the two up-moves.
Then M3 is necessarily \under\ M6 .
Thus, M7 = M3 , which contradicts (ii).
Then, in each case, we obtain a contradiction. Thus, 8 is not a \good\
integer.
If n = 4k, k  3, starting from P12 (in solid lines),

M3 M4
M1 M2 M5 M6
M8 M7
M9

we add the dotted part, deleting [M8 M9 ] and [M7 M8 ]:

178

P4(k+1) is obtained from P4k by the same construction.

Then, every integer of the form 4k with k  3 is good.
We are done.
5. Find the biggest number n such that there exist n straight lines
in space, R3, which pass through one point, and the angle between each
two lines is the same. (The angle between two intersecting straight lines is
dened to be the smaller one of the two angles between these two lines.)
Solution by Murray S. Klamkin, University of Alberta, Edmonton,
Alberta.
More generally, the result is known for Rn . (It is given in one of my
Olympiad Corners way back).
Let An , n = 0, 1, : : : , n denote unit vectors from the centroid of a
regular n-dimensional simplex to the vertices. Then these n + 1 vectors
make equal angles with each other and there cannot be more than n + 1.
Furthermore, the common angle  between the vectors is obtained from
(A0 + A1 +


+ An )2 = 0 = n + 1 + [n(n + 1)] cos  .
Thus, cos  = ;1=n.

We continue this number of the Corner with readers' solutions to prob-

lems of the Ninth Irish Mathematical Olympiad [1999 : 199-200].
1. For each positive integer n, let f (n) denote the greatest common
divisor of n!+1 and (n +1)! (where ! denotes \factorial"). Find, with proof,
a formula for f (n) for each n.
Solutions by Mohammed Aassila, Strasbourg, France; by Michel
Bataille, Rouen, France; by Pierre Bornsztein, Courdimanche, France; by
George Evagelopoulos, Athens, Greece; by Murray S. Klamkin, University
of Alberta, Edmonton, Alberta; and by Edward T.H. Wang, Wilfrid Laurier
University, Waterloo, Ontario. We give Wang's solution.
We show that

f (n) = n1 + 1 ifotherwise
n + 1 is a prime,
.
 179

For convenience of notation, denote f (n) by d. Since d j n! + 1 and

d j (n + 1)! we have d j (n + 1)(n! + 1) ; (n + 1)!; that is, d j n + 1.
If n + 1 is a prime, then n + 1 j n! + 1 by Wilson's Theorem. Since clearly
n +1 j (n +1)! we have n +1 j d. Hence, d = n +1. If n +1 is a composite,
then n + 1 = ab for some integers a and b such that 1 < a  b < n. If
d = n + 1 then ab = d and so, a j d. Since d j n! + 1 we have a j n! + 1.
On the other hand, since a < n we also have a j n!. Hence, a j 1 which
implies that a = 1, a contradiction. Thus, d  n. Then, d j n! together with
d j n! + 1 imply that d = 1, and the proof is complete.
2. For each positive integer n, let S(n) denote the sum of the digits of
n (when n is written in base 10). Prove that for every positive integer n
S(2n)  2S(n)  10S(2n) .
Prove also that there exists a positive integer n with
S(n) = 1996S(3n) .
Solutions by Michel Bataille, Rouen, France; and by Pierre Bornsztein,
Courdimanche, France. We give Bornsztein's solution.
Let n 2 N , n = d0 + 10d1 +


+ 10k dk (decimal expansion). Thus,
n
X
S(n) = di .
i=0
It is well known that S (2n) = 2 ki=0 di ; 9n where n denotes the number
P

of di such that di  5. It follows that S (2n)  2S (n).

Moreover,
X X X
S(n) = di + di  di
di 4 di 5 di 5
X
 5 1 = 5n .
di 5
Then
S(2n) ; n = 2S(n) ; 10n  0
and
S(2n)  n .
Thus,
2S(n) = S(2n) + 9n  10S (2n) .
Finally,
S(2n)  2S(n)  10S(2n) .
For n = 3| 3 : : : :{z: : : : : 3 3} 6, we have
5986 digits \3"
S(n) = 3  5986 + 6 = 17964 = 9  1996
180

and then,
S(n) = 1996S(3n) .
3. Let K be the set of all real numbers x with 0  x  1. Let f
be a function from K to the set of all real numbers R with the following
properties:
(i) f (1) = 1.
(ii) f (x)  0 for all x 2 K .
(iii) if x, y and x + y are all in K , then
f (x + y)  f (x) + f (y) .
Prove that f (x)  2x for all x 2 K .
Solutions by Michel Bataille, Rouen, France; and by Hojoo Lee, stu-
dent, Kwangwoon University, Kangwon-Do, South Korea. We give Lee's
solution.
We rst prove the following lemma.
Lemma. If 0  x  n1 for n 2 N, then f (x)  n1 .
Proof of Lemma. Let 0  x  n1 for n 2 N. Then, we have
1 = f (1) = f (1 ; nx + nx)  f (1 ; nx) + f (nx)  f (nx) ,
and we have
n times z
n times
}| {
z }| {
f (nx) = f (x +


+ x)  f (x) +


+ f (x)
from (iii).
Hence, we get
1  f (nx)  nf (x) or n1  f (x) ,
as desired.
We shall prove that f (x)  2x for 0 < x  1.
Let 0 < x  1. Then, there exists a natural number x such that
n+1 x  n . Then we have f (x)  n from the above lemma.
<
1 1 1

So, we have f (x)  n1  n+1

2
< 2x or f (x) < 2x, as desired.
Now, we prove f (0)  0.
Since 0  n1 for all n 2 N, we have f (0)  n1 for all n 2 N from the
above lemma. This implies that f (0)  0 since limn!1 n1 = 0.
 181

Comments by Mohammed Aassila, Strasbourg, France; and by Pierre

Bornsztein, Courdimanche, France.
Aassila points out that the problem was proposed at the 8th All-Union
Mathematical Olympiad, 1974 held in Erevan. A solution can be found, for
example, in N.B. Vassil'ev and A.A. Egorov, The Problems of the All-Union
Mathematical Competitions, Moscow, Nauka., 1988 (in Russian), ISBN
5-02-013730-8.
Bornsztein reminds us that this is the same problem as problem No. 5
{ Grade X of the Georgian Mathematical Olympiad [1998 : 388]. Moreover,
in that problem it was also proved that the number 2 cannot be replaced by
any number k < 2.
4. Let F be the mid-point of the side BC of the triangle ABC .
Isosceles right-angled triangles ABD and ACE are constructed externally
on the sides AB and AC with the right angles at D and E , respectively.
Prove that DEF is a right-angled isosceles triangle.
Solutionsby Michel Bataille, Rouen, France; by Pierre Bornsztein, Cour-
dimanche, France; by Murray S. Klamkin, University of Alberta, Edmon-
ton, Alberta; by Luyun-Zhong-Qiao, Columbia International College, Hamil-
ton, Ontario; and by D.J. Smeenk, Zaltbommel, the Netherlands. We give
Bataille's solution.
Let R1 be the rotation with centre D which transforms B into A and R2
be the rotation with centre E which transforms A into C . Then S = R2  R1
is a rotation by angle 180 ; that is, a symmetry about a point, and, since
S(B) = C , this point is F .
E D
A

C F B

D 0

Now, S (D) = R2  R1 (D) = R2 (D) = D0 (say).

From S (D) = D0 , we see that F is the mid-point of DD0 , and from
R2(D) = D0 , we deduce that 4DED0 is isosceles and right-angled at E.
Therefore, FD = FD0 = FE and EF ? DD0 and the result follows.
182

5. Show, with proof, how to dissect a square into at most ve pieces

in such a way that the pieces can be reassembled to form three squares no
two of which have the same area.
Solution by Mohammed Aassila, Strasbourg, France.
They say a picture is worth a thousand words.

!
6. The Fibonacci sequence F , F , F , : : : is dened as follows: F = 0,
0 1 2 0
F1 = 1 and for all n  0
Fn+2 = Fn + Fn+1 .
(Thus, F2 = 1, F3 = 2, F4 = 3, F5 = 5, F6 = 8, : : : ) Prove that
(i) The statement \Fn+k ; Fn is divisible by 10 for all positive integers n" is
true if k = 60 but it is not true for any positive integer k < 60.
(ii) The statement \Fn+t ; Fn is divisible by 100 for all positive integers n"
is true if t = 300 but it is not true for any positive integer t < 300.
Solutions by Pierre Bornsztein, Courdimanche, France; and by Murray
S. Klamkin, University of Alberta, Edmonton, Alberta. We give Klamkin's
solution.
(i) The smallest m such that Fm  0 (mod 2) is m = 3. Then,
Fn+3 ; Fn = 2Fn+1  0 (mod 2).
The smallest k such that Fn+k ; Fn is divisible by 10 for n = 0, 1, 2,
: : : , 20 is k = 20. Then Fn+20 = Fn+19 + Fn+18 =


= F20Fn+1 + F19Fn
so that Fn+20 ; Fn = F20Fn+1 +(F19 ; 1)Fn  0 (mod 5) since F20 = 6765
and F19 ; 1 = 4180.
Hence, the smallest k such that Fn+k ; Fn is divisible by 10 for all
positive integers n is 3  20 = 60.
(ii) The smallest m such that Fm  0 (mod 4) is m = 6. Then
Fn+6 ; Fn = 8Fn+1 + 4Fn  0 (mod 4).
The smallest t such that Fn+t ; Fn is divisible by 25 for n = 0, 1, : : : ,
100 is t = 100 (by examining a table of the Fn's). Then,
Fn+100 ; Fn = F100Fn+1 + (F99 ; 1)Fn  0 (mod 25)
since F100 = 354224848179261915075 and F99 = 218922995834555169026.
Finally, the smallest t is the lowest common multiple of 6 and 100, or 300.
 183

7. Prove that the inequality

21=2
41=4
81=8


(2n )1=2n < 4
holds for all positive integers n.
Solutionsby Michel Bataille, Rouen, France; by Pierre Bornsztein, Cour-
dimanche, France; by Luyun-Zhong-Qiao, Columbia International College,
Hamilton, Ontario; and by Edward T.H. Wang, Wilfrid Laurier University,
Waterloo, Ontario. We give Luyun's solution.
Proof.
2 21
4 14
8 81


(2n) 21n = 2 21
2 222
2 233


(2) 2nn
= 2 12 + 222 + 233 +


+ 2nn (see Aside)
< 22 = 4 ,
since y = 2x is increasing.
We have 2 12
4 41
8 18


(2n) 21n < 4 for all n 2 N.
Aside. Now
1 + 2 + 3 +


+ n .
2 22 23 2n
is an arithmetic-geometric series. Let
S = 12 + 222 + 233 +


+ 2nn
1S = 1 + 2 +


+ n; 1 + n .
2 22 23 2n 2n+1
Subtracting,
1S = 1 + 1 + 1 +


+ 1 ; n .
2 2 22 23 2n 2n+1
The rst part is geometric with r = 21 , a = 12 , so
1 S = 21 [1 ; ( 21 )n ] ; n ,
2 1 ; 21 2n+1
or
S = 2 ; 2n1;1 ; 2nn ,
1 n
since n;1 > 0 for any n, and n > 0, we get S < 2.
2 2
When n ! +1,
 n
1 = 0; n ;
nlim
!1 2 !1 2n = 0 ; therefore, S ! 2 .
nlim
184

8. Let p be a prime number and a and n positive integers. Prove that

if 2p + 3p = an , then n = 1.
Solutionsby Mohammed Aassila, Strasbourg, France; by Michel Bataille,
Rouen, France; by Pierre Bornsztein, Courdimanche, France; by Murray S.
Klamkin, University of Alberta, Edmonton, Alberta; and by Heinz-Jurgen
Seiert, Berlin, Germany. We give Aassila's solution.
If p = 2, we have 22 + 32 = 13 and n = 1. If p > 2, then p is odd,
and hence, 5 divides 2p + 3p and then 5 divides a. Now, if n > 1, then
25 divides an and 5 divides
2p + 3p = 2p;1 ; 2p;2
3 +


3p;1 (mod 5) ,
2+3
a contradiction if p 6= 5. Finally, if p = 5, then 25 +35 = 753 is not a perfect
power, so that n = 1.
9. Let ABC be an acute-angled triangle and let D, E, F be the feet of
the perpendiculars from A, B , C onto the sides BC , CA, AB , respectively.
Let P , Q, R be the feet of the perpendiculars from A, B , C onto the lines
EF , FD, DE respectively. Prove that the lines AP , BQ, CR (extended)
are concurrent.
Solution by Michel Bataille, Rouen, France and a comment by Murray
S. Klamkin, University of Alberta, Edmonton, Alberta.
Let HB and HC be the points symmetrical to the orthocentre H about
the lines AC and AB , respectively. Then E , F are the mid-points of HHB ,
HHC , respectively, so that HB HC kEF . Hence, AP ? HB HC , and, since
AHB = AHC (= AH ), AP is the perpendicular bisector of the segment
HB HC . Since, as is well known, HB and HC lie on the circumcircle of
4ABC , we can conclude: AP passes through the circumcentre O of 4ABC .
Similarly, BQ and CR pass through O. Thus, the lines AP , BQ, CR
are concurrent (at O).
Comment. This is a known result due to Steiner, (Werke, I, p. 157) and
is given as follows: If lines drawn from three points A, B , C respectively,
perpendicular to the joins, B 0 C 0 , C 0 A0 , A0 B 0 , of three other points, meet in
a point, then the lines drawn from A0 , B 0 , C 0 , respectively perpendicular to
BC , CA, AB, also meet in a point.
More generally, if lines drawn from A, B , C , respectively conjugate to
B0 C 0, C 0A0, A0 0 B00, in0 regard to any conic, meet in a point, then the lines
drawn from A , B , C , respectively conjugate to BC , CA, AB , in regard to
this conic, also meet in a point.

That completes the Olympiad Corner for this issue. Now is the time of
year to collect Olympiad problem sets and forward them to me. We always
appreciate your nice solutions and generalizations.