1974 USAMO Problems/Problem 2: Difference between revisions
No edit summary |
No edit summary |
||
| Line 28: | Line 28: | ||
Thus, <math>(a^ab^bc^c)^3\ge (a^ab^bc^c)(a^bb^cc^a)(a^cb^ac^b)=\left((abc)^{(a+b+c)/3}\right)^3</math>, and cube-rooting both sides gives <math>a^ab^bc^c\ge (abc)^{(a+b+c)/3}</math> as desired. | Thus, <math>(a^ab^bc^c)^3\ge (a^ab^bc^c)(a^bb^cc^a)(a^cb^ac^b)=\left((abc)^{(a+b+c)/3}\right)^3</math>, and cube-rooting both sides gives <math>a^ab^bc^c\ge (abc)^{(a+b+c)/3}</math> as desired. | ||
==Solution 3== | |||
WLOG let <math>a\ge b\ge c</math>. Let <math>b = ax</math> and <math>c = ay</math>, where <math>x \ge 1</math> and <math>y \ge 1</math>. | |||
We want to prove that <math>(a)^{a}(ax)^{ax}(ay)^{ay} \ge (a \cdot ax \cdot ay)^{\frac{a + ax + ay}{3}}</math>. | |||
Simplifying and combining terms on each side, we get <math>a^{a + ax + ay}x^{ax}y^{ay} \ge a^{a + ax + ay}(xy)^{\frac{a + ax + ay}{3}}</math>. | |||
Since <math>a > 0</math>, we can divide out <math>a^{a + ax + ay}</math> to get <math>x^{ax}y^{ay} \ge (xy)^{\frac{a + ax + ay}{3}}</math>. | |||
Take the <math>a</math>th root of each side and then cube both sides to get <math>x^{3x}y^{3y} \ge (xy)^{1 + x + y}</math>. | |||
This simplifies to <math>x^{2x-1}y^{2y-1} \ge x^{y}y^{x}</math>. | |||
Since <math>2x - 1 \ge x</math> and <math>2y - 1 \ge y</math>, we only need to prove <math>x^{x}y^{y} \ge x^{y}y^{x}</math> for our given <math>x, y</math>. | |||
WLOG, let <math>y \ge x</math> and <math> y =kx</math> for <math>k \ge 1</math>. Then our expression becomes | |||
<math>x^{x}(xk)^{xk} \ge x^{xk}(xk)^{x}</math> | |||
<math>x^{x+xk}k^{xk} \ge x^{x+xk}k^{x}</math> | |||
<math>k^{xk} \ge k^{x}</math> | |||
<math>k^k \ge k</math> | |||
This is clearly true for <math>k \ge 1</math>. | |||
Revision as of 21:45, 8 April 2018
Problem
Prove that if
,
, and
are positive real numbers, then
Solution 1
Consider the function
.
for
; therefore, it is a convex function and we can apply Jensen's Inequality:
Apply AM-GM to get
which implies
Rearranging,
Because
is an increasing function, we can conclude that:
which simplifies to the desired inequality.
Solution 2
Note that
.
So if we can prove that
and
, then we are done.
WLOG let
.
Note that
. Since
,
,
, and
, it follows that
.
Note that
. Since
,
,
, and
, it follows that
.
Thus,
, and cube-rooting both sides gives
as desired.
Solution 3
WLOG let
. Let
and
, where
and
.
We want to prove that
.
Simplifying and combining terms on each side, we get
.
Since
, we can divide out
to get
.
Take the
th root of each side and then cube both sides to get
.
This simplifies to
.
Since
and
, we only need to prove
for our given
.
WLOG, let
and
for
. Then our expression becomes
This is clearly true for
.
Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.
See Also
| 1974 USAMO (Problems • Resources) | ||
| Preceded by Problem 1 |
Followed by Problem 3 | |
| 1 • 2 • 3 • 4 • 5 | ||
| All USAMO Problems and Solutions | ||
- Simple Olympiad Inequality
- Hard inequality
- Inequality
- Some q's on usamo write ups
- ineq
- exponents (generalization)
These problems are copyrighted © by the Mathematical Association of America.