1994 USAMO Problems/Problem 4
Let be a sequence of positive real numbers satisfying for all . Prove that, for all
Note that if we try to minimize , we would try to make the as equal as possible. However, by the condition given in the problem, this isn't possible, the 's have to be an increasing sequence. Thinking of minimizing sequences, we realize that the optimal equation is . Note that this is strictly greater than . So it is greater than the sum of over all n from 1 to . So the sum we are looking to minimize is strictly greater than the sum of over all from 1 to , which is what we wanted to do.
|1994 USAMO (Problems • Resources)|
|1 • 2 • 3 • 4 • 5|
|All USAMO Problems and Solutions|
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.