Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "1997 USAMO Problems/Problem 5"

(→‎Solution 3 (Isolated fudging))
(One of the solutions was a PNG file (bad), and the other was a sketch (bad))
Line 5: Line 5:
  
 
== Solution ==
 
== Solution ==
−
[[File:USAMO97(5-solution).jpg]]
 
−
 
−
== Solution 2 ==
 
−
'''Outline:'''
 
−
 
−
1. Because the inequality is homogenous, scale <math>a, b, c</math> by an arbitrary factor such that <math>abc = 1</math>.
 
−
 
−
2. Replace all <math>abc</math> with 1. Then, multiply both sides by <math>(a^3 + b^3 + 1)(b^3 + c^3 + 1)(a^3 + c^3 + 1)</math> to clear the denominators.
 
−
 
−
3. Expand each product of trinomials.
 
−
 
−
4. Cancel like mad.
 
−
 
−
5. You are left with <math>a^3 + a^3 + b^3 + b^3 + c^3 + c^3 \le a^6b^3 + a^6c^3 + b^6c^3 + b^6a^3 + c^6a^3 + c^6b^3</math>. Homogenize the inequality by multiplying each term of the LHS by <math>a^2b^2c^2</math>. Because <math>(6, 3, 0)</math> ''majorizes'' <math>(5, 2, 2)</math>, this inequality holds true by bunching. (Alternatively, one sees the required AM-GM is <math>\frac{a^6b^3 + a^6b^3 + a^3c^6}{3} \ge a^5b^2c^2</math>. Sum similar expressions to obtain the desired result.)
 
−
 
−
==Solution 3 (Isolated fudging)==
 
 
Because the inequality is homogenous (i.e. <math>(a, b, c)</math> can be replaced with <math>(ka, kb, kc)</math> without changing the inequality other than by a factor of <math>k^n</math> for some <math>n</math>), without loss of generality, let <math>abc = 1</math>.
 
Because the inequality is homogenous (i.e. <math>(a, b, c)</math> can be replaced with <math>(ka, kb, kc)</math> without changing the inequality other than by a factor of <math>k^n</math> for some <math>n</math>), without loss of generality, let <math>abc = 1</math>.
  

Revision as of 08:41, 20 July 2016

Problem

Prove that, for all positive real numbers $a, b, c,$

$(a^3+b^3+abc)^{-1}+(b^3+c^3+abc)^{-1}+(a^3+c^3+abc)^{-1}\le(abc)^{-1}$.

Solution

Because the inequality is homogenous (i.e. $(a, b, c)$ can be replaced with $(ka, kb, kc)$ without changing the inequality other than by a factor of $k^n$ for some $n$), without loss of generality, let $abc = 1$.

Lemma: \[\frac{1}{a^3 + b^3 + 1} \le \frac{c}{a + b + c}.\] Proof: Rearranging gives $(a^3 + b^3) c + c \ge a + b + c$, which is a simple consequence of $a^3 + b^3 = (a + b)(a^2 - ab + b^2)$ and \[(a^2 - ab + b^2)c \ge (2ab - ab)c = abc = 1.\]

Thus, by $abc = 1$: \[\frac{1}{a^3 + b^3 + abc} + \frac{1}{b^3 + c^3 + abc} + \frac{1}{c^3 + a^3 + abc}\] \[\le \frac{c}{a + b + c} + \frac{a}{a + b + c} + \frac{b}{a + b + c} = 1 = \frac{1}{abc}.\]

See Also

1997 USAMO (Problems • Resources)
Preceded by
Problem 4 		Followed by
Problem 6
1 • 2 • 3 • 4 • 5 • 6
All USAMO Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1997_USAMO_Problems/Problem_5&oldid=79633"