Fibonacci Numbers: Difference between revisions
From charlesreid1
(Created page with "Fibonacci numbers are possibly the most famous integer sequence. The nth Fibonacci number is computed from the n-1th and n-2th Fibonacci numbers as follows: <math> F(n) = F(n...") |
No edit summary |
||
| Line 1: | Line 1: | ||
{{ConstantFlag}} | |||
Fibonacci numbers are possibly the most famous integer sequence. The nth Fibonacci number is computed from the n-1th and n-2th Fibonacci numbers as follows: | Fibonacci numbers are possibly the most famous integer sequence. The nth Fibonacci number is computed from the n-1th and n-2th Fibonacci numbers as follows: | ||
Revision as of 20:59, 16 July 2017
Fibonacci numbers are possibly the most famous integer sequence. The nth Fibonacci number is computed from the n-1th and n-2th Fibonacci numbers as follows:
$ F(n) = F(n-1) + F(n-2) $
where the two starting numbers are $ F_0 = 1 $ and $ F_1 = 1 $.