Let $e_n$ be $(1+\frac{1}{n})^{\frac{1}{n}}$.
Let $E_n$ be $\sum_{k=0}^{n} \frac{1}{k!}$.
Suppose the convergence of $(e_n)$ and $(E_n)$ are established and let $e =lim_{n\to\infty}(e_n)$.
By Binomial Theorem,
$$e_n = 1+1+\frac{1}{2!}(1-\frac{1}{n})+\ldots+\frac{1}{n!}(1-\frac{1}{n})(1-\frac{2}{n})\ldots(1-\frac{n-1}{n})$$
Let $\epsilon >0$.
Since $e =lim_{n\to\infty}(e_n)$, there exists $N \in \mathbb{N}$ such that for each $n\ge N$, $|e_n-e| < \epsilon /2$. I was trying to show that there exists $N_2 \in \mathbb{N}$ such that $|E_n-e_n| < \epsilon /2$, but I failed.
How to prove that the two sequences converge to the same limit?