Fibonacci number

From Wikipedia, the free encyclopedia

A tiling with squares whose side lengths are successive Fibonacci numbers

In mathematics, the Fibonacci numbers or Fibonacci sequence are the numbers in the
following integer sequence:[1][2]

or (often, in modern usage):

(sequence A000045 in OEI
S).

The Fibonacci spiral: an approximation of the golden spiral created by drawing circular arcs connecting
the opposite corners of squares in the Fibonacci tiling;[3] this one uses squares of sizes 1, 1, 2, 3, 5, 8,
13, 21, and 34.

By definition, the first two numbers in the Fibonacci sequence are 1 and 1, or 0 and 1,
depending on the chosen starting point of the sequence, and each subsequent number is
the sum of the previous two.
In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence
relation

with seed values[1][2]

or[4]

The Fibonacci sequence is named after Fibonacci. His 1202 book Liber
Abaci introduced the sequence to Western European mathematics,[5] although
the sequence had been described earlier in Indian mathematics.[6][7][8] By modern
convention, the sequence begins either with F0 = 0 or with F1 = 1. The Liber
Abaci began the sequence with F1 = 1.

Fibonacci numbers are closely related to Lucas numbers in that they are a
complementary pair of Lucas sequences. They are intimately connected with
the golden ratio; for example, the closest rational approximations to the ratio are
2/1, 3/2, 5/3, 8/5, ... . Applications include computer algorithms such as
the Fibonacci search technique and theFibonacci heap data structure, and
graphs called Fibonacci cubes used for interconnecting parallel and distributed
systems. They also appear in biological settings,[9] such as branching in
trees, phyllotaxis (the arrangement of leaves on a stem), the fruit sprouts of
a pineapple,[10] the flowering of an artichoke, an uncurling fern and the
arrangement of apine cone.[11]
Contents
[hide]

1 Origins
2 List of Fibonacci numbers
3 Use in mathematics
4 Relation to the golden ratio
o 4.1 Closed-form expression
o 4.2 Computation by rounding
o 4.3 Limit of consecutive quotients
o 4.4 Decomposition of powers of the golden ratio
5 Matrix form
6 Recognizing Fibonacci numbers
7 Combinatorial identities
8 Other identities
o 8.1 Cassini and Catalan's Identities
o 8.2 d'Ocagne's identity
9 Power series
10 Reciprocal sums
11 Primes and divisibility
o 11.1 Divisibility properties
o 11.2 Primality testing
o 11.3 Fibonacci primes
o 11.4 Prime divisors of Fibonacci numbers
o 11.5 Periodicity modulo n
12 Right triangles
13 Magnitude
14 Applications
15 In nature
o 15.1 The bee ancestry code
16 In popular culture
17 Generalizations
18 See also
19 Notes
20 References
21 External links

Origins[edit]

A page of Fibonacci's Liber Abacifrom the Biblioteca Nazionale di Firenze showing (in
box on right) the Fibonacci sequence with the position in the sequence labeled in Latin
and Roman numerals and the value in Hindu-Arabic numerals.

The Fibonacci sequence appears in Indian mathematics, in connection

with Sanskrit prosody.[7][12] In the Sanskrit tradition of prosody, there was interest
in enumerating all patterns of long (L) syllables that are 2 units of duration, and
short (S) syllables that are 1 unit of duration; counting the different patterns of L
and S of a given duration results in the Fibonacci numbers: the number of
patterns that are m short syllables long is the Fibonacci number Fm + 1.[8]
Susantha Goonatilake writes that the development of the Fibonacci sequence
"is attributed in part to Pingala (200 BC), later being associated
with Virahanka (c. 700 AD), Gopla (c. 1135), and Hemachandra (c.
1150)".[6] Parmanand Singh cites Pingala's cryptic formula misrau cha ("the two
are mixed") and cites scholars who interpret it in context as saying that the
cases for m beats (Fm+1) is obtained by adding a [S] to Fm cases and [L] to
the Fm1 cases. He dates Pingala before 450 BC.[13]
However, the clearest exposition of the series arises in the work
of Virahanka (c. 700 AD), whose own work is lost, but is available in a quotation
by Gopala (c. 1135):
Variations of two earlier meters [is the variation]... For example, for [a meter of length] four,
variations of meters of two [and] three being mixed, five happens. [works out examples 8, 13,
21]... In this way, the process should be followed in all mtr-vttas [prosodic
combinations].[14]
The series is also discussed by Gopala (before 1135 AD) and by the Jain
scholar Hemachandra (c. 1150).
In the West, the Fibonacci sequence first appears in the book Liber
Abaci (1202) by Leonardo of Pisa, known as Fibonacci.[5] Fibonacci
considers the growth of an idealized (biologically

unrealistic) rabbit population, assuming that: a newly born pair of rabbits,

one male, one female, are put in a field; rabbits are able to mate at the age
of one month so that at the end of its second month a female can produce
another pair of rabbits; rabbits never die and a mating pair always produces
one new pair (one male, one female) every month from the second month
on. The puzzle that Fibonacci posed was: how many pairs will there be in
one year?

At the end of the first month, they mate, but there is still only 1 pair.
At the end of the second month the female produces a new pair, so
now there are 2 pairs of rabbits in the field.
At the end of the third month, the original female produces a second
pair, making 3 pairs in all in the field.
At the end of the fourth month, the original female has produced yet
another new pair, the female born two months ago produces her first
pair also, making 5 pairs.

At the end of the nth month, the number of pairs of rabbits is equal to the
number of new pairs (which is the number of pairs in month n 2) plus the
number of pairs alive last month (n 1). This is the nth Fibonacci number.[15]
The name "Fibonacci sequence" was first used by the 19th-century number
theorist douard Lucas.[16]

List of Fibonacci numbers[edit]

The first 21 Fibonacci numbers Fn for n = 0, 1, 2, ..., 20 are:[17]
F0 F1 F2 F3 F4 F5 F6 F7 F8 F9 F10 F11 F12 F13 F14 F15 F16

F17

F18

F19

F20

0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 6765

The sequence can also be extended to negative index n using the rearranged recurrence relation

which yields the sequence of "negafibonacci" numbers[18] satisfying

Thus the bidirectional sequence is

F8 F7 F6 F5 F4 F3 F2 F1 F0 F1 F2 F3 F4 F5 F6 F7 F8

21 13 8

5 3

2 1

1 0 1 1 2 3 5 8 13 21

Use in mathematics[edit]

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 (see Binomial coefficient).[19]

These numbers also give the solution to certain

enumerative problems.[20] The most common such
problem is that of counting the number
ofcompositions of 1s and 2s that sum to a given total n:
there are Fn+1 ways to do this. For example F6 = 8
counts the eight compositions:
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,
all of which sum to 61 = 5.
The Fibonacci numbers can be found in different ways
among the set of binary strings, or equivalently, among
the subsets of a given set.

The number of binary strings of length n without

consecutive 1s is the Fibonacci number Fn+2. For
example, out of the 16 binary strings of length 4,
there are F6 = 8 without consecutive 1s they are
0000, 0001, 0010, 0100, 0101, 1000, 1001 and
1010. By symmetry, the number of strings of
length n without consecutive 0s is also Fn+2.
Equivalently, Fn+2 is the number of subsets S
{1,...,n} without consecutive integers: {i, i+1} S
for every i. The symmetric statement is: Fn+2 is the
number of subsets S {1,...,n} without two
consecutive skipped integers: that is, S = {a1 < ... <
ak} with ai+1 ai + 2.
The number of binary strings of length n without an
odd number of consecutive 1s is the Fibonacci
number Fn+1. For example, out of the 16 binary

strings of length 4, there are F5 = 5 without an odd

number of consecutive 1s they are 0000, 0011,
0110, 1100, 1111. Equivalently, the number of
subsets S {1,...,n} without an odd number of
consecutive integers is Fn+1.
The number of binary strings of length n without an
even number of consecutive 0s or 1s is 2Fn. For
example, out of the 16 binary strings of length 4,
there are 2F4 = 6 without an even number of
consecutive 0s or 1s they are 0001, 0111, 0101,
1000, 1010, 1110. There is an equivalent
statement about subsets.

Relation to the golden ratio[edit]

Closed-form expression[edit]
Like every sequence defined by a linear recurrence
with constant coefficients, the Fibonacci numbers have
a closed-form solution. It has become known
as Binet's formula, even though it was already known
byAbraham de Moivre:[21]

where

is the golden
ratio (sequence A001622 in OEIS), and

[22]

Since
written as

, this formula can also be

To see this,[23] note that and are both

solutions of the equations

so the powers of and satisfy the

Fibonacci recursion. In other words

and

It follows that for any

values a and b, the sequence
defined by

satisfies the same

recurrence

If a and b are chosen

so that U0 = 0
and U1 = 1 then the
resulting
sequence Un must be
the Fibonacci
sequence. This is the
same as
requiring a and b sati
sfy the system of
equations:

which has
solution

producing the
required
formula.

Computati
on by
rounding[e
dit]
Since

for all n
0, the
number F
n is the
closest
integer to

Ther
efore
it can
be
found
by ro
undin
g, or
in
terms
of
the fl
oor
functi
on:

O
r
t
h
e
n
e
a
r
e
s
t
i
n
t
e
g
e
r
f
u
n
c
ti
o
n
:

S
i
m
i
l
a
r
l
y
,
i
f
w
e
a
l
r
e
a
d
y
k
n
o
w
t
h
a
t
t
h
e
n
u
m
b
e
r
F
>
1
i

s
a
F
i
b
o
n
a
c
c
i
n
u
m
b
e
r
,
w
e
c
a
n
d
e
t
e
r
m
i
n
e
i
t
s
i
n
d
e
x
w
i
t
h

i
n
t
h
e
s
e
q
u
e
n
c
e
b
y

L
i
m
i
t
o
f
c
o
n
s
e
c
u
t
i
v
e
q
u
o
t
i

e
n
t
s
[
e
d
i
t
]
J
o
h
a
n
n
e
s
K
e
p
l
e
r
o
b
s
e
r
v
e
d
t
h
a
t
t
h
e
r
a
t
i
o
o

f
c
o
n
s
e
c
u
t
i
v
e
F
i
b
o
n
a
c
c
i
n
u
m
b
e
r
s
c
o
n
v
e
r
g
e
s
.
H
e
w
r
o
t
e
t

h
a
t
"
a
s
5
i
s
t
o
8
s
o
i
s
8
t
o
1
3
,
p
r
a
c
t
i
c
a
l
l
y
,
a
n
d
a
s

8
i
s
t
o
1
3
,
s
o
i
s
1
3
t
o
2
1
a
l
m
o
s
t
"
,
a
n
d
c
o
n
c
l
u
d
e
d
t
h
a

t
t
h
e
l
i
m
i
t
a
p
p
r
o
a
c
h
e
s
t
h
e
g
o
l
d
e
n
r
a
t
i
o
.
[
2
4
]
[
2
5
]

T
h
i
s
c
o
n
v
e
r
g
e
n
c
e
d
o
e
s
n
o
t
d
e
p
e
n
d
o
n
t
h
e
s
t
a
r
t
i
n
g
v
a
l
u

e
s
c
h
o
s
e
n
,
e
x
c
l
u
d
i
n
g
0
,
0
.
F
o
r
e
x
a
m
p
l
e
,
t
h
e
i
n
i
t
i
a
l
v

a
l
u
e
s
1
9
a
n
d
3
1
g
e
n
e
r
a
t
e
t
h
e
s
e
q
u
e
n
c
e
1
9
,
3
1
,
5
0
,
8
1
,

1
3
1
,
2
1
2
,
3
4
3
,
5
5
5
.
.
.
e
t
c
.
T
h
e
r
a
t
i
o
o
f
c
o
n
s
e
c
u
t
i
v
e

t
e
r
m
s
i
n
t
h
i
s
s
e
q
u
e
n
c
e
s
h
o
w
s
t
h
e
s
a
m
e
c
o
n
v
e
r
g
e
n
c
e
t
o

w
a
r
d
s
t
h
e
g
o
l
d
e
n
r
a
t
i
o
.
I
n
f
a
c
t
t
h
i
s
h
o
l
d
s
f
o
r
a
n
y
s
e
q

u
e
n
c
e
t
h
a
t
s
a
t
i
s
f
i
e
s
t
h
e
F
i
b
o
n
a
c
c
i
r
e
c
u
r
r
e
n
c
e
o
t
h
e
r
t

h
a
n
a
s
e
q
u
e
n
c
e
o
f
0
s
.
T
h
i
s
c
a
n
b
e
d
e
r
i
v
e
d
f
r
o
m
B
i
n
e
t
'

s
f
o
r
m
u
l
a
.
A
n
o
t
h
e
r
c
o
n
s
e
q
u
e
n
c
e
i
s
t
h
a
t
t
h
e
l
i
m
i
t
o
f
t
h

e
r
a
t
i
o
o
f
t
w
o
F
i
b
o
n
a
c
c
i
n
u
m
b
e
r
s
o
f
f
s
e
t
b
y
a
p
a
r
t
i
c
u
l

a
r
f
i
n
i
t
e
d
e
v
i
a
t
i
o
n
i
n
i
n
d
e
x
c
o
r
r
e
s
p
o
n
d
s
t
o
t
h
e
g
o
l
d
e

n
r
a
t
i
o
r
a
i
s
e
d
b
y
t
h
a
t
d
e
v
i
a
t
i
o
n
.
O
r
,
i
n
o
t
h
e
r
w
o
r
d
s
:

n
i

f
i
l

w
i

s
i

t
i
l
i

p
l

x
i

t
i

o
l

t
i

a
l

u
l

d
i

v
i

d
i

a
i

F
i

c
i

F
i

c
i

D
e
c
o
m
p
o
s
i
t
i
o
n

o
f

p
o
w
e
r
s

o
f

t
h
e

g
o
l
d
e
n

a
t
i
o
[
e
d
i
t
]

S
i
n
c
e

t
h
e

g
o
l
d
e
n

r
a
t
i
o

s
a
t
i
s
f
i
e
s

t
h
e

e
q
u
a

t
i
o
n

gcd(Fn, Fn+1) = gcd(Fn, Fn+2) = gcd(Fn+1, Fn+2) = 1.

, where the Legendre symbol has been replaced by the Jacobi symbol, then
this is evidence that n is a prime, and if it fails to hold, then n is definitely not a prime. If n is
composite and satisfies the formula, then n is a Fibonacci pseudoprime.

(mod m).

2, 3, 5, 13, 89, 233, 1597, 28657, 514229, ... (sequence A005478 in OEIS).

[44][45]

particular n it can be solved as an instance of cycle detection.

equal to the difference between the preceding bypassed Fibonacci number and the shorter leg of the preceding

conditions is called a Zeckendorf representation. The Zeckendorf representation of a number can be used to derive

ntation of the polyphase merge sort was described in The Art of Computer Programming.

radix 2 number register in golden ratio base being shifted. To convert from kilometers to miles, shift the register

s.[55] However, numerous poorly substantiated claims of Fibonacci numbers or golden sections in nature are found in

angle from the center, so the florets pack efficiently. Because the rational approximations to the golden ratio are of
onacci numbers), but this is true only of one range of radii, typically the outermost and thus most conspicuous.[59]

tors, which is Fn1, plus the number of male ancestors, which is Fn2.[60] This is under the unrealistic assumption that