Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I need to proof this inequality by AM-GM method.
Any ideas how to do it?

$$\frac{1}{a(1+b)} + \frac{1}{b(1+c)} + \frac{1}{c(1+a)} \geq \frac{3}{ (abc)^{\frac{1}{3}}\big( 1+ (abc)^{\frac{1}{3}}\big) }$$

share|cite|improve this question
up vote 5 down vote accepted

We may assume without loss of generality that $abc = k^3$, which enables us to make the substitution $\displaystyle a = \frac{kq}{p}, b = \frac{kr}{q}, c = \frac{kp}{r}$.

Now, $\displaystyle a(1+b) = \frac{kq}{p} \left(1+ \frac{kr}{q} \right) = \frac{k(q+kr)}{p}$.

Thus, the inequality reduces to proving (after cancelling $k$ from the denominator on both sides) $$\frac{p}{q+kr} +\frac{q}{r+kp} +\frac{r}{p+kq} \ge \frac{3}{1+k} $$ By Cauchy Schwarz, we get $$\left(\frac{p}{q+kr} +\frac{q}{r+kp} +\frac{r}{p+kq} \right) ( p(q+kr) + q(r+kp) + r(p+kq)) \ge (p+q+r)^2$$ Thus, we have that $$\frac{p}{q+kr} +\frac{q}{r+kp} +\frac{r}{p+kq} \ge \frac{(p+q+r)^2}{(1+k)(pq+qr+rp)} \ge \frac 3{1+k}$$ due to the well known $(p+q+r)^2 \ge 3(pq+qr+rp)$

share|cite|improve this answer
How do you use Cauchy Schwartz in the third step? This is not of the form $|x||y|\ge |x\cdot y|$ right? (are you using the sum norm on $\mathbb{R}^{n}$? – Bombyx mori Sep 15 '12 at 15:36

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.