Fibonacci Numbers: Difference between revisions
Jump to navigation
Jump to search
(Created page with "=Internal= * Mathematics =Overview= We define '''Fibonacci numbers''' by the following recurrence: F<sub>0</sub> = 0 F<sub>1</sub> = 1 F<sub>i</sub> = F<sub>i-1</sub...") |
|||
| Line 11: | Line 11: | ||
F<sub>1</sub> = 1 | F<sub>1</sub> = 1 | ||
F<sub>i</sub> = F<sub>i-1</sub> + F<sub>i-2</sub>. | F<sub>i</sub> = F<sub>i-1</sub> + F<sub>i-2</sub> for i ≥ 2. | ||
Revision as of 21:00, 8 August 2018
Internal
Overview
We define Fibonacci numbers by the following recurrence:
F0 = 0
F1 = 1
Fi = Fi-1 + Fi-2 for i ≥ 2.