MATH1010 · Method · Chapter 1 · 1. Functions, sequences and finite proof tools
Mathematical induction
0 steps of prerequisites below it
To prove P(n) for every integer n ≥ n₀, prove the base case and show that P(k) implies P(k + 1); the principle is equivalent to the least-element property of the positive integers.
Taught in
- 1.2 Induction and finite binomial tools · introduced
- 4.6 Tangent iteration and a certified square root · applied
Builds on
Nothing in the notes sits below this point: it is a starting point.
The same idea in other courses
- Mathematical induction MATH1020
- Ordinary induction from an arbitrary start MATH1025
- Mathematical induction MATH1050
Used by
Possible roots and a review route need your own answers on these points. None are recorded yet, so none are suggested.
Longest chain down to a starting point
Nothing is recorded below this point: it is a starting point.