6,480
edits
Fibonacci numbers: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
| (11 intermediate revisions by 2 users not shown) | |||
| Line 12: | Line 12: | ||
:<math>0,\;1,\;1,\;2,\;3,\;5,\;8,\;13,\;21,\;34,\;55,\;89,\;144,\; \ldots</math> | :<math>0,\;1,\;1,\;2,\;3,\;5,\;8,\;13,\;21,\;34,\;55,\;89,\;144,\; \ldots</math> | ||
The ratio <math> \frac {F_n}{F_{n+1}} \ </math> approaches the [[ | Fibonacci numbers are named after Italian mathematician Leonardo of Pisa, later known as Fibonacci. In his 1202 book Liber Abaci, Fibonacci introduced the sequence to Western European mathematics, although the sequence had been described earlier in Indian mathematics as early as 200 BC in work by Pingala on enumerating possible patterns of Sanskrit poetry formed from syllables of two lengths. | ||
==Mathematics== | |||
The ratio <math> \frac {F_n}{F_{n+1}} \ </math> approaches the golden ratio as <math>n</math> approaches infinity. | |||
[[File:PascalTriangleFibanacci.png|thumb|right|360px|The Fibonacci numbers are the sums of the "shallow" diagonals (shown in red) of Pascal's triangle.]] | |||
The Fibonacci numbers occur in the sums of "shallow" diagonals in Pascal's triangle. | |||
:<math>F_n = \sum_{k=0}^{\left\lfloor\frac{n-1}{2}\right\rfloor} \binom{n-k-1}{k}</math> | |||
Counting the number of ways of writing a given number <math>n</math> as an ordered sum of 1s and 2s (called compositions); there are <math>F_{n+1}</math> ways to do this. For example, if <math>n = 5</math>, then <math>F_{n+1} = F_{6} = 8</math> counts the eight compositions summing to 5: | |||
<math>1+1+1+1+1 = 1+1+1+2 = 1+1+2+1 = 1+2+1+1 = 2+1+1+1 = 2+2+1 = 2+1+2 = 1+2+2</math> | |||
== Resources: == | == Resources: == | ||
| Line 18: | Line 28: | ||
*[https://en.wikipedia.org/wiki/Fibonacci_number Fibonacci numbers] | *[https://en.wikipedia.org/wiki/Fibonacci_number Fibonacci numbers] | ||
== Discussion: == | == Discussion: == | ||
[[Category:Pages for Merging]] | |||