Fibonacci
10
Click here to load reader
-
Upload
janlee97 -
Category
Technology
-
view
170 -
download
1
Transcript of Fibonacci
![Page 1: Fibonacci](https://reader038.fdocuments.us/reader038/viewer/2022100606/559fce2b1a28ab827a8b467a/html5/thumbnails/1.jpg)
Fibonacci (Fn)Anna, Cindy
![Page 2: Fibonacci](https://reader038.fdocuments.us/reader038/viewer/2022100606/559fce2b1a28ab827a8b467a/html5/thumbnails/2.jpg)
Leonardo Fibonacci1170~1250
Italy
![Page 3: Fibonacci](https://reader038.fdocuments.us/reader038/viewer/2022100606/559fce2b1a28ab827a8b467a/html5/thumbnails/3.jpg)
Fibonacci Numbers
0,1,1,2,3,4,8,13,21,34,55,89,144......
![Page 4: Fibonacci](https://reader038.fdocuments.us/reader038/viewer/2022100606/559fce2b1a28ab827a8b467a/html5/thumbnails/4.jpg)
The first two numbers in the sequence are 0 and 1 each subsequent number is the sum of the previous two
![Page 5: Fibonacci](https://reader038.fdocuments.us/reader038/viewer/2022100606/559fce2b1a28ab827a8b467a/html5/thumbnails/5.jpg)
n= 0 1 2 3 4 5 6
Fn= 0 1 1 2 3 5 8
Fn=Fn-1 + Fn-2
Fn-1 is the previous
Fn-2 is the term before
![Page 6: Fibonacci](https://reader038.fdocuments.us/reader038/viewer/2022100606/559fce2b1a28ab827a8b467a/html5/thumbnails/6.jpg)
![Page 7: Fibonacci](https://reader038.fdocuments.us/reader038/viewer/2022100606/559fce2b1a28ab827a8b467a/html5/thumbnails/7.jpg)
Fn=Recurrence RelationFn=Recurrence Relation
Fn=Fn-1 + Fn-2
![Page 8: Fibonacci](https://reader038.fdocuments.us/reader038/viewer/2022100606/559fce2b1a28ab827a8b467a/html5/thumbnails/8.jpg)
![Page 9: Fibonacci](https://reader038.fdocuments.us/reader038/viewer/2022100606/559fce2b1a28ab827a8b467a/html5/thumbnails/9.jpg)
![Page 10: Fibonacci](https://reader038.fdocuments.us/reader038/viewer/2022100606/559fce2b1a28ab827a8b467a/html5/thumbnails/10.jpg)
Thank You!