Practice library
Problems
1Let \(A\) be a set of \(10\) numbers chosen from \(\{1, 2, \ldots, 100\}\). Prove that \(A\) has two nonempty subsets \(S\) and \(T\) with no element in common such that the sum of the elements of \(S\) …Open2An island is inhabited by \(45\) chameleons: \(17\) yellow, \(15\) grey and \(13\) blue. They wander about and meet from time to time, never more than two at a time. When two chameleons of the same colour …3The pupils of a school went to the theatre on two occasions, and every pupil of the school attended at least one of the two performances. Boys formed \(60\%\) of the audience at the first performance and …4The points of a plane \(\alpha\) are split between two nonempty sets \(A\) and \(B\): no point belongs to both, and every point belongs to one of them. Prove that some isosceles right triangle has all …5How many integers \(n\) with \(10 \le n < 100000\) are divisible by \(4\), contain no digit \(0\) in their decimal representation, and have no two adjacent digits equal?6In the expression \[ *\,1 * 3 * 3^{2} * 3^{3} * \cdots * 3^{1997} * 3^{1998} \] Arkadije and Branislav take turns replacing one of the stars by \(+\) or by \(-\), one star per move, until no star is left. …7In a group of \(20\) people, every person chooses ten of the other nineteen and sends one letter to each of them. Prove that there are two people who sent a letter to each other.8How many isosceles trapezoids with integer side lengths have perimeter \(2005\)? (A trapezoid here means a quadrilateral with exactly two parallel sides, so a parallelogram is not one. Trapezoids with …9The number \(1\) is written on a board \(2005\) times. A move consists of erasing two of the numbers written on the board and writing, in their place, one quarter of their sum. The move is repeated until …10A \(2004 \times 2004\) board is completely tiled by pieces of size \(1 \times 4\); each piece covers four cells of a single row (call it horizontal) or four cells of a single column (vertical). Can the …11A set \(\mathcal{A}\) of \(2000\) points in the plane contains no three collinear points. Prove that these points can be joined by \(1000\) blue, \(1000\) red and \(1000\) yellow segments in such a way …
Showing 11 of 651 - problem statements are free for everyone.