Browse · MathNet
PrintAUT_ABooklet_2023
Austria 2023 counting and probability
Problem
Written on a blackboard are the numbers . The numbers on the blackboard are now modified, in a sequence of moves. In each move, two numbers on the blackboard—call them and —are chosen, deleted, and replaced by the single number . Such moves are carried out until there is only one number left on the blackboard. Prove that this number is always greater than .
Solution
The expression reminds us of the arithmetic mean. By the AM-HM inequality, we have or This inequality leads us to consider an argument concerning the reciprocals of the numbers on the board, as the sum of the reciprocals of two of these numbers is at least as large as the reciprocal of the number replacing them. This value remains the same if and only if the two chosen numbers are equal, and is otherwise larger. At the beginning, the sum of all reciprocals is This implies the claim, since there is an odd number of s in the beginning that cannot be divided into pairs, so one of them has to be part of a pair with different numbers.
Techniques
Invariants / monovariantsQM-AM-GM-HM / Power Mean