Difference between revisions of "2018 USAJMO Problems/Problem 2"
(→Solution 2) |
(→Solution 2) |
||
Line 9: | Line 9: | ||
==Solution 2== | ==Solution 2== | ||
WLOG let <math>a \geq b \geq c</math>. Note that the equations are homogeneous, so WLOG let <math>c=1</math>. | WLOG let <math>a \geq b \geq c</math>. Note that the equations are homogeneous, so WLOG let <math>c=1</math>. | ||
− | Thus, the inequality now becomes <math>2ab + 2a + 2b + 4 \geq a^2 + b^2 + 1</math>, which simplifies to <math> | + | Thus, the inequality now becomes <math>2ab + 2a + 2b + 4 \geq a^2 + b^2 + 1</math>, which simplifies to <math>2(a+b) + 3 \geq (a-b)^2</math>. |
Now we will use the condition. Letting <math>x=a+b</math> and <math>y=a-b</math>, we have | Now we will use the condition. Letting <math>x=a+b</math> and <math>y=a-b</math>, we have |
Revision as of 00:12, 12 March 2023
Problem
Let be positive real numbers such that . Prove that
Solution 1
WLOG let . Add to both sides of the inequality and factor to get:
The last inequality is true by AM-GM. Since all these steps are reversible, the proof is complete.
Solution 2
WLOG let . Note that the equations are homogeneous, so WLOG let . Thus, the inequality now becomes , which simplifies to .
Now we will use the condition. Letting and , we have .
Plugging this into the inequality, we have , which is true since .
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.
Solution 3
https://wiki-images.artofproblemsolving.com//6/69/IMG_8946.jpg
-srisainandan6
See also
2018 USAJMO (Problems • Resources) | ||
Preceded by Problem 1 |
Followed by Problem 3 | |
1 • 2 • 3 • 4 • 5 • 6 | ||
All USAJMO Problems and Solutions |