Study guide

3.2 Infinite Series and Convergence Tests

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.2 Infinite Series and Convergence Tests

Key Takeaways Explain This Topic AI

The divergence test ( a n ↛ 0 a_n \not\to 0 a n ​  → 0 ) is an asymmetric filter: a non-zero limit guarantees divergence, but a n → 0 a_n \to 0 a n ​ → 0 is never sufficient for convergence.

The Limit Comparison Test with benchmark p p p -series is the most efficient GRE tool for rational and algebraic terms, while the Ratio and Root tests dominate factorials and exponential powers.

The Alternating Series Test requires alternating signs, monotonic magnitude decrease ( ∣ a n + 1 ∣ ≤ ∣ a n ∣ |a_{n+1}| \le |a_n| ∣ a n + 1 ​ ∣ ≤ ∣ a n ​ ∣ ), and limit zero, with truncation error bounded by the first omitted term ( ∣ R N ∣ ≤ ∣ a N + 1 ∣ |R_N| \le |a_{N+1}| ∣ R N ​ ∣ ≤ ∣ a N + 1 ​ ∣ ).

Absolute convergence implies convergence and allows arbitrary rearrangement of terms, whereas Riemann's Rearrangement Theorem proves conditionally convergent series can be rearranged to sum to any real value or diverge.

Last updated: September 2026

3.2 Infinite Series and Convergence Tests

Infinite series questions on the GRE Mathematics Subject Test evaluate theoretical criteria (absolute vs. conditional convergence, rearrangements) and rapid execution of convergence tests and closed-form summations.

Partial Sums and the Divergence Test

An infinite series ∑ n = 1 ∞ a n \sum_{n=1}^\infty a_n ∑ n = 1 ∞ ​ a n ​ converges to sum S ∈ R S \in \mathbb{R} S ∈ R if its partial sums S N = ∑ n = 1 N a n S_N = \sum_{n=1}^N a_n S N ​ = ∑ n = 1 N ​ a n ​ satisfy lim ⁡ N → ∞ S N = S \lim_{N \to \infty} S_N = S lim N → ∞ ​ S N ​ = S . Otherwise, it diverges.

The Divergence Test ( n n n -th Term Test)

If lim ⁡ n → ∞ a n ≠ 0 \lim_{n \to \infty} a_n \ne 0 lim n → ∞ ​ a n ​  = 0 , or if the limit fails to exist, then ∑ a n \sum a_n ∑ a n ​ diverges.

Warning: lim ⁡ a n = 0 \lim a_n = 0 lim a n ​ = 0 does not imply convergence. The harmonic series ∑ 1 / n \sum 1/n ∑ 1/ n has 1 / n → 0 1/n \to 0 1/ n → 0 , yet diverges.

Geometric and Telescoping Series

When asked for the exact value of a series, look for geometric or telescoping structure:

Geometric Series: ∑ n = 0 ∞ a r n = a 1 − r \sum_{n=0}^\infty a r^n = \frac{a}{1 - r} ∑ n = 0 ∞ ​ a r n = 1 − r a ​ for ∣ r ∣ < 1 |r| < 1 ∣ r ∣ < 1 . Diverges for ∣ r ∣ ≥ 1 |r| \ge 1 ∣ r ∣ ≥ 1 .

Telescoping Series: Partial sums collapse via cancellation: S N = ∑ n = 1 N ( b n − b n + 1 ) = b 1 − b N + 1 ⟹ ∑ n = 1 ∞ ( b n − b n + 1 ) = b 1 − lim ⁡ N → ∞ b N + 1 S_N = \sum_{n=1}^N (b_n - b_{n+1}) = b_1 - b_{N+1} \implies \sum_{n=1}^\infty (b_n - b_{n+1}) = b_1 - \lim_{N \to \infty} b_{N+1} S N ​ = n = 1 ∑ N ​ ( b n ​ − b n + 1 ​ ) = b 1 ​ − b N + 1 ​ ⟹ n = 1 ∑ ∞ ​ ( b n ​ − b n + 1 ​ ) = b 1 ​ − N → ∞ lim ​ b N + 1 ​ Use partial fractions on rational expressions to expose cancellations.

Benchmark Series: p p p -Series and Cauchy Condensation

p p p -Series: ∑ n = 1 ∞ 1 n p \sum_{n=1}^\infty \frac{1}{n^p} ∑ n = 1 ∞ ​ n p 1 ​ converges if and only if p > 1 p > 1 p > 1 .

Logarithmic p p p -Series: ∑ n = 2 ∞ 1 n ( ln ⁡ n ) p \sum_{n=2}^\infty \frac{1}{n (\ln n)^p} ∑ n = 2 ∞ ​ n ( l n n ) p 1 ​ converges if and only if p > 1 p > 1 p > 1 (diverges for p ≤ 1 p \le 1 p ≤ 1 ).

Cauchy Condensation: For non-negative, non-increasing a n a_n a n ​ , ∑ a n \sum a_n ∑ a n ​ converges ⟺ ∑ 2 k a 2 k \iff \sum 2^k a_{2^k} ⟺ ∑ 2 k a 2 k ​ converges.

Comparison Tests for Non-Negative Series

Let a n , b n ≥ 0 a_n, b_n \ge 0 a n ​ , b n ​ ≥ 0 :

Direct Comparison Test (DCT):

If a n ≤ b n a_n \le b_n a n ​ ≤ b n ​ and ∑ b n \sum b_n ∑ b n ​ converges, then ∑ a n \sum a_n ∑ a n ​ converges.

If a n ≥ b n a_n \ge b_n a n ​ ≥ b n ​ and ∑ b n \sum b_n ∑ b n ​ diverges, then ∑ a n \sum a_n ∑ a n ​ diverges.

Limit Comparison Test (LCT): Compute L = lim ⁡ n → ∞ a n b n L = \lim_{n \to \infty} \frac{a_n}{b_n} L = lim n → ∞ ​ b n ​ a n ​ ​ .

If 0 < L < ∞ 0 < L < \infty 0 < L < ∞ : Both series converge or both diverge.

If L = 0 L = 0 L = 0 and ∑ b n \sum b_n ∑ b n ​ converges: ∑ a n \sum a_n ∑ a n ​ converges.

If L = ∞ L = \infty L = ∞ and ∑ b n \sum b_n ∑ b n ​ diverges: ∑ a n \sum a_n ∑ a n ​ diverges. GRE Strategy: For algebraic/rational expressions, drop lower-order terms to choose b n = n p num − p den b_n = n^{p_{\text{num}} - p_{\text{den}}} b n ​ = n p num ​ − p den ​ .

The Integral Test and Remainder Bounds

If f ( x ) f(x) f ( x ) is continuous, positive, and decreasing on [ 1 , ∞ ) [1, \infty) [ 1 , ∞ ) with f ( n ) = a n f(n) = a_n f ( n ) = a n ​ , then ∑ a n \sum a_n ∑ a n ​ and ∫ 1 ∞ f ( x ) d x \int_1^\infty f(x)\,dx ∫ 1 ∞ ​ f ( x ) d x either both converge or both diverge.

Remainder Estimate: The truncation remainder R N = S − S N R_N = S - S_N R N ​ = S − S N ​ satisfies: ∫ N + 1 ∞ f ( x ) d x ≤ R N ≤ ∫ N ∞ f ( x ) d x \int_{N+1}^\infty f(x)\,dx \le R_N \le \int_N^\infty f(x)\,dx ∫ N + 1 ∞ ​ f ( x ) d x ≤ R N ​ ≤ ∫ N ∞ ​ f ( x ) d x

Alternating Series Test (Leibniz) and Error Bounds

An alternating series ∑ n = 1 ∞ ( − 1 ) n − 1 b n \sum_{n=1}^\infty (-1)^{n-1} b_n ∑ n = 1 ∞ ​ ( − 1 ) n − 1 b n ​ with b n > 0 b_n > 0 b n ​ > 0 converges if:

b n + 1 ≤ b n b_{n+1} \le b_n b n + 1 ​ ≤ b n ​ for all n ≥ N n \ge N n ≥ N , and

lim ⁡ n → ∞ b n = 0 \lim_{n \to \infty} b_n = 0 lim n → ∞ ​ b n ​ = 0 .

Alternating Series Estimation Theorem

The error in truncating at N N N terms is bounded by the first neglected term: ∣ R N ∣ = ∣ S − S N ∣ ≤ b N + 1 |R_N| = |S - S_N| \le b_{N+1} ∣ R N ​ ∣ = ∣ S − S N ​ ∣ ≤ b N + 1 ​ . Furthermore, S S S lies between any two consecutive partial sums S N S_N S N ​ and S N + 1 S_{N+1} S N + 1 ​ .

Absolute vs. Conditional Convergence

∑ a n \sum a_n ∑ a n ​ is absolutely convergent if ∑ ∣ a n ∣ \sum |a_n| ∑ ∣ a n ​ ∣ converges.

∑ a n \sum a_n ∑ a n ​ is conditionally convergent if ∑ a n \sum a_n ∑ a n ​ converges, but ∑ ∣ a n ∣ \sum |a_n| ∑ ∣ a n ​ ∣ diverges.

Theorem: Absolute convergence implies convergence ( ∑ ∣ a n ∣ < ∞ ⟹ ∑ a n converges \sum |a_n| < \infty \implies \sum a_n \text{ converges} ∑ ∣ a n ​ ∣ < ∞ ⟹ ∑ a n ​ converges ).

Riemann Rearrangement Theorem: Absolutely convergent series converge to the same sum under all rearrangements; conditionally convergent series can be rearranged to sum to any real M ∈ [ − ∞ , ∞ ] M \in [-\infty, \infty] M ∈ [ − ∞ , ∞ ] .

Ratio and Root Tests

Let L = lim ⁡ n → ∞ ∣ a n + 1 a n ∣ L = \lim_{n \to \infty} \left|\frac{a_{n+1}}{a_n}\right| L = lim n → ∞ ​ ​ a n ​ a n + 1 ​ ​ ​ (Ratio) or L = lim sup ⁡ n → ∞ ∣ a n ∣ 1 / n L = \limsup_{n \to \infty} |a_n|^{1/n} L = lim sup n → ∞ ​ ∣ a n ​ ∣ 1/ n (Root):

If L < 1 L < 1 L < 1 : Series converges absolutely.

If L > 1 L > 1 L > 1 : Series diverges.

If L = 1 L = 1 L = 1 : Inconclusive (fails on all rational and p p p -series terms). Note: The Root Test is strictly stronger than or equivalent to the Ratio Test.

Summary Comparison Table: Convergence Tests

Test When to Use Convergence Condition Inconclusive Case

Divergence Test Initial check on any series lim ⁡ a n ≠ 0 ⟹ \lim a_n \ne 0 \implies lim a n ​  = 0 ⟹ Diverges lim ⁡ a n = 0 \lim a_n = 0 lim a n ​ = 0

Geometric Series Constant ratio r n r^n r n ∣ r ∣ < 1 ⟹ S = a 1 − r \vert r\vert< 1 \implies S = \frac{a}{1-r} ∣ r ∣ < 1 ⟹ S = 1 − r a ​ Boundary ∣ r ∣ = 1 \vert r\vert= 1 ∣ r ∣ = 1

p p p -Series Terms 1 / n p 1/n^p 1/ n p p > 1 ⟹ p > 1 \implies p > 1 ⟹ Converges None

Limit Comparison Rational/algebraic terms Compare with b n = 1 / n p b_n = 1/n^p b n ​ = 1/ n p L = 0 L = 0 L = 0 or ∞ \infty ∞ with divergent reference

Integral Test Integrable f ( x ) f(x) f ( x ) ∫ 1 ∞ f ( x ) d x < ∞ \int_1^\infty f(x)\,dx < \infty ∫ 1 ∞ ​ f ( x ) d x < ∞ Non-monotone terms

Alternating (Leibniz) Alternating signs ( − 1 ) n (-1)^n ( − 1 ) n b n + 1 ≤ b n b_{n+1} \le b_n b n + 1 ​ ≤ b n ​ and b n → 0 b_n \to 0 b n ​ → 0 Non-decreasing terms

Ratio / Root Test Factorials, c n c^n c n , powers L < 1 ⟹ L < 1 \implies L < 1 ⟹ Abs Conv; L > 1 ⟹ L > 1 \implies L > 1 ⟹ Div L = 1 L = 1 L = 1

Worked Problem: Evaluating a Telescoping Series

Problem: Evaluate ∑ n = 1 ∞ 2 n 2 + 2 n \sum_{n=1}^\infty \frac{2}{n^2 + 2n} ∑ n = 1 ∞ ​ n 2 + 2 n 2 ​ .

Solution:

Apply partial fractions: 2 n ( n + 2 ) = 1 n − 1 n + 2 \frac{2}{n(n+2)} = \frac{1}{n} - \frac{1}{n+2} n ( n + 2 ) 2 ​ = n 1 ​ − n + 2 1 ​ .

Write the N N N -th partial sum: S N = ∑ n = 1 N ( 1 n − 1 n + 2 ) = ( 1 − 1 3 ) + ( 1 2 − 1 4 ) + ⋯ + ( 1 N − 1 − 1 N + 1 ) + ( 1 N − 1 N + 2 ) S_N = \sum_{n=1}^N \left(\frac{1}{n} - \frac{1}{n+2}\right) = \left(1 - \frac{1}{3}\right) + \left(\frac{1}{2} - \frac{1}{4}\right) + \cdots + \left(\frac{1}{N-1} - \frac{1}{N+1}\right) + \left(\frac{1}{N} - \frac{1}{N+2}\right) S N ​ = n = 1 ∑ N ​ ( n 1 ​ − n + 2 1 ​ ) = ( 1 − 3 1 ​ ) + ( 2 1 ​ − 4 1 ​ ) + ⋯ + ( N − 1 1 ​ − N + 1 1 ​ ) + ( N 1 ​ − N + 2 1 ​ )

Internal terms cancel, leaving S N = 1 + 1 2 − 1 N + 1 − 1 N + 2 = 3 2 − 1 N + 1 − 1 N + 2 S_N = 1 + \frac{1}{2} - \frac{1}{N+1} - \frac{1}{N+2} = \frac{3}{2} - \frac{1}{N+1} - \frac{1}{N+2} S N ​ = 1 + 2 1 ​ − N + 1 1 ​ − N + 2 1 ​ = 2 3 ​ − N + 1 1 ​ − N + 2 1 ​ .

Taking N → ∞ N \to \infty N → ∞ : lim ⁡ N → ∞ S N = 3 2 \lim_{N \to \infty} S_N = \frac{3}{2} lim N → ∞ ​ S N ​ = 2 3 ​ .

GRE Exam Traps & Fast Test-Taking Strategies

Trap 1: Applying Ratio Test to rational series. Ratios of polynomials always yield L = 1 L = 1 L = 1 . Use Limit Comparison with a p p p -series immediately.

Trap 2: Ignoring monotonicity in Leibniz's test. Alternating signs with a n → 0 a_n \to 0 a n ​ → 0 is not enough; magnitudes must decrease monotonically. ∑ ( − 1 ) n n + ( − 1 ) n \sum \frac{(-1)^n}{\sqrt{n} + (-1)^n} ∑ n ​ + ( − 1 ) n ( − 1 ) n ​ diverges despite a n → 0 a_n \to 0 a n ​ → 0 .

Trap 3: Using alternating error bounds on positive series. The bound ∣ R N ∣ ≤ a N + 1 |R_N| \le a_{N+1} ∣ R N ​ ∣ ≤ a N + 1 ​ requires an alternating series. For positive series, use the Integral Test remainder bound.

Loading diagram... Infinite Series Convergence Testing Strategy