Maths Olympiad Prep

Library / /278 of 397

Algebra Difficulty 6.4 National Olympiad Prove it Taiwan

Let ai>0,i=1,2,,n,i=1nai=1a_i > 0, i = 1, 2, \dots, n, \sum_{i=1}^{n} a_i = 1.
Prove that for any positive integer kk,
(a1k+1a1k)(a2k+1a2k)(ank+1ank)(nk+1nk)n. (a_1^k + \frac{1}{a_1^k})(a_2^k + \frac{1}{a_2^k})\cdots(a_n^k + \frac{1}{a_n^k}) \ge (n^k + \frac{1}{n^k})^n.

Solution

a1k+1a1k=a1k+1n2ka1k++1n2kank(n2k+1)(a1k(n2ka12k)n2k)1n2k+1=(nk+1nk)(1na1)k(n2k1)n2k+1. \begin{aligned} a_1^k + \frac{1}{a_1^k} &= a_1^k + \frac{1}{n^{2k} a_1^k} + \cdots + \frac{1}{n^{2k} a_n^k} \\ &\ge (n^{2k} + 1) \left( \frac{a_1^k}{(n^{2k} a_1^{2k})^{n^{2k}}} \right)^{\frac{1}{n^{2k}+1}} \\ &= (n^k + \frac{1}{n^k}) \left( \frac{1}{n a_1} \right)^{\frac{k(n^{2k}-1)}{n^{2k}+1}}. \end{aligned}

a2k+1a2k(nk+1nk)(1na2)k(n2k1)n2k+1,ank+1ank(nk+1nk)(1nan)k(n2k1)n2k+1 \begin{aligned} a_2^k + \frac{1}{a_2^k} &\ge (n^k + \frac{1}{n^k}) \left(\frac{1}{n a_2}\right)^{\frac{k(n^{2k}-1)}{n^{2k}+1}}, \\ \vdots & \\ a_n^k + \frac{1}{a_n^k} &\ge (n^k + \frac{1}{n^k}) \left(\frac{1}{n a_n}\right)^{\frac{k(n^{2k}-1)}{n^{2k}+1}} \end{aligned}

Similarly obtained

Multiplying the nn inequalities together, we get
(a1k+1a1k)(a2k+1a2k)(ank+1ank)(nk+1nk)n(1nna1an)k(n2k1)n2k \begin{aligned} & (a_1^k + \frac{1}{a_1^k})(a_2^k + \frac{1}{a_2^k})\cdots(a_n^k + \frac{1}{a_n^k}) \\ & \ge (n^k + \frac{1}{n^k})^n \left(\frac{1}{n^n a_1 \cdots a_n}\right)^{\frac{k(n^{2k}-1)}{n^{2k}}} \end{aligned}

Since ai>0,i=1,,n,i=1nai=1a_i > 0, i = 1, \dots, n, \sum_{i=1}^n a_i = 1, then
a1an(1ni=1nai)n=1nn, a_1 \cdots a_n \le \left( \frac{1}{n} \sum_{i=1}^n a_i \right)^n = \frac{1}{n^n},
then
1nna1an1. \frac{1}{n^n a_1 \cdots a_n} \ge 1.
Also, since
k(n2k1)n2k+1>0, therefore,  \frac{k(n^{2k} - 1)}{n^{2k} + 1} > 0, \text{ therefore, }
(1nna1an)k(n2k)n2k+11 \left(\frac{1}{n^n a_1 \cdots a_n}\right)^{\frac{k(n^{2k})}{n^{2k}+1}} \ge 1
Hence (a1k+1a1k)(a2k+1a2k)(ank+1ank)(nk+1nk)n(a_1^k + \frac{1}{a_1^k})(a_2^k + \frac{1}{a_2^k}) \cdots (a_n^k + \frac{1}{a_n^k}) \ge (n^k + \frac{1}{n^k})^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: MathNet, licensed CC-BY-4.0. Statement translated into English from zh; metadata (topic, difficulty) added by this project.