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

Let $a_i,b_i$ be nonnegative reals. Prove that


share|cite|improve this question
Have you tried anything? This looks very straightforward; maybe you should try figuring out what the right hand side equals. – chris Oct 27 '12 at 4:07
up vote 1 down vote accepted

We can assume that $a_j,b_j$'s are positive. As $\log$ is concave on $(0,+\infty)$, Jensen's inequality gives $$\tag{*}\frac 1n\sum_{j=1}^n\log c_j\leq \log\left(\frac 1n\sum_{j=1}^nc_j\right),$$ which gives $$\prod_{j=1}^nc_j^{1/n}\leq \frac 1n\sum_{j=1}^nc_j.$$ Applying this to $c_j:=\frac{a_j}{a_j+b_j}$, then to $c_j:=\frac{b_j}{a_j+b_j}$, and adding the inequalities, we get the wanted inequality.

Note that we have equality if and only if we have equality in $(*)$ for the given $c_j$'s.

share|cite|improve this answer

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.