Our lecturer once showed us that it is possible to approximate the value of 'e' with Taylor's approximation of order - whatever, lets say 3. How would. The result was something like this:
$$ 2.700001234<e<2.7290001234$$
He showed us the approximation between two inequalities with a a certain degree of error. I know how to do the Taylor's polynomial of a function but not the error approximation thing. Can someone show me in a better example?
For a fixed $a$, if $f$ is $(n+1)$-times differentiable on $(a,x)$ and $f^{(n)}$ exists and is continuous on $[a,x]$, then $$ f(x) = \underbrace{\sum_{k=1}^n \frac{f^{(k)}(a)}{k!}(x-a)^k}_{:=T_n(x)}+ \underbrace{\frac{f^{(n+1)}(\xi)}{(n+1)!}(x-a)^{n+1}}_{:=R_n(x)} \text{ for some $\xi \in (a,x)$.} $$ $R_n$ is called the remainder, and this particular formula for it is called the lagrange form the remainder. If you know some bound for $f^{(n+1)}$ on $(a,x)$, i.e. if you know some $M_x$ such that $|f^{(n+1)}(\xi)| \leq M_x$ for $\xi \in (a,x)$, then you can bound the maximum approximation error with $$ |T_n(x) - f(x)| \leq |R_n(x)| \leq \frac{M_x}{(n+1)!}(x - a)^{n+1} \text{.} $$