A series converges if its partial sums approach a finite limit.
Two you just know: a geometric series converges exactly when \(|r|\lt 1\) (and you can find its sum); a p-series converges exactly when \(p\gt 1\). The harmonic series \((p=1)\) diverges.
The one quick check to run before anything else.
If the terms don't shrink to zero, the series can't converge. But it only ever shows divergence — if \(\lim a_n=0\), the test is inconclusive and you need a real test.
How far a partial sum / Taylor polynomial is from the true value.
Each test has a tell — a series shape it's built for.
When a series has negative terms, there are two grades of convergence.
Why it matters: absolute convergence is sturdy — you can rearrange terms freely. Conditional convergence is fragile. The classic split: \(\sum\tfrac{(-1)^n}{n}\) is conditional (the harmonic series underneath diverges), while \(\sum\tfrac{(-1)^n}{n^2}\) is absolute.
Quick routine: strip the signs and test \(\sum|a_n|\) with whatever fits (often Ratio or a p-series comparison). Converges → absolute, and you're done. Diverges → fall back to the Alternating Series Test on \(\sum a_n\); if that converges, it's conditional.
Rebuild a function as an infinite polynomial from its derivatives at a point.
Maclaurin is just Taylor with \(c=0\). The \(n\)th-degree Taylor polynomial stops the sum at \(n\).
Memorize these four — they're the starting point for most problems (sub, differentiate, or integrate to get others):
A power series only equals its function for \(x\) close enough to the center.
The whole unit answers two questions: does this infinite sum settle to a number (convergence tests), and can I rebuild a function as an infinite polynomial (Taylor series)? Match the series' shape to the right test, and know your four Maclaurin series cold — everything else is built from those.