Problem

Source: ELMO Shortlist 2010, C4

Tags: integration, combinatorics proposed, combinatorics



The numbers $1, 2, \ldots, n$ are written on a blackboard. Each minute, a student goes up to the board, chooses two numbers $x$ and $y$, erases them, and writes the number $2x+2y$ on the board. This continues until only one number remains. Prove that this number is at least $\frac{4}{9}n^3$. Brian Hamrick.