Difference between revisions of "1994 USAMO Problems/Problem 4"
m |
m (→See Also) |
||
Line 9: | Line 9: | ||
== See Also == | == See Also == | ||
{{USAMO box|year=1994|num-b=3|num-a=5}} | {{USAMO box|year=1994|num-b=3|num-a=5}} | ||
+ | |||
+ | [[Category:Olympiad Algebra Problems]] | ||
[[Category:Olympiad Inequality Problems]] | [[Category:Olympiad Inequality Problems]] |
Revision as of 12:02, 17 September 2012
Problem
Let be a sequence of positive real numbers satisfying for all . Prove that, for all
Solution
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.
See Also
1994 USAMO (Problems • Resources) | ||
Preceded by Problem 3 |
Followed by Problem 5 | |
1 • 2 • 3 • 4 • 5 | ||
All USAMO Problems and Solutions |