1.3 Sequences, Series & Summation Notation

1.3 Sequences, Series & Summation Notation

Discrete mathematics bridges secondary algebra and continuous calculus. Sequences and series allow high school students to explore patterns, discrete dynamical systems, limits, and summation operators. For accomplished secondary mathematics teachers, mastering the rigorous algebraic derivations of summation formulas and anticipating student conceptual traps—such as confusing terms with partial sums or misapplying convergence criteria—is central to effective pedagogical leadership.

---

1. Sequence Foundations: Explicit vs. Recursive Formulations

A sequence is formally defined as a function $a: \mathbb{Z}^+ \to \mathbb{R}$ whose domain is the set of positive integers $\{1, 2, 3, \dots\}$. The function value $a(n)$ is written using subscript notation as $a_n$, denoting the $n$-th term. A series is the indicated sum of the terms of a sequence, with the sequence of partial sums defined by $S_n = \sum_{k=1}^n a_k = a_1 + a_2 + \dots + a_n$.

Accomplished teachers help students transition between these representations. For instance, the first-order linear recurrence $a_n = r a_{n-1} + d$ models loan amortization balances, annuity growth, and drug clearance in pharmacokinetics, which can be solved into an explicit closed-form geometric-arithmetic sum.

---

2. Arithmetic Progressions & Gauss Summation

An arithmetic sequence has a constant common difference $d$ between consecutive terms:

$$a_n - a_{n-1} = d \implies a_n = a_1 + (n - 1)d$$

Derivation of the Partial Sum Formula $S_n$

The derivation of the arithmetic series sum formula illustrates mathematical symmetry and historical elegance (associated with young Carl Friedrich Gauss). Write the sum forward and backward:

$$S_n = a_1 + (a_1 + d) + (a_1 + 2d) + \dots + a_n$$ $$S_n = a_n + (a_n - d) + (a_n - 2d) + \dots + a_1$$

Adding these two equations column-by-column produces $n$ pairs, each summing to $(a_1 + a_n)$:

$$2S_n = (a_1 + a_n) + (a_1 + a_n) + \dots + (a_1 + a_n) = n(a_1 + a_n)$$

Dividing by 2 yields the celebrated summation formula:

$$S_n = \frac{n(a_1 + a_n)}{2} = \frac{n}{2}[2a_1 + (n - 1)d]$$

Geometric & Continuous Interpretation

The formula $S_n = n \left(\frac{a_1 + a_n}{2}\right)$ states that the sum of an arithmetic progression equals the number of terms multiplied by the average of the first and last terms. Geometrically, this corresponds to the area of a trapezoid with height $n$ and parallel bases $a_1$ and $a_n$. It represents the exact discrete analogue of evaluating the definite integral of a linear function $\int_0^n (mx + b)dx$.

---

3. Geometric Progressions, Finite Sums & Infinite Convergence

A geometric sequence has a constant common ratio $r$ between successive terms:

$$\frac{a_n}{a_{n-1}} = r \implies a_n = a_1 r^{n-1}$$

Algebraic Derivation of the Finite Geometric Sum

To evaluate $S_n = a_1 + a_1 r + a_1 r^2 + \dots + a_1 r^{n-1}$, multiply the entire expression by $r$:

$$r S_n = a_1 r + a_1 r^2 + a_1 r^3 + \dots + a_1 r^n$$

Subtracting $r S_n$ from $S_n$ results in a telescoping cancellation of all intermediate terms:

$$S_n - r S_n = a_1 - a_1 r^n \implies S_n(1 - r) = a_1(1 - r^n)$$

For $r \ne 1$, dividing by $(1 - r)$ establishes the finite sum formula:

$$S_n = \frac{a_1(1 - r^n)}{1 - r} = \frac{a_1(r^n - 1)}{r - 1}$$

Infinite Geometric Series and the Convergence Criterion

The infinite geometric series $\sum_{k=1}^\infty a_1 r^{k-1}$ is defined as the limit of its partial sums as $n \to \infty$:

$$S = \lim_{n \to \infty} S_n = \lim_{n \to \infty} \frac{a_1(1 - r^n)}{1 - r} = \frac{a_1}{1 - r} \left(1 - \lim_{n \to \infty} r^n\right)$$

The convergence of the series is governed entirely by the asymptotic behavior of $\lim_{n \to \infty} r^n$:

1. Convergence ($|r| < 1$): If $-1 < r < 1$, then $\lim_{n \to \infty} r^n = 0$. The series converges to:

$$S = \frac{a_1}{1 - r}$$

1. Divergence ($|r| \ge 1$):
   • If $r > 1$, $r^n \to \infty$, so $S_n$ diverges without bound.
   • If $r \le -1$, $r^n$ oscillates with non-vanishing or growing magnitude; the partial sums fail to converge.
   • If $r = 1$, $S_n = n a_1$, which diverges to $\pm\infty$ for $a_1 \ne 0$.

Application: Converting Repeating Decimals to Fractions

Infinite geometric series provide the analytical proof that every repeating decimal is a rational number. For example, $0.\overline{27} = 0.272727\dots = \frac{27}{100} + \frac{27}{100^2} + \frac{27}{100^3} + \dots$ Here $a_1 = \frac{27}{100}$ and $r = \frac{1}{100} < 1$:

$$S = \frac{\frac{27}{100}}{1 - \frac{1}{100}} = \frac{\frac{27}{100}}{\frac{99}{100}} = \frac{27}{99} = \frac{3}{11}$$

---

4. Sigma Notation, Index Shifting & Telescoping Series

Sigma notation compacts long summations and obeys rigorous operational rules:

Core Properties of $\Sigma$

• Linearity: $\sum_{k=m}^n (c \cdot a_k + b_k) = c \sum_{k=m}^n a_k + \sum_{k=m}^n b_k$
• Term Counting: The number of terms in $\sum_{k=m}^n a_k$ is $N = n - m + 1$ (inclusive counting).
• Index Shifting: A summation index can be translated by an integer offset $p$:

$$\sum_{k=m}^n a_k = \sum_{j=m+p}^{n+p} a_{j-p}$$

Increasing the summation bounds by $p$ requires replacing $k$ with $j - p$ in the summand.

Telescoping Series and Partial Fractions

A series telescopes when its general term decomposes into a difference $a_k = b_k - b_{k+1}$:

$$\sum_{k=1}^n (b_k - b_{k+1}) = (b_1 - b_2) + (b_2 - b_3) + \dots + (b_n - b_{n+1}) = b_1 - b_{n+1}$$

Worked Example: Evaluate $\sum_{k=1}^\infty \frac{1}{k(k+1)}$. Using partial fractions: $\frac{1}{k(k+1)} = \frac{1}{k} - \frac{1}{k+1}$. The $n$-th partial sum is $S_n = (1 - \frac{1}{2}) + (\frac{1}{2} - \frac{1}{3}) + \dots + (\frac{1}{n} - \frac{1}{n+1}) = 1 - \frac{1}{n+1}$. Taking the limit as $n \to \infty$: $S = \lim_{n \to \infty} (1 - \frac{1}{n+1}) = 1 - 0 = 1$.

---

5. Pedagogical Traps & Instructional Interventions

Secondary students encounter three predictable misconceptions when learning sequences and series:

Trap 1: Confusing Sequence Terms $a_n$ with Series Partial Sums $S_n$

Students frequently conflate the value of an isolated term $a_n$ with the cumulative partial sum $S_n$.

• Pedagogical Intervention: Emphasize the fundamental recovery identity:

$$a_1 = S_1, \quad \text{and} \quad a_n = S_n - S_{n-1} \quad \text{for } n \ge 2$$

Classroom Problem: If $S_n = 2n^2 + 5n$, find $a_n$.

$$a_n = (2n^2 + 5n) - [2(n-1)^2 + 5(n-1)] = 2n^2 + 5n - [2(n^2 - 2n + 1) + 5n - 5] = 4n + 3$$

Verify that $a_1 = 4(1) + 3 = 7$ matches $S_1 = 2(1)^2 + 5(1) = 7$.

Trap 2: Blindly Applying $S = \frac{a_1}{1 - r}$ to Divergent Series

Students often mechanically apply $S = \frac{a_1}{1 - r}$ to series where $|r| \ge 1$:

$$1 + 2 + 4 + 8 + \dots \stackrel{?}{=} \frac{1}{1 - 2} = -1 \quad (\text{ABSURD})$$

• Pedagogical Intervention: Show students that the infinite formula is derived from $\lim_{n \to \infty} r^n = 0$, which holds only when $|r| < 1$. Emphasize that adding infinite positive quantities cannot produce a negative number, highlighting the strict boundary between convergent limits and divergent sequences.

Trap 3: Off-By-One Errors in Counting Terms

When evaluating $\sum_{k=3}^{10} 5$, students often compute $(10 - 3) \times 5 = 35$.

• Pedagogical Intervention: Use fencepost reasoning: the number of terms is $(10 - 3 + 1) = 8$, yielding $8 \times 5 = 40$.