# Fibonacci

## Fibonacci, Pascal, and Induction

A couple weeks ago, while looking at word problems involving the Fibonacci sequence, we saw two answers to the same problem, one involving Fibonacci and the other using combinations that formed an interesting pattern in Pascal’s Triangle. I promised a proof of the relationship, and it’s time to do that. And while we’re there, since …

## Fibonacci Word Problems II: Challenging

Last week we looked at several basic word problems for which the Fibonacci sequence is part of the solution. Now we’ll look at two problem that take longer to explain: a variation on the rabbit story, and an amazing reverse puzzle.

## Fibonacci Word Problems I: Basic

Here and next week, we’ll look at a collection of word problems we have seen that involve the Fibonacci sequence or its relatives, sometimes on the surface, other times only deep down. The first set (here) are direct representations of Fibonacci, while the second set will be considerably deeper. A 20-foot walkway The first, from …

## Generalizing and Summing the Fibonacci Sequence

Continuing our look at the Fibonacci sequence, we’ll extend the idea to “generalized Fibonacci sequences” (with different starting numbers), and see that the ratio of consecutive terms is the same in general as in the usual special case. Then we’ll look at the sum of terms of both the special and general sequence, turning it …

## A Few Inductive Fibonacci Proofs

Having studied proof by induction and met the Fibonacci sequence, it’s time to do a few proofs of facts about the sequence. We’ll see three quite different kinds of facts, and five different proofs, most of them by induction. We’ll also see repeatedly that the statement of the problem may need correction or clarification, so …

## The Golden Ratio and Fibonacci

We’re looking at the Fibonacci sequence, and have seen connections to a number called phi (φ or $$\phi$$), commonly called the Golden Ratio. I want to look at some geometrical connections and other interesting facts about this number before we get back to the Fibonacci numbers themselves and some inductive proofs involving them.

## 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.