Question: Find a number N s.t $\forall x>0 $ and $ n\ge N: |\sum_{k=0}^n\frac {(-1)^kx^k}{k!}|<2$
Thoughts We used the remainder of the taylor series of $e^{-x}$, after some bounding we got stuck. Would love someone's help finishing up.
Question: Find a number N s.t $\forall x>0 $ and $ n\ge N: |\sum_{k=0}^n\frac {(-1)^kx^k}{k!}|<2$
Thoughts We used the remainder of the taylor series of $e^{-x}$, after some bounding we got stuck. Would love someone's help finishing up.
As Daniel Fischer said, it is impossible to choose $N$ independently of $x$. But after $x>0$ is fixed, we can find $N$ as follows: since $|e^{-x}|<1$, it suffices to bound the remainder $r_n(x)=\sum_{k=n+1}^\infty\frac {(-1)^kx^k}{k!}$ by $1$. The Lagrange form of remainder yields $$ |r_n(x)|\leq \frac{x^{n+1}}{(n+1)!}$$ According to Stirling, $$(n+1)!\ge \sqrt{2\pi}(n+1)^{n+3/2}e^{-n-1}$$ Thus, $$ |r_n(x)|\leq \left(\frac{ ex }{ n+1}\right)^{n+1} $$ and choosing $N=\lfloor ex\rfloor$ does the job.