MathDB
Cono Sur Olympiad 2011, Problem 2

Source:

August 23, 2014
invariantcombinatorics proposedcombinatorics

Problem Statement

The numbers 11 through 4n4^{n} are written on a board. In each step, Pedro erases two numbers aa and bb from the board, and writes instead the number ab2a2+2b2\frac{ab}{\sqrt{2a^2+2b^2}}. Pedro repeats this procedure until only one number remains. Prove that this number is less than 1n\frac{1}{n}, no matter what numbers Pedro chose in each step.