fibonacci numbers in nature
play

Fibonacci numbers in nature Kenneth L. Ho 1 Courant Institute, New - PowerPoint PPT Presentation

Fibonacci numbers in nature Kenneth L. Ho 1 Courant Institute, New York University cSplash 2011 1 ho@courant.nyu.edu What are the Fibonacci numbers? What are the Fibonacci numbers? 0 , 1 , 1 , 2 , 3 , 5 , 8 , 13 , 21 , 34 , 55 , 89 , 144 , . . .


  1. Fibonacci numbers in nature Kenneth L. Ho 1 Courant Institute, New York University cSplash 2011 1 ho@courant.nyu.edu

  2. What are the Fibonacci numbers?

  3. What are the Fibonacci numbers? 0 , 1 , 1 , 2 , 3 , 5 , 8 , 13 , 21 , 34 , 55 , 89 , 144 , . . .

  4. What are the Fibonacci numbers? 0 , 1 , 1 , 2 , 3 , 5 , 8 , 13 , 21 , 34 , 55 , 89 , 144 , . . .

  5. What are the Fibonacci numbers? 0 , 1 , 1 , 2 , 3 , 5 , 8 , 13 , 21 , 34 , 55 , 89 , 144 , . . . One of these is not exactly related to the Fibonacci numbers.

  6. A little history Studied in India as early as 200 BC

  7. A little history Studied in India as early as 200 BC Introduced to the West by Leonardo of Pisa (Fibonacci) in Liber Abaci (1202) Leonardo of Pisa c. 1170 – c. 1250

  8. A little history Studied in India as early as 200 BC Introduced to the West by Leonardo of Pisa (Fibonacci) in Liber Abaci (1202) “Book of Calculation” Described Hindu-Arabic numerals Used Fibonacci numbers to model rabbit population growth Leonardo of Pisa c. 1170 – c. 1250

  9. Bunnies! Model assumptions One male-female pair originally Each pair able to mate at one month, mating each month thereafter Each mating produces one new pair after one month

  10. Bunnies! Model assumptions One male-female pair originally Each pair able to mate at one month, mating each month thereafter Each mating produces one new pair after one month How many pairs are there after n months?

  11. Fibonacci bunnies month 1 2 3 4 5 6 7 8 · · · n pairs 1 Month 1 One pair originally

  12. Fibonacci bunnies month 1 2 3 4 5 6 7 8 · · · n pairs 1 1 Month 2 From last month: 1 Newly born: 0

  13. Fibonacci bunnies month 1 2 3 4 5 6 7 8 · · · n pairs 1 1 2 Month 3 From last month: 1 Newly born: 1

  14. Fibonacci bunnies month 1 2 3 4 5 6 7 8 · · · n pairs 1 1 2 3 Month 4 From last month: 2 Newly born: 1

  15. Fibonacci bunnies month 1 2 3 4 5 6 7 8 · · · n pairs 1 1 2 3 5 Month 5 From last month: 3 Newly born: 2

  16. Fibonacci bunnies month 1 2 3 4 5 6 7 8 · · · n pairs 1 1 2 3 5 8 Month 6 From last month: 5 Newly born: 3

  17. Fibonacci bunnies month 1 2 3 4 5 6 7 8 · · · n pairs 1 1 2 3 5 8 13 Month 7 From last month: 8 Newly born: 5

  18. Fibonacci bunnies month 1 2 3 4 5 6 7 8 · · · n pairs 1 1 2 3 5 8 13 21 Month 8 From last month: 13 Newly born: 8

  19. Fibonacci bunnies month 1 2 3 4 5 6 7 8 · · · n pairs 1 1 2 3 5 8 13 21 · · · F n Month n From last month: F n − 1 Newly born: F n − 2

  20. Fibonacci bunnies month 1 2 3 4 5 6 7 8 · · · n pairs 1 1 2 3 5 8 13 21 · · · F n F 1 = F 2 = 1 (seed values) F n = F n − 1 + F n − 2 (recurrence relation)

  21. Fibonacci bunnies month 1 2 3 4 5 6 7 8 · · · n pairs 1 1 2 3 5 8 13 21 · · · F n F 0 = 0 , F 1 = 1 (seed values) F n = F n − 1 + F n − 2 (recurrence relation)

  22. Fibonacci bunnies month 1 2 3 4 5 6 7 8 · · · n pairs 1 1 2 3 5 8 13 21 · · · F n F 0 = 0 , F 1 = 1 (seed values) F n = F n − 1 + F n − 2 (recurrence relation) Note that the rabbit model is unrealistic (why?), but we will see a real instance where the Fibonacci numbers show up very shortly.

  23. Fibonacci numbers in nature 0 1 2 3 4 5 6 7 8 9 10 11 n · · · 0 1 1 2 3 5 8 13 21 34 55 89 F n · · ·

  24. Fibonacci numbers in nature 0 1 2 3 4 5 6 7 8 9 10 11 n · · · 0 1 1 2 3 5 8 13 21 34 55 89 F n · · · Number of spirals Clockwise: 13 Counterclockwise: 8

  25. Fibonacci numbers in nature 0 1 2 3 4 5 6 7 8 9 10 11 n · · · 0 1 1 2 3 5 8 13 21 34 55 89 F n · · · Number of spirals Clockwise: 21 Counterclockwise: 34

  26. Fibonacci numbers in nature 0 1 2 3 4 5 6 7 8 9 10 11 n · · · 0 1 1 2 3 5 8 13 21 34 55 89 F n · · · Number of spirals Clockwise: 13 Counterclockwise: 8

  27. Fibonacci numbers in nature 0 1 2 3 4 5 6 7 8 9 10 11 n · · · 0 1 1 2 3 5 8 13 21 34 55 89 F n · · · So where do the Fibonacci numbers come from?

  28. A crash course on plant growth Central turning growing tip Emits new seed head, floret, leaf bud, etc. every α turns Seed heads grow outward with time

  29. A crash course on plant growth α = 1 / 4 α = 1 / 5

  30. From a plant’s perspective What’s wrong with this growth pattern?

  31. From a plant’s perspective What’s wrong with this growth pattern? Too much wasted space!

  32. From a plant’s perspective

  33. From a plant’s perspective

  34. From a plant’s perspective What’s wrong with this growth pattern? Too much wasted space! Want to maximize exposure to sunlight, dew, CO 2

  35. From a plant’s perspective What’s wrong with this growth pattern? Too much wasted space! Want to maximize exposure to sunlight, dew, CO 2 Evolve for optimal packing

  36. Floral showcase α = 1 / 4 α = 1 / 5 α = 1 / 7 α = 2 / 3 α = 3 / 4 α = 5 / 8

  37. Rationality is not always good Definition A rational number is a number that can be expressed as a fraction m / n , where m and n are integers.

  38. Rationality is not always good Definition A rational number is a number that can be expressed as a fraction m / n , where m and n are integers. Can we get a good covering with α = m / n ?

  39. Rationality is not always good Definition A rational number is a number that can be expressed as a fraction m / n , where m and n are integers. Can we get a good covering with α = m / n ? The answer is no.

  40. Rationality is not always good Definition A rational number is a number that can be expressed as a fraction m / n , where m and n are integers. Can we get a good covering with α = m / n ? The answer is no. Why? Growing tip makes m revolutions every n seeds Growth pattern repeats after n seeds At most n “rays” of seeds

  41. Floral showcase redux (rational) α = 1 / 4 α = 1 / 5 α = 1 / 7 α = 2 / 3 α = 3 / 4 α = 5 / 8

  42. Floral showcase (irrational) √ α = 1 /π α = 1 / e α = 1 / 2

  43. Floral showcase (irrational) √ α = 1 /π α = 1 / e α = 1 / 2 “Less” irrational ⇐ ⇒ “More” irrational Some irrationals work better than others. What is the “most” irrational number?

  44. The golden ratio Mathematically, a + b = a b ≡ ϕ. a How to solve for ϕ ?

  45. The golden ratio a + b = a 1 Given: b ≡ ϕ a

  46. The golden ratio a + b = a 1 Given: b ≡ ϕ a 1 + b 2 Simplify: a = ϕ

  47. The golden ratio a + b = a 1 Given: b ≡ ϕ a 1 + b 2 Simplify: a = ϕ 1 + 1 3 Substitute: ϕ = ϕ

  48. The golden ratio a + b = a 1 Given: b ≡ ϕ a 1 + b 2 Simplify: a = ϕ 1 + 1 3 Substitute: ϕ = ϕ ϕ 2 − ϕ − 1 = 0 4 Rearrange:

  49. The golden ratio a + b = a 1 Given: b ≡ ϕ a 1 + b 2 Simplify: a = ϕ 1 + 1 3 Substitute: ϕ = ϕ ϕ 2 − ϕ − 1 = 0 4 Rearrange: √ ϕ = 1 + 5 5 Quadratic formula: 2

  50. The golden ratio a + b = a 1 Given: b ≡ ϕ a 1 + b 2 Simplify: a = ϕ 1 + 1 3 Substitute: ϕ = ϕ ϕ 2 − ϕ − 1 = 0 4 Rearrange: √ ϕ = 1 + 5 5 Quadratic formula: 2 The number ϕ ≈ 1 . 618 . . . is called the golden ratio.

  51. The golden ratio: a broader perspective Studied since antiquity First defined by Euclid ( Elements , c. 300 BC) Associated with perceptions of beauty Applications in art and architecture

  52. The golden ratio in plant growth α = 1 /ϕ

  53. The golden ratio in plant growth

  54. The golden ratio in plant growth α = 1 /ϕ ≈ 222 . 5 ◦ α = 222 . 4 ◦ α = 222 . 6 ◦ Nature seems to have found ϕ quite precisely!

  55. Some properties of irrational numbers Theorem Every irrational number can be written as a continued fraction 1 a 0 + 1 a 1 + a 2 + ... or, for short, [ a 0 ; a 1 , a 2 , . . . ], where the a i are positive integers.

  56. Some properties of irrational numbers Theorem Every irrational number can be written as a continued fraction 1 a 0 + 1 a 1 + a 2 + ... or, for short, [ a 0 ; a 1 , a 2 , . . . ], where the a i are positive integers. π = [3; 7 , 15 , 1 , 292 , 1 , 1 , 1 , 2 , 1 , . . . ] e = [2; 1 , 2 , 1 , 1 , 4 , 1 , 1 , 6 , 1 , . . . ] √ 2 = [1; 2 , 2 , 2 , . . . ] ϕ = [1; 1 , 1 , 1 , . . . ]

  57. Some properties of irrational numbers Theorem Every irrational number can be written as a continued fraction [ a 0 ; a 1 , a 2 , . . . ], where the a i are positive integers. The truncations [ a 0 ; a 1 ] = a 1 a 0 + 1 [ a 0 ] = a 0 1 , , a 1 [ a 0 ; a 1 , a 2 ] = a 2 ( a 1 a 0 + 1) + a 0 , . . . a 2 a 1 + 1 give a sequence of rational approximations called convergents.

  58. Some properties of irrational numbers Theorem The convergent [ a 0 ; a 1 , a 2 , . . . , a k ] ≡ m / n provides the best approximation among all rationals m ′ / n ′ with n ′ ≤ n . The truncations [ a 0 ; a 1 ] = a 1 a 0 + 1 [ a 0 ] = a 0 1 , , a 1 [ a 0 ; a 1 , a 2 ] = a 2 ( a 1 a 0 + 1) + a 0 , . . . a 2 a 1 + 1 give a sequence of rational approximations called convergents.

  59. The most irrational number A few convergents: 22 333 355 π : 3, 7 , 106, 113 8 11 19 e : 2, 3, 3, 4 , 7 √ 3 7 17 41 2: 1, 2, 5, 12, 29

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend