3.4 Taylor and Maclaurin Series with Error Bounds
Key Takeaways
- Computing high-order derivatives $f^{(k)}(a)$ on the GRE is solved by equating coefficients with standard Maclaurin series ($f^{(k)}(a) = k! \cdot c_k$) rather than repeated differentiation.
- Standard Maclaurin expansions for $e^x$, $\sin x$, $\cos x$, $(1-x)^{-1}$, $\ln(1+x)$, $\arctan x$, and $(1+x)^\alpha$ must be memorized with their intervals of convergence.
- Indeterminate limits of high order are evaluated faster and with fewer sign errors via Taylor series expansion than through multiple rounds of L'Hôpital's rule.
- Taylor's Theorem with the Lagrange remainder $R_n(x) = \frac{f^{(n+1)}(c)}{(n+1)!}(x-a)^{n+1}$ provides definitive error bounds by maximizing $|f^{(n+1)}(c)|$ between $a$ and $x$.
3.4 Taylor and Maclaurin Series with Error Bounds
Taylor and Maclaurin expansions are among the highest-yield problem-solving tools on the GRE Mathematics Subject Test. The examination rewards candidates who recognize that Taylor expansions convert complex transcendental functions into elementary polynomial algebra to evaluate high-order derivatives, resolve indeterminate limits, and compute rigorous error bounds.
Taylor and Maclaurin Series Definitions and Analyticity
Let $f$ be infinitely differentiable ($C^\infty$) on an open interval containing $a$.
- The Taylor series of $f$ centered at $a$ is:
- When centered at $a = 0$, the series is the Maclaurin series:
Smoothness vs. Analyticity
A function is smooth if it has derivatives of all orders ($C^\infty$). It is real analytic at $a$ if its Taylor series converges to $f(x)$ on an open neighborhood of $a$.
- Counterexample: $f(x) = e^{-1/x^2}$ for $x \ne 0$ with $f(0) = 0$ is $C^\infty$ on $\mathbb{R}$ with $f^{(n)}(0) = 0$ for all $n$. Its Maclaurin series is identically zero, converging everywhere but equaling $f(x)$ only at $x = 0$.
Essential Maclaurin Expansions Reference Table
The following fundamental expansions must be memorized alongside their intervals of convergence:
| Function $f(x)$ | Maclaurin Series | Convergence Interval & Radius |
|---|---|---|
| $\frac{1}{1 - x}$ | $\sum_{n=0}^\infty x^n = 1 + x + x^2 + x^3 + \cdots$ | $ |
| $e^x$ | $\sum_{n=0}^\infty \frac{x^n}{n!} = 1 + x + \frac{x^2}{2!} + \frac{x^3}{3!} + \cdots$ | $(-\infty, \infty)$, $R = \infty$ |
| $\sin x$ | $\sum_{n=0}^\infty (-1)^n \frac{x^{2n+1}}{(2n+1)!} = x - \frac{x^3}{3!} + \frac{x^5}{5!} - \cdots$ | $(-\infty, \infty)$, $R = \infty$ |
| $\cos x$ | $\sum_{n=0}^\infty (-1)^n \frac{x^{2n}}{(2n)!} = 1 - \frac{x^2}{2!} + \frac{x^4}{4!} - \cdots$ | $(-\infty, \infty)$, $R = \infty$ |
| $\ln(1 + x)$ | $\sum_{n=1}^\infty (-1)^{n-1} \frac{x^n}{n} = x - \frac{x^2}{2} + \frac{x^3}{3} - \cdots$ | $(-1, 1]$, $R = 1$ |
| $\arctan x$ | $\sum_{n=0}^\infty (-1)^n \frac{x^{2n+1}}{2n+1} = x - \frac{x^3}{3} + \frac{x^5}{5} - \cdots$ | $[-1, 1]$, $R = 1$ |
| $(1 + x)^\alpha$ | $1 + \sum_{k=1}^\infty \binom{\alpha}{k} x^k$, where $\binom{\alpha}{k} = \frac{\alpha(\alpha-1)\cdots(\alpha-k+1)}{k!}$ | $ |
Fast Extraction of High-Order Derivatives
Because power series representations are unique, if $f(x) = \sum_{n=0}^\infty c_n (x - a)^n$, the coefficients are directly linked to the derivatives:
- GRE Shortcut: To find $f^{(k)}(0)$ for large $k$, never take repeated derivatives. Expand $f(x)$ into its Maclaurin series by substitution, identify the coefficient $c_k$ of $x^k$, and multiply by $k!$: $f^{(k)}(0) = k! \cdot c_k$.
Evaluating Indeterminate Limits via Series Expansions
For indeterminate forms $\lim_{x \to 0} \frac{f(x)}{g(x)}$ of type $\frac{0}{0}$ of order $\ge 2$, repeated L'Hôpital applications invite algebraic sign errors. Substituting low-order series terms resolves the limit immediately:
Operations on Power Series
Power series can be combined within their shared convergence domains:
- Substitution: For $f(x) = \cos(x^2)$, substitute $u = x^2$ into $\cos u = 1 - u^2/2 + u^4/24 - \cdots$ to obtain $1 - x^4/2 + x^8/24 - \cdots$.
- Cauchy Product: $\left(\sum a_n x^n\right)\left(\sum b_n x^n\right) = \sum c_n x^n$ where $c_n = \sum_{k=0}^n a_k b_{n-k}$.
Taylor's Theorem and the Lagrange Form of the Remainder
Let $f$ have $n+1$ continuous derivatives on an interval containing $a$ and $x$. The $n$-th degree Taylor polynomial is $P_n(x) = \sum_{k=0}^n \frac{f^{(k)}(a)}{k!}(x - a)^k$, with remainder $R_n(x) = f(x) - P_n(x)$.
Lagrange Remainder Formula
There exists a point $c$ strictly between $a$ and $x$ such that: To bound error $|R_n(x)| \le \epsilon$, maximize $|f^{(n+1)}(c)|$ over $t \in [a, x]$:
Summary Comparison Table: Taylor Remainder Forms
| Remainder Form | Formula | Primary GRE Context |
|---|---|---|
| Lagrange Form | $R_n(x) = \frac{f^{(n+1)}(c)}{(n+1)!}(x-a)^{n+1}, \quad c \in (a,x)$ | Numerical error bounds, decimal accuracy |
| Cauchy Form | $R_n(x) = \frac{f^{(n+1)}(c)}{n!}(x-c)^n(x-a), \quad c \in (a,x)$ | Binomial series convergence proofs |
| Integral Form | $R_n(x) = \frac{1}{n!} \int_a^x (x-t)^n f^{(n+1)}(t),dt$ | Asymptotic integration, theoretical proofs |
| Alternating Bound | $ | R_n(x) |
Worked Problem: Extracting High-Order Derivatives
Problem: Let $f(x) = \frac{x^2}{1 + 2x^3}$. Find the exact value of $f^{(11)}(0)$.
Solution:
- Expand $f(x)$ using geometric series $\frac{1}{1-u} = \sum_{k=0}^\infty u^k$ with $u = -2x^3$:
- Set exponent to 11: $3k + 2 = 11 \implies 3k = 9 \implies k = 3$.
- The coefficient of $x^{11}$ is $c_{11} = (-1)^3 2^3 = -8$.
- Since $c_{11} = \frac{f^{(11)}(0)}{11!}$, we obtain $f^{(11)}(0) = 11! \cdot c_{11} = -8 \cdot 11!$.
GRE Exam Traps & Fast Test-Taking Strategies
- Trap 1: Evaluating high derivatives by brute force. If an exam problem asks for $f^{(12)}(0)$, taking derivatives directly is a trap. Expand into a Maclaurin series and extract $c_{12} \cdot 12!$.
- Trap 2: Forgetting $(n+1)!$ in the Lagrange denominator. The remainder after degree $n$ uses $(n+1)!$ and the $(n+1)$-th derivative, not $n!$.
- Trap 3: Overlooking even/odd function remainder improvements. For $\cos x$, $P_2(x) = P_3(x)$ because the $x^3$ coefficient is 0. You can bound the remainder using $n = 3$ (with 4th derivative and $4!$) to achieve a much tighter error bound.
Let $f(x) = \frac{1}{1 + x^4}$. What is the value of the 16th derivative of $f$ evaluated at zero, $f^{(16)}(0)$?
What is the limit $\lim_{x \to 0} \frac{\cos(x^2) - 1 + \frac{1}{2}x^4}{x^8}$?
Using the second-degree Taylor polynomial $P_2(x)$ for $f(x) = e^x$ centered at $a = 0$ to approximate $e^{0.1}$, which of the following is the upper bound for the approximation error $|e^{0.1} - P_2(0.1)|$ given by the Lagrange error formula, using the upper bound $e < 3$?