4.3.17 · D5Calculus III — Sequences & Series

Question bank — Maclaurin series of eˣ, sin x, cos x, ln(1+x), (1+x)ⁿ — derive all

1,517 words7 min readBack to topic

True or false — justify

A Maclaurin series always equals the function it came from
False. It only equals the function inside its interval of convergence; outside, the polynomial diverges even where the function is perfectly finite (see from at ). Look at figure s01 — the partial sums hug the curve near and then peel away.
Every infinitely-differentiable function equals its Maclaurin series near
False. (with ) has all derivatives zero at , so its Maclaurin series is , yet the function is nonzero — the series is right only for analytic functions. Figure s03 shows why: the graph flattens against the axis faster than any polynomial can detect.
The series for converges for every real
True. The factorial denominator eventually outgrows for any fixed , so terms shrink to fast enough — the radius of convergence is infinite.
has no odd-power terms because they cancel out during addition
False. There is nothing to cancel — the odd derivatives of are literally at (, etc.), so those coefficients are born as zero.
The denominators in are
False. They are factorials ; the smaller-looking is just written out, an easy misread.
is always an infinite series
False. With as the term counter, the numerator contains the factor once for a non-negative integer , so every later is zero and the series terminates — the ordinary binomial theorem.
The Maclaurin series and the Taylor series are different formulas
False. Maclaurin is exactly the Taylor series with centre ; same machinery, special base point.
Truncating a Maclaurin series always gives an over-estimate
False. The sign of the error depends on the next term's sign. For with the terms alternate, so a partial sum can lie above or below depending on where you stop.

Spot the error

", so the constant term is ."
Wrong. The constant term is ; there is no leading . The series starts at the term: .
"Coefficients of a Maclaurin series are just the derivatives at : ."
Missing the . Here is the weight of from the definition above. Since , the surviving term is , giving .
""
Sign error. Using the Geometric series with ratio gives alternating signs: . The all-plus version is .
""
Sign of the quadratic term is wrong. The coefficient is , so it is — negative because makes negative.
"Since is finite, I can compute it by plugging into the series."
The function value exists, but the series only converges for . At the polynomial diverges; you would need a different centre or identity. Figure s02 puts this interval on a number line.
" so ."
Wrong sign placement. Substitute : , which alternates. Only the odd terms change sign, not every term uniformly.
"Differentiating term by term should give ; let me check: — but starts with , contradiction."
No contradiction: , so is . Differentiating the sine series does reproduce the cosine series correctly.

Why questions

Why divide each derivative by at all?
Because ; without dividing, the piece would contribute instead of , so we compensate to make coefficients match the derivatives cleanly.
Why does putting isolate one coefficient at a time?
Every term still containing an vanishes (), leaving only the constant term of that particular derivative — a clean one-equation-one-unknown extraction.
Why is the "cleanest" series to derive?
Because , so every derivative at equals ; all numerators are the same, leaving only .
Why does contain only odd powers?
is an odd function (), and only odd-power monomials share that symmetry; the even-power coefficients must be zero to preserve it.
Why derive by integrating a geometric series instead of repeated differentiation?
Because is already a known geometric series; integrating it term-by-term is far cleaner than computing higher derivatives of a logarithm.
Why does the series converge at but not at ?
At it becomes the alternating harmonic series (converges to ); at it becomes the negative harmonic series , which diverges — mirroring . See the closed/open endpoints in figure s02.
Why does combining the three series , , produce Euler's formula?
Substituting into splits the terms by parity: real even-power terms rebuild and imaginary odd-power terms rebuild , giving .
Why can series speed up limit problems like [[L'Hôpital & limits via series|]]?
Replace by ; then instantly, no repeated differentiation needed.

Edge cases

What is the Maclaurin series of a polynomial like ?
It is the polynomial itself — a finite series. Its higher derivatives vanish, so all coefficients beyond degree are zero; it is already "its own" series.
At the boundary , does the binomial series still work for ?
is finite and the series does converge there for , but convergence is delicate at endpoints and depends on the sign of ; the safe interior guarantee is (the shaded band in figure s02).
What happens to when ?
The function is the constant ; the series collapses to its first term (recall is the weight of , and here only survives) and all further coefficients are zero — consistent with the terminating integer case.
Does 's series predict correctly?
Yes. Setting kills every power term, leaving the constant — the built-in sanity check that the constant coefficient equals .
What is the Maclaurin "series" of (no )?
It has none centred at : is undefined at , so no derivatives exist there. That is precisely why we expand instead, shifting the trouble to .
What if is large but the function is well-behaved — say ?
The series still converges (infinite radius), but you need many terms because only starts shrinking once ; convergence is guaranteed, not necessarily fast.

Recall One-line self-test

Cover every answer above and re-argue the three you found hardest. If your justification is "because the formula says so," you have found a trap you have not yet defused — go back to the derivation note.