Maths Olympiad Prep

Library / /483 of 520

Algebra Difficulty 7.5 National olympiad, round 2 Prove it

Example 6 Let aiR+(i=1,2,,n)a_i \in \mathbf{R}^{+} (i=1,2, \cdots, n), and a1+a2++an=ka_{1}+a_{2}+\cdots+a_{n}=k, then we have:
(a1+ka1)m+(a2+ka2)m++(an+kan)m\left(a_{1}+\frac{k}{a_{1}}\right)^{m}+\left(a_{2}+\frac{k}{a_{2}}\right)^{m}+\cdots+\left(a_{n}+\frac{k}{a_{n}}\right)^{m}
n(n+kn)m\geqslant n\left(n+\frac{k}{n}\right)^{m}. Where mNm \in \mathrm{N}.

Solution

In the lemma, let a11=a3m,a12=a13==act=1,(i=1,2,,n)It is easy to see: a1mn+a2m++anm1nm1(a1+a2++an)mThen (a1+ka1)m+(a2+ka2)m++(aa+kan)m1nn1[(a1+ka1)+(a2+ka2)++(an+kan)]mm=1nm1[(a1+a2++an)+k(1a1+1a2++1an)]m1nmn1[k+kn2a1+a2++an]m=1nk1(k+n2)kx=n(n+kn)nx.\begin{array}{l} \text{In the lemma, let } a_{11}=a_{3}^{m}, a_{12}=a_{13}=\cdots \\ =a_{\text{ct}}=1, (i=1,2, \cdots, n) \\ \text{It is easy to see: } a_{1}^{m n}+a_{2}^{m}+\cdots+a_{n}^{m} \\ \geqslant \frac{1}{n^{m-1}}\left(a_{1}+a_{2}+\cdots+a_{n}\right)^{m} \\ \text{Then }\left(a_{1}+\frac{k}{a_{1}}\right)^{m}+\left(a_{2}+\frac{k}{a_{2}}\right)^{m}+\cdots+\left(a_{a}+\right. \\ \left.\frac{k}{a_{n}}\right)^{m} \\ \geqslant \frac{1}{n^{n-1}}\left[\left(a_{1}+\frac{k}{a_{1}}\right)+\left(a_{2}+\frac{k}{a_{2}}\right)+\cdots+\left(a_{n}+\right.\right. \\ \left.\left.\frac{k}{a_{n}}\right)\right]^{\mathrm{mm}} \\ =\frac{1}{n^{m-1}}\left[\left(a_{1}+a_{2}+\cdots+a_{n}\right)+k\left(\frac{1}{a_{1}}+\frac{1}{a_{2}}+\cdots\right.\right. \\ \left.\left.+\frac{1}{a_{n}}\right)\right]^{m} \\ \geqslant \frac{1}{n^{\frac{m}{n}-1}}\left[k+k \cdot \frac{n^{2}}{a_{1}+a_{2}+\cdots+a_{n}}\right]^{m} \\ =\frac{1}{n^{k-1}}\left(k+n^{2}\right)^{\mathrm{kx}} \text{. } \\ =n\left(n+\frac{k}{n}\right)^{n x} . \end{array}

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.