The Fibonacci Sequence

Transcription

1 The Fibonacci Sequence MATH 100 Survey of Mathematical Ideas J. Robert Buchanan Department of Mathematics Summer 2018

2 The Fibonacci Sequence In 1202 Leonardo of Pisa (a.k.a Fibonacci) wrote a problem in a mathematics book: A man put a pair of rabbits in a cage. During the first month the rabbits produced no offspring, but each month thereafter produced one new pair of rabbits. If each new pair thus produced reproduces in the same manner, how many pairs of rabbits will there be at the end of one year?

3 The Fibonacci Sequence January February March April May June July August September October November December

4 The Fibonacci Sequence January 1 February March April May June July August September October November December

5 The Fibonacci Sequence January 1 February 1 March April May June July August September October November December

6 The Fibonacci Sequence January 1 February 1 March 2 April May June July August September October November December

7 The Fibonacci Sequence January 1 February 1 March 2 April 3 May June July August September October November December

8 The Fibonacci Sequence January 1 February 1 March 2 April 3 May 5 June July August September October November December

9 The Fibonacci Sequence January 1 February 1 March 2 April 3 May 5 June 8 July August September October November December

10 The Fibonacci Sequence January 1 February 1 March 2 April 3 May 5 June 8 July 13 August 21 September 34 October 55 November 89 December 144

11 Recursion Formula Let F n represent the Fibonacci number in the nth position in the sequence, then F 1 = 1 F 2 = 1 F n = F n 2 + F n 1 for n 3. The last equation is known as a recursion formula and defines new elements in the sequence in terms of elements that appeared earlier.

12 Recursion Formula Let F n represent the Fibonacci number in the nth position in the sequence, then F 1 = 1 F 2 = 1 F n = F n 2 + F n 1 for n 3. The last equation is known as a recursion formula and defines new elements in the sequence in terms of elements that appeared earlier. The Fibonacci sequence has many interesting phenomena associated with it.

13 Using the Recursion Formula In our earlier list we saw F 11 = 89 and F 12 = 144, so F 13 = F 11 + F 12 = = 233.

14 Using the Recursion Formula In our earlier list we saw F 11 = 89 and F 12 = 144, so F 13 = F 11 + F 12 = = 233. Use your i>clicker to enter 1. F 20

15 Using the Recursion Formula In our earlier list we saw F 11 = 89 and F 12 = 144, so F 13 = F 11 + F 12 = = 233. Use your i>clicker to enter 1. F F 22

16 Using the Recursion Formula In our earlier list we saw F 11 = 89 and F 12 = 144, so F 13 = F 11 + F 12 = = 233. Use your i>clicker to enter 1. F F F 25

17 Using the Recursion Formula In our earlier list we saw F 11 = 89 and F 12 = 144, so F 13 = F 11 + F 12 = = 233. Use your i>clicker to enter 1. F F F F 30

18 Fibonacci Behavior 1. Choose any Fibonacci number after the first one. Square your choice. 2. Multiply the Fibonacci numbers immediately before and after your choice. 3. Subtract the smaller number from the larger. What is your result?

19 Fibonacci Behavior 1. Choose any Fibonacci number after the first one. Square your choice. 2. Multiply the Fibonacci numbers immediately before and after your choice. 3. Subtract the smaller number from the larger. What is your result? F 12 = 144 F12 2 = = F 13 F 11 = (89)(233) = = 1

20 Observation (1 of 2) Find the sum of the squares of the first n Fibonacci numbers and examine the pattern.

21 Observation (1 of 2) Find the sum of the squares of the first n Fibonacci numbers and examine the pattern. F 2 1 = 1 2 F F 2 2 = F F F 2 3 = F F F F 2 4 = F F F F F 2 5 =

22 Observation (2 of 2) 1 2 = = = = = 40.

23 Observation (2 of 2) 1 2 = 1 = 1 1 = F 1 F = = = = 40.

24 Observation (2 of 2) 1 2 = 1 = 1 1 = F 1 F = 2 = 1 2 = F 2 F = = = 40.

25 Observation (2 of 2) 1 2 = 1 = 1 1 = F 1 F = 2 = 1 2 = F 2 F = 6 = 2 3 = F 3 F = = 40.

26 Observation (2 of 2) 1 2 = 1 = 1 1 = F 1 F = 2 = 1 2 = F 2 F = 6 = 2 3 = F 3 F = 15 = 3 5 = F 4 F = 40.

27 Observation (2 of 2) 1 2 = 1 = 1 1 = F 1 F = 2 = 1 2 = F 2 F = 6 = 2 3 = F 3 F = 15 = 3 5 = F 4 F = 40 = 5 8 = F 5 F 6.

28 Fibonacci Sequence in Fractions (1 of 2) Since F 11 = 89 consider the fraction 1/89.

29 Fibonacci Sequence in Fractions (1 of 2) Since F 11 = 89 consider the fraction 1/ =

30 Fibonacci Sequence in Fractions (2 of 2) = 1/89

31 Fibonacci Sequence in Pine Cones Consider the clockwise and counter-clockwise spirals of scales starting from the center on a pinecone. How many of each are there?

32 Two-Dimensional Pine Cone

33 Clockwise Spirals

34 Counter-clockwise Spirals

35 Honey Bees Male honeybees have only one parent (female). Female honeybees have two parents (female/male). The number of bees in each generation follows the Fibonacci sequence. Beginning with the 2nd generation, the number of female bees follows the Fibonacci sequence. Beginning with the 3rd generation, the number of male bees follows the Fibonacci sequence.

36 The Golden Ratio Consider the quotients of successive Fibonacci numbers. 1 1 = = = = = = = = = 1.618

37 The Golden Ratio Consider the quotients of successive Fibonacci numbers. 1 1 = = = = = 1.6 The quotients approach the number 13 8 = = = = which is known as the golden ratio.

38 Proof F n+1 F n = F n + F n 1 F n φ = φ φ 2 φ 1 = 0 = 1 + F n 1 F n φ = 1 ± 1 4(1)( 1) 2 φ =

39 Golden Rectangle (1 of 3) A golden rectangle is one that can be divided into a square and another smaller rectangle the same shape as the original rectangle. W L L+W L L L

40 Golden Rectangle (2 of 3) Let the edge of the square be length L and let the height of the smaller rectangle be W, then L W = L + W L L W = L L + W L φ = φ φ =

41 Golden Rectangle (3 of 3) Artists, architects, and designers frequently use the golden rectangle.

42 Spiral