Study guide
3.4 Taylor and Maclaurin Series with Error Bounds
GRE Subject Test: Mathematics Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Single-Variable Differential Calculus
1.1 Limits, Continuity, and Epsilon-Delta Definitions 1.2 Differentiation Rules, Implicit & Inverse Differentiation 1.3 Mean Value Theorem, Rolle's Theorem, and Function Extrema 1.4 L'Hôpital's Rule, Curve Sketching, and Optimization 1.5 Functions, Graphs, Transformations, and Inverses 1.6 Trigonometric Functions, Identities, and Equations 1.7 Coordinate Geometry, Lines, Circles, and Conics 1.8 Parametric and Polar Curves
2 Chapter 2: Single-Variable Integral Calculus
2.1 Riemann Sums and the Fundamental Theorem of Calculus 2.2 Advanced Integration Techniques 2.3 Geometric Applications: Areas, Volumes, and Arc Length 2.4 Improper Integrals and Convergence Criteria
3 Chapter 3: Sequences, Infinite Series & Power Series
3.1 Sequences, Monotonicity, and Limits 3.2 Infinite Series and Convergence Tests 3.3 Power Series, Radius and Interval of Convergence 3.4 Taylor and Maclaurin Series with Error Bounds
4 Chapter 4: Multivariable Differential Calculus
4.1 Multivariable Functions, Limits, and Partial Derivatives 4.2 Directional Derivatives, Gradients, and Tangent Planes 4.3 Multivariable Chain Rule and Implicit Differentiation 4.4 Multivariable Extrema, Hessian Matrix, and Lagrange Multipliers
5 Chapter 5: Multivariable Integration & Vector Calculus
5.1 Multiple Integrals in Cylindrical and Spherical Coordinates 5.2 Change of Variables and the Jacobian Determinant 5.3 Vector Fields, Line Integrals, and Green's Theorem 5.4 Surface Integrals, Stokes' Theorem, and the Divergence Theorem
6 Chapter 6: Ordinary Differential Equations
6.1 First-Order ODEs: Separable, Linear, and Exact Equations 6.2 Special First-Order ODEs: Homogeneous, Bernoulli, and Orthogonal Trajectories 6.3 Second-Order Linear Homogeneous ODEs with Constant Coefficients 6.4 Nonhomogeneous Linear ODEs: Undetermined Coefficients and Variation of Parameters
7 Chapter 7: Elementary Algebra & Number Theory
7.1 Elementary Algebra, Polynomials, Roots, and Factorization 7.2 Divisibility, Primes, and the Euclidean Algorithm 7.3 Modular Arithmetic, Chinese Remainder Theorem, and Euler's Totient
8 Chapter 8: Linear Algebra: Vector Spaces & Transformations
8.1 Vector Spaces, Subspaces, Span, and Linear Independence 8.2 Basis, Dimension, and Coordinate Representations 8.3 Linear Transformations, Kernel, Range, and the Rank-Nullity Theorem 8.4 Matrix Representations of Transformations and Change of Basis
9 Chapter 9: Linear Algebra: Matrices, Determinants & Spectral Theory
9.1 Systems of Linear Equations, Matrix Rank, and Row Reduction 9.2 Determinants, Matrix Inverses, and Cramer's Rule 9.3 Eigenvalues, Eigenvectors, and Diagonalization 9.4 Inner Product Spaces, Gram-Schmidt, and the Spectral Theorem
10 Chapter 10: Abstract Algebra: Groups, Rings & Fields
10.1 Groups, Subgroups, and Permutations 10.2 Cosets, Lagrange's Theorem, Normal Subgroups, and Homomorphisms 10.3 Rings, Ideals, Modules, Polynomial Rings, and Fields
11 Chapter 11: Introductory Real Analysis
11.1 The Real Field and Metric Space Topology 11.2 Compactness, Completeness, and Connectedness in R^n 11.3 Continuity, Uniform Continuity, and Value Theorems 11.4 Sequences and Series of Functions: Pointwise and Uniform Convergence
12 Chapter 12: Complex Analysis
12.1 Complex Numbers and Analytic Functions 12.2 Contour Integration and Cauchy's Theorems 12.3 Laurent Series, Singularities, and the Residue Theorem
13 Chapter 13: Topology, Geometry & Numerical Analysis
13.1 Topological Spaces, Open/Closed Sets, and Bases 13.2 Euclidean Geometry, Similarity, Circles, and Transformations 13.3 Numerical Analysis: Error, Root Finding, Interpolation, and Quadrature
14 Chapter 14: Probability, Statistics & Discrete Mathematics
14.1 Logic, Set Theory, Algorithms, and Combinatorics 14.2 Graph Theory: Trees, Cycles, Paths, and Planarity 14.3 Probability Spaces, Conditional Probability, and Bayes' Theorem 14.4 Random Variables, Expected Value, Variance, and Common Distributions
3.4 Taylor and Maclaurin Series with Error Bounds
Key Takeaways Explain This Topic AI
Computing high-order derivatives f ( k ) ( a ) f^{(k)}(a) f ( k ) ( a ) on the GRE is solved by equating coefficients with standard Maclaurin series ( f ( k ) ( a ) = k ! ⋅ c k f^{(k)}(a) = k! \cdot c_k f ( k ) ( a ) = k ! ⋅ c k ) rather than repeated differentiation.
Standard Maclaurin expansions for e x e^x e x , sin x \sin x sin x , cos x \cos x cos x , ( 1 − x ) − 1 (1-x)^{-1} ( 1 − x ) − 1 , ln ( 1 + x ) \ln(1+x) ln ( 1 + x ) , arctan x \arctan x arctan x , and ( 1 + x ) α (1+x)^\alpha ( 1 + x ) α 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 ) = f ( n + 1 ) ( c ) ( n + 1 ) ! ( x − a ) n + 1 R_n(x) = \frac{f^{(n+1)}(c)}{(n+1)!}(x-a)^{n+1} R n ( x ) = ( n + 1 )! f ( n + 1 ) ( c ) ( x − a ) n + 1 provides definitive error bounds by maximizing ∣ f ( n + 1 ) ( c ) ∣ |f^{(n+1)}(c)| ∣ f ( n + 1 ) ( c ) ∣ between a a a and x x x .
Last updated: September 2026
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 f f be infinitely differentiable ( C ∞ C^\infty C ∞ ) on an open interval containing a a a .
The Taylor series of f f f centered at a a a is: T ( x ) = ∑ n = 0 ∞ f ( n ) ( a ) n ! ( x − a ) n = f ( a ) + f ′ ( a ) ( x − a ) + f ′ ′ ( a ) 2 ! ( x − a ) 2 + ⋯ T(x) = \sum_{n=0}^\infty \frac{f^{(n)}(a)}{n!} (x - a)^n = f(a) + f'(a)(x-a) + \frac{f''(a)}{2!}(x-a)^2 + \cdots T ( x ) = n = 0 ∑ ∞ n ! f ( n ) ( a ) ( x − a ) n = f ( a ) + f ′ ( a ) ( x − a ) + 2 ! f ′′ ( a ) ( x − a ) 2 + ⋯
When centered at a = 0 a = 0 a = 0 , the series is the Maclaurin series : M ( x ) = ∑ n = 0 ∞ f ( n ) ( 0 ) n ! x n = f ( 0 ) + f ′ ( 0 ) x + f ′ ′ ( 0 ) 2 ! x 2 + ⋯ M(x) = \sum_{n=0}^\infty \frac{f^{(n)}(0)}{n!} x^n = f(0) + f'(0)x + \frac{f''(0)}{2!}x^2 + \cdots M ( x ) = n = 0 ∑ ∞ n ! f ( n ) ( 0 ) x n = f ( 0 ) + f ′ ( 0 ) x + 2 ! f ′′ ( 0 ) x 2 + ⋯
Smoothness vs. Analyticity
A function is smooth if it has derivatives of all orders ( C ∞ C^\infty C ∞ ). It is real analytic at a a a if its Taylor series converges to f ( x ) f(x) f ( x ) on an open neighborhood of a a a .
Counterexample: f ( x ) = e − 1 / x 2 f(x) = e^{-1/x^2} f ( x ) = e − 1/ x 2 for x ≠ 0 x \ne 0 x = 0 with f ( 0 ) = 0 f(0) = 0 f ( 0 ) = 0 is C ∞ C^\infty C ∞ on R \mathbb{R} R with f ( n ) ( 0 ) = 0 f^{(n)}(0) = 0 f ( n ) ( 0 ) = 0 for all n n n . Its Maclaurin series is identically zero, converging everywhere but equaling f ( x ) f(x) f ( x ) only at x = 0 x = 0 x = 0 .
Essential Maclaurin Expansions Reference Table
The following fundamental expansions must be memorized alongside their intervals of convergence:
Function f ( x ) f(x) f ( x ) Maclaurin Series Convergence Interval & Radius
1 1 − x \frac{1}{1 - x} 1 − x 1 ∑ n = 0 ∞ x n = 1 + x + x 2 + x 3 + ⋯ \sum_{n=0}^\infty x^n = 1 + x + x^2 + x^3 + \cdots ∑ n = 0 ∞ x n = 1 + x + x 2 + x 3 + ⋯ ∣ x ∣ < 1 \vert x\vert< 1 ∣ x ∣ < 1 , R = 1 R = 1 R = 1
e x e^x e x ∑ n = 0 ∞ x n n ! = 1 + x + x 2 2 ! + x 3 3 ! + ⋯ \sum_{n=0}^\infty \frac{x^n}{n!} = 1 + x + \frac{x^2}{2!} + \frac{x^3}{3!} + \cdots ∑ n = 0 ∞ n ! x n = 1 + x + 2 ! x 2 + 3 ! x 3 + ⋯ ( − ∞ , ∞ ) (-\infty, \infty) ( − ∞ , ∞ ) , R = ∞ R = \infty R = ∞
sin x \sin x sin x ∑ n = 0 ∞ ( − 1 ) n x 2 n + 1 ( 2 n + 1 ) ! = x − x 3 3 ! + x 5 5 ! − ⋯ \sum_{n=0}^\infty (-1)^n \frac{x^{2n+1}}{(2n+1)!} = x - \frac{x^3}{3!} + \frac{x^5}{5!} - \cdots ∑ n = 0 ∞ ( − 1 ) n ( 2 n + 1 )! x 2 n + 1 = x − 3 ! x 3 + 5 ! x 5 − ⋯ ( − ∞ , ∞ ) (-\infty, \infty) ( − ∞ , ∞ ) , R = ∞ R = \infty R = ∞
cos x \cos x cos x ∑ n = 0 ∞ ( − 1 ) n x 2 n ( 2 n ) ! = 1 − x 2 2 ! + x 4 4 ! − ⋯ \sum_{n=0}^\infty (-1)^n \frac{x^{2n}}{(2n)!} = 1 - \frac{x^2}{2!} + \frac{x^4}{4!} - \cdots ∑ n = 0 ∞ ( − 1 ) n ( 2 n )! x 2 n = 1 − 2 ! x 2 + 4 ! x 4 − ⋯ ( − ∞ , ∞ ) (-\infty, \infty) ( − ∞ , ∞ ) , R = ∞ R = \infty R = ∞
ln ( 1 + x ) \ln(1 + x) ln ( 1 + x ) ∑ n = 1 ∞ ( − 1 ) n − 1 x n n = x − x 2 2 + x 3 3 − ⋯ \sum_{n=1}^\infty (-1)^{n-1} \frac{x^n}{n} = x - \frac{x^2}{2} + \frac{x^3}{3} - \cdots ∑ n = 1 ∞ ( − 1 ) n − 1 n x n = x − 2 x 2 + 3 x 3 − ⋯ ( − 1 , 1 ] (-1, 1] ( − 1 , 1 ] , R = 1 R = 1 R = 1
arctan x \arctan x arctan x ∑ n = 0 ∞ ( − 1 ) n x 2 n + 1 2 n + 1 = x − x 3 3 + x 5 5 − ⋯ \sum_{n=0}^\infty (-1)^n \frac{x^{2n+1}}{2n+1} = x - \frac{x^3}{3} + \frac{x^5}{5} - \cdots ∑ n = 0 ∞ ( − 1 ) n 2 n + 1 x 2 n + 1 = x − 3 x 3 + 5 x 5 − ⋯ [ − 1 , 1 ] [-1, 1] [ − 1 , 1 ] , R = 1 R = 1 R = 1
( 1 + x ) α (1 + x)^\alpha ( 1 + x ) α 1 + ∑ k = 1 ∞ ( α k ) x k 1 + \sum_{k=1}^\infty \binom{\alpha}{k} x^k 1 + ∑ k = 1 ∞ ( k α ) x k , where ( α k ) = α ( α − 1 ) ⋯ ( α − k + 1 ) k ! \binom{\alpha}{k} = \frac{\alpha(\alpha-1)\cdots(\alpha-k+1)}{k!} ( k α ) = k ! α ( α − 1 ) ⋯ ( α − k + 1 ) ∣ x ∣ < 1 \vert x\vert< 1 ∣ x ∣ < 1 , R = 1 R = 1 R = 1
Fast Extraction of High-Order Derivatives
Because power series representations are unique, if f ( x ) = ∑ n = 0 ∞ c n ( x − a ) n f(x) = \sum_{n=0}^\infty c_n (x - a)^n f ( x ) = ∑ n = 0 ∞ c n ( x − a ) n , the coefficients are directly linked to the derivatives: c n = f ( n ) ( a ) n ! ⟺ f ( n ) ( a ) = n ! ⋅ c n c_n = \frac{f^{(n)}(a)}{n!} \iff f^{(n)}(a) = n! \cdot c_n c n = n ! f ( n ) ( a ) ⟺ f ( n ) ( a ) = n ! ⋅ c n
GRE Shortcut: To find f ( k ) ( 0 ) f^{(k)}(0) f ( k ) ( 0 ) for large k k k , never take repeated derivatives . Expand f ( x ) f(x) f ( x ) into its Maclaurin series by substitution, identify the coefficient c k c_k c k of x k x^k x k , and multiply by k ! k! k ! : f ( k ) ( 0 ) = k ! ⋅ c k f^{(k)}(0) = k! \cdot c_k f ( k ) ( 0 ) = k ! ⋅ c k .
Evaluating Indeterminate Limits via Series Expansions
For indeterminate forms lim x → 0 f ( x ) g ( x ) \lim_{x \to 0} \frac{f(x)}{g(x)} lim x → 0 g ( x ) f ( x ) of type 0 0 \frac{0}{0} 0 0 of order ≥ 2 \ge 2 ≥ 2 , repeated L'Hôpital applications invite algebraic sign errors. Substituting low-order series terms resolves the limit immediately: lim x → 0 x − sin x x 3 = lim x → 0 x − ( x − x 3 / 6 + O ( x 5 ) ) x 3 = 1 6 \lim_{x \to 0} \frac{x - \sin x}{x^3} = \lim_{x \to 0} \frac{x - (x - x^3/6 + O(x^5))}{x^3} = \frac{1}{6} x → 0 lim x 3 x − sin x = x → 0 lim x 3 x − ( x − x 3 /6 + O ( x 5 )) = 6 1
Operations on Power Series
Power series can be combined within their shared convergence domains:
Substitution: For f ( x ) = cos ( x 2 ) f(x) = \cos(x^2) f ( x ) = cos ( x 2 ) , substitute u = x 2 u = x^2 u = x 2 into cos u = 1 − u 2 / 2 + u 4 / 24 − ⋯ \cos u = 1 - u^2/2 + u^4/24 - \cdots cos u = 1 − u 2 /2 + u 4 /24 − ⋯ to obtain 1 − x 4 / 2 + x 8 / 24 − ⋯ 1 - x^4/2 + x^8/24 - \cdots 1 − x 4 /2 + x 8 /24 − ⋯ .
Cauchy Product: ( ∑ a n x n ) ( ∑ b n x n ) = ∑ c n x n \left(\sum a_n x^n\right)\left(\sum b_n x^n\right) = \sum c_n x^n ( ∑ a n x n ) ( ∑ b n x n ) = ∑ c n x n where c n = ∑ k = 0 n a k b n − k c_n = \sum_{k=0}^n a_k b_{n-k} c n = ∑ k = 0 n a k b n − k .
Taylor's Theorem and the Lagrange Form of the Remainder
Let f f f have n + 1 n+1 n + 1 continuous derivatives on an interval containing a a a and x x x . The n n n -th degree Taylor polynomial is P n ( x ) = ∑ k = 0 n f ( k ) ( a ) k ! ( x − a ) k P_n(x) = \sum_{k=0}^n \frac{f^{(k)}(a)}{k!}(x - a)^k P n ( x ) = ∑ k = 0 n k ! f ( k ) ( a ) ( x − a ) k , with remainder R n ( x ) = f ( x ) − P n ( x ) R_n(x) = f(x) - P_n(x) R n ( x ) = f ( x ) − P n ( x ) .
Lagrange Remainder Formula
There exists a point c c c strictly between a a a and x x x such that: R n ( x ) = f ( n + 1 ) ( c ) ( n + 1 ) ! ( x − a ) n + 1 R_n(x) = \frac{f^{(n+1)}(c)}{(n+1)!} (x - a)^{n+1} R n ( x ) = ( n + 1 )! f ( n + 1 ) ( c ) ( x − a ) n + 1
To bound error ∣ R n ( x ) ∣ ≤ ϵ |R_n(x)| \le \epsilon ∣ R n ( x ) ∣ ≤ ϵ , maximize ∣ f ( n + 1 ) ( c ) ∣ |f^{(n+1)}(c)| ∣ f ( n + 1 ) ( c ) ∣ over t ∈ [ a , x ] t \in [a, x] t ∈ [ a , x ] : ∣ R n ( x ) ∣ ≤ max t ∈ [ a , x ] ∣ f ( n + 1 ) ( t ) ∣ ( n + 1 ) ! ∣ x − a ∣ n + 1 |R_n(x)| \le \frac{\max_{t \in [a, x]} |f^{(n+1)}(t)|}{(n+1)!} |x - a|^{n+1} ∣ R n ( x ) ∣ ≤ ( n + 1 )! max t ∈ [ a , x ] ∣ f ( n + 1 ) ( t ) ∣ ∣ x − a ∣ n + 1
Summary Comparison Table: Taylor Remainder Forms
Remainder Form Formula Primary GRE Context
Lagrange Form R n ( x ) = f ( n + 1 ) ( c ) ( n + 1 ) ! ( x − a ) n + 1 , c ∈ ( a , x ) R_n(x) = \frac{f^{(n+1)}(c)}{(n+1)!}(x-a)^{n+1}, \quad c \in (a,x) R n ( x ) = ( n + 1 )! f ( n + 1 ) ( c ) ( x − a ) n + 1 , c ∈ ( a , x ) Numerical error bounds, decimal accuracy
Cauchy Form R n ( x ) = f ( n + 1 ) ( c ) n ! ( x − c ) n ( x − a ) , c ∈ ( a , x ) R_n(x) = \frac{f^{(n+1)}(c)}{n!}(x-c)^n(x-a), \quad c \in (a,x) R n ( x ) = n ! f ( n + 1 ) ( c ) ( x − c ) n ( x − a ) , c ∈ ( a , x ) Binomial series convergence proofs
Integral Form R n ( x ) = 1 n ! ∫ a x ( x − t ) n f ( n + 1 ) ( t ) d t R_n(x) = \frac{1}{n!} \int_a^x (x-t)^n f^{(n+1)}(t)\,dt R n ( x ) = n ! 1 ∫ a x ( x − t ) n f ( n + 1 ) ( t ) d t Asymptotic integration, theoretical proofs
Alternating Bound ∣ R n ( x ) ∣ ≤ ∣ a n + 1 ( x ) ∣ \vert R_n(x)\vert\le \vert a_{n+1}(x)\vert ∣ R n ( x ) ∣ ≤ ∣ a n + 1 ( x ) ∣ for alternating series Fast mental error checks when Leibniz applies
Worked Problem: Extracting High-Order Derivatives
Problem: Let f ( x ) = x 2 1 + 2 x 3 f(x) = \frac{x^2}{1 + 2x^3} f ( x ) = 1 + 2 x 3 x 2 . Find the exact value of f ( 11 ) ( 0 ) f^{(11)}(0) f ( 11 ) ( 0 ) .
Solution:
Expand f ( x ) f(x) f ( x ) using geometric series 1 1 − u = ∑ k = 0 ∞ u k \frac{1}{1-u} = \sum_{k=0}^\infty u^k 1 − u 1 = ∑ k = 0 ∞ u k with u = − 2 x 3 u = -2x^3 u = − 2 x 3 : f ( x ) = x 2 ∑ k = 0 ∞ ( − 2 x 3 ) k = ∑ k = 0 ∞ ( − 1 ) k 2 k x 3 k + 2 f(x) = x^2 \sum_{k=0}^\infty (-2x^3)^k = \sum_{k=0}^\infty (-1)^k 2^k x^{3k+2} f ( x ) = x 2 k = 0 ∑ ∞ ( − 2 x 3 ) k = k = 0 ∑ ∞ ( − 1 ) k 2 k x 3 k + 2
Set exponent to 11: 3 k + 2 = 11 ⟹ 3 k = 9 ⟹ k = 3 3k + 2 = 11 \implies 3k = 9 \implies k = 3 3 k + 2 = 11 ⟹ 3 k = 9 ⟹ k = 3 .
The coefficient of x 11 x^{11} x 11 is c 11 = ( − 1 ) 3 2 3 = − 8 c_{11} = (-1)^3 2^3 = -8 c 11 = ( − 1 ) 3 2 3 = − 8 .
Since c 11 = f ( 11 ) ( 0 ) 11 ! c_{11} = \frac{f^{(11)}(0)}{11!} c 11 = 11 ! f ( 11 ) ( 0 ) , we obtain f ( 11 ) ( 0 ) = 11 ! ⋅ c 11 = − 8 ⋅ 11 ! f^{(11)}(0) = 11! \cdot c_{11} = -8 \cdot 11! f ( 11 ) ( 0 ) = 11 ! ⋅ c 11 = − 8 ⋅ 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 ) f^{(12)}(0) f ( 12 ) ( 0 ) , taking derivatives directly is a trap. Expand into a Maclaurin series and extract c 12 ⋅ 12 ! c_{12} \cdot 12! c 12 ⋅ 12 ! .
Trap 2: Forgetting ( n + 1 ) ! (n+1)! ( n + 1 )! in the Lagrange denominator. The remainder after degree n n n uses ( n + 1 ) ! (n+1)! ( n + 1 )! and the ( n + 1 ) (n+1) ( n + 1 ) -th derivative, not n ! n! n ! .
Trap 3: Overlooking even/odd function remainder improvements. For cos x \cos x cos x , P 2 ( x ) = P 3 ( x ) P_2(x) = P_3(x) P 2 ( x ) = P 3 ( x ) because the x 3 x^3 x 3 coefficient is 0. You can bound the remainder using n = 3 n = 3 n = 3 (with 4th derivative and 4 ! 4! 4 ! ) to achieve a much tighter error bound.