Lesson plan
Mathematical induction
. Mathematical induction is a method for proving that a statement P(n) is true for every natural number n , that is, that the infinitely many cases P(0), P(1), P(2), P(3), \dots   all hold. This is done by first proving a simple case, then also showing that if we assume the claim is true for a given case, then the next case is also true. Informal metaphors help to explain this technique, such as falling dominoes or climbing a ladder: A proof by induction consists of two cases. The first, the base case, proves the statement for n = 0 without assuming any knowledge of other cases. The second case, the induction step, proves that if the statement holds for any given case n = k , then it must also hold for the next case n = k + 1 . These two steps establish that the statement holds for every natural number n . The base case does not necessarily begin with n = 0 , but often with n = 1 , and possibly with any fixed natural number n = N , establishing the truth of the statement for all natural numbers n \geq N . The method can be extended to prove statements about more general well-founded structures, such as trees; this generalization, known as structural induction, is used in mathematical logic and computer science. Mathematical induction in this extended sense is closely related to recursion.…
Article summary
. Mathematical induction is a method for proving that a statement P(n) is true for every natural number n , that is, that the infinitely many cases P(0), P(1), P(2), P(3), \dots   all hold. This is done by first proving a simple case, then also showing that if we assume the claim is true for a given case, then the next case is also true. Informal metaphors help to explain this technique, such as falling dominoes or climbing a ladder: A proof by induction consists of two cases. The first, the base case, proves the statement for n = 0 without assuming any knowledge of other cases. The second case, the induction step, proves that if the statement holds for any given case n = k , then it must also hold for the next case n = k + 1 . These two steps establish that the statement holds for every natural number n . The base case does not necessarily begin with n = 0 , but often with n = 1 , and possibly with any fixed natural number n = N , establishing the truth of the statement for all natural numbers n \geq N . The method can be extended to prove statements about more general well-founded structures, such as trees; this generalization, known as structural induction, is used in mathematical logic and computer science. Mathematical induction in this extended sense is closely related to recursion.…
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.