Maths Olympiad Prep

Library / /59 of 105

Algebra Difficulty 5.0 AIME Prove it United States

Problem:

Given nn positive real numbers a1,a2,,ana_{1}, a_{2}, \ldots, a_{n} such that a1a2an=1a_{1} a_{2} \cdots a_{n}=1, prove that
(1+a1)(1+a2)(1+an)2n \left(1+a_{1}\right)\left(1+a_{2}\right) \cdots\left(1+a_{n}\right) \geq 2^{n}
When does the equality hold?

Solution

Solution:

By the inequality a+b2aba+b \geq 2 \sqrt{a b} which holds for positive numbers a,ba, b (and equality is if and only if a=ba=b), we see that 1+a12a11+a_{1} \geq 2 \sqrt{a_{1}}, 1+a22a21+a_{2} \geq 2 \sqrt{a_{2}}, \ldots, 1+an2an1+a_{n} \geq 2 \sqrt{a_{n}}. Multiplying these inequalities we get
(1+a1)(1+an)2na1an=2n. \left(1+a_{1}\right) \cdots \left(1+a_{n}\right) \geq 2^{n} \sqrt{a_{1} \cdots a_{n}} = 2^{n}.
The equality holds if and only if a1=a2==an=1a_{1}=a_{2}=\cdots=a_{n}=1.

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