TITLE: Prove or disprove that $ 1 < \frac {x_1 + x_2 +... + x_n}{n} \leq 2 $ .
QUESTION [8 upvotes]: For $n \geq 2$, prove or disprove that $1 < \frac {x_1 + x_2 +... + x_n}{n} \leq 2$ ,
for all natural numbers $x_1,x_2,...,x_n$ statisfying
$${\sum \limits_{j=1}^{n}{x_j}} = {\prod \limits_{j=1}^{n}{x_j}}.$$

EDIT : As per the request of @yurnero, I hereby explicitly state that the "natural numbers" mentioned in the question mean the positive non-fraction numbers excluding $0$.
My attempt :
Let ${\sum \limits_{j=1}^{n}{x_j}}={\prod \limits_{j=1}^{n}{x_j}}=\lambda$.
Applying AM-GM on the set {$x_1,x_2,...,x_n$} :
$$\frac {\lambda}{n} \geq {\lambda}^{\frac {1}{n}}$$
$$\frac {{\lambda}^n}{n^n} \geq {\lambda}$$
$${\lambda ^{n-1}} \geq n^{n-1} . n$$
$$\lambda \geq n . n^{\frac {1}{n-1}}$$
$$\frac {\lambda}{n} \geq n^{\frac {1}{n-1}}$$
Is this approach correct? If yes, then is there any alternate way of "solving" this problem ? How to solve for the other bound/limit ?

REPLY [4 votes]: If $x_1+x_2+\cdot+x_n=x_1x_2\cdots x_n$ with $n\ge2$, it's easy to see that at least two of the $x_i$'s must be greater than $1$.  Suppose we reorder things so that $x_i=2+u_i$ with $u_i\ge0$ for $1\le i\le k$ and $x_i=1$ for $k+1\le i\le n$.  If we now let 
$$P=(2+u_1)(2+u_2)\cdots(2+u_k)\quad\text{and}\quad S=(2+u_1)+(2+u_2)+\cdots+(2+u_k)$$
then we have $P=S+1+1+\cdots+1$ with $n-k$ $1$'s, from which we see that $n=k+P-S$, and the inequalities to prove become
$$1\le{P\over k+P-S}\le2$$
or
$$k\le S\quad\text{and}\quad 2(S-k)\le P$$
The first of these is clearly true, since $S=(2+u_1)+(2+u_2)+\cdots+(2+u_k)\ge2+2+\cdots+2=2k$.  The second requires our initial observation that $k\ge2$:
$$\begin{align}
2(S-k)
&=2k+2(u_1+u_2+\cdots+u_k)\\
&\le2^k+2^{k-1}(u_1+u_2+\cdots+u_k)\\
&\le(2+u_1)(2+u_2)\cdots(2+u_k)\\
&=P
\end{align}$$