Chapter 8: Q9SE (page 567)
Solve the recurrence relation if and . [Hint: Take logarithms of both sides to obtain a recurrence relation for the sequence
Short Answer
The solution is
Chapter 8: Q9SE (page 567)
Solve the recurrence relation if and . [Hint: Take logarithms of both sides to obtain a recurrence relation for the sequence
The solution is
All the tools & learning materials you need for study success - in one app.
Get started for free47. A new employee at an exciting new software company starts with a salary of550,000and is promised that at the end of each year her salary will be double her salary of the previous year, with an extra increment of$ 10,000 for each year she has been with the company.
a) Construct a recurrence relation for her salary for hern th year of employment.
b) Solve this recurrence relation to find her salary for hern th year of employment.
Some linear recurrence relations that do not have constant coefficients can be systematically solved. This is the case for recurrence relations of the form \(f(n){a_n} = g(n){a_{n - 1}} + h(n)\)Exercises 48-50 illustrate this.
For 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}}\)
For each of these generating functions, provide a closed formula for the sequence it determines.
a) \({\left( {{x^2} + 1} \right)^3}\)
b) \({(3x - 1)^3}\)
c) \(1/\left( {1 - 2{x^2}} \right)\)
d) \({x^2}/{(1 - x)^3}\)
e) \(x - 1 + (1/(1 - 3x))\)
f) \(\left( {1 + {x^3}} \right)/{(1 + x)^3}\)
g) \(x/\left( {1 + x + {x^2}} \right)\)
h) \({e^{3{x^2}}} - 1\)
Suppose that the votes of people for different candidates (where there can be more than two candidates) for a particular office are the elements of a sequence. A person wins the election if this person receives a majority of the votes.
a) Devise a divide-and-conquer algorithm that determines whether a candidate received a majority and, if so, determine who this candidate is. [Hint: Assume that is even and split the sequence of votes into two sequences, each with elements. Note that a candidate could not have received a majority of votes without receiving a majority of votes in at least one of the two halves.]
b) Use the master theorem to give a big-estimate for the number of comparisons needed by the algorithm you devised in part (a).
To prove every allowable arrangement of the ndisks occurs in the solution of this variation of the puzzle.
What do you think about this solution?
We value your feedback to improve our textbook solutions.