$$\frac{ab}{a+b} + \frac{cd}{c+d} \leq \frac{(a+c)(b+d)}{a+b+c+d}$$ I tried applying a.m. g.m inequality to l.h.s and tried to find upper bound for l.h.s and lower bound for r.h.s but i am not getting answer .
2026-03-31 07:24:59.1774941899
On
Prove that $\frac{ab}{a+b} + \frac{cd}{c+d} \leq \frac{(a+c)(b+d)}{a+b+c+d}$
160 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
3
There are 3 best solutions below
0
On
Not a beautiful proof I have to admit, but it is a proof:
Multiply 2 sides of equation with $(a+b)(c+d)(a+b+c+d)$, we get to the equivalent form: $$ ab(c+d)(a+b+c+d) + cd(a+b)(a+b+c+d) \leq (a+c)(b+d)(a+b)(c+d). $$ Work out both sides of the equation above to reduce it to the following equivalent form: $$ 2abcd \leq a^2d^2 + b^2c^2, $$ which is obviously true due to the AM-GM inequality.
I suppose that $a,b,c,d$ are $>0$. An idea is to put $$F(x)=\frac{(x+c)(b+d)}{x+b+c+d}-\frac{xb}{x+b}-\frac{cd}{c+d}$$ and to compute the derivative: $$F^{\prime}(x)=\frac{(b+d)^2}{(x+b+c+d)^2}-\frac{b^2}{(x+b)^2}$$
This show that the minimum of $F$ on $]0,+\infty[$ is obtained for $x=bc/d$, and to finish you have to compute this minimum.