# Does $(x_1 + \cdots +x_n)^n \geq n(x_1 \cdots x_n)^{1/n}$ hold true for positive $x_i$? [closed]

Suppose $x_1, \cdots, x_n$ are strictly positive real numbers. Then

$(x_1 + \cdots +x_n)^n \geq n(x_1 \cdots x_n)^{1/n}$

Is this statement true? If not, can you provide a counter example?

• I think the statement is FALSE.. Commented Jul 22, 2015 at 15:06
• Take, $x_1=1,x_2=2$. Then $\sqrt 3>2\sqrt 2$ , which is absurd. Commented Jul 22, 2015 at 15:07
• It is false as the counter examples peole gave you prove. But the inequality $x_1+\cdots+x_n\ge n(x_1\cdots x_n)^\frac{1}{n}$ is correct. It's the AM-GM inequality (Inequality of arithmetic and geometric means). Commented Jul 22, 2015 at 15:10

Just consider e.g. $n=2$ and $x_1 = x_2 = \frac{1}{4}$.

Note that the AM-GM inequality is of a very similar form; it states that

$$x_1+\ldots+x_n \geq n (x_1 \cdots x_n)^{\frac{1}{n}}.$$

This means in particular that the inequality from the OP holds true whenever $x_1+\ldots+x_n \geq 1$.

Put $x_1=x_2=\cdots=x_n=x$. The inequality becomes $(nx)^{n-1}\ge1$, which is not generally true.

It's true, when $x_1+\cdots+x_n>1$, because in that case, it follows from what is known as the Inequality of arithmetic and geometric means, which states that

$$x_1 + \cdots +x_n \geq n(x_1 \cdots x_n)^{1/n},$$

and when $\sum x_i > 1$, you have $(x_1 + \cdots +x_n)^n \geq x_1 + \cdots +x_n$.