Chapter 8: Q11SE (page 567)
Find the solution of the recurrence relation ifand
Short Answer
The solution is
Chapter 8: Q11SE (page 567)
Find the solution of the recurrence relation ifand
The solution is
All the tools & learning materials you need for study success - in one app.
Get started for freeFor each of these generating functions, provide a closed formula for the sequence it determines.
a) \({(3x - 4)^3}\)
b) \({\left( {{x^3} + 1} \right)^3}\)
c) \(1/(1 - 5x)\)
d) \({x^3}/(1 + 3x)\)
e) \({x^2} + 3x + 7 + \left( {1/\left( {1 - {x^2}} \right)} \right)\)
f) \(\left( {{x^4}/\left( {1 - {x^4}} \right)} \right) - {x^3} - {x^2} - x - 1\)
g) \({x^2}/{(1 - x)^2}\)
h) \(2{e^{2x}}\)
Find the coefficient of \({x^{10}}\) in the power series of each of these functions.
a) \(1/(1 - 2x)\)
b) \(1/{(1 + x)^2}\)
c) \(1/{(1 - x)^3}\)
d) \(1/{(1 + 2x)^4}\)
e) \({x^4}/{(1 - 3x)^3}\)
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 \)
Apply the algorithm described in the Example for finding the closest pair of points, using the Euclidean distance between points, to find the closest pair of the pointsand .
What do you think about this solution?
We value your feedback to improve our textbook solutions.