Intuition What this page is for
The parent note proved why you may differentiate and integrate a power series term by term and why the radius survives (its §2 derives R new = R from the Cauchy–Hadamard theorem plus the limit n 1/ n → 1 ). This page does the opposite job: it drags that theorem through every kind of situation you will ever meet — a positive series, an alternating one, a series that gains an endpoint, one that loses an endpoint, a shifted centre c = 0 , a degenerate case, a real-world word problem, and a nasty exam twist. Nothing is left as "you'll figure it out."
Before we compute anything, let me name the four tools so no symbol appears unearned.
Definition The four moves, in plain words
∑ n = 0 ∞ a n ( x − c ) n means: add up infinitely many terms; the n -th term is a number a n (the coefficient ) times ( x − c ) raised to the power n . The number c is the centre — the point the series is "built around."
Differentiate (d x d ) = "find the slope." For one term a n ( x − c ) n the slope is n a n ( x − c ) n − 1 : bring the power down front, drop the power by one.
Integrate (∫ ) = "find the running area." For one term it is n + 1 a n ( x − c ) n + 1 : bump the power up by one, divide by the new power.
Radius of convergence R = the half-width of the "safe zone" ( c − R , c + R ) where the infinite sum is a real finite number. See Power series and radius of convergence .
Definition The radius-survival fact we lean on
Throughout this page we reuse one result the parent note established: term-by-term differentiation or integration leaves the radius of convergence R unchanged; only the two endpoints x = c ± R may flip their verdict. The parent proved this from the Cauchy–Hadamard theorem using n 1/ n → 1 . We cite it as "radius-survival" below so you never have to leave this page to know where it comes from.
Definition Two different endpoint tools — keep them separate
When a series lands on an endpoint, two distinct facts are in play, and students often blur them:
Alternating series test (AST): a convergence test. If the terms alternate in sign and their sizes shrink monotonically to 0 , the series converges . This tells you the sum is some finite number — but not which number.
Abel's theorem : an identification tool. Given that the series already converges at the endpoint (AST supplies that), Abel says its value equals the limit of the function as x approaches the endpoint from inside. This tells you which number.
So the workflow at an endpoint is always two-step: (1) AST — does it converge? (2) Abel — if yes, what does it equal?
Every example below is tagged with the cell(s) it covers. The goal: no empty cell. Note the two-sided rows: every "endpoint" cell is checked at both x = c + R and x = c − R .
Cell
The scenario it stress-tests
Covered by
A
Differentiate — all coefficients positive
Ex 1
B
Integrate — series gains the right endpoint x = + 1
Ex 2
B′
Integrate — the left endpoint x = − 1 (opposite sign)
Ex 2, step 4
C
Integrate — series only conditionally convergent at endpoint
Ex 3
C′
Integrate — the left endpoint x = − 1 diverges
Ex 3, step 4
D
Differentiate — series loses an endpoint (both sides)
Ex 4
E
Shifted centre c = 0 (not centred at zero)
Ex 5
F
Degenerate / limiting: the series that returns itself
Ex 6
G
Real-world word problem (physics)
Ex 7
H
Exam twist: sum an unknown series by recognising a derivative
Ex 8
The figure above is the map: the horizontal line is the x -axis, the shaded band is the safe zone ( c − R , c + R ) , and the two dots are the endpoints — the only places where differentiating or integrating can flip the verdict. Both dots must be tested independently.
Worked example Example 1 — from
1 − x 1 to ( 1 − x ) 2 1 and beyond
Start from the Geometric series 1 − x 1 = n = 0 ∑ ∞ x n for ∣ x ∣ < 1 . Find a closed form for n = 1 ∑ ∞ n 2 x n .
Forecast: guess before reading — differentiating once gave ( 1 − x ) 2 1 ; a second differentiation (with a multiply-by-x trick) should produce a rational function with a cube in the denominator. Write down your guess.
Differentiate once. d x d 1 − x 1 = ( 1 − x ) 2 1 = ∑ n = 1 ∞ n x n − 1 .
Why this step? The theorem lets each term x n become n x n − 1 ; the n = 0 term is a constant so it vanishes, which is why the sum now starts at n = 1 .
Multiply by x to line the powers back up: ( 1 − x ) 2 x = ∑ n = 1 ∞ n x n .
Why this step? We want a ∑ n 2 x n eventually; keeping the exponent equal to n (not n − 1 ) means the next differentiation will hand us another factor of n cleanly.
Differentiate again. d x d ( 1 − x ) 2 x = ( 1 − x ) 3 1 + x = ∑ n = 1 ∞ n 2 x n − 1 .
Why this step? Differentiating n x n gives n ⋅ n x n − 1 = n 2 x n − 1 — the second factor of n we wanted.
Multiply by x once more. n = 1 ∑ ∞ n 2 x n = ( 1 − x ) 3 x ( 1 + x ) .
Verify: put x = 2 1 . Closed form: ( 2 1 ) 3 2 1 ⋅ 2 3 = 1/8 3/4 = 6 . Partial sum ∑ n = 1 6 n 2 ( 2 1 ) n = 0.5 + 1 + 1.125 + 1 + 0.78125 + 0.5625 = 4.968 … , marching toward 6 . ✓ Radius unchanged at R = 1 (each differentiation kept it — radius-survival).
Worked example Example 2 — the
arctan series and Leibniz's π
Derive the series for arctan x and show what happens at both endpoints x = 1 and x = − 1 .
Forecast: the base series 1 + x 2 1 diverges at x = ± 1 (terms ± 1 never shrink). After integrating, do you expect x = ± 1 to still fail, or to suddenly work? Guess.
Match the geometric pattern. 1 + x 2 1 = 1 − ( − x 2 ) 1 = ∑ n = 0 ∞ ( − x 2 ) n = ∑ n = 0 ∞ ( − 1 ) n x 2 n , valid when ∣ − x 2 ∣ < 1 , i.e. ∣ x ∣ < 1 .
Why this step? Substituting − x 2 for the "x " of the geometric series is the cheapest way to get a series for 1 + x 2 1 — no calculus needed yet.
Integrate from 0 to x , term by term: arctan x = ∫ 0 x 1 + t 2 d t = n = 0 ∑ ∞ 2 n + 1 ( − 1 ) n x 2 n + 1 .
Why this step? ∫ 0 x t 2 n d t = 2 n + 1 x 2 n + 1 , and the lower limit 0 auto-fixes the constant since arctan 0 = 0 .
Right endpoint x = 1 — two-step. (1) AST: the terms become 1 − 3 1 + 5 1 − 7 1 + ⋯ , which alternate and shrink to 0 , so by the alternating series test the series converges . (2) Abel: since it converges, Abel's theorem identifies the sum as lim x → 1 − arctan x = arctan 1 = 4 π .
Why this step? Keep the two tools apart: AST establishes convergence , Abel pins the value . Dividing by 2 n + 1 shrank the terms enough — the right endpoint was gained by integrating.
Left endpoint x = − 1 — the opposite sign, checked separately. Plugging x = − 1 : the odd power x 2 n + 1 = − 1 gives ∑ 2 n + 1 ( − 1 ) n ( − 1 ) = − ( 1 − 3 1 + 5 1 − ⋯ ) . (1) AST: same alternating, shrinking terms → converges . (2) Abel: sum = arctan ( − 1 ) = − 4 π .
Why this step? The theorem demands each boundary be tested on its own. Here arctan is odd, so the left endpoint mirrors the right — but you only know that by doing the check , not assuming it.
Verify: 4 ∑ n = 0 5000 2 n + 1 ( − 1 ) n ≈ 3.1414 , closing on π ≈ 3.14159 (slowly, oscillating). And at x = − 1 : ∑ n = 0 5000 2 n + 1 ( − 1 ) n ( − 1 ) ≈ − 0.7854 ≈ − 4 π . ✓ Radius still R = 1 .
The figure shows why the endpoints are gained: the base series' terms (yellow) sit at height 1 forever, but after integrating, the new terms (blue) decay like 2 n + 1 1 → 0 — the same picture at x = 1 and x = − 1 .
Worked example Example 3 —
ln ( 1 + x ) and the alternating harmonic series
From 1 + x 1 = ∑ n = 0 ∞ ( − 1 ) n x n , build ln ( 1 + x ) and evaluate at both endpoints x = 1 and x = − 1 .
Forecast: will the endpoint sums converge absolutely (rearrange freely) or only conditionally (order matters)? And will both sides behave the same? Decide before steps 3–4.
Integrate the base series 0 → x : ln ( 1 + x ) = ∑ n = 0 ∞ n + 1 ( − 1 ) n x n + 1 = x − 2 x 2 + 3 x 3 − ⋯ .
Why this step? ∫ 0 x t n d t = n + 1 x n + 1 ; constant is 0 because ln ( 1 + 0 ) = ln 1 = 0 .
The safe zone is ∣ x ∣ < 1 , so the two endpoints to test are x = 1 and x = − 1 .
Why this step? Base series has R = 1 ; integrating keeps R = 1 (radius-survival), so the boundaries are exactly ± 1 .
Right endpoint x = 1 — two-step. (1) AST: 1 − 2 1 + 3 1 − 4 1 + ⋯ alternates and shrinks to 0 → converges . (2) Abel: sum = lim x → 1 − ln ( 1 + x ) = ln 2 . Absolute version 1 + 2 1 + 3 1 + ⋯ is the harmonic series, which diverges — so the right endpoint is only conditionally convergent.
Why this step? Separating AST (converges) from absolute convergence (fails) is exactly what "conditional" means.
Left endpoint x = − 1 — checked separately, and it FAILS. Plugging x = − 1 : x n + 1 = ( − 1 ) n + 1 gives ∑ n + 1 ( − 1 ) n ( − 1 ) n + 1 = ∑ n + 1 ( − 1 ) 2 n + 1 = − ∑ n = 0 ∞ n + 1 1 — the negative harmonic series, which diverges to − ∞ . This matches ln ( 1 + ( − 1 )) = ln 0 = − ∞ .
Why this step? This is the crucial asymmetry: the right endpoint was gained but the left endpoint is lost. You would never see it if you only tested x = + 1 . Always do both.
Verify: ∑ n = 0 9999 n + 1 ( − 1 ) n ≈ 0.69310 , and ln 2 ≈ 0.69315 . Left side ∑ n = 0 9999 n + 1 1 ≈ 9.79 and still climbing (diverges). ✓ Radius R = 1 .
Worked example Example 4 — where differentiating breaks the edge
Consider f ( x ) = n = 1 ∑ ∞ n 2 x n . Its radius is R = 1 , and at both x = 1 and x = − 1 it converges (at x = 1 it is ∑ n 2 1 = 6 π 2 ; at x = − 1 it is ∑ n 2 ( − 1 ) n , absolutely convergent). What happens to the endpoints after differentiating?
Forecast: the coefficients are n 2 1 (fast decay, works at both ± 1 ). Differentiating multiplies by n . Do you predict x = 1 and x = − 1 survive?
Differentiate term by term: f ′ ( x ) = ∑ n = 1 ∞ n 2 n x n − 1 = ∑ n = 1 ∞ n x n − 1 .
Why this step? d x d n 2 x n = n 2 n x n − 1 = n x n − 1 : the factor n from differentiating cancelled one power of n in the denominator, leaving decay only like n 1 .
Right endpoint x = 1 : ∑ n = 1 ∞ n 1 — the harmonic series, which diverges . Right endpoint lost.
Why this step? Before differentiating ∑ n 2 1 converged; after, ∑ n 1 diverges.
Left endpoint x = − 1 — checked separately. Here x n − 1 = ( − 1 ) n − 1 gives ∑ n = 1 ∞ n ( − 1 ) n − 1 = 1 − 2 1 + 3 1 − ⋯ , which by AST converges (to ln 2 ). So the left endpoint survives even though the right one died.
Why this step? This is the sharpest possible reminder: the two endpoints can have opposite fates. Differentiation lost x = 1 but kept x = − 1 . Testing only one side would give a false conclusion.
Verify: the derivative is − x l n ( 1 − x ) in closed form; near x = 1 − it blows up like − ln ( 1 − x ) → + ∞ (right endpoint gone), while at x = − 1 it equals − − 1 l n 2 = ln 2 ≈ 0.693 (finite, left endpoint kept). Numerically at x = 0.99 : ∑ n = 1 2000 n 0.9 9 n − 1 ≈ 4.20 , and − ln ( 0.01 ) /0.99 ≈ 4.65 — growing. ✓ Radius still R = 1 .
Common mistake Steel-man: "Losing an endpoint means the radius shrank!"
Why it feels right: the series stopped working somewhere it used to work.
The fix: the open interval ( − 1 , 1 ) still converges perfectly. Only the single boundary point x = 1 changed verdict (and x = − 1 didn't even change!). Radius = half-width of the open interval, and that is untouched. "Endpoint ≠ radius" is the whole moral of DIRT (parent mnemonic).
Worked example Example 5 — series centred at
c = 2
Let g ( x ) = n = 0 ∑ ∞ 3 n ( x − 2 ) n . Find g ′ ( x ) as a series and as a closed form, and state its safe zone.
Forecast: the "x " of the geometric pattern is now 3 x − 2 . The centre is 2 , and R comes from 3 x − 2 < 1 . Guess R .
Recognise the geometric shape. With u = 3 x − 2 , g = ∑ u n = 1 − u 1 = 1 − 3 x − 2 1 = 5 − x 3 , valid for ∣ u ∣ < 1 ⇒ ∣ x − 2∣ < 3 , so c = 2 , R = 3 .
Why this step? Naming u makes the shift invisible — it's still just a geometric series in disguise.
Differentiate the series. g ′ ( x ) = ∑ n = 1 ∞ 3 n n ( x − 2 ) n − 1 .
Why this step? The theorem is centre-agnostic: d x d ( x − 2 ) n = n ( x − 2 ) n − 1 exactly as if c were 0 .
Differentiate the closed form to cross-check. g ′ ( x ) = d x d 5 − x 3 = ( 5 − x ) 2 3 .
Why this step? Two independent routes must agree — that's how you trust term-by-term work.
Verify: at x = 3 (inside, since ∣3 − 2∣ = 1 < 3 ): series ∑ n = 1 20 3 n n ⋅ 1 n − 1 ≈ 0.75 ; closed form ( 5 − 3 ) 2 3 = 4 3 = 0.75 . ✓ Centre 2 , radius 3 both unchanged by differentiation. The endpoints here are x = − 1 and x = 5 ; both diverge (geometric terms ± 1 don't shrink), on both sides.
Worked example Example 6 — the series equal to its own derivative
Show E ( x ) = n = 0 ∑ ∞ n ! x n satisfies E ′ = E , and note why this is the limiting/degenerate case where nothing at all changes.
Forecast: the exponential Taylor and Maclaurin series has R = ∞ (no endpoints exist). Predict what E ′ looks like.
Differentiate. E ′ ( x ) = ∑ n = 1 ∞ n ! n x n − 1 = ∑ n = 1 ∞ ( n − 1 )! x n − 1 .
Why this step? n ! n = ( n − 1 )! 1 — the factor n from differentiating cancels the top of the factorial.
Re-index m = n − 1 : E ′ ( x ) = ∑ m = 0 ∞ m ! x m = E ( x ) .
Why this step? Shifting the index shows the differentiated series is identical to the original.
Note the degeneracy. Here R = ∞ , so the safe zone is the whole line and there are no endpoints to gain or lose — neither + ∞ nor − ∞ is a real boundary point. This is the one cell where the "endpoint caveat" is vacuously satisfied.
Verify: at x = 1 , ∑ n = 0 10 n ! 1 ≈ 2.71828 , matching e . Derivative sum equals it by construction. ✓
Worked example Example 7 — charging a capacitor, term by term (with units)
In an RC circuit a capacitor charges so its voltage is V ( t ) = V 0 ( 1 − e − t / τ ) , where V 0 is measured in volts (V), t in seconds (s), and τ (the time constant ) also in seconds. The current is I ( t ) = C V ′ ( t ) where C is capacitance in farads (F). Find V ( t ) as a power series in t and differentiate it to get I ( t ) , checking units.
Forecast: e − t / τ near t = 0 is roughly 1 − τ t , so V ≈ V 0 τ t (linear ramp at first). Predict the leading term of I .
Expand the exponential. e − t / τ = ∑ n = 0 ∞ n ! ( − t / τ ) n , so V ( t ) = V 0 ( 1 − ∑ n = 0 ∞ n ! τ n ( − 1 ) n t n ) = V 0 ∑ n = 1 ∞ n ! τ n ( − 1 ) n − 1 t n .
Why this step? The n = 0 term of e − t / τ is 1 , and 1 − 1 = 0 , so the series starts at n = 1 : a clean ramp with no constant offset — matching V ( 0 ) = 0 .
Differentiate term by term. V ′ ( t ) = V 0 ∑ n = 1 ∞ n ! τ n ( − 1 ) n − 1 n t n − 1 = V 0 ∑ n = 1 ∞ ( n − 1 )! τ n ( − 1 ) n − 1 t n − 1 = τ V 0 e − t / τ .
Why this step? Same n ! n cancellation as Example 6; re-summing gives the compact closed form.
Multiply by C . I ( t ) = C V ′ ( t ) = τ C V 0 e − t / τ , and at t = 0 : I ( 0 ) = τ C V 0 .
Why this step? This is the peak initial current; term-by-term differentiation handed us the whole current curve.
Verify (units). τ C V 0 has units s F ⋅ V . Since 1 F = 1 C / V (coulomb per volt), s F ⋅ V = s C = A (amperes). ✓ Current in amps — dimensionally correct. Numerically with V 0 = 5 V, τ = 2 s, C = 1 F, t = 1 s: I = 2 5 e − 0.5 ≈ 1.516 A.
Worked example Example 8 — sum a mystery series by spotting a derivative
Evaluate S = n = 1 ∑ ∞ 2 n n in closed form.
Forecast: there's an n upstairs — a tell-tale sign a differentiation created it. Guess whether S is a small integer.
Find the parent series. Recall ∑ n = 1 ∞ n x n − 1 = ( 1 − x ) 2 1 (Example 1, step 1).
Why this step? The factor n in 2 n n screams "I came from differentiating ∑ x n ."
Multiply by x to match the exponent: ∑ n = 1 ∞ n x n = ( 1 − x ) 2 x .
Why this step? Our target has x n (namely x = 2 1 so x n = 1/ 2 n ), not x n − 1 .
Plug x = 2 1 (safely inside R = 1 ): S = ∑ n = 1 ∞ n ( 2 1 ) n = ( 1 − 2 1 ) 2 2 1 = 4 1 2 1 = 2 .
Why this step? Since ∣ x ∣ = 2 1 < 1 sits strictly inside the safe zone, no endpoint subtlety arises — the term-by-term-derived closed form is valid, and it gives the final answer S = 2 .
Verify: partial sum ∑ n = 1 20 2 n n ≈ 1.99998 , converging to 2 . ✓ The final closed form is S = 2 .
Recall Which cell was hardest for you?
Cell D (differentiation losing an endpoint) vs Cell B (integration gaining one) — can you state the one-sentence reason each happens, and why you must check both sides?
Losing: differentiating multiplies coefficients by n , weakening decay, so a borderline endpoint can break. Gaining: integrating divides by n + 1 , strengthening decay, so a borderline endpoint can start converging. ::: And Ex 3/Ex 4 show the two ends can even disagree — so test x = c + R and x = c − R separately, every time.
Recall The scenario matrix, from memory
Name all cells A–H and the endpoint rule they enforce.
A differentiate-positive; B/B′ integrate-gains-endpoint (both sides); C/C′ integrate-conditional (right gained, left lost); D differentiate-loses-endpoint (right lost, left kept); E shifted-centre; F self-returning/degenerate; G word-problem; H exam-twist. ::: In every one, the radius R was unchanged — only endpoints ever flipped, and each of the two endpoints must be tested on its own.
DIRT (from the parent): D ifferentiate/I ntegrate keep the R adius, T est endpoints again — both endpoints, exactly what all cells confirmed.
scenario matrix cells A to H
differentiate cells A D E H
integrate strengthens decay
differentiate weakens decay
test both sides separately