Difference between revisions of "2012 USAJMO Problems/Problem 3"
m (→Solution 5) |
(→Solution 5) |
||
Line 73: | Line 73: | ||
==Solution 5== | ==Solution 5== | ||
Lemma: For all positive integers <math>a,b>0</math>, we have <math>\frac{a^3+3b^3}{5a+b}\ge \frac{a^2}{6}+\frac{b^2}{2}</math>. | Lemma: For all positive integers <math>a,b>0</math>, we have <math>\frac{a^3+3b^3}{5a+b}\ge \frac{a^2}{6}+\frac{b^2}{2}</math>. | ||
+ | |||
Proof: We want to prove <math>\frac{a^3+3b^3}{5a+b}-(\frac{a^2}{6}+\frac{b^2}{2})\ge 0</math>. We can factor a <math>a^2+3b^2</math> from this to get <math>(a^2+3b^2)(\frac{a+3b}{5a+b}-\frac{1}{6})\ge 0</math>. The 2nd factor of the LHS is equal to <math>\frac{a+17b}{5a+b}</math>, which is positive since <math>a,b>0</math>. Additionally, by the Trivial Inequality, <math>(a^2+3b^2)</math> is positive, so the LHS is positive, proving the lemma. | Proof: We want to prove <math>\frac{a^3+3b^3}{5a+b}-(\frac{a^2}{6}+\frac{b^2}{2})\ge 0</math>. We can factor a <math>a^2+3b^2</math> from this to get <math>(a^2+3b^2)(\frac{a+3b}{5a+b}-\frac{1}{6})\ge 0</math>. The 2nd factor of the LHS is equal to <math>\frac{a+17b}{5a+b}</math>, which is positive since <math>a,b>0</math>. Additionally, by the Trivial Inequality, <math>(a^2+3b^2)</math> is positive, so the LHS is positive, proving the lemma. | ||
Revision as of 15:20, 31 December 2019
Problem
Let ,
,
be positive real numbers. Prove that
Solution
By the Cauchy-Schwarz inequality,
so
Since
,
Hence,
Again by the Cauchy-Schwarz inequality,
so
Since
,
Hence,
Therefore,
Solution 2
Titu's Lemma: The sum of multiple fractions in the form where
and
are sequences of real numbers is greater than of equal to the square of the sum of all
divided by the sum of all
, where i is a whole number less than n+1. Titu's Lemma can be proved using the Cauchy-Schwarz Inequality after multiplying out the denominator of the RHS.
Consider the LHS of the proposed inequality. Split up the numerators and multiply both sides of the fraction by either a or 3a to make the LHS
(Cyclic notation is a special notation in which all permutations of (a,b,c) is the summation command.)
Then use Titu's Lemma on all terms: owing to the fact that
, which is actually equivalent to
!
Solution 3
We proceed to prove that
(then the inequality in question is just the cyclic sum of both sides, since
)
Indeed, by AP-GP, we have
and
Summing up, we have
which is equivalent to:
Dividing from both sides, the desired inequality is proved.
--Lightest 15:31, 7 May 2012 (EDT)
Solution 4
By Cauchy-Schwarz,
(by AM-GM)
as desired.
Solution 5
Lemma: For all positive integers , we have
.
Proof: We want to prove . We can factor a
from this to get
. The 2nd factor of the LHS is equal to
, which is positive since
. Additionally, by the Trivial Inequality,
is positive, so the LHS is positive, proving the lemma.
We now go back to the equation. We have by the lemma, and the RHS equals
. Therefore, we are done.
--jeteagle 2:18, 31 December 2019 (EDT)
See Also
2012 USAJMO (Problems • Resources) | ||
Preceded by Problem 2 |
Followed by Problem 4 | |
1 • 2 • 3 • 4 • 5 • 6 | ||
All USAJMO Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.