Study guide
3.3 Power Series, Radius and Interval of Convergence
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.3 Power Series, Radius and Interval of Convergence
Key Takeaways Explain This Topic AI
A power series centered at c c c converges absolutely for ∣ x − c ∣ < R |x-c| < R ∣ x − c ∣ < R and diverges for ∣ x − c ∣ > R |x-c| > R ∣ x − c ∣ > R , with radius given by Cauchy-Hadamard ( 1 / R = lim sup ∣ c n ∣ 1 / n 1/R = \limsup |c_n|^{1/n} 1/ R = lim sup ∣ c n ∣ 1/ n ) or the ratio limit.
Term-by-term differentiation and integration preserve the exact radius of convergence R R R , though endpoint convergence can change and must be analyzed separately.
When power series arguments are transformed as ∑ c n ( a x − b ) k \sum c_n (a x - b)^k ∑ c n ( a x − b ) k , solve ∣ a x − b ∣ k < R base |ax - b|^k < R_{\text{base}} ∣ a x − b ∣ k < R base to obtain the adjusted center, radius, and endpoints.
Abel's Theorem establishes boundary continuity: if a power series converges at an endpoint c ± R c \pm R c ± R , the function value extends continuously to that endpoint.
Last updated: September 2026
3.3 Power Series, Radius and Interval of Convergence
Power series link discrete series to continuous analytic functions. On the GRE Mathematics Subject Test, questions test your ability to determine the exact radius and interval of convergence, analyze endpoint behavior, and differentiate or integrate series to evaluate numerical sums.
Power Series Foundations and Convergence Trichotomy
A power series centered at c c c has the form: ∑ n = 0 ∞ c n ( x − c ) n = c 0 + c 1 ( x − c ) + c 2 ( x − c ) 2 + ⋯ \sum_{n=0}^\infty c_n (x - c)^n = c_0 + c_1(x - c) + c_2(x - c)^2 + \cdots n = 0 ∑ ∞ c n ( x − c ) n = c 0 + c 1 ( x − c ) + c 2 ( x − c ) 2 + ⋯
where c n ∈ R c_n \in \mathbb{R} c n ∈ R are coefficients and c ∈ R c \in \mathbb{R} c ∈ R is the center.
For every power series, exactly one of three cases holds:
The series converges only at x = c x = c x = c ( R = 0 R = 0 R = 0 ).
The series converges absolutely for all x ∈ R x \in \mathbb{R} x ∈ R ( R = ∞ R = \infty R = ∞ ).
There exists a finite R > 0 R > 0 R > 0 ( radius of convergence ) such that the series converges absolutely for ∣ x − c ∣ < R |x - c| < R ∣ x − c ∣ < R , diverges for ∣ x − c ∣ > R |x - c| > R ∣ x − c ∣ > R , and may converge or diverge at endpoints ∣ x − c ∣ = R |x - c| = R ∣ x − c ∣ = R .
Finding the Radius of Convergence
Two primary formulas compute R R R :
1. Ratio Limit Formula
If the limit of successive coefficient ratios exists: R = lim n → ∞ ∣ c n c n + 1 ∣ = 1 lim n → ∞ ∣ c n + 1 c n ∣ R = \lim_{n \to \infty} \left|\frac{c_n}{c_{n+1}}\right| = \frac{1}{\lim_{n \to \infty} \left|\frac{c_{n+1}}{c_n}\right|} R = n → ∞ lim c n + 1 c n = lim n → ∞ c n c n + 1 1
2. The Cauchy-Hadamard Theorem
The universal formula applying to all coefficient sequences is: 1 R = lim sup n → ∞ ∣ c n ∣ 1 / n \frac{1}{R} = \limsup_{n \to \infty} |c_n|^{1/n} R 1 = n → ∞ lim sup ∣ c n ∣ 1/ n
with conventions 1 / 0 = ∞ 1/0 = \infty 1/0 = ∞ and 1 / ∞ = 0 1/\infty = 0 1/∞ = 0 . Cauchy-Hadamard is essential when coefficients have periodic gaps or alternating growth rates (e.g., c n = 5 n c_n = 5^n c n = 5 n for even n n n , 2 n 2^n 2 n for odd n n n ).
Endpoint Analysis and Interval of Convergence
The interval of convergence is the set of x ∈ R x \in \mathbb{R} x ∈ R where the series converges: ( c − R , c + R ) , [ c − R , c + R ) , ( c − R , c + R ] , [ c − R , c + R ] (c - R, c + R), \quad [c - R, c + R), \quad (c - R, c + R], \quad [c - R, c + R] ( c − R , c + R ) , [ c − R , c + R ) , ( c − R , c + R ] , [ c − R , c + R ]
Endpoint Rule: Ratio and Root tests always yield 1 at x = c ± R x = c \pm R x = c ± R . Substitute x = c ± R x = c \pm R x = c ± R into the series and test the resulting numerical series using p p p -series, Leibniz, or comparison tests.
Power Series with Transformed Arguments
When a series features an argument like ∑ c n ( a x − b ) k \sum c_n (a x - b)^k ∑ c n ( a x − b ) k :
Determine base radius R base R_{\text{base}} R base of ∑ c n u n \sum c_n u^n ∑ c n u n .
Set ∣ a x − b ∣ k < R base ⟹ ∣ a x − b ∣ < ( R base ) 1 / k |ax - b|^k < R_{\text{base}} \implies |ax - b| < (R_{\text{base}})^{1/k} ∣ a x − b ∣ k < R base ⟹ ∣ a x − b ∣ < ( R base ) 1/ k .
Solve for x x x : ∣ x − b / a ∣ < ( R base ) 1 / k ∣ a ∣ |x - b/a| < \frac{(R_{\text{base}})^{1/k}}{|a|} ∣ x − b / a ∣ < ∣ a ∣ ( R base ) 1/ k . New center is b / a b/a b / a , and new radius is R new = ( R base ) 1 / k ∣ a ∣ R_{\text{new}} = \frac{(R_{\text{base}})^{1/k}}{|a|} R new = ∣ a ∣ ( R base ) 1/ k .
Term-by-Term Differentiation and Integration
Let f ( x ) = ∑ n = 0 ∞ c n ( x − c ) n f(x) = \sum_{n=0}^\infty c_n (x - c)^n f ( x ) = ∑ n = 0 ∞ c n ( x − c ) n have radius R > 0 R > 0 R > 0 . Within ( c − R , c + R ) (c - R, c + R) ( c − R , c + R ) , f ( x ) f(x) f ( x ) is infinitely differentiable and integrable term-by-term:
Derivative: f ′ ( x ) = ∑ n = 1 ∞ n c n ( x − c ) n − 1 f'(x) = \sum_{n=1}^\infty n c_n (x - c)^{n-1} f ′ ( x ) = ∑ n = 1 ∞ n c n ( x − c ) n − 1
Antiderivative: ∫ f ( x ) d x = C + ∑ n = 0 ∞ c n n + 1 ( x − c ) n + 1 \int f(x)\,dx = C + \sum_{n=0}^\infty \frac{c_n}{n+1} (x - c)^{n+1} ∫ f ( x ) d x = C + ∑ n = 0 ∞ n + 1 c n ( x − c ) n + 1
Invariance of Radius vs. Endpoint Sensitivity
Radius Invariance: Differentiation and integration preserve the exact radius R R R .
Endpoint Warning: Endpoint convergence can change. Differentiation can destroy endpoint convergence (e.g., ∑ x n n \sum \frac{x^n}{n} ∑ n x n converges at x = − 1 x = -1 x = − 1 , but derivative ∑ x n − 1 \sum x^{n-1} ∑ x n − 1 diverges). Integration can gain endpoint convergence.
Abel's Theorem on Boundary Continuity
If ∑ c n ( x − c ) n \sum c_n (x - c)^n ∑ c n ( x − c ) n has radius R > 0 R > 0 R > 0 and converges at x = c + R x = c + R x = c + R , then: lim x → ( c + R ) − ∑ n = 0 ∞ c n ( x − c ) n = ∑ n = 0 ∞ c n R n \lim_{x \to (c + R)^-} \sum_{n=0}^\infty c_n (x - c)^n = \sum_{n=0}^\infty c_n R^n x → ( c + R ) − lim n = 0 ∑ ∞ c n ( x − c ) n = n = 0 ∑ ∞ c n R n
Abel's Theorem guarantees continuity extends to convergent endpoints, justifying evaluation of series sums via limits (e.g., ∑ ( − 1 ) n − 1 n = lim x → 1 − ln ( 1 + x ) = ln 2 \sum \frac{(-1)^{n-1}}{n} = \lim_{x \to 1^-} \ln(1+x) = \ln 2 ∑ n ( − 1 ) n − 1 = lim x → 1 − ln ( 1 + x ) = ln 2 ).
Summary Comparison Table: Power Series Properties
Operation Formula Radius R R R Endpoints Behavior
Standard Series ∑ c n ( x − c ) n \sum c_n (x - c)^n ∑ c n ( x − c ) n R = 1 / lim sup ∣ c n ∣ 1 / n R = 1 / \limsup \vert c_n\vert^{1/n} R = 1/ lim sup ∣ c n ∣ 1/ n Test individually at c ± R c \pm R c ± R
Differentiation ∑ n c n ( x − c ) n − 1 \sum n c_n (x - c)^{n-1} ∑ n c n ( x − c ) n − 1 Identically R R R May lose convergence
Integration ∑ c n n + 1 ( x − c ) n + 1 \sum \frac{c_n}{n+1} (x - c)^{n+1} ∑ n + 1 c n ( x − c ) n + 1 Identically R R R May gain convergence
Scaling a x ax a x ∑ c n ( a x ) n \sum c_n (ax)^n ∑ c n ( a x ) n R / ∣ a ∣ R / \vert a\vert R /∣ a ∣ Endpoints scaled by 1 / a 1/a 1/ a
Power x k x^k x k ∑ c n x k n \sum c_n x^{kn} ∑ c n x kn R 1 / k R^{1/k} R 1/ k Re-test at ± R 1 / k \pm R^{1/k} ± R 1/ k
Worked Problem: Interval of Convergence with Mixed Endpoints
Problem: Find the exact interval of convergence for ∑ n = 1 ∞ ( 2 x − 1 ) n n ⋅ 3 n \sum_{n=1}^\infty \frac{(2x - 1)^n}{n \cdot 3^n} ∑ n = 1 ∞ n ⋅ 3 n ( 2 x − 1 ) n .
Solution:
Apply ratio test: lim n → ∞ ∣ a n + 1 a n ∣ = ∣ 2 x − 1 ∣ 3 lim n n + 1 = ∣ 2 x − 1 ∣ 3 \lim_{n \to \infty} |\frac{a_{n+1}}{a_n}| = \frac{|2x - 1|}{3} \lim \frac{n}{n+1} = \frac{|2x - 1|}{3} lim n → ∞ ∣ a n a n + 1 ∣ = 3 ∣2 x − 1∣ lim n + 1 n = 3 ∣2 x − 1∣ .
Convergence requires ∣ 2 x − 1 ∣ 3 < 1 ⟹ ∣ 2 x − 1 ∣ < 3 ⟹ − 1 < x < 2 \frac{|2x - 1|}{3} < 1 \implies |2x - 1| < 3 \implies -1 < x < 2 3 ∣2 x − 1∣ < 1 ⟹ ∣2 x − 1∣ < 3 ⟹ − 1 < x < 2 . The center is c = 1 / 2 c = 1/2 c = 1/2 and radius is R = 3 / 2 R = 3/2 R = 3/2 .
Test x = − 1 x = -1 x = − 1 : 2 ( − 1 ) − 1 = − 3 2(-1) - 1 = -3 2 ( − 1 ) − 1 = − 3 . The series becomes ∑ n = 1 ∞ ( − 3 ) n n ⋅ 3 n = ∑ n = 1 ∞ ( − 1 ) n n \sum_{n=1}^\infty \frac{(-3)^n}{n \cdot 3^n} = \sum_{n=1}^\infty \frac{(-1)^n}{n} ∑ n = 1 ∞ n ⋅ 3 n ( − 3 ) n = ∑ n = 1 ∞ n ( − 1 ) n , which converges by Leibniz.
Test x = 2 x = 2 x = 2 : 2 ( 2 ) − 1 = 3 2(2) - 1 = 3 2 ( 2 ) − 1 = 3 . The series becomes ∑ n = 1 ∞ 3 n n ⋅ 3 n = ∑ n = 1 ∞ 1 n \sum_{n=1}^\infty \frac{3^n}{n \cdot 3^n} = \sum_{n=1}^\infty \frac{1}{n} ∑ n = 1 ∞ n ⋅ 3 n 3 n = ∑ n = 1 ∞ n 1 , which diverges.
The interval of convergence is [ − 1 , 2 ) [-1, 2) [ − 1 , 2 ) .
GRE Exam Traps & Fast Test-Taking Strategies
Trap 1: Omitting the scaling coefficient in radius. For ∑ c n ( a x − b ) n \sum c_n (ax - b)^n ∑ c n ( a x − b ) n , calculating base radius without dividing by ∣ a ∣ |a| ∣ a ∣ gives an incorrect interval. Always divide by ∣ a ∣ |a| ∣ a ∣ .
Trap 2: Assuming identical endpoint behavior. It is common for one endpoint to converge conditionally and the other to diverge. Test both endpoints independently.
Trap 3: Applying ratio test to lacunary series. When series contain powers like x 2 n x^{2n} x 2 n or oscillating coefficients, use the Cauchy-Hadamard formula directly.