- Day 1
Prove that from a set of ten distinct two-digit numbers, it is always possible to find two disjoint subsets whose members have the same sum.
International Mathematical Olympiad 1972.
Prove that from a set of ten distinct two-digit numbers, it is always possible to find two disjoint subsets whose members have the same sum.
Given , prove that every cyclic quadrilateral can be dissected into cyclic quadrilaterals.
Prove that is a multiple of for any non-negative integers and .
Find all positive real solutions to: \begin{eqnarray*} (x_1^2-x_3x_5)(x_2^2-x_3x_5) &\le& 0 (x_2^2-x_4x_1)(x_3^2-x_4x_1) &\le& 0 (x_3^2-x_5x_2)(x_4^2-x_5x_2) &\le& 0 (x_4^2-x_1x_3)(x_5^2-x_1x_3) &\le & 0 (x_5^2-x_2x_4)(x_1^2-x_2x_4) &\le& 0 \end{eqnarray*}
and are real-valued functions defined on the real line. For all and . is not identically zero and for all . Prove that for all .
Given four distinct parallel planes, prove that there exists a regular tetrahedron with a vertex on each plane.