Maths Olympiad Prep

Library / /497 of 520

Algebra Difficulty 7.7 National olympiad, round 2 Prove it

8. Let a1,a2,,an;b1,b2,,bna_{1}, a_{2}, \cdots, a_{n} ; b_{1}, b_{2}, \cdots, b_{n} be positive real numbers, prove that:
k=1n(ak+bk)k=1nakbkak+bk(k=1nak)(k=1nbk)\sum_{k=1}^{n}\left(a_{k}+b_{k}\right) \cdot \sum_{k=1}^{n} \frac{a_{k} b_{k}}{a_{k}+b_{k}} \leqslant\left(\sum_{k=1}^{n} a_{k}\right)\left(\sum_{k=1}^{n} b_{k}\right)

Equality holds if and only if akbk\frac{a_{k}}{b_{k}} is a constant.

Solution

8. Proof
 Let D=(k=1nak)(k=1nbk)(k=1n(ak+bk))(k=1nakbkak+bk)=(k=1nak)(j=1nbj)(k=1n(ak+bk))(j=1najbjaj+bj)=k=1nj=1nakbj(aj+bj)ajbj(ak+bk)aj+bj\text { Let } \begin{aligned} D & =\left(\sum_{k=1}^{n} a_{k}\right)\left(\sum_{k=1}^{n} b_{k}\right)-\left(\sum_{k=1}^{n}\left(a_{k}+b_{k}\right)\right)\left(\sum_{k=1}^{n} \frac{a_{k} b_{k}}{a_{k}+b_{k}}\right) \\ & =\left(\sum_{k=1}^{n} a_{k}\right)\left(\sum_{j=1}^{n} b_{j}\right)-\left(\sum_{k=1}^{n}\left(a_{k}+b_{k}\right)\right)\left(\sum_{j=1}^{n} \frac{a_{j} b_{j}}{a_{j}+b_{j}}\right) \\ & =\sum_{k=1}^{n} \sum_{j=1}^{n} \frac{a_{k} b_{j}\left(a_{j}+b_{j}\right)-a_{j} b_{j}\left(a_{k}+b_{k}\right)}{a_{j}+b_{j}} \end{aligned}

By swapping the indices k,jk, j, the value of DD remains unchanged: D=k=1nj=1najbk(ak+bk)akbk(aj+bj)ak+bkD=\sum_{k=1}^{n} \sum_{j=1}^{n} \frac{a_{j} b_{k}\left(a_{k}+b_{k}\right)-a_{k} b_{k}\left(a_{j}+b_{j}\right)}{a_{k}+b_{k}},
Adding (1) and (2), we get 2D=k=1nj=1n(akbjajbk)2(ak+bk)(aj+bj)0,D=02 D=\sum_{k=1}^{n} \sum_{j=1}^{n} \frac{\left(a_{k} b_{j}-a_{j} b_{k}\right)^{2}}{\left(a_{k}+b_{k}\right)\left(a_{j}+b_{j}\right)} \geqslant 0, D=0 if and only if akbj=a,bk(k,j=1a_{k} b_{j}=a, b_{k}(k, j=1, 2,,n)2, \cdots, n).

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.