IMC 2002, Day 1, Problem 3
Let be a positive integer and let
Show that
Original from the official PDF

This transcription was compared symbol by symbol with the original, but not yet by a person.
Time on this problem
Work for at least 45 minutes before opening the solution.
Official solution
Solution. Since for all , (1) is equivalent to
We prove (2) by induction. For , both sides are equal to 2.
Assume that (2) holds for some . Let
then
This implies (2) for .
Transcribed from the official solutions, page 2. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.