Chapter 8: Q23E (page 550)
a) What is the generating function for, where is the number of solutions of when, and are integers with, and ?
b) Use your answer to part (a) to find.
Short Answer
(a)The total generating function is.
(b) Therefore,.
Chapter 8: Q23E (page 550)
a) What is the generating function for, where is the number of solutions of when, and are integers with, and ?
b) Use your answer to part (a) to find.
(a)The total generating function is.
(b) Therefore,.
All the tools & learning materials you need for study success - in one app.
Get started for freeFind the coefficient of \({x^{10}}\) in the power series of each of these functions.
a) \({\left( {1 + {x^5} + {x^{10}} + {x^{15}} + \cdots } \right)^3}\)
b) \({\left( {{x^3} + {x^4} + {x^5} + {x^6} + {x^7} + \cdots } \right)^3}\)
c) \(\left( {{x^4} + {x^5} + {x^6}} \right)\left( {{x^3} + {x^4} + {x^5} + {x^6} + {x^7}} \right)(1 + x + \left. {{x^2} + {x^3} + {x^4} + \cdots } \right)\)
d) \(\left( {{x^2} + {x^4} + {x^6} + {x^8} + \cdots } \right)\left( {{x^3} + {x^6} + {x^9} + } \right. \cdots \left( {{x^4} + {x^8} + {x^{12}} + \cdots } \right)\)
e) \(\left( {1 + {x^2} + {x^4} + {x^6} + {x^8} + \cdots } \right)\left( {1 + {x^4} + {x^8} + {x^{12}} + } \right. \cdots )\left( {1 + {x^6} + {x^{12}} + {x^{18}} + \cdots } \right)\)
If is the generating function for the sequence, what is the generating function for each of these sequences?
a)
b) (Assuming that terms follow the pattern of all but the first term)
c) (Assuming that terms follow the pattern of all but the first four terms)
d)
e) [Hint: Calculus required here.]
f)
50. It can be shown that \({C_B}\)the average number of comparisons made by the quick sort algorithm (described in preamble to Exercise 50 in Section 5.4), when sorting \(n\)elements in random order, satisfies the recurrence relation\({C_n} = n + 1 + \frac{2}{n}\sum\limits_{k = 0}^{n - 1} {{C_k}} \)
for \(n = 1,2, \ldots \), with initial condition \({C_0} = 0\)
a) Show that \(\left\{ {{C_n}} \right\}\)also satisfies the recurrence relation \(n{C_n} = (n + 1){C_{n - 1}} + 2n\)for \(n = 1,2, \ldots \)
b) Use Exercise 48 to solve the recurrence relation in part (a) to find an explicit formula for \({C_n}\)
Solve the recurrence relation if and . (See the hint for Exercise 9.)
How many ternary strings of length six do not contain two consecutiveor twoconsecutive?
What do you think about this solution?
We value your feedback to improve our textbook solutions.