recategorized by
477 views

1 Answer

3 votes
3 votes
The fibonacci sequence can be wriiten as per definition given :

$a_{0},$$a_{1},a_{2},a_{3},a_{4},a_{5},a_{6},a_{7},....$ = $1,1,2,3,5,8,13,21,…...$

Therefor the ordinary generating function corresponding to the given sequence =

$G(x) = 1.x^{0} + 1.x^{1} +2.x^{2}+3.x^{3} +5.x^{4}+8.x^{5}....$        $\textbf{......(1) }$

            $= 1.+ 1.x^{1} +2.x^{2}+3.x^{3} +5.x^{4}+8.x^{5}....$

$xG(x) = 1.x^{1} + 1.x^{2} +2.x^{3}+3.x^{4} +5.x^{5}+....$     $\textbf{......(2) }$

Subtracting $\textbf{(2) }$ from $\textbf{(1) }$

$G(x) - xG(x) = 1+ 0x^{1} + 1x^{2} +1x^{3} + 2x^{4} + 3x^{5} + 5x^{6}+.....$

$= 1+ 0x^{1} + x^{2}(1x^{0} + 1x^{1} + 2x^{2} + 3x^{3}+.....)$

$= 1+ 0x^{1} + x^{2}G(x)$

$\Rightarrow G(x) = \frac{1}{1-x-x^{2}}$
edited by

Related questions

1 votes
1 votes
0 answers
3
admin asked Dec 15, 2022
383 views
Let us say we have a supply of $1$ rupee and $2$ rupee coins in large quantities. What is the generating function for the number of ways of giving change with $1$ rupee a...
1 votes
1 votes
0 answers
4
admin asked Dec 15, 2022
175 views
Derangements are permutations $\pi$ of the set $\{1,2, \ldots, n\}$ such that $\pi(i) \neq i.$ Compute the number of derangements on the set $1,2, \ldots, n$.