This document contains 6 problems from the 2002 Korean Mathematical Olympiad final round. Problem 1 deals with elements of a set defined using primes and their equivalence. Problem 2 asks to find functions satisfying a given functional equation. Problem 3 is a combinatorics problem about the minimum number of contestants needed to guarantee someone solved all problems.
This document contains 6 problems from the 2002 Korean Mathematical Olympiad final round. Problem 1 deals with elements of a set defined using primes and their equivalence. Problem 2 asks to find functions satisfying a given functional equation. Problem 3 is a combinatorics problem about the minimum number of contestants needed to guarantee someone solved all problems.
This document contains 6 problems from the 2002 Korean Mathematical Olympiad final round. Problem 1 deals with elements of a set defined using primes and their equivalence. Problem 2 asks to find functions satisfying a given functional equation. Problem 3 is a combinatorics problem about the minimum number of contestants needed to guarantee someone solved all problems.
This document contains 6 problems from the 2002 Korean Mathematical Olympiad final round. Problem 1 deals with elements of a set defined using primes and their equivalence. Problem 2 asks to find functions satisfying a given functional equation. Problem 3 is a combinatorics problem about the minimum number of contestants needed to guarantee someone solved all problems.
1. For a prime p of the form 12k + 1 and Z p = {0, 1, 2, . . ., p − 1}, define
E p = {(a, b) ∈ Z2p | p ∤ 4a3 + 27b2}.
We say that elements (a, b) and (a′ , b′ ) of E p are equivalent if there is a nonzero c ∈ Z p such that p | a′ − ac4 and p | b′ − bc6 . Find the maximal number of inequivalent elements of E p . 2. Find all functions f : R → R such that for all x ∈ R and y ∈ f (R)
f (x − y) = f (x) + xy + f (y).
3. The following facts are known on a mathematical contest:
(i) There were n ≥ 4 problems;
(ii) Each problem was solved by exactly four contestants; (iii) For any two problems there is exactly one contestant who solved both prob- lems. Assuming that there were at least 4n contestants, find the minimum value of n for which there always exists a contestant who solved all the problems.
Second Day – April 14, 2002
4. For positive real numbers a1 , . . . , an , b1 , . . . , bn (n ≥ 3) with the bi pairwise dis-
tinct, denote S = a1 + a2 + · · · + an and T = b1 b2 · · · bn . n aj (a) Let f (x) = (x − b1 )(x − b2 ) · · · (x − bn ) ∑ . Find the number of dis- j=1 x − b j tinct real zeroes of the polynomial f (x). ! 1 n−1 1 n aj T n aj (b) Prove that ∑ n − 1 j=1 1 − S b j > ∑ bj S j=1 .
5. In an acute-angled triangle ABC, the altitude from A meets the circumcircle O at
D. Let P be a point on O, and let Q be the foot of the perpendicular from P to AB. Prove that if Q is outside O and 2∠QPB = ∠PBC, then the points D, P, Q are collinear. 6. Let pn denote the n-th smallest prime (p1 = 2, p2 = 3, p3 = 5, etc.).
The IMO Compendium Group,
D. Djukić, V. Janković, I. Matić, N. Petrović www.imomath.com (a) For a given n ≥ 10, let r be the smallest integer such that pr > n − 3, and let Ns = sp1 p2 · · · pr−1 − 1 for s = 1, 2, . . . , pr . Show that there exists j, 1 ≤ j ≤ pr , such that none of p1 , p2 , . . . , pn divides N j . (b) Using the result of (a), find all m for which p2m+1 < p1 p2 · · · pm .
The IMO Compendium Group,
D. Djukić, V. Janković, I. Matić, N. Petrović www.imomath.com
