The Lagrange Error Bound

A Taylor polynomial gives an estimate. The Lagrange error bound says how far off that estimate can be, using only a bound on one more derivative.

The bound

The right side looks like the next term of the Taylor polynomial, with f(n+1)(a)f^{(n+1)}(a) replaced by MM. The error itself equals that next-term form evaluated at some unknown zz between aa and xx. Since zz is unknown, MM has to cover every possible zz, so take the largest value of ∣f(n+1)∣|f^{(n+1)}| on the interval, or any number above it.
Here the bound is close to the actual error. It can be much larger for other functions, and that's expected, since it has to hold whichever zz the error comes from.

When the alternating series bound applies

Sometimes the terms of a Taylor polynomial, evaluated at a particular xx, are the first terms of a convergent alternating series whose sum is f(x)f(x). If that series passes the alternating series test, the error is at most the first term left out. This is often easier than finding MM.
A Maclaurin series continues a Maclaurin polynomial forever. Its coefficients are g(n)(0)n!\frac{g^{(n)}(0)}{n!}, so its first n+1n + 1 terms are PnP_n. In the next example the series and where it converges are given.