Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Show that: $\displaystyle\sum _{k=n}^{\infty } \frac{1}{k!}\leq \frac{2}{n!}$

I am clueless here, I tried to multiply both sides with $n!$, but it doesn't make things better. I know that the left one converges against $e$ for $n=0$, but I better don't want to use its numerical value.

share|cite|improve this question
It's not true for $n=0$ :-) – Robin Chapman Dec 2 '10 at 7:48
Indeed.. But I got the solution now (thanks to Derek) :) – Listing Dec 2 '10 at 12:35
up vote 7 down vote accepted

Hint: $$\frac{1}{(n+1)!} + \frac{1}{(n+2)!} + \cdots $$ $$= \frac{1}{n!} \left( \frac{1}{(n+1)} + \frac{1}{(n+1)(n+2)} + \cdots \right) $$ $$ < \frac{1}{n!} \times \text{some geometric series}$$

share|cite|improve this answer
Do you mean this? $\left( \frac{1}{(n+1)} + \frac{1}{(n+1)(n+2)} + \cdots \right)<\sum _{k=1}^{\infty } \frac{1}{(n+1)^k}=\frac{1}{n}$ – Listing Dec 1 '10 at 21:50
@user3123 Yes, sorry for the late reply, though no doubt you've sorted the problem now. – Derek Jennings Dec 2 '10 at 8:09

Estimate it using a geometric series.

share|cite|improve this answer
Which side of the term? – Listing Dec 1 '10 at 21:38
The left one =) – Jens Dec 1 '10 at 21:43

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.