1997 USAMO Problems/Problem 5

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 1

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}.$

Solution 2

Rearranging the AM-HM inequality, we get $\frac{1}{x}+\frac{1}{y}+\frac{1}{z} \le \frac{9}{x+y+z}$ .

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

Page

Toolbox

Search

1997 USAMO Problems/Problem 5

Contents

Problem

Solution 1

Solution 2

See Also