Maths Olympiad Prep

Library / /101 of 397

Algebra Difficulty 5.3 AIME, harder Prove it Taiwan

Let a1,a2,,ana_1, a_2, \dots, a_n be nonnegative real numbers such that for every positive integer 1kn1 \le k \le n,
a1a2ak1(2k)! a_1 a_2 \cdots a_k \ge \frac{1}{(2k)!}
Prove that:
a1+a2++an1n+1+1n+2++12n. a_1 + a_2 + \cdots + a_n \ge \frac{1}{n+1} + \frac{1}{n+2} + \cdots + \frac{1}{2n}.

Solution

We rewrite the left-hand side of the problem as follows:
a1+a2++an=(112)(12a1)+(1314)(34a2)++(12n112n)((2n1)2nan)=(11213+14)(12a1)+(131415+16)(12a1+34a2)++(12n112n)(12a1+34a2++(2n1)2nan). \begin{aligned} a_1 + a_2 + \cdots + a_n &= \left(1 - \frac{1}{2}\right)(1 \cdot 2a_1) + \left(\frac{1}{3} - \frac{1}{4}\right)(3 \cdot 4a_2) \\ &\quad + \cdots + \left(\frac{1}{2n-1} - \frac{1}{2n}\right)((2n-1) \cdot 2na_n) \\ &= \left(1 - \frac{1}{2} - \frac{1}{3} + \frac{1}{4}\right)(1 \cdot 2a_1) \\ &\quad + \left(\frac{1}{3} - \frac{1}{4} - \frac{1}{5} + \frac{1}{6}\right)(1 \cdot 2a_1 + 3 \cdot 4a_2) + \cdots \\ &\quad + \left(\frac{1}{2n-1} - \frac{1}{2n}\right)(1 \cdot 2a_1 + 3 \cdot 4a_2 + \cdots + (2n-1) \cdot 2na_n). \end{aligned}
By the AM-GM inequality and the condition of the problem, we have:
12a11, 12a1+34a22,, 12a1+34a2++(2n1)2nann. 1 \cdot 2a_1 \ge 1, \ 1 \cdot 2a_1 + 3 \cdot 4a_2 \ge 2, \cdots, \ 1 \cdot 2a_1 + 3 \cdot 4a_2 + \cdots + (2n-1)2na_n \ge n.
Hence
a1+a2++an(11213+14)+2(131415+16)++n(12n112n)=112+1314+1516++12n112n=1+12+13+14+15++12n1+12n2(12+14+16++12n)=1n+1+1n+2++12n. \begin{aligned} a_1 + a_2 + \cdots + a_n &\ge \left(1 - \frac{1}{2} - \frac{1}{3} + \frac{1}{4}\right) + 2\left(\frac{1}{3} - \frac{1}{4} - \frac{1}{5} + \frac{1}{6}\right) + \cdots \\ &\quad + n\left(\frac{1}{2n-1} - \frac{1}{2n}\right) \\ &= 1 - \frac{1}{2} + \frac{1}{3} - \frac{1}{4} + \frac{1}{5} - \frac{1}{6} + \cdots + \frac{1}{2n-1} - \frac{1}{2n} \\ &= 1 + \frac{1}{2} + \frac{1}{3} + \frac{1}{4} + \frac{1}{5} + \cdots + \frac{1}{2n-1} + \frac{1}{2n} \\ &\quad - 2\left(\frac{1}{2} + \frac{1}{4} + \frac{1}{6} + \cdots + \frac{1}{2n}\right) \\ &= \frac{1}{n+1} + \frac{1}{n+2} + \cdots + \frac{1}{2n}. \end{aligned}

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 the original; metadata (topic, difficulty) added by this project.