#CompetitionYearsProblemsYears
1International Mathematical Olympiad1959–2025398
2Middle European Mathematical Olympiad2009–2025160
International Mathematical Olympiad 1992 Problem 3

Consider nine 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 nn such that whenever exactly nn edges are colored, the set of colored edges necessarily contains a triangle all of whose edges have the same color.

International Mathematical Olympiad 1992 Problem 5

Let SS be a finite set of points in three-dimensional space. Let Sx,Sy,SzS_x, S_y, S_z be the sets consisting of the orthogonal projections of the points of SS onto the yzyz-plane, zxzx-plane, xyxy-plane, respectively. Prove that

S2SxSySz,|S|^2 \leq |S_x| \cdot |S_y| \cdot |S_z|,

where A|A| denotes the number of elements in the finite set A|A|. (Note: The orthogonal projection of a point onto a plane is the foot of the perpendicular from that point to the plane.)

International Mathematical Olympiad 1992 Problem 6

For each positive integer nn, S(n)S(n) is defined to be the greatest integer such that, for every positive integer kS(n)k \leq S(n), n2n^2 can be written as the sum of kk positive squares.

(a) Prove that S(n)n214S(n) \leq n^2 - 14 for each n4n \geq 4.

(b) Find an integer nn such that S(n)=n214S(n) = n^2 - 14.

(c) Prove that there are infinitely many integers nn such that S(n)=n214S(n) = n^2 - 14.