Difference between revisions of "1983 USAMO Problems/Problem 2"
Danielguo94 (talk | contribs) (→Solution) |
Danielguo94 (talk | contribs) (→Solution) |
||
Line 21: | Line 21: | ||
<cmath>\frac{1}{2}x^2+\frac{1}{2}y^2\ge xy</cmath> | <cmath>\frac{1}{2}x^2+\frac{1}{2}y^2\ge xy</cmath> | ||
− | By the trivial inequality, | + | By the trivial inequality, |
− | <cmath>x^2+y^2\ge 2xy</cmath> | + | <cmath>x^2+y^2\ge 2xy \rightarrow \frac{x^2}{2} + \frac{y^2}{2} \ge xy</cmath> |
− | |||
− | |||
Making such an inequality for all the variable pairs and summing them, we find the lemma is true. | Making such an inequality for all the variable pairs and summing them, we find the lemma is true. |
Revision as of 17:54, 14 June 2012
1983 USAMO Problem 2
Prove that the zeros of
cannot all be real if .
Solution
Lemma:
For all real numbers ,
We solve this cyclically by showing
By the trivial inequality,
Making such an inequality for all the variable pairs and summing them, we find the lemma is true.
Now, 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
We subtract out the second symmetric sums, and then multiply by to find
which is true by our lemma.