1 / 81

The Fibonacci Numbers And An Unexpected Calculation.

The Fibonacci Numbers And An Unexpected Calculation. Leonardo Fibonacci. In 1202, Fibonacci proposed a problem about the growth of rabbit populations. Leonardo Fibonacci. In 1202, Fibonacci proposed a problem about the growth of rabbit populations. Leonardo Fibonacci.

valasquez
Télécharger la présentation

The Fibonacci Numbers And An Unexpected Calculation.

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. The Fibonacci Numbers And An Unexpected Calculation.

  2. Leonardo Fibonacci • In 1202, Fibonacci proposed a problem about the growth of rabbit populations.

  3. Leonardo Fibonacci • In 1202, Fibonacci proposed a problem about the growth of rabbit populations.

  4. Leonardo Fibonacci • In 1202, Fibonacci proposed a problem about the growth of rabbit populations.

  5. The rabbit reproduction model • A rabbit lives forever • The population starts as a single newborn pair • Every month, each productive pair begets a new pair which will become productive after 2 months old • Fn= # of rabbit pairs at the beginning of the nth month

  6. The rabbit reproduction model • A rabbit lives forever • The population starts as a single newborn pair • Every month, each productive pair begets a new pair which will become productive after 2 months old • Fn= # of rabbit pairs at the beginning of the nth month

  7. The rabbit reproduction model • A rabbit lives forever • The population starts as a single newborn pair • Every month, each productive pair begets a new pair which will become productive after 2 months old • Fn= # of rabbit pairs at the beginning of the nth month

  8. The rabbit reproduction model • A rabbit lives forever • The population starts as a single newborn pair • Every month, each productive pair begets a new pair which will become productive after 2 months old • Fn= # of rabbit pairs at the beginning of the nth month

  9. The rabbit reproduction model • A rabbit lives forever • The population starts as a single newborn pair • Every month, each productive pair begets a new pair which will become productive after 2 months old • Fn= # of rabbit pairs at the beginning of the nth month

  10. The rabbit reproduction model • A rabbit lives forever • The population starts as a single newborn pair • Every month, each productive pair begets a new pair which will become productive after 2 months old • Fn= # of rabbit pairs at the beginning of the nth month

  11. The rabbit reproduction model • A rabbit lives forever • The population starts as a single newborn pair • Every month, each productive pair begets a new pair which will become productive after 2 months old • Fn= # of rabbit pairs at the beginning of the nth month

  12. Inductive Definition or Recurrence Relation for theFibonacci Numbers Stage 0, Initial Condition, or Base Case: Fib(1) = 1; Fib (2) = 1 Inductive Rule For n>3, Fib(n) = Fib(n-1) + Fib(n-2)

  13. Inductive Definition or Recurrence Relation for theFibonacci Numbers Stage 0, Initial Condition, or Base Case: Fib(0) = 0; Fib (1) = 1 Inductive Rule For n>1, Fib(n) = Fib(n-1) + Fib(n-2)

  14. Sneezwort (Achilleaptarmica) Each time the plant starts a new shoot it takes two months before it is strong enough to support branching.

  15. Counting Petals • 5 petals: buttercup, wild rose, larkspur, columbine (aquilegia) 8 petals: delphiniums 13 petals: ragwort, corn marigold, cineraria, some daisies • 21 petals: aster, black-eyed susan, chicory 34 petals: plantain, pyrethrum 55, 89 petals: michaelmas daisies, the asteraceae family.

  16. Pineapple whorls • Church and Turing were both interested in the number of whorls in each ring of the spiral. The ratio of consecutive ring lengths approaches the Golden Ratio.

  17. Bernoulli Spiral When the growth of the organism is proportional to its size

  18. Bernoulli Spiral When the growth of the organism is proportional to its size

  19. Let’s take a break from the Fibonacci Numbers in order to remark on polynomial division.

  20. 1 + X + X2 1 – X 1 -(1 – X) X2 X3 X -(X – X2) -(X2 – X3) 1 + X + X2 + X3 + X4+ X5 + X6 + X7 + … = How to divide polynomials? 1 ? 1 – X …

  21. Xn+1 - 1 1 + X1 + X2 + X 3 + … + Xn-1 + Xn = X- 1 The Geometric Series

  22. Xn+1 - 1 1 + X1 + X2 + X 3 + … + Xn-1 + Xn = X- 1 • The limit as n goes to infinity of = - 1 Xn+1 - 1 X- 1 X- 1 = 1 1 - X

  23. 1 1 + X1 + X2 + X 3 + … + Xn + ….. = 1 - X The Infinite Geometric Series

  24. 1 1 + X1 + X2 + X 3 + … + Xn + ….. = 1 - X • (X-1) ( 1 + X1 + X2 + X 3 + … + Xn + … ) • = X1 + X2 + X 3 + … + Xn + Xn+1 + …. • - 1 - X1 - X2 - X 3 - … - Xn-1 – Xn - Xn+1 - … • = 1

  25. 1 1 + X1 + X2 + X 3 + … + Xn + ….. = 1 - X 1 + X 1 – X 1 -(1 – X) X2 X3 X -(X – X2) + X2 + … -(X2 – X3) …

  26. X + X2 + 2X3 + 3X4 + 5X5 + 8X6 1 – X – X2 X -(X – X2 – X3) X2 + X3 -(X2 – X3 – X4) 2X3 + X4 -(2X3 – 2X4 – 2X5) 3X4 + 2X5 -(3X4 – 3X5 – 3X6) 5X5 + 3X6 8X6 + 5X7 -(5X5 – 5X6 – 5X7) -(8X6 – 8X7 – 8X8) Something a bit more complicated X 1 – X – X2

  27. Hence X • = F0 1 + F1 X1 + F2 X2 +F3 X3 + F4 X4 + F5 X5 + F6 X6 + … 1 – X – X2 • = 01 + 1 X1 + 1 X2 + 2X3 + 3X4 + 5X5 + 8X6 + …

  28. Going the Other Way • (1 - X- X2)  ( F0 1 + F1 X1 + F2 X2 + … + Fn-2 Xn-2 + Fn-1 Xn-1 + Fn Xn + … • = ( F0 1 + F1 X1 + F2 X2 + … + Fn-2 Xn-2 + Fn-1 Xn-1 + Fn Xn + … • - F0 X1 - F1 X2 - … - Fn-3 Xn-2 - Fn-2 Xn-1 - Fn-1 Xn - … • - F0 X2 - … - Fn-4 Xn-2 - Fn-3 Xn-1 - Fn-2 Xn - … • = F0 1 + ( F1 – F0 ) X1 F0 = 0, F1 = 1 = X

  29. Thus • F0 1 + F1 X1 + F2 X2 + … + Fn-1 Xn-1 + Fn Xn + … X = 1 – X – X2

  30. I was trying to get away from them!

  31. Sequences That Sum To n • Let fn+1 be the number of different sequences of 1’s and 2’s that sum to n. • Example: f5 = 5 • 4 = 2 + 2 • 2 + 1 + 1 • 1 + 2 + 1 • 1 + 1 + 2 • 1 + 1 + 1 + 1

  32. Sequences That Sum To n • Let fn+1 be the number of different sequences of 1’s and 2’s that sum to n. f2 = 1 1 = 1 f1 = 1 0 = the empty sum f3 = 2 2 = 1 + 1 2

  33. # of sequences beginning with a 2 # of sequences beginning with a 1 Sequences That Sum To n • Let fn+1 be the number of different sequences of 1’s and 2’s that sum to n. fn+1 = fn + fn-1

  34. Fibonacci Numbers Again • Let fn+1 be the number of different sequences of 1’s and 2’s that sum to n. fn+1 = fn + fn-1 f1 = 1 f2 = 1

  35. Visual Representation: Tiling • Let fn+1 be the number of different ways to tile a 1 X n strip with squares and dominoes.

  36. Visual Representation: Tiling • Let fn+1 be the number of different ways to tile a 1 X n strip with squares and dominoes.

  37. Visual Representation: Tiling • 1 way to tile a strip of length 0 • 1 way to tile a strip of length 1: • 2 ways to tile a strip of length 2:

  38. fn+1 = fn + fn-1 • fn+1 is number of ways to title length n. • fn tilings that start with a square. • fn-1 tilings that start with a domino.

  39. Let’s use this visual representation to prove a couple of Fibonacci identities.

  40. Fibonacci Identities • The Fibonacci numbers have many unusual properties. The many properties that can be stated as equations are called Fibonacci identities. • Ex: Fm+n+1 = Fm+1 Fn+1 + Fm Fn

  41. m n m-1 n-1 Fm+n+1 = Fm+1 Fn+1 + Fm Fn

  42. (Fn)2 = Fn-1 Fn+1 + (-1)n

  43. n-1 (Fn)2 = Fn-1 Fn+1 + (-1)n Fn tilings of a strip of length n-1

  44. n-1 n-1 (Fn)2 = Fn-1 Fn+1 + (-1)n

  45. (Fn)2 = Fn-1 Fn+1 + (-1)n n (Fn)2 tilings of two strips of size n-1

  46. (Fn)2 = Fn-1 Fn+1 + (-1)n n Draw a vertical “fault line” at the rightmost position (<n) possible without cutting any dominoes

  47. (Fn)2 = Fn-1 Fn+1 + (-1)n n Swap the tails at the fault line to map to a tiling of 2 n-1 ‘s to a tiling of an n-2 and an n.

More Related