TITLE: e as sum of an infinite series
QUESTION [6 upvotes]: I read that $e = \sum_{i=0}^\infty$$ 1\over n!$. This isn't immediately obvious to me, and I can't find proof of this. Can somebody explain to me, how do I prove this from definition $e = \lim_{n\to \infty}$$ (1 + {1\over n})^n $, or point me to one?

REPLY [6 votes]: If you expand $\left(1+\frac1n\right)^n$, you get
$$\tag1 \sum_{k=0}^n{n\choose k}\frac1{n^k}=\sum_{k=0}^n\frac{n!}{(n-k)!n^k}\cdot\frac1{k!}$$
The factor $\frac{n!}{n^k(n-k)!}$ is $\le 1$ (the denominator is the numerator with some factors $n-i$ increased to $n$), hence the expression in $(1)$ is always $<\sum_{k=0}^\infty\frac1{k!}$, hence $\mathrm e\le\sum_{k=0}^\infty\frac1{k!}$.
On the other hand, For any given $k$, we have $\frac{n!}{(n-k)!n^k}\to1$ as $n\to\infty$. Hence for any $\epsilon>0$ and any $m\in\mathbb N$, we can pick $n$ so large that the first $m$ summands in $(1)$ exceed $\sum_{k=0}^m\frac{1-\epsilon}{k!}$. As all summands are positive, we conclude that $\left(1+\frac1n\right)^n>(1-\epsilon)\sum_{k=0}^m\frac1{k!} $, hence $(1-\epsilon)\sum_{k=0}^\infty\frac1{k!}\le\mathrm e$ for all $\epsilon>0$.

REPLY [4 votes]: Expand using Binomial theorem:
$$
\begin{align}
\lim_{N\rightarrow\infty}(1 + \frac{1}{N})^N &= \lim_{N\rightarrow\infty} \sum\limits_{n=0}^N {N \choose n} \left(\frac{1}{N}\right)^n \\
&= \lim_{N\rightarrow\infty} \sum\limits_{n=0}^N \frac{N!}{n! (N-n)! N^n} \\
&= \lim_{N\rightarrow\infty} \sum\limits_{n=0}^N \frac{N \times (N-1)\times (N-2) \times \cdots \times (N-n+1)}{n! N^n} \\
&= \lim_{N\rightarrow\infty} \sum\limits_{n=0}^N \frac{N^n}{n! N^n} \\
&=  \sum\limits_{n=0}^\infty \frac{1}{n!}
\end{align}
$$
EDIT: I like Hagen von Eitzen's explanation better than my own. Going from the 3rd to 4th line I said that each factor in the numerator approaches $N$ as $N \rightarrow \infty$ but glossed over the fact that $n$ gets summed to $N$, so that step is not as obvious as I made it out to be.