Business Mathematics and Statistics · Ch 2 — Algebra (Partial Fractions, Permutations, Combinations, Mathematical Induction, Binomial Theorem)
Mathematical Induction — Applications to Summation and Divisibility
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 , or , is proved by: (i) checking the formula at ; (ii) assuming it holds for ; (iii) adding the next term, or 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 replaced by .
Divisibility results. A claim of the form " is divisible by for every natural number " is proved by: (i) checking is divisible by ; (ii) assuming for some integer ; (iii) expressing in terms of (typically by adding and subtracting a term so that appears explicitly), and showing that what remains, after substituting , is still a multiple of . …
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 …
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 …