Skip to content

Business Mathematics and Statistics · Ch 2 — Algebra (Partial Fractions, Permutations, Combinations, Mathematical Induction, Binomial Theorem)

Mathematical Induction — Applications to Summation and Divisibility

8

Mathematical Induction — Applications to Summation and Divisibility

The Principle of Mathematical Induction is applied in this chapter to two standard classes of results.

Summation formulas. A claim of the form 1+2+⋯+n=n(n+1)21+2+\cdots+n = \dfrac{n(n+1)}{2}, or 12+22+⋯+n2=n(n+1)(2n+1)61^2+2^2+\cdots+n^2 = \dfrac{n(n+1)(2n+1)}{6}, is proved by: (i) checking the formula at n=1n=1; (ii) assuming it holds for n=kn=k; (iii) adding the next term, (k+1)(k+1) or (k+1)2(k+1)^2 as the case may be, to both the assumed sum and the assumed formula, and showing through algebraic simplification that the result is exactly the original formula with nn replaced by k+1k+1.

Divisibility results. A claim of the form "f(n)f(n) is divisible by dd for every natural number nn" is proved by: (i) checking f(1)f(1) is divisible by dd; (ii) assuming f(k)=d⋅mf(k) = d \cdot m for some integer mm; (iii) expressing f(k+1)f(k+1) in terms of f(k)f(k) (typically by adding and subtracting a term so that f(k)f(k) appears explicitly), and showing that what remains, after substituting f(k)=dmf(k)=dm, is still a multiple of dd. …

Definition 1Summation proof by induction

Proving a formula for the sum of the first n terms of a sequence by adding the (k+1)th term to the assumed k-term formula and simplifying to match the fo …

Definition 2Divisibility proof by induction

Proving f(n) is always divisible by a fixed number d by expressing f(k+1) in terms of the assumed multiple f(k)=dm and showing the resulting expressio …