Open main menu
Home
Random
Log in
Settings
About The Portal Wiki
Disclaimers
The Portal Wiki
Search
Editing
Fibonacci numbers
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
<div style="text-align: center; padding-right: 300"> [[File:34 21-FibonacciBlocks.png|right|300px|thumb|A tiling with squares whose side lengths are successive Fibonacci numbers: 1, 1, 2, 3, 5, 8, 13 and 21.]] </div> In mathematics, the '''Fibonacci numbers''', commonly denoted <math>F_n</math>, form a sequence, called the '''Fibonacci sequence''', such that each number is the sum of the two preceding ones, starting from 0 and 1. That is, :<math>F_0=0,\quad F_1= 1,</math> and :<math>F_n=F_{n-1} + F_{n-2},</math> for <math>n > 1</math>. The beginning of the sequence is thus: :<math>0,\;1,\;1,\;2,\;3,\;5,\;8,\;13,\;21,\;34,\;55,\;89,\;144,\; \ldots</math> 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: == *[https://en.wikipedia.org/wiki/Golden_spiral Golden spiral] *[https://en.wikipedia.org/wiki/Fibonacci_number Fibonacci numbers] == Discussion: == [[Category:Pages for Merging]]
Summary:
Please note that all contributions to The Portal Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
The Portal:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)