Binets formula using generating functions

Miliyon T.
October 7, 2013
Abstract
Generating functions express an infinite sequence as coefficients arising from a power
series in an auxiliary variable. The closed form of a generating function is a concise
way to represent such an infinite sequence. In this concise note we are going to solve
special type of recurrence relation using generating function.

Introduction

1.1

Generating Functions

Definition 1.1. The (ordinary) generating function for the sequence a0 , a1 , a2 , of real
numbers is the formal power series
2

f (x) = a0 + a1 x + a2 x + =

ai x i

i=0

or any equivalent closed form expression.

Note:
1. Generating functions can be used to solve recurrence relations. As we will see soon.
2. Each sequence an defines a unique generating function f (x), and conversely.
3. Generating functions are considered as algebraic forms and can be manipulated as
such, without regard to actual convergence of the power series.
Example .1. The generating function for the sequence 1, 1, 1, 1, 1, is
f (x) = 1 + x + x2 + x3 +
As we know from geometric series the closed form of (1) is given by
f (x) =

1
1x

(1)

Example .2. The generating function for the sequence 1, 1, 1, 1, 1, ...is

1 + x + x2 + x3 + x4 + =

1
1x

Differentiating both sides of this expression produces

1 + 2x + 3x2 + 4x3 + =
Thus,

1.2

1
(1x)2

1
(1 x)2

is a closed form expression for the generating function of the sequence 1, 2, 3, 4, ....

Recurrence Relation

Definition 1.2. A recurrence relation for the sequence a0 , a1 , a2 , is an equation relating

the term an to certain of the preceding terms ai , i n, for each n n0 .

2
2.1

Binets formula
Notation and Identities

The following notations and identities are used throughout the proof of Theorem (2.1). We
denote the roots of the equation

by 1 an 2 with value

1+ 5
2

and

1 5
2

x2 x 1 = 0

(2)

respectively. The identities are the following

2 = 1 5
1
= 1
2

(3)
(4)

Theorem 2.1. The nth term of a Fibonacci sequence is given by



1
n
n
Fn = 1 2
5
Where 1 =

1+ 5
2

and 2 =

1 5
.
2

Proof. Consider a Fibonacci sequence which is given by the following recurrence relation
Fn = Fn1 + Fn2

f or n 2.

(5)

And F0 and F1 are defined to be 0 and 1 respectively. The generating function for Fibonacci
sequence is

X
f (x) = F0 + F1 x + F2 x2 + =
Fi xi
i=0

When we assign their respective numbers for each Fi s f (x) becomes

f (x) = 0 + 1x + 1x2 + 2x3 + 3x4 + 5x5 +

(6)

The generating function (6) wont help us to solve the recurrence relation in (5). So, lets
find the closed form. In order to find the closed form we are going to do some trick, which
indeed based at how the Fibonacci sequence recursively defined. Here is what we are going
to do, first write (6) as it is,
f (x)
= 0
+ 1x
+ 1x2
+ 2x3 + 3x4 + 5x5 +
xf (x)
= 0x + 1x2
+ 1x3
+ 2x4 + 3x5 + 5x6 +
2
2
3
4
x f (x)
= 0x + 1x
+ 1x
+ 2x5 + 3x6 + 5x7 +
f (x) xf (x) x2 f (x) = 0
+x
+x2 {1 1} +0 x3 +0 x4 +0 x5 +
Clearly, on the right side we are left with x because the summands goes to 0. Hence
f (x) xf (x) x2 f (x) = x
Thus,
f (x) =

x
1 x x2

(7)

So far, we have found a generating function (7) for (5). Now, lets use method partial fraction
f (x) =

x2

x
A
B
x
=
=
+
+x1
(x + 1 )(x + 2 )
(x + 1 ) (x + 2 )

To find A and B we are going to solve the following system of equation

A + B = 1
2 A + 1 B = 0
Which results A =

1
5

and B =

.Thus,
5

1
1
1
2
f (x) =
+
5 (x + 1 )
5 (x + 2 )


1
2
1

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




1
1
1
1
1
1
=
x
=

x
5 ( 2 + 1) ( 1 + 1)
5 (1 x + 1) (2 x + 1)


1
1
1
=

5 (1 1 x) (1 2 x)

But we know that

1
1ax

= 1 + ax + a2 x2 + a3 x3 + . Hence
1
= 1 + 1 x + 21 x2 + 31 x3 +
1 1 x
3

1
= 1 + 2 x + 22 x2 + 32 x3 +
1 2 x
Then, we will get


1
1
1
f (x) =

5 (1 1 x) (1 2 x)


1
2 2
3 3
2 2
3 3
= 1 + 1 x + 1 x + 1 x + (1 + 2 x + 2 x + 2 x + )
5


1
2
2 2
3
3 3
= (1 2 )x + (1 2 )x + (1 2 )x +
5

X
1
(n1 n2 )xn
=
5
n=0
Therefore,


1
n
n
Fn = 1 2
5

References
[1] [Wiki] Genreating Functions.
[2] [Wiki] Fibonacci Sequence.