Difference between revisions of "1983 USAMO Problems/Problem 2"
(Created page with "Lemma: <cmath>2(x_1^2+x_2^2+\cdots+x_5^2)\ge</cmath> <cmath>x_1x_2+x_1x_3+\cdots+x_4x_5</cmath> We solve this cylicallly by showing <cmath>\frac{1}{2}x^2+\frac{1}{2}y^2\ge x...") |
|||
Line 1: | Line 1: | ||
− | Lemma: | + | ==1983 USAMO Problem 1== |
+ | |||
+ | ==Solution== | ||
+ | |||
+ | |||
+ | '''Lemma:''' | ||
+ | |||
+ | For all real numbers <math>x_1,x_2,\cdots, x_3</math>, | ||
<cmath>2(x_1^2+x_2^2+\cdots+x_5^2)\ge</cmath> | <cmath>2(x_1^2+x_2^2+\cdots+x_5^2)\ge</cmath> |
Revision as of 18:12, 13 November 2011
1983 USAMO Problem 1
Solution
Lemma:
For all real numbers ,
We solve this cylicallly by showing
By the trivial inequality, , or .
Dividing by gives us the desired.
Making such an inequality for all the variable pairs and summing
them, we find the lemma is true.[/hide]
We start by plugging in our Vieta's: Let our roots be
. This means be Vieta's that
If we show that for all real that ,
then we have a contradiction and all of cannot
be real. We start by rewriting as
We divide by and find
Expanding the LHS, we have
Aha! We subtract out the second symmetric sums, and then multiply
by to find
which is true by our lemma.