2015 USAJMO Problems/Problem 1
Given a sequence of real numbers, a move consists of choosing two terms and replacing each with their arithmetic mean. Show that there exists a sequence of distinct real numbers such that after one initial move is applied to the sequence -- no matter what move -- there is always a way to continue with a finite sequence of moves so as to obtain in the end a constant sequence.
Let the set be , namely all the consecutive integers from to . Notice that the operation we are applying in this problem does not change the sum or the mean of the set, which is .
There are pairs of opposite integers . After the first two elements are chosen, there are at least such pairs. For each such pair we perform the operation of average, hence reducing these elements to . Then use the other elements together with three 's produced to form the group of eight: , and perform the operation in the following order: where . Then, for two groups, for the other two groups, and finally for all the eight elements. Since the sum of the eight-group is , must also be . Therefore, all the elements are reduced to .
The key to the algorithm is to form a subset, which is guaranteed to be reducible to all the members of the same value, namely the mean. Then before that, if we could always choose members to form pairs, each yielding the average of the total group, then all the members are reduced to the average. Under the condition that two arbitrary elements are chosen first, we need only to guarantee this result. But for the first operation leads to equal elements, so is the only case when all the members may not be reduced to average.
Sidenote: Actually, for , the members are all reduced to the average, as the sum of the terms is constant and does not change.
Consider any arithmetic sequence. WLOG, let it be , i.e. . Define the move as replacing the numbers located at positions and with their mean, assuming and are distinct. If they are the same integer, define it as not making a move. Now, suppose the initial move . If , then . Then, applying the moves we get . Otherwise, suppose . Then consider the following moves: We have makes . So, makes Similarly for with and . Then, finishing up with the moves we get .
(95% Sure) Doesn't this solution fail for Case when or is ? (Because so is basically non-existent.) - ike.chen
Solution 3 (INCORRECT)
Let the set be , where all the terms are nonnegative. Note that the sum of all the terms in this sequence will always be the same after any amount of moves. To prove this, let be integers with , and we have .
Also, by AM-GM, so the product of all the terms will not decrease after any number of moves. However, the product will only stay the same when , so the product will always increase if .
Finally, note that by AM-GM, so because is fixed, there is a maximum product that is reached after a finite number of moves as the product increases. This product is reached when , so we are done.
This solution is incorrect; the product may take an infinite number of moves to reach the maximum (for example, consider the sequence )
We claim that the sequence satisifes the conditions
Let the initial pair that we choose to operate on be denoted as
Sub case 1a: if sum to in this sequence, the pair is really just or . If we replace , and with their AM then they both become . Notice that for every number in the original sequence, there is either a negative or positive value to that (depending on the sign). So once we convert the initial pair to , we can do so for every other pair, for example let be a number in the sequence, we would operate on for every number until every number in the sequence becomes . (Note that the amount of operations this would take is finite).
Sub case 1b: If then we can use the same logic, but with one extra step. After we do as our initial operation, we do . This is equivalent to and which turns all those values into (this is also the same as comparing and which cancels out). Then since the only values that remain besides both have a negative/positive counter part, do the same thing in Sub case 1a; turning the whole sequence to in a finite number of operations.
Case 2: The inital pair is
Obviously, there is a in the sequence, (this will come into play later). Since our only vanishes due to the AM, our goal is to make another . Remember that for every number in the original sequence (besides ) there is a negative or positive value depending on the numbers sign. So even if to or any other number in the sequence doesn't make , we have another option.
Find any such that (again this is guaranteed to be in the sequence).
Now once you have your s, take the , and take the AM of that and . Then there will be 2 s. This will make s with our two numbers from since that produces 2 s. Since those cancel and make , everything else is the same positive negative condition, which finishes. ~dukcrantel
|2015 USAJMO (Problems • Resources)|
|First Problem||Followed by|
|1 • 2 • 3 • 4 • 5 • 6|
|All USAJMO Problems and Solutions|