Math Detours · Grade 6 · Around the corner · 6

Fibonacci and the golden ratio

Add the last two numbers to get the next: 1, 1, 2, 3, 5, 8, 13. This simple rule counts staircases, converts miles to kilometres, and shows up in the seeds of a sunflower.

Name ____________________Date ____________

Tonight's idea

The Fibonacci sequence starts 1, 1 and then every term is the sum of the two before it: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, … We write \(F_n\) for the \(n\)-th Fibonacci number: \(F_1 = 1\), \(F_2 = 1\), \(F_3 = 2\) and so on.

It appears whenever something is built from the two previous steps. Suppose a staircase has \(n\) steps and you climb either 1 or 2 steps at a time. Your last move was either a single step (from step \(n-1\)) or a double (from step \(n-2\)), so the number of ways to climb \(n\) steps is the ways for \(n-1\) plus the ways for \(n-2\). That is the Fibonacci rule, and the counts are 1, 2, 3, 5, 8, 13, …

Now divide each term by the one before: \(\frac{8}{5} = 1.6\), \(\frac{13}{8} = 1.625\), \(\frac{21}{13} = 1.615\ldots\) The ratios settle down toward a number called the golden ratio, \(\varphi = 1.6180339\ldots\) It is the proportion of a rectangle that, when you cut a square off one end, leaves a smaller rectangle of exactly the same shape.

1 by 1 1 byφ − 1 φ 1
Cut a square off a golden rectangle and the leftover (orange) has the same proportions as the whole.

Sunflower seeds grow about 137.5° apart, which is a full turn divided by \(\varphi^2\). That angle packs the seeds as evenly as possible, and the spirals you can count in the head come in Fibonacci pairs: 34 and 55, or 55 and 89. Most real sunflowers do this; some don't. Change the angle at mathdetours.com/demos/sunflower and watch the pattern fall apart.

Watch one: how many ways to climb 5 steps?

One step: 1 way. Two steps: 2 ways (1+1 or 2). Three steps: the last move was a 1 (from step 2, 2 ways) or a 2 (from step 1, 1 way): \(2 + 1 = 3\). Four steps: \(3 + 2 = 5\). Five steps: \(5 + 3 = 8\).

Check by listing all eight: 1-1-1-1-1, 2-1-1-1, 1-2-1-1, 1-1-2-1, 1-1-1-2, 2-2-1, 2-1-2, 1-2-2. The pattern lets you skip the listing for a 20-step staircase, where there are 10,946 ways.

Your turn

Tonight's core: the example and exercises 1 to 3. The rest can wait for another visit.

  1. Write out the first 15 Fibonacci numbers.
  2. How many ways are there to climb a 6-step staircase taking 1 or 2 steps at a time? An 8-step staircase?
  3. Compute \(\frac{21}{13}\), \(\frac{34}{21}\), \(\frac{55}{34}\) and \(\frac{89}{55}\) to three decimal places. Notice that they alternate: one above \(\varphi\), the next below.
  4. Add the first ten Fibonacci numbers. Compare your total with \(F_{12}\). Try the same with the first five and \(F_7\). What is the rule?
  5. Circle the even Fibonacci numbers in your list. Every third one is even and the others are odd. Explain why, using only the facts odd + odd = even, odd + even = odd.
  6. Miles to kilometres. A mile is 1.609 km, and \(\varphi = 1.618\), close enough. So to convert, step forward one Fibonacci number: 5 miles ≈ 8 km, 8 miles ≈ 13 km. Convert 34 miles to km with the trick, then check with a calculator. How would you convert 10 miles? (Hint: 10 = 8 + 2.)

Stretch: the golden rectangle's secret

A golden rectangle has sides \(\varphi\) and 1. Cut a 1 by 1 square off the end. The rectangle left over is 1 by \(\varphi - 1\), and the claim is that it has the same proportions as the original. Write that as an equation: \(\dfrac{\varphi}{1} = \dfrac{1}{\varphi - 1}\). Multiply out and show it means \(\varphi^2 = \varphi + 1\). Check it with \(\varphi = 1.618\) on a calculator. Then try \(\frac{1}{\varphi}\) and see what you notice.

One more: compute \(F_n^2 - F_{n-1}F_{n+1}\) for \(n = 3, 4, 5, 6\). (For \(n = 5\) that is \(5^2 - 3 \times 8\).) Cassini noticed this pattern in 1680, and it has been used to design a card trick where a rectangle appears to lose a square of area.

Answers

  1. 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610.
  2. 6 steps: 13 ways. 8 steps: 34 ways. (The count for \(n\) steps is \(F_{n+1}\).)
  3. 1.615, 1.619, 1.618, 1.618 (more precisely 1.6154, 1.6190, 1.6176, 1.6182: below, above, below, above \(\varphi = 1.6180\)).
  4. First ten sum to 143, and \(F_{12} = 144\). First five sum to 12, and \(F_7 = 13\). The sum of the first \(n\) Fibonacci numbers is \(F_{n+2} - 1\).
  5. Start odd, odd. Odd + odd = even. Then odd + even = odd, even + odd = odd, and now you are back to odd, odd, so the pattern odd, odd, even repeats forever.
  6. 34 miles ≈ 55 km (calculator: 54.7 km). For 10 miles, split into 8 + 2: 13 + 3 = 16 km (calculator: 16.1 km).

Stretch. Cross-multiplying \(\varphi(\varphi - 1) = 1\) gives \(\varphi^2 - \varphi = 1\), so \(\varphi^2 = \varphi + 1\). Check: \(1.618^2 = 2.618\), and \(1.618 + 1 = 2.618\). Also \(1/\varphi = 0.618\), the same digits: dividing the equation by \(\varphi\) gives \(\varphi = 1 + 1/\varphi\). Cassini: \(n=3\): \(4 - 1 \times 3 = 1\). \(n=4\): \(9 - 2 \times 5 = -1\). \(n=5\): \(25 - 3 \times 8 = 1\). \(n=6\): \(64 - 5 \times 13 = -1\). It alternates \(+1, -1\) forever.

← PreviousNext: Pythagoras and square roots →