Difference between revisions of "2012 USAJMO Problems/Problem 3"
(→See Also) |
(→Solution 6) |
||
(14 intermediate revisions by 7 users not shown) | |||
Line 27: | Line 27: | ||
<cmath>\frac{a^3 + 3b^3}{5a + b} + \frac{b^3 + 3c^3}{5b + c} + \frac{c^3 + 3a^3}{5c + a} \ge \frac{1 + 3}{6} (a^2 + b^2 + c^2) = \frac{2}{3} (a^2 + b^2 + c^2).</cmath> | <cmath>\frac{a^3 + 3b^3}{5a + b} + \frac{b^3 + 3c^3}{5b + c} + \frac{c^3 + 3a^3}{5c + a} \ge \frac{1 + 3}{6} (a^2 + b^2 + c^2) = \frac{2}{3} (a^2 + b^2 + c^2).</cmath> | ||
==Solution 2== | ==Solution 2== | ||
− | Split up the numerators and multiply both sides of the fraction by either a or 3a | + | Titu's Lemma: The sum of multiple fractions in the form <math>\frac{a_n^2}{b_n}</math> where <math>a_n</math> and <math>b_n</math> are sequences of real numbers is greater than of equal to the square of the sum of all <math>a_i</math> divided by the sum of all <math>b_i</math>, 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. |
− | < | + | |
− | Then use Titu's Lemma: < | + | 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 |
− | + | <cmath>\sum_{cyc} \frac {a^4} {5a^2+ab}+\sum_{cyc} \frac {9a^4} {15ac+3a^2}</cmath> | |
− | + | (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: <cmath>\sum_{cyc} \frac {a^4} {5a^2+ab} +\sum_{cyc} \frac {9a^4} {15ac+3a^2} \ge \frac {16(a^2+b^2+c^2)^2} {8(a^2+b^2+c^2)+16(ab+bc+ca)} \ge \frac {16(a^2 + b^2 + c^2)^2}{24(a^2 + b^2 + c^2)} = \frac{2}{3} (a^2 + b^2 + c^2) </cmath> owing to the fact that <math>a^2+b^2+c^2 \ge ab+bc+ca</math>, which is actually equivalent to <math>(a-b)^2 + (b-c)^2 + (c-a)^2 \ge 0</math>! | ||
==Solution 3== | ==Solution 3== | ||
Line 59: | Line 61: | ||
--[[User:Lightest|Lightest]] 15:31, 7 May 2012 (EDT) | --[[User:Lightest|Lightest]] 15:31, 7 May 2012 (EDT) | ||
+ | |||
+ | ==Solution 4== | ||
+ | By Cauchy-Schwarz, | ||
+ | |||
+ | <cmath>\left(\sum_{cyc} \dfrac{a^3}{5a + b} + \dfrac{b^3}{5a + b} + \dfrac{b^3}{5a + b} + \dfrac{b^3}{5a + b} \right) \ge \dfrac{\left( \sum_{cyc} a^2 + b^2 + b^2 + b^2 \right)^2}{ \left( \sum_{cyc} a(5a + b) + b(5a + b) + b(5a + b) + b(5a + b) \right) }</cmath> | ||
+ | |||
+ | <cmath>= \dfrac{\left(4a^2 + 4b^2 + 4c^2\right)^2}{\left(8a^2 + 8b^2 + 8c^2\right) + \left(16ab + 16bc + 16ca\right)}</cmath> | ||
+ | |||
+ | <cmath>\ge \dfrac{16\left(a^2 + b^2 + c^2\right)^2}{\left(8a^2 + 8b^2 + 8c^2\right) + \left(8a^2 + 8b^2\right) + \left(8b^2 + 8c^2\right) + \left(8c^2 + 8a^2\right)}</cmath> (by AM-GM) <cmath>= \dfrac{2}{3}\left(a^2 + b^2 + c^2\right)</cmath> as desired. | ||
+ | |||
+ | ==Solution 5== | ||
+ | |||
+ | We note that if we can prove that there exists a real number <math>x</math> such that <cmath>\frac{a^3+3b^3}{5a+b}\geq xa^2+(\frac{2}{3}-x)b^2</cmath> for all positive reals <math>a</math> and <math>b</math>, then we are done since both sides are a cyclic sum of <math>a,b</math>, and <math>c</math>. Note that if we multiply both <math>a</math> and <math>b</math> by a constant <math>r</math>, the left and right sides will both multiply by <math>r^2</math> (since the numerator on the left will multiply by <math>r^3</math> and the denominator will multiply by <math>r</math>. This means that if the inequality is satisfied for an ordered pair <math>(a,b)</math>, then it is also satisfied for <math>(ar,br)</math> for any positive real <math>r</math>. Thus, without loss of generality we can let <math>b=1</math>,and our inequality becomes <cmath>\frac{a^3+3}{5a+1}\geq a^2x+\frac{2}{3}-x.</cmath> Expanding this and rearranging we get <math>a^3(1-5x)+a^2(-x)+a(5x-\frac{10}{3})+x+\frac{7}{3}\geq0</math>. Since <math>1</math> is a root of the left side, we can factor this as <cmath>(a-1)(a^2(1-5x)+a(1-6x)-x-\frac{7}{3})\geq0.</cmath> Note that for this to always be nonnegative, we must have <math>a^2(1-5x)+a(1-6x)-x-\frac{7}{3}</math> be positive when <math>a>1</math> and negative when <math>a<1</math>. Thus, it must have a root at <math>a=1</math>, so we plug in <math>a=1</math> is a root and find that we must have <math>x=-\frac{1}{36}</math>. When <math>x=-\frac{1}{36}</math>, the expression factors as <math>(a-1)^2(\frac{41}{36}a+\frac{83}{36})\geq0</math> which obviously is nonnegative for all positive reals <math>a</math>, so we are done. | ||
+ | |||
+ | ~john0512, bronzetruck2016 | ||
+ | |||
+ | |||
+ | ==Solution 6== | ||
+ | |||
+ | <math>LHS=\sum_{cyc}\frac{a^3+3b^3}{5a+b}=\sum_{cyc}\frac{a^3}{5a+b}+\sum_{cyc}\frac{3b^3}{5a+b}=\sum_{cyc}\frac{a^4}{5a^2+ab}+\sum_{cyc}\frac{9b^4}{15ab+3b^2}</math> which tells that <math>LHS\geq \frac{(a^2+b^2+c^2)^2}{5(a^2+b^2+c^2)+ab+bc+ac}+\frac{3(a^2+b^2+c^2)}{(a^2+b^2+c^2)+5(ab+bc+ac)}\geq (\frac{1}{2}+\frac{1}{6})(a^2+b^2+c^2)=RHS</math>, our proof is done | ||
+ | |||
+ | ~bluesoul | ||
==See Also== | ==See Also== |
Latest revision as of 19:20, 17 June 2022
Contents
[hide]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
We note that if we can prove that there exists a real number such that for all positive reals and , then we are done since both sides are a cyclic sum of , and . Note that if we multiply both and by a constant , the left and right sides will both multiply by (since the numerator on the left will multiply by and the denominator will multiply by . This means that if the inequality is satisfied for an ordered pair , then it is also satisfied for for any positive real . Thus, without loss of generality we can let ,and our inequality becomes Expanding this and rearranging we get . Since is a root of the left side, we can factor this as Note that for this to always be nonnegative, we must have be positive when and negative when . Thus, it must have a root at , so we plug in is a root and find that we must have . When , the expression factors as which obviously is nonnegative for all positive reals , so we are done.
~john0512, bronzetruck2016
Solution 6
which tells that , our proof is done
~bluesoul
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.