olymmath

IMO 1992

International Mathematical Olympiad 1992.

Official paper

The official paper in 1 language

English

Day 1

Problem 2

Let  R \,{\mathbb{R}}\, denote the set of all real numbers. Find all functions f:R→R f: {\mathbb{R}}\rightarrow {\mathbb{R}}\, such that f(x2+f(y))=y+(f(x))2for allx,y∈R.f\left( x^{2}+f(y)\right) =y+\left( f(x)\right) ^{2}\hspace{0.2in}\text{for all} x,y\in \mathbb{R}.

Answer, solutions and source

Problem 3

Consider 99 points in space, no four of which are coplanar. Each pair of points is joined by an edge (that is, a line segment) and each edge is either colored blue or red or left uncolored. Find the smallest value of n n\, such that whenever exactly n n\, edges are colored, the set of colored edges necessarily contains a triangle all of whose edges have the same color.

Answer, solutions and source

Day 2

Problem 5

Let S be a finite set of points in three-dimensional space. Let SxS_x, SyS_y, SzS_z be the sets consisting of the orthogonal projections of the points of S onto the yz-plane, zx-plane, xy-plane respectively. Prove that: ∣S∣2|S|^2 ≤ ∣Sx|S_x| ∣Sy|S_y| ∣Sz|S_z|, where |A| denotes the number of points in the set A. [The orthogonal projection of a point onto a plane is the foot of the perpendicular from the point to the plane.]

Answer, solutions and source

Problem 6

For each positive integer n, S(n) is defined as the greatest integer such that for every positive integer k ≤ S(n), n2n^2 can be written as the sum of k positive squares. (a) Prove that S(n) ≤ n2n^2 - 14 for each n ≥ 4. (b) Find an integer n such that S(n) = n2n^2 - 14. (c) Prove that there are infinitely many integers n such that S(n) = n2n^2 - 14.

Answer, solutions and source