← Back to modules

Series & Sequences

Analyze convergence and common series tests.

Sequences are ordered lists of numbers, and series are their sums. The fundamental question of this entire topic: when you add up infinitely many numbers, can you get a finite answer?

Series are not just theoretical: they underpin how computers calculate sinx\sin x, exe^x, and lnx\ln x. Taylor series let you approximate any smooth function with a polynomial. Power series extend calculus into the realm of infinite-degree polynomials.

This module covers convergence tests (the toolkit for determining if a series converges), power series, and Taylor/Maclaurin series. Master the tests systematically and you'll always know which tool to reach for.

Sequences and their limits

A sequence {an}\{a_n\} is an ordered list: a1,a2,a3,a_1, a_2, a_3, \ldots The sequence converges if limnan=L\lim_{n\to\infty} a_n = L for some finite LL.

Common sequences: an=1/n0a_n = 1/n \to 0, an=(1+1/n)nea_n = (1+1/n)^n \to e, an=(1)na_n = (-1)^n diverges (oscillates).

Tools for evaluating sequence limits: L'Hôpital's Rule (treat nn as a continuous variable xx), Squeeze Theorem, and the fact that exponentials dominate polynomials which dominate logarithms: lnnnpann!nn\ln n \ll n^p \ll a^n \ll n! \ll n^n for a>1a > 1.

A sequence is monotonic if it is always increasing or always decreasing. A bounded monotonic sequence always converges (Monotone Convergence Theorem).


Series: partial sums and convergence

A series n=1an\sum_{n=1}^{\infty} a_n is the limit of its partial sums: SN=n=1NanS_N = \sum_{n=1}^{N} a_n. If limNSN\lim_{N\to\infty} S_N exists and is finite, the series converges.

Key distinction: a sequence {an}\{a_n\} converging to 00 is necessary for the series to converge, but not sufficient. an=1/n0a_n = 1/n \to 0, yet 1/n\sum 1/n diverges.

The harmonic series 1/n\sum 1/n diverges. This is one of the most important facts in the theory of series. It shows that terms going to zero isn't enough.

💡Explain it simply

Imagine stacking blocks. Each block is thinner than the last. The question is: does the tower reach a finite height, or does it grow forever?

If each block is half as thick as the previous one (like 1,1/2,1/4,1/8,1, 1/2, 1/4, 1/8, \ldots), the tower settles at height 2. That's a convergent series. But if each block is 1,1/2,1/3,1/4,1, 1/2, 1/3, 1/4, \ldots (harmonic series), the blocks get thinner but not fast enough — the tower grows forever, just very slowly.

So 'the pieces get smaller' isn't enough. They have to get smaller fast enough. The convergence tests are all about measuring whether 'fast enough' is satisfied.


Geometric series

A geometric series has the form n=0arn\sum_{n=0}^{\infty} ar^n where aa is the first term and rr is the common ratio.

It converges if and only if r<1|r| < 1, and the sum is a1r\frac{a}{1-r}.

Example: n=032n=311/2=6\sum_{n=0}^{\infty} \frac{3}{2^n} = \frac{3}{1-1/2} = 6.

This is the only common series where we can easily compute the exact sum. Many convergence tests compare other series to geometric ones.

1

Summing a geometric series

  1. Compute n=0(1)n4n\sum_{n=0}^{\infty} \frac{(-1)^n}{4^n}.
  2. Rewrite: this is n=0(14)n\sum_{n=0}^{\infty} \left(-\frac{1}{4}\right)^n. So a=1a = 1 and r=1/4r = -1/4.
  3. Check: r=1/4<1|r| = 1/4 < 1, so it converges.
  4. Apply the formula: a1r=11(1/4)=15/4=45\frac{a}{1-r} = \frac{1}{1-(-1/4)} = \frac{1}{5/4} = \frac{4}{5}.
  5. The sum is 45\frac{4}{5}. Note: even though terms alternate sign, the geometric series formula handles this perfectly.

Telescoping series

A telescoping series is one where most terms cancel in the partial sum.

Example: n=11n(n+1)=n=1(1n1n+1)\sum_{n=1}^{\infty} \frac{1}{n(n+1)} = \sum_{n=1}^{\infty} \left(\frac{1}{n} - \frac{1}{n+1}\right).

The partial sum is SN=11N+1S_N = 1 - \frac{1}{N+1}. As NN \to \infty, SN1S_N \to 1.

To recognize telescoping: use partial fractions to decompose the general term. If consecutive terms cancel, you have a telescoping series.


The Divergence Test (nth-term test)

If limnan0\lim_{n\to\infty} a_n \neq 0, then an\sum a_n diverges. Period.

This should always be your first check. It's quick and catches obvious divergence.

If limnan=0\lim_{n\to\infty} a_n = 0, the test is inconclusive. You need another test. (Remember: 1/n\sum 1/n has an0a_n \to 0 but diverges.)


p-series and the harmonic series

A p-series is n=11np\sum_{n=1}^{\infty} \frac{1}{n^p}.

Converges if p>1p > 1 and diverges if p1p \leq 1.

p=1p=1: harmonic series 1/n\sum 1/n (diverges). p=2p=2: 1/n2=π2/6\sum 1/n^2 = \pi^2/6 (converges). p=1/2p=1/2: 1/n\sum 1/\sqrt{n} (diverges).

p-series are the benchmark for comparison tests. When you see 1/np1/n^p-like terms, think p-series.


The Integral Test

If f(x)f(x) is positive, continuous, and decreasing for xNx \geq N, and an=f(n)a_n = f(n), then n=Nan\sum_{n=N}^{\infty} a_n and Nf(x)dx\int_N^{\infty} f(x)\,dx either both converge or both diverge.

The integral test does not give the sum of the series, only whether it converges.

Example: test 1/n2\sum 1/n^2. Compare with 11/x2dx=1\int_1^{\infty} 1/x^2\,dx = 1. The integral converges, so the series converges.

This is how we prove the p-series convergence criteria: 1xpdx\int_1^{\infty} x^{-p}\,dx converges iff p>1p > 1.


Comparison and Limit Comparison Tests

Direct comparison: if 0anbn0 \leq a_n \leq b_n for all nn and bn\sum b_n converges, then an\sum a_n converges. If an\sum a_n diverges, then bn\sum b_n diverges.

Limit comparison: if limnan/bn=L\lim_{n\to\infty} a_n / b_n = L where 0<L<0 < L < \infty, then an\sum a_n and bn\sum b_n either both converge or both diverge.

Strategy: compare your series to a known p-series or geometric series. Pick bnb_n by keeping only the dominant terms.

Example: test nn3+1\sum \frac{n}{n^3+1}. For large nn, this behaves like nn3=1n2\frac{n}{n^3} = \frac{1}{n^2}. Limit comparison with 1/n2\sum 1/n^2 (converges) confirms convergence.


Ratio and Root Tests

Ratio test: compute L=limnan+1anL = \lim_{n\to\infty} \left|\frac{a_{n+1}}{a_n}\right|. If L<1L < 1: converges absolutely. L>1L > 1: diverges. L=1L = 1: inconclusive.

Root test: compute L=limnannL = \lim_{n\to\infty} \sqrt[n]{|a_n|}. Same criteria as the ratio test.

The ratio test excels for series with factorials (like n!/3nn!/3^n) or products. The root test is ideal for terms raised to the nnth power (like (2/3)n(2/3)^n).

Warning: both tests are inconclusive when L=1L=1. This happens for all p-series, so you can't use ratio/root tests on 1/np\sum 1/n^p.

1

Ratio test on a factorial series

  1. Does n=1n!3n\sum_{n=1}^{\infty} \frac{n!}{3^n} converge or diverge?
  2. Use the ratio test. Compute an+1an=(n+1)!3n+13nn!\frac{a_{n+1}}{a_n} = \frac{(n+1)!}{3^{n+1}} \cdot \frac{3^n}{n!}.
  3. Simplify: (n+1)!/n!=n+1(n+1)!/n! = n+1 and 3n/3n+1=1/33^n/3^{n+1} = 1/3.
  4. So an+1an=n+13\frac{a_{n+1}}{a_n} = \frac{n+1}{3}.
  5. Take the limit: L=limnn+13=L = \lim_{n\to\infty} \frac{n+1}{3} = \infty.
  6. Since L>1L > 1 (in fact L=L = \infty), the series diverges. The factorial grows so much faster than 3n3^n that the terms blow up.

Alternating Series Test

An alternating series has the form (1)nan\sum (-1)^n a_n where an>0a_n > 0.

It converges if: (1) ana_n is eventually decreasing and (2) limnan=0\lim_{n\to\infty} a_n = 0.

Example: n=1(1)n+1n=11/2+1/31/4+=ln2\sum_{n=1}^{\infty} \frac{(-1)^{n+1}}{n} = 1 - 1/2 + 1/3 - 1/4 + \cdots = \ln 2. (The alternating harmonic series.)

Alternating series estimation: the error after summing NN terms is at most aN+1|a_{N+1}|. This gives a built-in error bound.


Absolute vs. conditional convergence

A series an\sum a_n converges absolutely if an\sum |a_n| converges. It converges conditionally if an\sum a_n converges but an\sum |a_n| diverges.

Absolute convergence implies convergence. So if the absolute value series converges, you're done.

Example: (1)n/n2\sum (-1)^n/n^2 converges absolutely because 1/n2\sum 1/n^2 converges.

Example: (1)n/n\sum (-1)^n/n converges conditionally. It converges by the alternating series test, but 1/n\sum 1/n diverges.

Why it matters: absolutely convergent series can be rearranged freely without changing the sum. Conditionally convergent series cannot (Riemann rearrangement theorem).

💡Explain it simply

Think of absolute convergence like having money in the bank. Even if some terms are positive and some are negative, if the total amount of money moving around (ignoring direction) is finite, you're safe. The sum is solid and reliable.

Conditional convergence is like balancing on a tightrope. The positive and negative terms cancel each other out just right to give a finite sum, but it's fragile. If you rearrange the order you add them, you can get a completely different answer (or no answer at all). It only works because of the specific order.


Power series

A power series centered at aa is n=0cn(xa)n\sum_{n=0}^{\infty} c_n(x-a)^n. It converges on some interval centered at aa.

The radius of convergence RR determines where it converges: xa<R|x-a| < R (converges), xa>R|x-a| > R (diverges). At xa=R|x-a| = R (the endpoints), you must check separately.

Find RR using the ratio test: R=limncncn+1R = \lim_{n\to\infty} \left|\frac{c_n}{c_{n+1}}\right| (or the root test).

Inside the radius, power series behave like polynomials: you can differentiate and integrate them term by term.

Example: the geometric series 11x=n=0xn\frac{1}{1-x} = \sum_{n=0}^{\infty} x^n for x<1|x| < 1 is a power series with R=1R = 1.


Taylor and Maclaurin series

The Taylor series of f(x)f(x) centered at aa is: f(x)=n=0f(n)(a)n!(xa)nf(x) = \sum_{n=0}^{\infty} \frac{f^{(n)}(a)}{n!}(x-a)^n.

A Maclaurin series is a Taylor series centered at a=0a=0.

Essential Maclaurin series to memorize:

ex=n=0xnn!=1+x+x22!+x33!+e^x = \sum_{n=0}^{\infty} \frac{x^n}{n!} = 1 + x + \frac{x^2}{2!} + \frac{x^3}{3!} + \cdots for all xx.

sinx=n=0(1)nx2n+1(2n+1)!=xx33!+x55!\sin x = \sum_{n=0}^{\infty} \frac{(-1)^n x^{2n+1}}{(2n+1)!} = x - \frac{x^3}{3!} + \frac{x^5}{5!} - \cdots for all xx.

cosx=n=0(1)nx2n(2n)!=1x22!+x44!\cos x = \sum_{n=0}^{\infty} \frac{(-1)^n x^{2n}}{(2n)!} = 1 - \frac{x^2}{2!} + \frac{x^4}{4!} - \cdots for all xx.

ln(1+x)=n=1(1)n+1xnn=xx22+x33\ln(1+x) = \sum_{n=1}^{\infty} \frac{(-1)^{n+1} x^n}{n} = x - \frac{x^2}{2} + \frac{x^3}{3} - \cdots for 1<x1-1 < x \leq 1.

11x=n=0xn\frac{1}{1-x} = \sum_{n=0}^{\infty} x^n for x<1|x| < 1.

💡Explain it simply

A Taylor series is like building a copy of a function out of simple polynomial building blocks (1,x,x2,x3,1, x, x^2, x^3, \ldots).

Imagine you want to recreate a complicated curve. First, you match the value at one point (constant term). Then you match the slope (linear term). Then the curvature (x2x^2 term). Each new term makes your copy more accurate, like adding more detail to a sketch.

With enough terms, your polynomial copy becomes indistinguishable from the original function. That's how your calculator computes sin(0.5)\sin(0.5) — it's not drawing a circle, it's evaluating a polynomial like 0.50.53/6+0.55/1200.5 - 0.5^3/6 + 0.5^5/120 - \cdots that happens to equal sin(0.5)\sin(0.5) to many decimal places.

1

Computing a Taylor series from scratch

  1. Find the Maclaurin series for f(x)=exf(x) = e^x (centered at a=0a = 0).
  2. We need f(n)(0)f^{(n)}(0) for each nn. Since ddxex=ex\frac{d}{dx}e^x = e^x, every derivative of exe^x is exe^x.
  3. So f(0)=1f(0) = 1, f(0)=1f'(0) = 1, f(0)=1f''(0) = 1, f(0)=1f'''(0) = 1, and so on. Every derivative at 00 equals 11.
  4. Plug into the Taylor formula: ex=n=0f(n)(0)n!xn=n=0xnn!e^x = \sum_{n=0}^{\infty} \frac{f^{(n)}(0)}{n!} x^n = \sum_{n=0}^{\infty} \frac{x^n}{n!}.
  5. Written out: ex=1+x+x22+x36+x424+e^x = 1 + x + \frac{x^2}{2} + \frac{x^3}{6} + \frac{x^4}{24} + \cdots
  6. This converges for all xx. For example, e11+1+0.5+0.167+0.042+0.008+2.718e^1 \approx 1 + 1 + 0.5 + 0.167 + 0.042 + 0.008 + \cdots \approx 2.718.
2

Deriving a series by substitution

  1. Find the Maclaurin series for ex2e^{-x^2}.
  2. Instead of computing derivatives (which get very messy), use the known series for exe^x and substitute x2-x^2 for xx.
  3. We know: ex=n=0xnn!e^x = \sum_{n=0}^{\infty} \frac{x^n}{n!}.
  4. Replace xx with x2-x^2: ex2=n=0(x2)nn!=n=0(1)nx2nn!e^{-x^2} = \sum_{n=0}^{\infty} \frac{(-x^2)^n}{n!} = \sum_{n=0}^{\infty} \frac{(-1)^n x^{2n}}{n!}.
  5. Written out: ex2=1x2+x42x66+e^{-x^2} = 1 - x^2 + \frac{x^4}{2} - \frac{x^6}{6} + \cdots
  6. This is the Gaussian function used in probability and statistics. Its integral 0ex2dx=π2\int_0^\infty e^{-x^2}dx = \frac{\sqrt{\pi}}{2} has no closed form — but we can integrate the series term by term!

Taylor remainder and error bounds

The nnth degree Taylor polynomial Tn(x)T_n(x) approximates f(x)f(x). The error is Rn(x)=f(x)Tn(x)R_n(x) = f(x) - T_n(x).

Taylor's inequality: Rn(x)M(n+1)!xan+1|R_n(x)| \leq \frac{M}{(n+1)!}|x-a|^{n+1} where MM is an upper bound for f(n+1)(t)|f^{(n+1)}(t)| on the interval between aa and xx.

For alternating series, the error after nn terms is bounded by the first omitted term: Rnan+1|R_n| \leq |a_{n+1}|.

This is critical for applications: you can determine how many terms you need for a desired accuracy.


Building new series from known ones

Substitution: replace xx in a known series. E.g., ex2=(x2)nn!=(1)nx2nn!e^{-x^2} = \sum \frac{(-x^2)^n}{n!} = \sum \frac{(-1)^n x^{2n}}{n!}.

Differentiation: ddx[11x]=1(1x)2=n=1nxn1\frac{d}{dx}\left[\frac{1}{1-x}\right] = \frac{1}{(1-x)^2} = \sum_{n=1}^{\infty} nx^{n-1}.

Integration: 0x11+t2dt=arctanx=n=0(1)nx2n+12n+1\int_0^x \frac{1}{1+t^2}\,dt = \arctan x = \sum_{n=0}^{\infty} \frac{(-1)^n x^{2n+1}}{2n+1}.

These techniques let you derive new series without computing derivatives from scratch.


Choosing the right convergence test (strategy)

1. Divergence test first: if an↛0a_n \not\to 0, done (diverges).

2. Is it geometric? Check if an=arna_n = ar^n.

3. Is it a p-series? Check if an=1/npa_n = 1/n^p.

4. Does it telescope? Try partial fractions.

5. Are there factorials or nnth powers? Try ratio or root test.

6. Does it look like a known series? Try comparison or limit comparison.

7. Is it alternating? Try the alternating series test.

8. Is f(n)=anf(n) = a_n easy to integrate? Try the integral test.


⚠️

Common Mistakes to Avoid

  • Using the divergence test to 'prove' convergence. If an0a_n \to 0, the test tells you nothing. It can only prove divergence.
  • Applying the ratio or root test to a p-series. These tests always give L=1L = 1 (inconclusive) for 1/np\sum 1/n^p.
  • Forgetting to check the endpoints of a power series interval. The series may converge at one endpoint, both, or neither.
  • Confusing absolute and conditional convergence. Absolute convergence (an\sum |a_n| converges) is strictly stronger than conditional convergence.
  • Computing Taylor coefficients incorrectly: the nnth coefficient is f(n)(a)n!\frac{f^{(n)}(a)}{n!}, not f(n)(a)f^{(n)}(a). Don't forget the n!n! in the denominator.
  • Trying to determine the sum of a series when the question only asks about convergence. Most convergent series don't have nice closed-form sums.
  • Not simplifying before choosing a test. Algebra can often reveal the right comparison or simplify the ratio test calculation.

Worked Practice Problems (5 examples)

Study these solved examples to understand the techniques. Then head to Practice to try problems on your own.

Practice on your own →
1

Problem 1

Does the geometric series n=0(12)n\sum_{n=0}^{\infty} \left(\frac{1}{2}\right)^n converge or diverge?

Step-by-Step Solution

1

Geometric series with r=1/2r = 1/2.

2

Since r=1/2<1|r| = 1/2 < 1, it converges.

Final Answer: Converges

2

Problem 2

Find the sum: n=0(13)n\sum_{n=0}^{\infty} \left(\frac{1}{3}\right)^n

Step-by-Step Solution

1

Sum =a1r=111/3=12/3=32= \frac{a}{1-r} = \frac{1}{1-1/3} = \frac{1}{2/3} = \frac{3}{2}.

Final Answer: 32\frac{3}{2}

3

Problem 3

Does n=11n\sum_{n=1}^{\infty} \frac{1}{n} converge?

Step-by-Step Solution

1

This is the harmonic series.

2

The harmonic series diverges (famous result).

Final Answer: Diverges

4

Problem 4

Find the sum: n=0(14)n\sum_{n=0}^{\infty} \left(\frac{1}{4}\right)^n

Step-by-Step Solution

1

111/4=43\frac{1}{1-1/4} = \frac{4}{3}.

Final Answer: 43\frac{4}{3}

5

Problem 5

Does n=11n2\sum_{n=1}^{\infty} \frac{1}{n^2} converge?

Step-by-Step Solution

1

This is a pp-series with p=2>1p=2>1.

2

pp-series converges when p>1p>1.

Final Answer: Converges

Ready to practice?

Test your understanding with 40 problems on series & sequences.