Let $a_1,a_2,\ldots,a_n,b_1,b_2,\ldots,b_n$ be positive numbers with $a_1+a_2+\cdots+a_n = b_1+b_2+\cdots+b_n$. $$\text{Prove that} \dfrac{a_1^2}{a_1+b_1}+\cdots+\dfrac{a_n^2}{a_n+b_n} \geq \dfrac{1}{2}(a_1+\cdots+a_n).$$


It seems like I should use AM-GM on the bottom of each fraction. We then get $\dfrac{a_i^2}{a_i+b_i} \leq \dfrac{a_i^2}{2\sqrt{a_ib_i}}$. But this doesn't seem to help as we get an upper bound. Since there is so much about $a_1+\cdots+a_n$ in this problem, I think a substitution for that might work.

  • 1
    $\begingroup$ This may help $\endgroup$ – I. Cavey Dec 29 '15 at 23:11
  • $\begingroup$ Use $\frac{a^2}{b}\geq2a-b$ for positive $a$ and $b$. $\endgroup$ – Michael Rozenberg Dec 29 '15 at 23:19
  • $\begingroup$ Cauchy-Schwarz gives:$$\sum \frac{a_i^2}{a_i+b_i} \ge \frac{(\sum a_i)^2}{\sum (a_i + b_i)} = ...$$ $\endgroup$ – Macavity Dec 30 '15 at 9:20

Since $\displaystyle\sum_{i=1}^n\frac{a_i^{2}}{a_i+b_i}-\sum_{i=1}^{n}\frac{b_i^{2}}{a_i+b_i}=\sum_{i=1}^n\frac{a_i^{2}-b_i^{2}}{a_i+b_i}=\sum_{i=1}^n(a_i-b_i)=0$, $\displaystyle\;\;\sum_{i=1}^n\frac{a_i^{2}+b_i^{2}}{a_i+b_i}=2\sum_{i=1}^n\frac{a_i^{2}}{a_i+b_i}$.

Since $2(a_i^{2}+b_i^{2})\ge(a_i+b_i)^2$, $\displaystyle\;\;2\sum_{i=1}^n\frac{a_i^{2}}{a_i+b_i}=\sum_{i=1}^n\frac{a_i^{2}+b_i^{2}}{a_i+b_i}\ge\sum_{i=1}^n\frac{a_i+b_i}{2}=\sum_{i=1}^n a_i$

  • $\begingroup$ Jesus, that was such a nice argument. $\endgroup$ – Vinícius Novelli Dec 30 '15 at 1:10

Using Cauchy-Schwarz inequality $$ (x_1^2+\cdots+x_n^2)(y_1^2+\cdots+y_n^2)\ge (x_1y_1+\cdots+x_ny_n)^2, $$ for $x_i=\displaystyle\frac{a_i}{\sqrt{a_i+b_i}}\,$ and $\,y_i=\sqrt{a_i+b_i}$, we obtain

$$ \left({\frac{a_1^2}{a_1+b_1}}+\cdots+\frac{a_n^2}{a_n+b_n}\right)\big((a_1+b_1)+\cdots+(a_n+b_n)\big)\ge \left(a_1+\cdots+a_n\right)^2, $$ or equivalently $$ 2\left({\frac{a_1^2}{a_1+b_1}}+\cdots+\frac{a_n^2}{a_n+b_n}\right)(a_1+\cdots+a_n)\ge \left(a_1+\cdots+a_n\right)^2, $$ and finally $$ {\frac{a_1^2}{a_1+b_1}}+\cdots+\frac{a_n^2}{a_n+b_n}\ge \frac{1}{2}\left(a_1+\cdots+a_n\right). $$


It can be proved by using the Cauchy reverse technique. In details, $$ \sum\limits_{i=1}^n{\frac{2a_i^2}{a_i+b_i}}=\sum\limits_{i=1}^n{\left(2a_i-\frac{2a_ib_i}{a_i+b_i}\right)} \ge \sum\limits_{i=1}^n{\left(2a_i-\sqrt{a_ib_i}\right)} $$ So it suffices to show the following inequality $$ \sum\limits_{i=1}^n{a_i} \ge \sum\limits_{i=1}^n{\sqrt{a_ib_i}} $$ , which is quite clear since $$ 2\sum\limits_{i=1}^n{a_i}=\sum\limits_{i=1}^n{\left(a_i+b_i\right)} \ge 2\sum\limits_{i=1}^n{\sqrt{a_ib_i}} $$ according to AM-GM inequality and the condition.

Remark. If there is a minus before a fraction, then we can apply AM-GM in the denominator.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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