Art of Problem Solving

1997 USAMO Problems/Problem 5: Difference between revisions

1=2 (talk | contribs)
mNo edit summary
1=2 (talk | contribs)
mNo edit summary
Line 10: Line 10:
{{USAMO newbox|year=1997|num-b=4|num-a=6}}
{{USAMO newbox|year=1997|num-b=4|num-a=6}}


[[Category:Olympiad Algebra Problems]]
[[Category:Olympiad Inequality Problems]]

Revision as of 10:54, 17 September 2012

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

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See Also

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