MathsGee is Zero-Rated (You do not need data to access) on: Telkom |Dimension Data | Rain | MWEB

0 like 0 dislike
421 views
If $\left\{b_{1}, \ldots, b_{n}\right\}$ is a permutation of the sequence $\left\{a_{1}, \ldots, a_{n}\right\}$ of positive reals, then prove that
$$\frac{a_{1}}{b_{1}}+\frac{a_{2}}{b_{2}}+\cdots+\frac{a_{n}}{b_{n}} \geq n$$
| 421 views

0 like 0 dislike
Notice that $a_{1} a_{2} \cdots a_{n}=b_{1} b_{2} \cdots b_{n}$ since $b$ is a permutation of $a$. Then by AM-GM inequality
$$\frac{a_{1}}{b_{1}}+\frac{a_{2}}{b_{2}}+\cdots+\frac{a_{n}}{b_{n}} \geq n \sqrt[n]{\frac{a_{1}}{b_{1}} \frac{a_{2}}{b_{2}} \cdots \frac{a_{n}}{b_{n}}}=n \sqrt[n]{\frac{a_{1} a_{2} \cdots a_{n}}{a_{1} a_{2} \cdots a_{n}}}=n$$
by Diamond (78,454 points)

1 like 0 dislike