How can I prove that $\sum_{n=1}^\infty\frac{1}{n!}$ is limited this way $1 \le \sum_{n=1}^\infty\frac{1}{n!} \le 2$. I know that the lower bound is obvious because the sequence of the partial sums is monotone in a crescent way and the first term is $\frac{1}{1!}=1$, for the upper bound I think that maybe $\lim s_n = 2$ with $(s_n)$ being the sequence of partial sums of $\sum_{n=1}^\infty\frac{1}{n!}$, since this sequence is convergent by the Ratio Test, but how can I prove this?
Asked
Active
Viewed 184 times
2

Martin Sleziak
- 53,687

Rebeca Lie Yatsuzuka Silva
- 457
- 2
- 12
-
use the link https://en.wikipedia.org/wiki/Proof_that_e_is_irrational, also the sum is bounded above by $3$ not $2$ and is bounded below by $1$ – Jan 22 '20 at 18:58
-
1See e.g. Proving $\mathrm e <3$ – Minus One-Twelfth Jan 22 '20 at 19:00
-
1Which is larger. Your sum or 1+1/2+1/4+1/8+1/16+... ? – Thomas Jan 22 '20 at 19:00
-
NB: the limit of the partial sums is $lim S_n = e - 1$, where e is the Neper number. Just compare with the expansion of $e^x$, so your conjecture that the limit is $2$ does not look correct :) – Thomas Jan 22 '20 at 19:09
-
https://math.stackexchange.com/questions/254335/prove-that-5-2-e-3 – lab bhattacharjee Jan 22 '20 at 19:35
-
Does this answer your question? Proving $\mathrm e <3$ – Jam Jan 22 '20 at 19:43
1 Answers
5
Note that for $n\geq1$ we have that
$$2^{n-1}\leq n!$$
so
$$\frac{1}{2^{n-1}}\geq\frac{1}{n!}$$
and then
$$\sum_{n=0}^\infty\frac{1}{2^n}\geq\sum_{n=1}^\infty\frac{1}{n!}.$$

dxdydz
- 2,083