Olympiad Maths Prep

Track / Stage 6 / 322 of 400 #1322 of 2000

Problem 1322

National olympiad, first round
Algebra Difficulty 6.6 Prove it

Example 5.2.1 Let a1,a2,,ana_{1}, a_{2}, \cdots, a_{n} be positive real numbers, prove: a1+a2++anna1a2anna_{1}+a_{2}+\cdots+a_{n} \geq n \sqrt[n]{a_{1} a_{2} \cdots a_{n}}

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

Proof: Without loss of generality, assume a1a2an=1a_{1} a_{2} \cdots a_{n}=1 (normalization). Let a1=x1x2,a2=x2x3,,an1=xn1xna_{1}=\frac{x_{1}}{x_{2}}, a_{2}=\frac{x_{2}}{x_{3}}, \cdots, a_{n-1}=\frac{x_{n-1}}{x_{n}}, where x1,x2,,xn>0x_{1}, x_{2}, \cdots, x_{n}>0, then an=xnx1a_{n}=\frac{x_{n}}{x_{1}}. The inequality becomes
x1x2+x2x3++xn1xn+xnx1n\frac{x_{1}}{x_{2}}+\frac{x_{2}}{x_{3}}+\cdots+\frac{x_{n-1}}{x_{n}}+\frac{x_{n}}{x_{1}} \geq n

Notice that if the sequence (x1,x2,,xn)\left(x_{1}, x_{2}, \cdots, x_{n}\right) is increasing, then the sequence (1x1,1x2,,1xn)\left(\frac{1}{x_{1}}, \frac{1}{x_{2}}, \cdots, \frac{1}{x_{n}}\right) is decreasing. By the rearrangement inequality, we get
i=1nxixi+1=i=1nxi1xi+1i=1nxi1xi=n\sum_{i=1}^{n} \frac{x_{i}}{x_{i+1}}=\sum_{i=1}^{n} x_{i} \cdot \frac{1}{x_{i+1}} \geq \sum_{i=1}^{n} x_{i} \cdot \frac{1}{x_{i}}=n

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.