Last week we looked at examples of induction proofs: some sums of series and a couple divisibility proofs. This time, I want to do a couple inequality proofs, and a couple more series, in part to show more of the variety of ways the details of an inductive proof can be handled.
Last week we looked at introductory explanations of what mathematical induction is, including answers to some misunderstandings of the concept. But we only looked at one trivial example of such a proof; for a real understanding of the technique, we need some fuller examples. For that purpose, I have chosen a few questions we have …
Last week’s exploration of a problem involving the Fibonacci sequence, has led me to delve into that and related concepts. In order to say much about the Fibonacci numbers, we have to first explore the concept of proof by mathematical induction. We’ll introduce it here, and then dig deeper next time.