Proofs

Introducing the Fibonacci Sequence

We’ve been examining inductive proof in preparation for the Fibonacci sequence, which is a playground for induction. Here we’ll introduce the sequence, and then prove the formula for the nth term using two different methods, using induction in a way we haven’t seen before.

Inductive Proofs: More Examples

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.