I thought it might be useful to present a way forward in which $x$ is any positive integer. To that end we proceed.
In THIS ANSWER, I showed using only Bernoulli's Inequality that $\left(1+\frac1n \right)^n$ is monotonically increasing for integer values of $n\ge 1$.
From the binomial theorem, we have for $n\ge 1$
$$\begin{align}
\left(1+\frac1n \right)^n&=1+1+\frac1{2!} \left(1-\frac1n\right)+\frac1{3!}\left(1-\frac1n\right)\left(1-\frac2{n}\right)+\cdots \frac1{n!}\left(1-\frac{n-1}{n}\right)\\\\
&\le \sum_{k=0}^n\frac1{k!}\\\\
&\le \sum_{k=0}^\infty\frac1{k!}\\\\
&= 1+1+\frac12+\frac16+\sum_{k=4}^\infty \frac{1}{k!}\\\\
&\le 2\frac23+\sum_{k=4}^\infty \frac{1}{2^k}\\\\
&=2\frac23+\frac18\\\\
&=2\frac{19}{24}\\\\
&<2.8
\end{align}$$
From the monotonicity, the lower bound is evidently $2$ (i.e., the term of interest is greater than its value at $n=1$). Putting it together reveals
$$2\le \left(1+\frac1n\right)^n<2.8$$
for integer values of $n\ge 1$.
Can this result be shown for positive integers without the use of limits? Is it through binomial theorem?
– P. N. Karthik Nov 12 '16 at 18:48