olymmath

KZ-MO 2001

Kazakhstan Mathematical Olympiad 2001.

Other problems

Problem 1

Prove that there are infinitely many natural numbers nn such that 2n+3n2 ^ n + 3 ^ n is divisible by nn .

Problem 2

In the acute triangle ABCABC , LL , HH and MM are the intersection points of bisectors, altitudes and medians, respectively, and OO is the center of the circumscribed circle. Denote by XX , YY and ZZ the intersection points of ALAL , BLBL and CLCL with a circle, respectively. Let NN be a point on the line OLOL such that the lines MNMN and HLHL are parallel. Prove that NN is the intersection point of the medians of XYZXYZ .

Problem 3

For positive numbers x1,x2,…,xnx_1, x_2, \ldots, x_n (n≥1)(n \geq 1) the following equality holds 11+x1+11+x2+…+11+xn=1.\frac {1} {{1 + x_1}} + \frac {1} {{1 + x_2}} + \ldots + \frac {1} {{1 + x_n}} = 1. Prove that x1⋅x2⋅…⋅xn≥(n−1)n.x_1 \cdot x_2 \cdot \ldots \cdot x_n \geq (n-1) ^ n.

Problem 4

Find all functions f:R→Rf: \mathbb {R} \rightarrow \mathbb {R} satisfying the equality f(x2−y2)=(x−y)(f(x)+f(y))f (x ^ 2-y ^ 2) = (x-y) (f (x) + f (y)) for any x,y∈Rx, y \in \mathbb {R} .

Problem 5

Find all possible pairs of real numbers (x,y)(x, y) that satisfy the equalities y2−[x]2=2001y ^ 2- [x] ^ 2 = 2001 and x2+[y]2=2001x ^ 2 + [y] ^ 2 = 2001 .

Problem 6

Each interior point of an equilateral triangle with sides equal to 11 lies in one of six circles of the same radius rr . Prove that r≥310r \geq \frac {{\sqrt 3}} {{10}} .

Problem 7

Two circles w1w_1 and w2w_2 intersect at two points PP and QQ . The common tangent to w1w_1 and w2w_2 , which is closer to the point PP than to QQ , touches these circles at AA and BB , respectively. The tangent to w1w_1 at the point PP intersects w2w_2 at the point EE (different from PP ), and the tangent to w2w_2 at the point PP intersects w1w_1 at FF (different from PP ). Let HH and KK be points on the rays AFAF and BEBE , respectively, such that AH=APAH = AP and BK=BPBK = BP . Prove that the points AA , HH , QQ , KK and BB lie on the same circle.

Problem 8

There are n≥4n \geq4 points on the plane, the distance between any two of which is an integer. Prove that there are at least 16\frac {1} {6} distances, each of which is divisible by 33 .