The numbers 1 through 4n are written on a board. In each step, Pedro erases two numbers a and b from the board, and writes instead the number 2a2+2b2ab. Pedro repeats this procedure until only one number remains. Prove that this number is less than n1, no matter what numbers Pedro chose in each step. invariantcombinatorics proposedcombinatorics