AZE JBMO TST
Source: AZE JBMO TST
May 2, 2015
combinatorics
Problem Statement
There are some real numbers on the board (at least two). In every step we choose two of them, for example and , and then we replace them with . We continue until there is one number. Prove that the last number does not depend on which order we choose the numbers to erase.