IMO 2012 · Problem 2

Let \(n \ge 3\) be an integer, and let \(a_2, a_3, \ldots, a_n\) be positive real numbers such that \(a_2a_3\cdots a_n=1\). Prove that \[ (1+a_2)^2(1+a_3)^3\cdots(1+a_n)^n>n^n. \]

Official text of the problem. Official problem paper (PDF)

Solution

For each \(k=2,3,\ldots,n\), apply the arithmetic–geometric mean inequality to the \(k\) positive numbers consisting of \(a_k\) and \(k-1\) copies of \(1/(k-1)\). This gives \[ \frac{1+a_k}{k} \ge \left(\frac{a_k}{(k-1)^{k-1}}\right)^{1/k}, \] and hence \[ (1+a_k)^k\ge \frac{k^k}{(k-1)^{k-1}}\,a_k. \] Multiplying these inequalities and using the given product condition, we obtain \[ \prod_{k=2}^{n}(1+a_k)^k \ge \left(\prod_{k=2}^{n}\frac{k^k}{(k-1)^{k-1}}\right) \left(\prod_{k=2}^{n}a_k\right) =n^n. \]

Since all factors are positive, equality here would require equality in every application of the arithmetic–geometric mean inequality. Thus it would require \[ a_k=\frac1{k-1}\qquad(k=2,\ldots,n). \] But then \[ a_2a_3\cdots a_n=\frac1{(n-1)!}<1 \] because \(n\ge3\), contradicting the hypothesis. Therefore the inequality is strict, as required.

The solution was checked against the official IMO shortlist solutions.