recategorized by
9,975 views
36 votes
36 votes
What is the generating function $G(z)$ for the sequence of Fibonacci numbers?
recategorized by

8 Answers

3 votes
3 votes

Fibonacci series :  1,1,2,3,5,8,13..........

Its generating function is :

1*z+ 1*z+2*z+3*z+5*z4+-----------∞  =  G(z)

Above series can be rewritten as :

1 + (z +z2) + (z+z2)+....................∞  = G(z)

1/(1 - (z+z2)   = G(z)

Hence generating function G(z) =  1/(1- z -z2)

Related questions

25 votes
25 votes
4 answers
5
makhdoom ghaya asked Nov 7, 2016
5,115 views
The total number of Boolean functions which can be realised with four variables is:$4$$17$$256$$65, 536$
23 votes
23 votes
9 answers
7
makhdoom ghaya asked Nov 14, 2016
5,307 views
Show that the conclusion $(r \to q)$ follows from the premises$:p, (p \to q) \vee (p \wedge (r \to q))$
22 votes
22 votes
6 answers
8
makhdoom ghaya asked Nov 14, 2016
5,504 views
Give a regular expression over the alphabet $\{0, 1\}$ to denote the set of proper non-null substrings of the string $0110$.