Fibonacci number

Origins

The Fibonacci sequence appears in Indian mathematics, in connection with Sanskrit prosody. 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 F_m + 1.

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), Gopāla (c. 1135), and Hemachandra (c. 1150)". 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 (F_m+1) is obtained by adding a [S] to F_m cases and [L] to the F_m−1 cases. He dates Pingala before 450 BC.

However, the clearest exposition of the sequence 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 mātrā-vṛttas [prosodic combinations].

The sequence is also discussed by Gopala (before 1135 AD) and by the Jain scholar Hemachandra (c. 1150).

Outside India, the Fibonacci sequence first appears in the book Liber Abaci (1202) by Fibonacci. 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, and the female born two months ago also produces her first pair, 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.

The name "Fibonacci sequence" was first used by the 19th-century number theorist Édouard Lucas.

List of Fibonacci numbers

The first 21 Fibonacci numbers F_n for n = 0, 1, 2, …, 20 are:

The sequence can also be extended to negative index n using the re-arranged recurrence relation

F n − 2 = F n − F n − 1 ,

which yields the sequence of "negafibonacci" numbers satisfying

F − n = ( − 1 ) n + 1 F n .

Thus the bidirectional sequence is

Use in mathematics

The Fibonacci numbers occur in the sums of "shallow" diagonals in Pascal's triangle (see binomial coefficient):

F n = ∑ k = 0 ⌊ n − 1 2 ⌋ ( n − k − 1 k )

These numbers also give the solution to certain enumerative problems. The most common such problem is that of counting the number of compositions of 1s and 2s that sum to a given total n: there are F_n+1 ways to do this.

For example, if n = 5, then F_n+1 = F₆ = 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 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 F_n+2. For example, out of the 16 binary strings of length 4, there are F₆ = 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 F_n+2. Equivalently, F_n+2 is the number of subsets S ⊂ {1,...,n} without consecutive integers: {i, i+1} ⊄ S for every i. The symmetric statement is: F_n+2 is the number of subsets S ⊂ {1,...,n} without two consecutive skipped integers: that is, S = {a₁ < … < a_k} with a_i+1 ≤ a_i + 2.

The number of binary strings of length n without an odd number of consecutive 1s is the Fibonacci number F_n+1. For example, out of the 16 binary strings of length 4, there are F₅ = 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 F_n+1.

The number of binary strings of length n without an even number of consecutive 0s or 1s is 2F_n. For example, out of the 16 binary strings of length 4, there are 2F₄ = 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.

Closed-form expression

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 by Abraham de Moivre:

F n = φ n − ψ n φ − ψ = φ n − ψ n 5

where

φ = 1 + 5 2 ≈ 1.61803 39887 ⋯

is the golden ratio ( A001622), and

ψ = 1 − 5 2 = 1 − φ = − 1 φ ≈ − 0.61803 39887 ⋯

Since ψ = − 1 φ , this formula can also be written as

F n = φ n − ( − φ ) − n 5 = φ n − ( − φ ) − n 2 φ − 1

To see this, note that φ and ψ are both solutions of the equations

x 2 = x + 1 , x n = x n − 1 + x n − 2 ,

so the powers of φ and ψ satisfy the Fibonacci recursion. In other words,

φ n = φ n − 1 + φ n − 2

and

ψ n = ψ n − 1 + ψ n − 2 .

It follows that for any values a and b, the sequence defined by

U n = a φ n + b ψ n

satisfies the same recurrence

U n = a φ n − 1 + b ψ n − 1 + a φ n − 2 + b ψ n − 2 = U n − 1 + U n − 2 .

If a and b are chosen so that U₀ = 0 and U₁ = 1 then the resulting sequence U_n must be the Fibonacci sequence. This is the same as requiring a and b satisfy the system of equations:

{ a + b = 0 φ a + ψ b = 1

which has solution

a = 1 φ − ψ = 1 5 , b = − a

producing the required formula.

Taking U₀ and U₁ to be variables, a more general solution can be found for any starting values:

U n = a φ n + b ψ n

where

a = U 1 − U 0 ψ 5 b = U 0 φ − U 1 5 .

Computation by rounding

Since

| ψ n 5 | < 1 2

for all n ≥ 0, the number F_n is the closest integer to φ n 5 . Therefore, it can be found by rounding, that is by the use of the nearest integer function:

F n = [ φ n 5 ] ,   n ≥ 0 ,

or in terms of the floor function:

F n = ⌊ φ n 5 + 1 2 ⌋ ,   n ≥ 0.

Similarly, if we already know that the number F > 1 is a Fibonacci number, we can determine its index within the sequence by

n ( F ) = ⌊ log φ ⁡ ( F ⋅ 5 + 1 2 ) ⌋

Limit of consecutive quotients

Johannes Kepler observed that the ratio of consecutive Fibonacci numbers converges. He wrote that "as 5 is to 8 so is 8 to 13, practically, and as 8 is to 13, so is 13 to 21 almost", and concluded that the limit approaches the golden ratio φ .

lim n → ∞ F n + 1 F n = φ

This convergence holds regardless of the starting values, excluding 0, 0. This can be derived from Binet's formula. For example, the initial values 3 and 2 generate the sequence 3, 2, 5, 7, 12, 19, 31, 50, 81, 131, 212, 343, 555, …, etc. The ratio of consecutive terms in this sequence shows the same convergence towards the golden ratio.

Another consequence is that the limit of the ratio of two Fibonacci numbers offset by a particular finite deviation in index corresponds to the golden ratio raised by that deviation. Or, in other words:

lim n → ∞ F n + α F n = φ α

Decomposition of powers of the golden ratio

Since the golden ratio satisfies the equation

φ 2 = φ + 1 ,

this expression can be used to decompose higher powers φ n as a linear function of lower powers, which in turn can be decomposed all the way down to a linear combination of φ and 1. The resulting recurrence relationships yield Fibonacci numbers as the linear coefficients:

φ n = F n φ + F n − 1 .

This equation can be proved by induction on n.

This expression is also true for n < 1 if the Fibonacci sequence F_n is extended to negative integers using the Fibonacci rule F n = F n − 1 + F n − 2 .

Matrix form

A 2-dimensional system of linear difference equations that describes the Fibonacci sequence is

( F k + 2 F k + 1 ) = ( 1 1 1 0 ) ( F k + 1 F k )

alternatively denoted

F → k + 1 = A F → k ,

which yields F → n = A n F → 0 . As the eigenvalues of the matrix A are φ =   1 2 ( 1 + 5 ) and − φ − 1 =   1 2 ( 1 − 5 ) corresponding to the respective eigenvectors

μ → = ( φ 1 )

and

ν → = ( − φ − 1 1 ) ,

and the initial value is

F → 0 = ( 1 0 ) = 1 5 μ → − 1 5 ν → ,

it follows that the nth term is

F → n = 1 5 A n μ → − 1 5 A n ν → = 1 5 φ n μ → − 1 5 ( − φ ) − n ν →   = 1 5 ( 1 + 5 2 ) n ( φ 1 ) − 1 5 ( 1 − 5 2 ) n ( − φ − 1 1 )   ,

from which the nth element in the Fibonacci series as an analytic function of n is now read off directly:

F n = 1 5 ( 1 + 5 2 ) n − 1 5 ( 1 − 5 2 ) n   .

Equivalently, the same computation is performed by diagonalization of A through use of its eigendecomposition:

A = S Λ S − 1 , A n = S Λ n S − 1 ,

where Λ = ( φ 0 0 − φ − 1 ) and S = ( φ − φ − 1 1 1 ) . The closed-form expression for the nth element in the Fibonacci series is therefore given by

( F n + 1 F n ) = A n ( F 1 F 0 ) = S Λ n S − 1 ( F 1 F 0 ) = S ( φ n 0 0 ( − φ ) − n ) S − 1 ( F 1 F 0 ) = ( φ − φ − 1 1 1 ) ( φ n 0 0 ( − φ ) − n ) 1 5 ( 1 φ − 1 − 1 φ ) ( 1 0 ) ,

which again yields

F n = φ n − ( − φ ) − n 5 .

The matrix A has a determinant of −1, and thus it is a 2×2 unimodular matrix.

This property can be understood in terms of the continued fraction representation for the golden ratio:

φ = 1 + 1 1 + 1 1 + 1 1 + ⋱

The Fibonacci numbers occur as the ratio of successive convergents of the continued fraction for φ, and the matrix formed from successive convergents of any continued fraction has a determinant of +1 or −1. The matrix representation gives the following closed expression for the Fibonacci numbers:

( 1 1 1 0 ) n = ( F n + 1 F n F n F n − 1 ) .

Taking the determinant of both sides of this equation yields Cassini's identity,

( − 1 ) n = F n + 1 F n − 1 − F n 2 .

Moreover, since Aⁿ A^m = A^n+m for any square matrix A, the following identities can be derived (they are obtained from two different coefficients of the matrix product, and one may easily deduce the second one from the first one by changing n into n + 1),

F m F n + F m − 1 F n − 1 = F m + n − 1 , F m F n + 1 + F m − 1 F n = F m + n .

In particular, with m = n,

F 2 n − 1 = F n 2 + F n − 1 2 F 2 n = ( F n − 1 + F n + 1 ) F n = ( 2 F n − 1 + F n ) F n .

These last two identities provide a way to compute Fibonacci numbers recursively in O(log(n)) arithmetic operations and in time O(M(n) log(n)), where M(n) is the time for the multiplication of two numbers of n digits. This matches the time for computing the nth Fibonacci number from the closed-form matrix formula, but with fewer redundant steps if one avoids recomputing an already computed Fibonacci number (recursion with memoization).

Recognizing Fibonacci numbers

The question may arise whether a positive integer x is a Fibonacci number. This is true if and only if one or both of 5 x 2 + 4 or 5 x 2 − 4 is a perfect square. This is because Binet's formula above can be rearranged to give

n = log φ ⁡ ( F n 5 + 5 F n 2 ± 4 2 ) ,

which allows one to find the position in the sequence of a given Fibonacci number.

This formula must return an integer for all n, so the radical expression must be an integer (otherwise the logarithm does not even return a rational number).

Combinatorial identities

Most identities involving Fibonacci numbers can be proved using combinatorial arguments using the fact that F_n can be interpreted as the number of sequences of 1s and 2s that sum to n − 1. This can be taken as the definition of F_n, with the convention that F₀ = 0, meaning no sum adds up to −1, and that F₁ = 1, meaning the empty sum "adds up" to 0. Here, the order of the summand matters. For example, 1 + 2 and 2 + 1 are considered two different sums.

For example, the recurrence relation

F n = F n − 1 + F n − 2 ,

or in words, the nth Fibonacci number is the sum of the previous two Fibonacci numbers, may be shown by dividing the F_n sums of 1s and 2s that add to n − 1 into two non-overlapping groups. One group contains those sums whose first term is 1 and the other those sums whose first term is 2. In the first group the remaining terms add to n − 2, so it has F_n-1 sums, and in the second group the remaining terms add to n − 3, so there are F_n−2 sums. So there are a total of F_n−1 + F_n−2 sums altogether, showing this is equal to F_n.

Similarly, it may be shown that the sum of the first Fibonacci numbers up to the nth is equal to the (n + 2)-nd Fibonacci number minus 1. In symbols:

∑ i = 1 n F i = F n + 2 − 1

This is done by dividing the sums adding to n + 1 in a different way, this time by the location of the first 2. Specifically, the first group consists of those sums that start with 2, the second group those that start 1 + 2, the third 1 + 1 + 2, and so on, until the last group, which consists of the single sum where only 1's are used. The number of sums in the first group is F(n), F(n − 1) in the second group, and so on, with 1 sum in the last group. So the total number of sums is F(n) + F(n − 1) + ... + F(1) + 1 and therefore this quantity is equal to F(n + 2).

A similar argument, grouping the sums by the position of the first 1 rather than the first 2, gives two more identities:

∑ i = 0 n − 1 F 2 i + 1 = F 2 n

and

∑ i = 1 n F 2 i = F 2 n + 1 − 1.

In words, the sum of the first Fibonacci numbers with odd index up to F_2n−1 is the (2n)th Fibonacci number, and the sum of the first Fibonacci numbers with even index up to F_2n is the (2n + 1)th Fibonacci number minus 1.

A different trick may be used to prove

∑ i = 1 n F i 2 = F n F n + 1 ,

or in words, the sum of the squares of the first Fibonacci numbers up to F_n is the product of the nth and (n + 1)th Fibonacci numbers. In this case note that Fibonacci rectangle of size F_n by F(n + 1) can be decomposed into squares of size F_n, F_n−1, and so on to F₁ = 1, from which the identity follows by comparing areas.

Other identities

Numerous other identities can be derived using various methods. Some of the most noteworthy are:

Cassini and Catalan's identities

Cassini's identity states that

F n 2 − F n + 1 F n − 1 = ( − 1 ) n − 1

Catalan's identity is a generalization:

F n 2 − F n + r F n − r = ( − 1 ) n − r F r 2

d'Ocagne's identity

F m F n + 1 − F m + 1 F n = ( − 1 ) n F m − n F 2 n = F n + 1 2 − F n − 1 2 = F n ( F n + 1 + F n − 1 ) = F n L n

where L_n is the n'th Lucas number. The last is an identity for doubling n; other identities of this type are

F 3 n = 2 F n 3 + 3 F n F n + 1 F n − 1 = 5 F n 3 + 3 ( − 1 ) n F n

by Cassini's identity.

F 3 n + 1 = F n + 1 3 + 3 F n + 1 F n 2 − F n 3 F 3 n + 2 = F n + 1 3 + 3 F n + 1 2 F n + F n 3 F 4 n = 4 F n F n + 1 ( F n + 1 2 + 2 F n 2 ) − 3 F n 2 ( F n 2 + 2 F n + 1 2 )

These can be found experimentally using lattice reduction, and are useful in setting up the special number field sieve to factorize a Fibonacci number.

More generally,

F k n + c = ∑ i = 0 k ( k i ) F c − i F n i F n + 1 k − i .

Putting k = 2 in this formula, one gets again the formulas of the end of above section Matrix form.

Power series

The generating function of the Fibonacci sequence is the power series

s ( x ) = ∑ k = 0 ∞ F k x k .

This series is convergent for | x | < 1 φ , and its sum has a simple closed-form:

s ( x ) = x 1 − x − x 2

This can be proved by using the Fibonacci recurrence to expand each coefficient in the infinite sum:

s ( x ) = ∑ k = 0 ∞ F k x k = F 0 + F 1 x + ∑ k = 2 ∞ ( F k − 1 + F k − 2 ) x k = x + ∑ k = 2 ∞ F k − 1 x k + ∑ k = 2 ∞ F k − 2 x k = x + x ∑ k = 0 ∞ F k x k + x 2 ∑ k = 0 ∞ F k x k = x + x s ( x ) + x 2 s ( x ) .

Solving the equation

s ( x ) = x + x s ( x ) + x 2 s ( x )

for s(x) results in the above closed form.

If x is the reciprocal of an integer k that is greater than 1, the closed form of the series becomes

∑ n = 0 ∞ F n k n = k k 2 − k − 1 .

In particular,

∑ n = 1 ∞ F n 10 m ( n + 1 ) = 1 10 2 m − 10 m − 1

for all positive integers m.

Some math puzzle-books present as curious the particular value that comes from m=1, which is s ( 1 10 ) 10 = 1 89 = .011235 … . Similarly, m=2 gives s ( 1 100 ) 100 = 1 9899 = .00010102030508132134 … .

Reciprocal sums

Infinite sums over reciprocal Fibonacci numbers can sometimes be evaluated in terms of theta functions. For example, we can write the sum of every odd-indexed reciprocal Fibonacci number as

∑ k = 0 ∞ 1 F 2 k + 1 = 5 4 ϑ 2 2 ( 0 , 3 − 5 2 ) ,

and the sum of squared reciprocal Fibonacci numbers as

∑ k = 1 ∞ 1 F k 2 = 5 24 ( ϑ 2 4 ( 0 , 3 − 5 2 ) − ϑ 4 4 ( 0 , 3 − 5 2 ) + 1 ) .

If we add 1 to each Fibonacci number in the first sum, there is also the closed form

∑ k = 0 ∞ 1 1 + F 2 k + 1 = 5 2 ,

and there is a nested sum of squared Fibonacci numbers giving the reciprocal of the golden ratio,

∑ k = 1 ∞ ( − 1 ) k + 1 ∑ j = 1 k F j 2 = 5 − 1 2 .

No closed formula for the reciprocal Fibonacci constant

ψ = ∑ k = 1 ∞ 1 F k = 3.359885666243 …

is known, but the number has been proved irrational by Richard André-Jeannin.

The Millin series gives the identity

∑ n = 0 ∞ 1 F 2 n = 7 − 5 2 ,

which follows from the closed form for its partial sums as N tends to infinity:

∑ n = 0 N 1 F 2 n = 3 − F 2 N − 1 F 2 N .

Divisibility properties

Every 3rd number of the sequence is even and more generally, every kth number of the sequence is a multiple of F_k. Thus the Fibonacci sequence is an example of a divisibility sequence. In fact, the Fibonacci sequence satisfies the stronger divisibility property

gcd ( F m , F n ) = F gcd ( m , n ) .

Any three consecutive Fibonacci numbers are pairwise coprime, which means that, for every n,

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

Every prime number p divides a Fibonacci number that can be determined by the value of p modulo 5. If p is congruent to 1 or 4 (mod 5), then p divides F_p − 1, and if p is congruent to 2 or 3 (mod 5), then, p divides F_p + 1. The remaining case is that p = 5, and in this case p divides F_p. These cases can be combined into a single formula, using the Legendre symbol:

p ∣ F p − ( 5 p ) .

Primality testing

The above formula can be used as a primality test in the sense that if

n ∣ F n − ( 5 n ) , 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.

When m is large—say a 500-bit number—then we can calculate F_m (mod n) efficiently using the matrix form. Thus

( F m + 1 F m F m F m − 1 ) ≡ ( 1 1 1 0 ) m (mod n).

Here the matrix power A^m is calculated using Modular exponentiation, which can be adapted to matrices--modular exponentiation for matrices

Fibonacci primes

A Fibonacci prime is a Fibonacci number that is prime. The first few are:

2, 3, 5, 13, 89, 233, 1597, 28657, 514229, …  A005478.

Fibonacci primes with thousands of digits have been found, but it is not known whether there are infinitely many.

F_kn is divisible by F_n, so, apart from F₄ = 3, any Fibonacci prime must have a prime index. As there are arbitrarily long runs of composite numbers, there are therefore also arbitrarily long runs of composite Fibonacci numbers.

No Fibonacci number greater than F₆ = 8 is one greater or one less than a prime number.

The only nontrivial square Fibonacci number is 144. Attila Pethő proved in 2001 that there is only a finite number of perfect power Fibonacci numbers. In 2006, Y. Bugeaud, M. Mignotte, and S. Siksek proved that 8 and 144 are the only such non-trivial perfect powers.

Prime divisors of Fibonacci numbers

With the exceptions of 1, 8 and 144 (F₁ = F₂, F₆ and F₁₂) every Fibonacci number has a prime factor that is not a factor of any smaller Fibonacci number (Carmichael's theorem). As a result, 8 and 144 (F₆ and F₁₂) are the only Fibonacci numbers that are the product of other Fibonacci numbers  A235383.

The divisibility of Fibonacci numbers by a prime p is related to the Legendre symbol ( p 5 ) which is evaluated as follows:

( p 5 ) = { 0 if p = 5 1 if p ≡ ± 1 ( mod 5 ) − 1 if p ≡ ± 2 ( mod 5 ) .

If p is a prime number then

F p ≡ ( p 5 ) ( mod p ) and F p − ( p 5 ) ≡ 0 ( mod p ) .

For example,

( 2 5 ) = − 1 , F 3 = 2 , F 2 = 1 , ( 3 5 ) = − 1 , F 4 = 3 , F 3 = 2 , ( 5 5 ) = 0 , F 5 = 5 , ( 7 5 ) = − 1 , F 8 = 21 , F 7 = 13 , ( 11 5 ) = + 1 , F 10 = 55 , F 11 = 89.

It is not known whether there exists a prime p such that

F p − ( p 5 ) ≡ 0 ( mod p 2 ) .

Such primes (if there are any) would be called Wall–Sun–Sun primes.

Also, if p ≠ 5 is an odd prime number then:

5 F p ± 1 2 2 ≡ { 1 2 ( 5 ( p 5 ) ± 5 ) ( mod p ) if p ≡ 1 ( mod 4 ) 1 2 ( 5 ( p 5 ) ∓ 3 ) ( mod p ) if p ≡ 3 ( mod 4 ) .

Example 1. p = 7, in this case p ≡ 3 (mod 4) and we have:

( 7 5 ) = − 1 : 1 2 ( 5 ( 7 5 ) + 3 ) = − 1 , 1 2 ( 5 ( 7 5 ) − 3 ) = − 4. F 3 = 2  and  F 4 = 3. 5 F 3 2 = 20 ≡ − 1 ( mod 7 )  and  5 F 4 2 = 45 ≡ − 4 ( mod 7 )

Example 2. p = 11, in this case p ≡ 3 (mod 4) and we have:

( 11 5 ) = + 1 : 1 2 ( 5 ( 11 5 ) + 3 ) = 4 , 1 2 ( 5 ( 11 5 ) − 3 ) = 1. F 5 = 5  and  F 6 = 8. 5 F 5 2 = 125 ≡ 4 ( mod 11 )  and  5 F 6 2 = 320 ≡ 1 ( mod 11 )

Example 3. p = 13, in this case p ≡ 1 (mod 4) and we have:

( 13 5 ) = − 1 : 1 2 ( 5 ( 13 5 ) − 5 ) = − 5 , 1 2 ( 5 ( 13 5 ) + 5 ) = 0. F 6 = 8  and  F 7 = 13. 5 F 6 2 = 320 ≡ − 5 ( mod 13 )  and  5 F 7 2 = 845 ≡ 0 ( mod 13 )

Example 4. p = 29, in this case p ≡ 1 (mod 4) and we have:

( 29 5 ) = + 1 : 1 2 ( 5 ( 29 5 ) − 5 ) = 0 , 1 2 ( 5 ( 29 5 ) + 5 ) = 5. F 14 = 377  and  F 15 = 610. 5 F 14 2 = 710645 ≡ 0 ( mod 29 )  and  5 F 15 2 = 1860500 ≡ 5 ( mod 29 )

For odd n, all odd prime divisors of F_n are congruent to 1 modulo 4, implying that all odd divisors of F_n (as the products of odd prime divisors) are congruent to 1 modulo 4.

For example,

F 1 = 1 , F 3 = 2 , F 5 = 5 , F 7 = 13 , F 9 = 34 = 2 ⋅ 17 , F 11 = 89 , F 13 = 233 , F 15 = 610 = 2 ⋅ 5 ⋅ 61.

All known factors of Fibonacci numbers F(i) for all i < 50000 are collected at the relevant repositories.

Periodicity modulo n

If the members of the Fibonacci sequence are taken mod n, the resulting sequence is periodic with period at most 6n. The lengths of the periods for various n form the so-called Pisano periods  A001175. Determining a general formula for the Pisano periods is an open problem, which includes as a subproblem a special instance of the problem of finding the multiplicative order of a modular integer or of an element in a finite field. However, for any particular n, the Pisano period may be found as an instance of cycle detection.

Right triangles

Starting with 5, every second Fibonacci number is the length of the hypotenuse of a right triangle with integer sides, or in other words, the largest number in a Pythagorean triple. The length of the longer leg of this triangle is equal to the sum of the three sides of the preceding triangle in this series of triangles, and the shorter leg is equal to the difference between the preceding bypassed Fibonacci number and the shorter leg of the preceding triangle.

The first triangle in this series has sides of length 5, 4, and 3. Skipping 8, the next triangle has sides of length 13, 12 (5 + 4 + 3), and 5 (8 − 3). Skipping 21, the next triangle has sides of length 34, 30 (13 + 12 + 5), and 16 (21 − 5). This series continues indefinitely. The triangle sides a, b, c can be calculated directly:

a n = F 2 n − 1 b n = 2 F n F n − 1 c n = F n 2 − F n − 1 2 .

These formulas satisfy a n 2 = b n 2 + c n 2 for all n, but they only represent triangle sides when n > 2.

Any four consecutive Fibonacci numbers F_n, F_n+1, F_n+2 and F_n+3 can also be used to generate a Pythagorean triple in a different way:

a = F n F n + 3 ; b = 2 F n + 1 F n + 2 ; c = F n + 1 2 + F n + 2 2 ; a 2 + b 2 = c 2 .

Example 1: let the Fibonacci numbers be 1, 2, 3 and 5. Then:

a = 1 × 5 = 5 b = 2 × 2 × 3 = 12 c = 2 2 + 3 2 = 13 5 2 + 12 2 = 13 2

Magnitude

Since F_n is asymptotic to φ n / 5 , the number of digits in F_n is asymptotic to n log 10 ⁡ φ ≈ 0.2090 n . As a consequence, for every integer d > 1 there are either 4 or 5 Fibonacci numbers with d decimal digits.

More generally, in the base b representation, the number of digits in F_n is asymptotic to n log b ⁡ φ .

Applications

The Fibonacci numbers are important in the computational run-time analysis of Euclid's algorithm to determine the greatest common divisor of two integers: the worst case input for this algorithm is a pair of consecutive Fibonacci numbers.

Brasch et al. 2012 show how a generalised Fibonacci sequence also can be connected to the field of economics. In particular, it is shown how a generalised Fibonacci sequence enters the control function of finite-horizon dynamic optimisation problems with one state and one control variable. The procedure is illustrated in an example often referred to as the Brock–Mirman economic growth model.

Yuri Matiyasevich was able to show that the Fibonacci numbers can be defined by a Diophantine equation, which led to his solving Hilbert's tenth problem.

The Fibonacci numbers are also an example of a complete sequence. This means that every positive integer can be written as a sum of Fibonacci numbers, where any one number is used once at most.

Moreover, every positive integer can be written in a unique way as the sum of one or more distinct Fibonacci numbers in such a way that the sum does not include any two consecutive Fibonacci numbers. This is known as Zeckendorf's theorem, and a sum of Fibonacci numbers that satisfies these conditions is called a Zeckendorf representation. The Zeckendorf representation of a number can be used to derive its Fibonacci coding.

Fibonacci numbers are used by some pseudorandom number generators.

They are also used in planning poker, which is a step in estimating in software development projects that use the Scrum (software development) methodology.

Fibonacci numbers are used in a polyphase version of the merge sort algorithm in which an unsorted list is divided into two lists whose lengths correspond to sequential Fibonacci numbers – by dividing the list so that the two parts have lengths in the approximate proportion φ. A tape-drive implementation of the polyphase merge sort was described in The Art of Computer Programming.

Fibonacci numbers arise in the analysis of the Fibonacci heap data structure.

The Fibonacci cube is an undirected graph with a Fibonacci number of nodes that has been proposed as a network topology for parallel computing.

A one-dimensional optimization method, called the Fibonacci search technique, uses Fibonacci numbers.

The Fibonacci number series is used for optional lossy compression in the IFF 8SVX audio file format used on Amiga computers. The number series compands the original audio wave similar to logarithmic methods such as µ-law.

Since the conversion factor 1.609344 for miles to kilometers is close to the golden ratio (denoted φ), the decomposition of distance in miles into a sum of Fibonacci numbers becomes nearly the kilometer sum when the Fibonacci numbers are replaced by their successors. This method amounts to a radix 2 number register in golden ratio base φ being shifted. To convert from kilometers to miles, shift the register down the Fibonacci sequence instead.

In nature

Fibonacci sequences appear in biological settings, in two consecutive Fibonacci numbers, such as branching in trees, arrangement of leaves on a stem, the fruitlets of a pineapple, the flowering of artichoke, an uncurling fern and the arrangement of a pine cone, and the family tree of honeybees. However, numerous poorly substantiated claims of Fibonacci numbers or golden sections in nature are found in popular sources, e.g., relating to the breeding of rabbits in Fibonacci's own unrealistic example, the seeds on a sunflower, the spirals of shells, and the curve of waves.

Przemysław Prusinkiewicz advanced the idea that real instances can in part be understood as the expression of certain algebraic constraints on free groups, specifically as certain Lindenmayer grammars.

A model for the pattern of florets in the head of a sunflower was proposed by H. Vogel in 1979. This has the form

θ = 2 π ϕ 2 n ,   r = c n

where n is the index number of the floret and c is a constant scaling factor; the florets thus lie on Fermat's spiral. The divergence angle, approximately 137.51°, is the golden angle, dividing the circle in the golden ratio. Because this ratio is irrational, no floret has a neighbor at exactly the same angle from the center, so the florets pack efficiently. Because the rational approximations to the golden ratio are of the form F(j):F(j + 1), the nearest neighbors of floret number n are those at n ± F(j) for some index j, which depends on r, the distance from the center. It is often said that sunflowers and similar arrangements have 55 spirals in one direction and 89 in the other (or some other pair of adjacent Fibonacci numbers), but this is true only of one range of radii, typically the outermost and thus most conspicuous.

The bee ancestry code

Fibonacci numbers also appear in the pedigrees of idealized honeybees, according to the following rules:

If an egg is laid by an unmated female, it hatches a male or drone bee.

If, however, an egg was fertilized by a male, it hatches a female.

Thus, a male bee always has one parent, and a female bee has two.

If one traces the pedigree of any male bee (1 bee), he has 1 parent (1 bee), 2 grandparents, 3 great-grandparents, 5 great-great-grandparents, and so on. This sequence of numbers of parents is the Fibonacci sequence. The number of ancestors at each level, F_n, is the number of female ancestors, which is F_n−1, plus the number of male ancestors, which is F_n−2. This is under the unrealistic assumption that the ancestors at each level are otherwise unrelated.

The human X chromosome inheritance tree

Luke Hutchison noticed that the number of possible ancestors on the X chromosome inheritance line at a given ancestral generation also follows the Fibonacci sequence. A male individual has an X chromosome, which he received from his mother, and a Y chromosome, which he received from his father. The male counts as the "origin" of his own X chromosome ( F 1 = 1 ), and at his parents' generation, his X chromosome came from a single parent ( F 2 = 1 ). The male's mother received one X chromosome from her mother (the son's maternal grandmother), and one her father (the son's maternal grandfather), so two grandparents contributed to the male descendant's X chromosome ( F 3 = 2 ). The maternal grandfather received his X chromosome from his mother, and the maternal grandmother received X chromosomes from both of her parents, so three great-grandparents contributed to the male descendant's X chromosome ( F 4 = 3 ). Five great-great-grandparents contributed to the male descendant's X chromosome ( F 5 = 5 ), etc. (Note that this assumes that all ancestors of a given descendant are independent, but if any genealogy is traced far enough back in time, ancestors begin to appear on multiple lines of the genealogy, until eventually a population founder appears on all lines of the genealogy.)

Generalizations

The Fibonacci sequence has been generalized in many ways. These include:

Generalizing the index to negative integers to produce the negafibonacci numbers.

Generalizing the index to real numbers using a modification of Binet's formula.

Starting with other integers. Lucas numbers have L₁ = 1, L₂ = 3, and L_n = L_n−1 + L_n−2. Primefree sequences use the Fibonacci recursion with other starting points to generate sequences in which all numbers are composite.

Letting a number be a linear function (other than the sum) of the 2 preceding numbers. The Pell numbers have P_n = 2P_{n − 1} + P_{n − 2}.

Not adding the immediately preceding numbers. The Padovan sequence and Perrin numbers have P(n) = P(n − 2) + P(n − 3).

Generating the next number by adding 3 numbers (tribonacci numbers), 4 numbers (tetranacci numbers), or more. The resulting sequences are known as n-Step Fibonacci numbers.

Adding other objects than integers, for example functions or strings – one essential example is Fibonacci polynomials.