Cono Sur Olympiad 2011, Problem 2
Source:
August 23, 2014
invariantcombinatorics proposedcombinatorics
Problem Statement
The numbers through are written on a board. In each step, Pedro erases two numbers and from the board, and writes instead the number . Pedro repeats this procedure until only one number remains. Prove that this number is less than , no matter what numbers Pedro chose in each step.