Typeset by AMS-TEX

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

GILLIS OLYMPIADE (1996)

1. Let a be a prime number and n > 2 an integer. Find all integer solutions of
the equation xn + ay n = a2 z n .
2. Find all polynomials P (x) satisfying the identity P (x+1)2P (x)P (x1) =
x.
3. The triangle ABC is with acute angles , , respectively. Denote by AD
the height from A, CF the mediane from C and BE the bissectrix of the angle B.
Prove that the necessary and sufficient condition of AD, CF and BE to intersect
at a single point is the identity cos tan = sin .
4. Eight guests arrive to a hotel having four rooms. Each guest dislikes at most
3 other guests (and doesnt like to share a room with any of them), and this feeling
is mutual (A dislikes B if and only if B dislikes A). Prove that all 8 guests can be
settled in the 4 rooms, 2 persons in each room.
5. Let ABC be a triangle with R = 2r, where R is the radius of the circumscribed
circle and r the radius of the inscribed circle. Prove that the triangle is equilateral.
6. Let |x|, |y|, |z| > 2. What is the smallest value of |xyz + 2(x + y + z)|?
7. Let a, b, c be natural numbers. Find all solutions to the system
a2 = 4(b + c),

a3 2b3 4c3 = 21 abc.

8. Let f : N N be a map satisfying the properties


(1) f (1) = 1,
(2) f (2n) = f (n) for any n N,
(3) f (2n + 1) = f (2n) + 1 for any n N.
(a) Find the maximal value of f (n) over 1 n 1995. (b) Find all values of f on
this interval.
Preparatory problems
1. Solve the system
p

x2 + 1) = y,
p
y + log(y + y 2 + 1) = z,
p
z + log(z + z 2 + 1) = x.

x + log(x +

2. The segment P Q is the diameter of a semi-circle. The circle O touches from


inside the semi-circle and the diameter. Denote by C the tangency point on P Q
and A a point on the perimeter of the semi-circle. Let B be the point on P Q such
that AB is tangent to O and perpendicular to P Q. The point C is between B and
P . Prove that AC is a bissectrix of the angle QAB.
3. Prove for all natural k, n:
!
r
1
1
1
1
n k + 1
+
+
+ +
n
1 .
kn kn + 1 kn + 2
(k + 1)n 1
k
Typeset by AMS-TEX

GILLIS OLYMPIADE (1996)

4. Find all integer n, m such that m3 n3 9mn = 27.


5. Let n > 1 be an odd number. Given n real variables x1 , . . . , xn pairwise
different and such that |xi xj | 1 for all i 6= j, prove that
X
i<j

|xi xj | <


h n i h n i

+1 .
2
2

Here [x] is the integer part of a real number x.


6. Given a square table 1995 1995 tiled by 19952 squares 1 1. A k-coloring is
said nice, if the squares can be rearranged to make a pattern symmetric w.r.t. the
principal diagonal. Find all k such that any k-coloring is nice.
7. Between any two cities out of n (n 3) there is an aerial connection, but
some lines are not operational for technical reasons. Prove that if the number of
non-operational lines is not greater than n 3, then one can trace a closed trip
visiting exactly once every city (except for the initial one that is visited twice),
using only the operational lines.
8. Let be a real number. Find all functions from (0, ) to (0, ) satisfying
the identity
 
1
x
x2 f
+ f (x) =
.
x
x+1

You might also like