Maths Olympiad Prep

Library / /481 of 520

Algebra Difficulty 6.3 National olympiad Prove it

34 Let
f(x)=lg1x+2x++(n1)x+anxn(nN,n2) f(x)=\lg \frac{1^{x}+2^{x}+\cdots+(n-1)^{x}+a \cdot n^{x}}{n}(n \in \mathbf{N}, n \geqslant 2)

If 0<a10<a \leqslant 1, prove: f(2x)2f(x)f(2 x) \geqslant 2 f(x).

Solution

34 Let
1x+2x++(n1)x+nxa=k, 1^{x}+2^{x}+\cdots+(n-1)^{x}+n^{x} \cdot a=k,

then
12+(kn)22kn,22x+(kn)222xkn,,n2xa2+(kn)22nxakn. \begin{array}{c} 1^{2}+\left(\frac{k}{n}\right)^{2} \geqslant \frac{2 k}{n}, 2^{2 x}+\left(\frac{k}{n}\right)^{2} \geqslant 2 \cdot \frac{2^{x} k}{n}, \cdots, \\ n^{2 x} a^{2}+\left(\frac{k}{n}\right)^{2} \geqslant \frac{2 n^{x} \cdot a k}{n} . \end{array}

Adding these inequalities, we get:
1+22x++(n1)2x+n2xa2+n(kn)22k[1+2x++(n1)x+nxa]/n=2k2n, \begin{aligned} & 1+2^{2 x}+\cdots+(n-1)^{2 x}+n^{2 x} a^{2}+n \cdot\left(\frac{k}{n}\right)^{2} \\ \geqslant & 2 k\left[1+2^{x}+\cdots+(n-1)^{x}+n^{x} a\right] / n \\ = & \frac{2 k^{2}}{n}, \end{aligned}

which simplifies to
1+22x++(n1)2x+n2xa2k2n. 1+2^{2 x}+\cdots+(n-1)^{2 x}+n^{2 x} a^{2} \geqslant \frac{k^{2}}{n} .

Substituting the value of k k gives
1+22x++(n1)2x+n2xa2[1+2x++(n1)x+nxa]2n. 1+2^{2 x}+\cdots+(n-1)^{2 x}+n^{2 x} \cdot a^{2} \geqslant \frac{\left[1+2^{x}+\cdots+(n-1)^{x}+n^{x} a\right]^{2}}{n} .

Since 0<a1 0 < a \leqslant 1 , we have aa2 a \geqslant a^{2} . Therefore,
1+22x++(n1)2x+n2xa[1+2x++(n1)x+nxa]2n 1+2^{2 x}+\cdots+(n-1)^{2 x}+n^{2 x} \cdot a \geqslant \frac{\left[1+2^{x}+\cdots+(n-1)^{x}+n^{x} a\right]^{2}}{n}

which means f(2x)2f(x) f(2 x) \geqslant 2 f(x) .

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.