How to prove this integer inequality?

68 Views Asked by At

Given $\alpha _{n}= 1+\frac{1}{1!}+...+\frac{1}{n!} ,\forall n\in \mathbb{N}$.

How would I prove the following statement?

$\alpha _{n}< 3$

1

There are 1 best solutions below

0
On

$2! \geq 2, 3! > 2^{2}, ...$ Can you finish?

[Use the fact that $ \sum\limits_{k=1}^{\infty} \frac 1 {2^{k}}=1$].