# What is the minimum value of $(1 + a_1)(1 + a_2). . .(1 + a_n)$?

Suppose $a_1, a_2,\dots , a_n$ are $n$ positive real numbers with $a_1a_2 \dots a_n = 1$. Then what is the minimum value of $(1 + a_1)(1 + a_2). . .(1 + a_n)$ ?

I think $(1 + a_1)(1 + a_2). . .(1 + a_n)$ takes its minimum value when $a_1=a_2=\dots=a_n=1$ and thus the minimum value is $2^n$.

• Also follows from this result: math.stackexchange.com/questions/29357/…
– user940
Nov 1, 2013 at 3:31
• Dec 31, 2016 at 15:32

No need for calculus here; by AM-GM we have $1+a_1\ge2\sqrt{a_1},\ldots, 1+a_{n}\ge 2\sqrt{a_n}$ and multiplying them yields $$\prod_{1\le i\le n} (1+a_i)\ge 2^{n}\sqrt{a_1a_2\cdots a_n}=2^n,$$ with equality when $a_1=\cdots = a_n = 1$. In general if $a_1a_2\cdots a_k = M$ for some positive real $M$, then we can give a lower bound on the minimum value, which is similarly computed to be $2^n\cdot \sqrt{M}$, with equality at $a_1=\cdots = a_n = \sqrt[n]{M}$. The absolute minimum, as discussed below, is $(1+\sqrt[n]{M})^n$.

• Many many thanks, Sir/Mam! Nov 1, 2013 at 2:25
• Sir/Mam, many thanks for so quick response. Will you just please answer how $(1+\sqrt[n]{M})^n=2^n\sqrt M$ ? Nov 1, 2013 at 5:40
• I asked here, and got that $(1+\sqrt[n]{M})^n\neq2^n\sqrt M$. Will you please explain your last sentences more so that I can get it? Nov 1, 2013 at 6:05
• I'm just plugging the value of $a_1a_2\cdots a_k=M$ into the RHS of the inequality... Nov 1, 2013 at 6:06
• Sure but mentioning "the minimum value" leads one to believe that $2^n\sqrt{M}$ is the minimum value of the LHS--which it is not except when $M=1$.
– Did
Nov 1, 2013 at 9:05

Use the fact that $$1+a_k \geq 2\sqrt{a_k}$$ to conclude what you want.

accepted answer is true only for the case $~a_{1}a_{2}\cdots a_{n}=1$.
for example, if $a_{1}a_{2}\cdots a_{n}=10$, it doesn't work any more.

Huygens inequality : $(1+a_{1})(1+a_{2})\cdots(1+a_{n})\geq (1+\sqrt[n]{a_{1}a_{2}\cdots a_{n}})^{n}$

by Huygens inequality, the minimum value is $2^{n}$

• Why cite obscure results? My answer works perfectly fine... in the case that $a_1\cdots a_n = 10$, the maximum value is just $2^n\sqrt{10}$, with equality at $a_1=\cdots = a_n = \sqrt[n]{10}$. Nov 1, 2013 at 2:58
• you used AM-GM and watch the equality condition. Nov 1, 2013 at 4:36
• @tc1729, will you please explain more why your ans. holds even for $a_1\cdots a_n = 10$ (by editing your answer)? and shouldn't it be minimum value (the $2^n\sqrt{10}$) Nov 1, 2013 at 5:28

Let $A=\prod_{k=1}^n (1+a_k)$. (A isn't a constant value)

Just use the fact that you can pair up each term of A so that one term of the pair is a reciprocal of the another. For example, there is such a pair consisting of $x$ and $y$. Since $\prod^{n}_{k=1}a_k=1$, $xy=1$. Using this fact and AM-GM inequality, it can be obtained that:

$A=(1^n+\prod^{n}_{k=1}a_k)+(x+y)+(...)+(...)...$ (Such pairs are summed up within the parenthesis)

Since $x+y\ge2 \sqrt{1}$, $A\ge2 \times$(the number of the parenthesis)

Since the number of terms of A is ${2^n}$, $A\ge2 \times 2^{n-1}=2^n$