Documents

YearFilenameLanguageSource
2007IMO-2007-problems-eng.pdfen
Problem 1

Real numbers a1,a2,,ana_1, a_2, \ldots, a_n are given. For each ii (1in1 \leq i \leq n) define

di=max{aj:1ji}min{aj:ijn}d_i = \max\{a_j : 1 \leq j \leq i\} - \min\{a_j : i \leq j \leq n\}

and let

d=max{di:1in}.d = \max\{d_i : 1 \leq i \leq n\}.

(a) Prove that, for any real numbers x1x2xnx_1 \leq x_2 \leq \cdots \leq x_n,

max{xiai:1in}d2.()\max\{|x_i - a_i| : 1 \leq i \leq n\} \geq \frac{d}{2}. \quad (*)

(b) Show that there are real numbers x1x2xnx_1 \leq x_2 \leq \cdots \leq x_n such that equality holds in ()(*).

Problem 2

Consider five points A,B,C,DA, B, C, D and EE such that ABCDABCD is a parallelogram and BCEDBCED is a cyclic quadrilateral. Let \ell be a line passing through AA. Suppose that \ell intersects the interior of the segment DCDC at FF and intersects line BCBC at GG. Suppose also that EF=EG=ECEF = EG = EC. Prove that \ell is the bisector of angle DABDAB.

Problem 3

In a mathematical competition some competitors are friends. Friendship is always mutual. Call a group of competitors a clique if each two of them are friends. (In particular, any group of fewer than two competitors is a clique.) The number of members of a clique is called its size.

Given that, in this competition, the largest size of a clique is even, prove that the competitors can be arranged in two rooms such that the largest size of a clique contained in one room is the same as the largest size of a clique contained in the other room.

Problem 4

In triangle ABCABC the bisector of angle BCABCA intersects the circumcircle again at RR, the perpendicular bisector of BCBC at PP, and the perpendicular bisector of ACAC at QQ. The midpoint of BCBC is KK and the midpoint of ACAC is LL. Prove that the triangles RPKRPK and RQLRQL have the same area.

Problem 6

Let nn be a positive integer. Consider

S={(x,y,z):x,y,z{0,1,,n},x+y+z>0}S = \{(x, y, z) : x, y, z \in \{0, 1, \ldots, n\}, x + y + z > 0\}

as a set of (n+1)31(n + 1)^3 - 1 points in three-dimensional space. Determine the smallest possible number of planes, the union of which contains SS but does not include (0,0,0)(0,0,0).