IMO 2000

Let $n \geq 2$ be a positive integer and $\lambda$ a positive real number. Initially there are $n$ fleas on a horizontal line, not all at the same point. We define a move as choosing two fleas at some points $A$ and $B$ , with $A$ to the left of $B$ , and letting the flea from $A$ jump over the flea from $B$ to the point $C$ so that $\frac {BC}{AB} = \lambda$ .

Determine all values of $\lambda$ such that, for any point $M$ on the line and for any initial position of the $n$ fleas, there exists a sequence of moves that will take them all to the position right of $M$ .

A magician has one hundred cards numbered 1 to 100. He puts them into three boxes, a red one, a white one and a blue one, so that each box contains at least one card. A member of the audience draws two cards from two different boxes and announces the sum of numbers on those cards. Given this information, the magician locates the box from which no card has been drawn.

How many ways are there to put the cards in the three boxes so that the trick works?

Let $AH_1, BH_2, CH_3$ be the altitudes of an acute angled triangle $ABC$ . Its incircle touches the sides $BC, AC$ and $AB$ at $T_1, T_2$ and $T_3$ respectively. Consider the symmetric images of the lines $H_1H_2, H_2H_3$ and $H_3H_1$ with respect to the lines $T_1T_2, T_2T_3$ and $T_3T_1$ . Prove that these images form a triangle whose vertices lie on the incircle of $ABC$ .