1 / 9

- recursive formula

F 0 =0 ; F 1 =1 ; F n =F n - 1 + F n - 2 for n > 1. - recursive formula. Fibonacci sequence. Solution. Bee hive. 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987,. 3/2=1.5 5/3=1.66 8/5=1.6

onslow
Télécharger la présentation

- recursive formula

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. F0=0; F1=1; Fn =Fn - 1 + Fn- 2 for n > 1 -recursive formula Fibonacci sequence

  2. Solution

  3. Bee hive

  4. 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, ... 3/2=1.5 5/3=1.66 8/5=1.6 13/8=1.625 21/13=1.615 … 987/610=1.618

  5. Eden project – botanic garden UK, Cornwall

  6. Chimney of Turku Energia • Turku, Finland

  7. Mr. Magorium's Wonder Emporium • The Da Vinci Code • 21

  8. "Fibonaccis Traum" • Painting by • Martina Schettina • 2008.

  9. By:Ines Malić

More Related