Lessons and exercises follow the school system and stay in its language.Les leçons et les exercices suivent le système scolaire et restent dans sa langue.Lektionen und Übungen folgen dem Schulsystem und bleiben in seiner Sprache.

Sequences and series

Revision sheet

All the summary cards of the chapter on one page. Print it, or save it as a PDF from the print window.

Lesson 2 · Arithmetic sequences

Arithmetic sequences

  • Add dd each time: an=a1+(n−1)da_n = a_1 + (n - 1)d.
  • d=aq−apq−pd = \dfrac{a_q - a_p}{q - p}.

Watch out: n−1n - 1 steps from a1a_1 to ana_n.

Lesson 3 · Geometric sequences

Geometric sequences

  • Multiply by rr each time: an=a1r n−1a_n = a_1 r^{\,n-1}.
  • rr = a term divided by the one before.

Watch out: the exponent is n−1n - 1.

Lesson 4 · Sigma notation and arithmetic series

Arithmetic series

  • ∑k=pq\displaystyle\sum_{k=p}^{q} has q−p+1q - p + 1 terms.
  • Sn=n(a1+an)2S_n = \dfrac{n(a_1 + a_n)}{2}.
  • 1+2+⋯+n=n(n+1)21 + 2 + \dots + n = \dfrac{n(n + 1)}{2}.

Watch out: count the terms with +1+1.

Lesson 5 · Finite geometric series

Finite geometric series

  • Sn=a1 rn−1r−1S_n = a_1\,\dfrac{r^n - 1}{r - 1}.
  • nn is the number of terms; the power is rnr^n.

Watch out: the last term is a1r n−1a_1 r^{\,n-1}, but the sum uses rnr^n.

Lesson 6 · The binomial theorem

The binomial theorem

  • (a+b)n=∑(nk)a n−kb k(a + b)^n = \sum \dbinom{n}{k} a^{\,n-k} b^{\,k}.
  • Coefficients: a row of Pascal's triangle.
  • Include the powers of the constants.

Watch out: (a+b)2≠a2+b2(a + b)^2 \ne a^2 + b^2.

Lesson 7 · Fibonacci sequences and the golden ratio

Fibonacci-type sequences

  • Each term is the sum of the two before.
  • The ratio of consecutive terms tends to φ≈1.618\varphi \approx 1.618.

Spirals in sunflowers and pine cones often show Fibonacci numbers.

Lesson 8 · History of sequences: Zeno, Fibonacci and Gauss

Sequences today

  • Savings and loans grow as geometric sequences.
  • Computer programs repeat steps with recursive rules, like Fibonacci's.
  • Zeno's sums appear whenever a quantity halves again and again, such as radioactive decay.

Sources: MacTutor biographies of Zeno of Elea, Fibonacci and Gauss (see "Sources and credits").

Lesson 9 · Infinite geometric series

Infinite geometric series

  • ∣r∣<1|r| < 1: S=a1−rS = \dfrac{a}{1 - r}.
  • ∣r∣≥1|r| \ge 1: no sum.
  • Repeating decimals are such series.

Watch out: check ∣r∣<1|r| < 1 before using the formula.

Lesson 11 · The integral test and p-series

Integral test, p-series

  • Positive decreasing terms: compare with ∫1∞f\int_1^{\infty} f.
  • ∑1/np\sum 1/n^p: converges iff p>1p > 1.

Watch out: p=1p = 1 diverges.

Lesson 12 · Comparison tests

Comparison tests

  • Below convergent: converges. Above divergent: diverges.
  • Same leading behavior: limit comparison.

Watch out: below a divergent series tells you nothing.

Lesson 13 · Alternating series and the error bound

Alternating series

  • bnb_n decreasing to 0: converges.
  • Error after NN terms ≤bN+1\le b_{N+1}.
  • Absolute vs conditional: test ∑∣an∣\sum |a_n|.

Watch out: the bound uses the first omitted term.

Lesson 15 · Choosing a convergence test

Choosing a test

nth-term → known series → alternating → ratio → comparison → integral.

Watch out: a divergent absolute series does not make an alternating series diverge.

Lesson 16 · Taylor polynomials

Taylor polynomials

Pn(x)=∑k=0nf(k)(a)k!(x−a)kP_n(x) = \displaystyle\sum_{k=0}^{n} \dfrac{f^{(k)}(a)}{k!}(x - a)^k.

Watch out: divide by k!k!; use powers of (x−a)(x - a).

Lesson 17 · The Lagrange error bound

Lagrange error bound

∣Rn∣≤M∣x−a∣n+1(n+1)!|R_n| \le \dfrac{M|x - a|^{n+1}}{(n + 1)!}, M≥∣f(n+1)∣M \ge |f^{(n+1)}|.

Watch out: n+1n + 1 everywhere.

Lesson 20 · New series from known ones

New series from old

  • Multiply by xkx^k: shift the powers.
  • Substitute: replace xx by u(x)u(x).
  • Differentiate or integrate term by term.

Watch out: integrating divides by the new power.