Scribd
Upload
30 views3 pages

Lecture 4: Recurrence Relation Using Generating Functions: 0 1 2 3 4 N N I 0 I I 0 1 2 2 3 3 4 4 N N

Recurrences

Uploaded by

sunshinesun49
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
30 views3 pages

Lecture 4: Recurrence Relation Using Generating Functions: 0 1 2 3 4 N N I 0 I I 0 1 2 2 3 3 4 4 N N

Recurrences

Uploaded by

sunshinesun49
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/ 3

Discrete Mathematics 23/09/2019

Lecture 4: Recurrence Relation using Generating functions


Instructor: Sourav Chakraborty Scribe: Barkha Bharti

1 How to solve Recurrence relation using generating func-


tions.
For the sequence a0 , a1 , a2 , a3 , a4 ......., an the generating functions can be written as-
P (x) = ni=0 ai xi = a0 + a1 x + a2 x2 + a3 x3 + a4 x4 + .......an xn
P

Pn OR
ai i
P (x) = i=0 n! x

So in a general form we can write a generating function as-


Pn i
P (x) = i=0 f (ai )x

2 General View
Given a recurrence relation for the sequence (an ), we
Pn i.
1. Deduce from it, an equation satisfied by the generating function a(x) = i=0 ai x

2. Solve this equation to get an explicit expression for the generating function.

3. Extract the coefficient an of xn from a(x), by expanding a(x) as a power series.

3 Some Examples
1. Fibonacci Series: Recurrence function given as:
Fn = Fn−1 + Fn−2 n ≥ 2 F1 = 1 F0 = 0

2. Catalan’s Number Recurrence function given below:


Cn = ni=1 Ci Cn−i C1 = 1 C2 = 2
P

3. Dearrangement :Recurrence function given as:


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

Problem 1 Solve the below recurrence relations using generating function-: Fn = Fn−1 +
Fn−2 n ≥ 2 F1 = 1 F0 = 0

4-1
Solution 1 Let P(x) be the generating function given as-
P (x) = ni=0 F (i)xi where F(i) is the fibonacci no.
P

=⇒ 0 + x + x2 + 2x3 + 3x4 + .......


P(X) can also be written as:
P(X) = X + ni=2 F (i)xi
P

=⇒ X + ni=2 (F (i − 1) + F (i − 2))xi
P

=⇒ P (X) = X + ni=2 F (i − 1)xi + ni=2 F (i − 2)xi


P P

=⇒ P (X) = X + X n−1
P i 2
Pn−2 i
i=2 F (i − 1)x + X i=2 F (i − 2)x

=⇒ P (X) = X + XP (X) + X 2 P (X)


∴ (1 − X − X 2 )P (X) = X
X
P (X) =
(1 − X − X 2 )
−X
P (X) =
(X 2 + X − 1)
α β
∴ P (X) = +
X −φ X −γ
φγ = −1 φ − γ = −1
√ √
−1 − 5 −1 + 5
φ= γ=
2 2
α + β = 1 αγ + βφ = 0
√ √
−1 − 5 −1 + 5
α= √ β= √
2 5 2 5
α 1 β 1
P (X) = +
−φ (1 + Xγ −γ (1 + Xφ
1
= ∞ i i
P
We know, i=0 (−1) (Xφ)
(1 + Xφ
1
= ∞ i i
P
and, i=0 (−1) (Xγ)
(1 + Xγ
−1 P∞ i i −1 P∞ i i
∴ P (X) = √ i=0 (−1) (Xγ) + √ i=0 (−1) (Xφ)
5 5
−1 −1
=⇒ P (X) = ∞ i i i i i
P
i=0 ( √ (−1) (γ) + √ .(−1) (φ) )(X)
5 5
−1 −1
∴ Fn = √ (−1)n (γ)n + √ .(−1)n (φ)n
5 5
n
φ −γ n
=⇒ Fn = (−1)n . √
5

4-2
φn − γ n
=⇒ Fn =
φ−γ

Problem 2 Solve the below recurrence relations using generating function-:(For exercise)
Fn = Fn−1 + Fn−2 + Fn−3 + 2 n ≥ 2 F1 = F0 = 0 F1 = 1

4-3

You might also like