Scribd
Upload
515 views7 pages

Binet Formula Proofs

The document proves Binet's formula for calculating the nth term of the Fibonacci sequence using different mathematical approaches. It begins by introducing the Fibonacci sequence and the golden ratio. It then proves Binet's formula first using a combinatorial proof by setting up a characteristic equation and solving it. Next, it provides an alternative proof by mathematical induction. Finally, it proves Binet's formula using tools from linear algebra by diagonalizing the matrix form of the recurrence relation and taking its powers.

Uploaded by

Miliyon Tilahun
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
515 views7 pages

Binet Formula Proofs

The document proves Binet's formula for calculating the nth term of the Fibonacci sequence using different mathematical approaches. It begins by introducing the Fibonacci sequence and the golden ratio. It then proves Binet's formula first using a combinatorial proof by setting up a characteristic equation and solving it. Next, it provides an alternative proof by mathematical induction. Finally, it proves Binet's formula using tools from linear algebra by diagonalizing the matrix form of the recurrence relation and taking its powers.

Uploaded by

Miliyon Tilahun
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Binets Formula

Miliyon T.
October 7, 2014
Abstract
A sequence of integers
1, 1, 2, 3, 5,
is called Fibonacci1 sequence. By convention, the sequence begins either with F0 = 0 or
with F1 = 1. Thus, the first two terms F1 and F2 in the Fibonacci sequence are either
1 and 1, or 0 and 1, depending on the chosen starting point of the sequence but in this
paper we shall define F1 = 1 and F2 = 1 (i.e F0 = 0), and each subsequent number is
the sum of the previous two Fn = Fn1 + Fn2 . So we are interested in finding the nth
term Fn of this sequence. In fact, the nth term of the Fibonacci sequence is given by
2 Binets formula which we are going to prove using different approach.

Introduction

1.1

Golden ratio

The golden ratio (golden section) is defined as follows


a
a+b
=
b
a
Or we can define it using continued fraction
:=

:= 1 +

1
1+

(1)

1
1+

1
1+

1+

1+

1
1
1+ 1

..

The other way to define the golden ratio would be this


v
v
u
s
u
u
r
u
q
u

t
t
:= 1 + 1 + 1 + 1 + 1 + 1 +
1
2

(2)

Leonardo of Pisa, known as Fibonacci was the first European mathematician to write about this sequence.
Binet derived it in 1843, but it was already known to Euler over a century earlier.

1.2 Interesting Identities

1.2

2 BINETS FORMULA

Interesting Identities

The identity that we get from (1) directly


1

(3)

2 = 1 +

(4)

=1+
The following identity is derived from (2)

Binets formula

Theorem 2.1. For any n N the nth term of the Fibonacci sequence is given by


n 
1
1
n
Fn =

5
where is a golden ratio.
Proof. [Combinatorial] The Fibonacci sequence is defined by the following recurrence relation
an = an1 + an2
This can be rewritten as follows
an an1 an2 = 0

(5)

Which is clearly a homogeneous equation. The characteristic3 () equation of (5) is given by


2 1 = 0

(6)

Thus using quadratic formula the solutions to (6) are

1+ 5
1 5
=
&
=
2
2
Hence the general solution to the recurrence relation (5) is
n 
n
1+ 5
1 5
an =
+
2
2


(7)

But from Fibonacci sequence we know that the values of a0 and a1 are 0 and 1 respectively.
So by using this we are going to find the values of and
Substitute n = 1 in (7)
1 
1

1+ 5
1 5
+
a1 =
2
2
3

Dr. Yirgalem

2.1 An Alternative proof of Binets formula

2 BINETS FORMULA

But a1 = 1, then we have



 
1 5
1+ 5
+
=1

2
2


(8)

Substitute n = 2 in (7)
2 
2
1+ 5
1 5
a1 =
+
2
2


But a2 = 1, then we have



 
3 5
3+ 5
+
=1

2
2


(9)

From (8) and (9) we have two equations with two variable. Hence by using simultaneous
1
equation or other method we will get the values of and to be 15 and
respectively.
5
Therefore we have
n
n


1 1 5
1 1+ 5

an =
2
2
5
5

2.1

An Alternative proof of Binets formula




n 
1
1
n
Fn =

Proof. [Induction] 4 For n = 1






1
1
1
1
2
F1 + F2 =
+ 2

5
5


 4

1
1 1
= 2 1 +
2
5
5
 
 2

1
1 ( 1)(2 + 1)
=
5 +
2
5
5


1 (2 1)
=1+
(2 1 = by (4))
2

5




1 2 1
1
1
=1+
=1+

5
5
 

1
=1+
5
5
= 2 = F3
4

Alfred and Ingmar

3 PROOF USING LINEAR ALGEBRA

For n = k
Fk + Fk1 = Fk2
Now, for n = k + 1
Fk+1 + Fk+2





k+1 
k+2 
1
1
1
1
k+1
k+2


=
+

5
5


k+2 
k+1 
1
1
1
= k+2 + k+1

5


k+1 
 
1
1
1
k+1
= ( + 1)

+1

5


k+1 
2 

2 

1
1
1
1
1
k+1
2
= ( )

(
=
+1)

5
k+3 


1
1
k+3
=

5
= Fk+3

Hence, by principles of mathematical induction it follows that




n 
1
1
n
Fn =
n N.

3
3.1

Proof using Linear Algebra


Some Linear Algebra facts
   
F1
1
=
F2
1


&

 


Fn
0 1 Fn1
=
Fn+1
1 1
Fn

We are going to see the importance of (10) in proving the following lemma.
Lemma 3.1. For any n N
 
n1  
Fn
0 1
1
=
Fn+1
1 1
1

Proof. [Induction]
For n = 1


 
0  
   
F1
0 1
1
1
1
=
= I2
=
F2
1 1
1
1
1

(10)

3.1 Some Linear Algebra facts

3 PROOF USING LINEAR ALGEBRA

For n = k. This step is called Induction hypothesis (IH).



 
k1  
Fk
0 1
1
=
Fk+1
1 1
1
Now for n = k + 1. But from (10) we have


 
Fk+1
0
=
Fk+2
1

0
=
1

0
=
1


Fk
Fk+1

k1  
1 0 1
1
1 1 1
1
k  
1
1
1
1
1
1



(by IH)

Hence by using principle of mathematical induction we can conclude that




 
n1  
0 1
1
Fn
=
Fn+1
1 1
1

n N.

Theorem 3.2 (Binet). A closed form of a Fibonacci sequence is given by




1
n
n
Fn = 1 2
5
Where 1 =

1+ 5
2

and 2 =

(11)

1 5
.
2

Proof. From (3.1) we have




 
n1  
Fn
0 1
1
=
Fn+1
1 1
1



0 1
Let A =
1 1
If some how we could diagonalize matrix A (i.e to write A in the form A = P DP 1 ), taking
any powers of A would be simple. Because we know that An = P Dn P 1 and we would get
such a simple formula for Fn . So lets start diagonalize A.
First lets find the eigenvalues. Which can be found as follows




1

|A I2 | =
1 1
= (1 ) 1
= 2 1
Thus, by using quadratic formula we would get

1+ 5
1 =
= 1
and
2
5

1 5
2 =
= 2
2

3.1 Some Linear Algebra facts

3 PROOF USING LINEAR ALGEBRA

Now, lets find the corresponding eigenvectors


For 1 = 1
 
0
(A 1 I2 )V =
0
 
v
Where V = 1 , then
v2


1
1
(A 1 I2 )V = (A 1 I2 )V =
1 1 1

   
v1
0
=
v2
0

After multiplying the matrices in the left side and equating with the right side we will get
the following system of equation
1 v1 + v2 = 0
v1 + (1 1 )v2 = 0

(12)
(13)

1 v1 v2 = 0

(14)

Multiplying (13) by 1

Using (12) and (14)


  
  
1
v1
v1
=
v
=
V =
1 v1
1 1
v2
 
1
Hence the corresponding eigenvector for 1 is
.
1  
1
Similarly, one can find that the eigenvector for 2 is
. Now we are going to write matrix
2






1 1
2 1
1 0
1
1
1
in a form A = P DP , where P =
and D =
P = 2 1
1 2
1 1
0 2
Finally, lets compute

 
n1  
Fn
0 1
1
=
Fn+1
1 1
1

 


n1
1
2 1 1
1 1 1 0
=
1
1 2
0 2
2 1 1 1



  n1
1
0
2 1
1 1 1
=
n1
0
2
1 + 1
2 1 1 2

  n1

1
1 1
1 (2 1)
=
n1
5 1 2 2 (1 + 1)
 n1

1 1 (1 ) + n1
(2 )
2
=
n (1 ) + n (2 )
5
 n1 n  2
1
1 2
=
n+1
n+1

5 1 2
That was to be shown!
6

REFERENCES

REFERENCES

References
[1] [Mario Livio] The Golden Ratio; The Story of Phi,the Worlds Most Astonishing Number.
[2] [Alfred and Ingmar] The Fabulous Fibonacci Numbers.
[3] [Ron Larson ] Elementary Linear Algebra, 6th ed.

You might also like