Updated 02 Oct 2026
expresses a function's value near a point as an infinite sum of derivative terms: f(x0+h)=∑k=0nf(k)(x0)k!hk+Rn(h)f(x_0+h) = \sum_{k=0}^{n} \dfrac{f^{(k)}(x_0)}{k!}h^k + R_n(h)
Rn(h)=f(n+1)(ξ)(n+1)!hn+1R_n(h) = \dfrac{f^{(n+1)}(\xi)}{(n+1)!}h^{n+1} for some ξ\xi between x0x_0 and x0+hx_0+h
Pn(x)=∑k=0nf(k)(a)(x−a)k/k!P_n(x)=\sum_{k=0}^{n}f^{(k)}(a)(x-a)^k/k! has degree at most nn and contains n+1n+1 indexed terms.
a Maclaurin expansion uses a=0a=0.
Under the required differentiability assumptions, Rn(x)=f(n+1)(ξ)(x−a)n+1/(n+1)!R_n(x)=f^{(n+1)}(\xi)(x-a)^{n+1}/(n+1)! for an intermediate ξ\xi.
An error bound follows by bounding the derivative: ∣Rn(x)∣≤M∣x−a∣n+1/(n+1)!|R_n(x)|\le M|x-a|^{n+1}/(n+1)!.
An infinite Taylor series represents the function only where the remainder tends to zero; smoothness alone is insufficient.
exponential terms can be generated using tk+1=tkx/(k+1)t_{k+1}=t_kx/(k+1).
for sine, tk+1=−tkx2/[(2k+2)(2k+3)]t_{k+1}=-t_kx^2/[(2k+2)(2k+3)].
argument reduction can avoid adding large alternating terms when evaluating trigonometric functions.
for e2e^2, degree 1616 is enough for fractional relative error below 10−1010^{-10}.
a threshold of 10−1010^{-10}% is stricter: degree 1818 is needed. These are different criteria, explaining the report/website distinction.
for sin(1)\sin(1), terms indexed k=0,…,5k=0,\ldots,5 give degree 1111 and relative error about 1.90×10−101.90\times10^{-10}.
P4(0.5)=1.6484375P_4(0.5) = 1.6484375; true value e0.5=1.64872127e^{0.5} = 1.64872127; actual error ≈2.84×10−4\approx 2.84 \times 10^{-4}
Lagrange bound: ∣R4(0.5)∣≤7.8125×10−4|R_4(0.5)| \leq 7.8125 \times 10^{-4} — the actual error falls safely within the bound
a polynomial of degree nn, Taylor-expanded to order nn, is represented exactly — the remainder RnR_n is identically zero
the Maclaurin series of f(x)=11−xf(x) = \dfrac{1}{1-x} is exactly the geometric series ∑k=0∞xk\sum_{k=0}^{\infty}x^k for ∣x∣<1|x|<1
Truncation Error
◌ Explore connections in Graph view
COLLECTIONS