Chapter 8: Q36E (page 536)
Findwhen, wheresatisfies the recurrence relation
with.
Short Answer
The required expressions are:
Chapter 8: Q36E (page 536)
Findwhen, wheresatisfies the recurrence relation
with.
The required expressions are:
All the tools & learning materials you need for study success - in one app.
Get started for freeIf G(x) is the generating function for the sequence, what is the generating function for each of these sequences?
a) (Assuming that terms follow the pattern of all but the first three terms)
b)
c) (Assuming that terms follow the pattern of all but the first four terms)
d)
e) [Hint: Calculus required here.]
f)
Find a closed form for the generating function for each of these sequences. (For each sequence, use the most obvious choice of a sequence that follows the pattern of the initial terms listed.)
a) \(0,2,2,2,2,2,2,0,0,0,0,0, \ldots \)
b) \(0,0,0,1,1,1,1,1,1, \ldots \)
c) \(0,1,0,0,1,0,0,1,0,0,1, \ldots \)
d) \(2,4,8,16,32,64,128,256, \ldots \)
e) \(\left( {\begin{array}{*{20}{l}}7\\0\end{array}} \right),\left( {\begin{array}{*{20}{l}}7\\1\end{array}} \right),\left( {\begin{array}{*{20}{l}}7\\2\end{array}} \right), \ldots ,\left( {\begin{array}{*{20}{l}}7\\7\end{array}} \right),0,0,0,0,0, \ldots \)
f) \(2, - 2,2, - 2,2, - 2,2, - 2, \ldots \)
g) \(1,1,0,1,1,1,1,1,1,1, \ldots \)
h) \(0,0,0,1,2,3,4, \ldots \)
Use generating functions to solve the recurrence relation with the initial condition.
Suppose that the function satisfies the recurrence relation whenever is a perfect square greater than and .
a) Find .
b) Give a big -estimate for. [Hint: Make the substitution ].
How many ternary strings of length six contain two consecutive 0's ?
What do you think about this solution?
We value your feedback to improve our textbook solutions.