8.

2 Solving Linear Recurrence Relations 551

3. Solve these recurrence relations together with the initial 12. Find the solution to an = 2an−1 + an−2 − 2an−3
conditions given. for n = 3, 4, 5, … , with a0 = 3, a1 = 6, and a2 = 0.
a) an = 2an−1 for n ≥ 1, a0 = 3 13. Find the solution to an = 7an−2 + 6an−3 with a0 = 9,
b) an = an−1 for n ≥ 1, a0 = 2 a1 = 10, and a2 = 32.
c) an = 5an−1 − 6an−2 for n ≥ 2, a0 = 1, a1 = 0
d) an = 4an−1 − 4an−2 for n ≥ 2, a0 = 6, a1 = 8 14. Find the solution to an = 5an−2 − 4an−4 with a0 = 3,
e) an = −4an−1 − 4an−2 for n ≥ 2, a0 = 0, a1 = 1 a1 = 2, a2 = 6, and a3 = 8.
f ) an = 4an−2 for n ≥ 2, a0 = 0, a1 = 4 15. Find the solution to an = 2an−1 + 5an−2 − 6an−3 with
g) an = an−2 ∕ 4 for n ≥ 2, a0 = 1, a1 = 0 a0 = 7, a1 = −4, and a2 = 8.
4. Solve these recurrence relations together with the initial
∗ 16. Prove Theorem 3.
conditions given.
a) an = an−1 + 6an−2 for n ≥ 2, a0 = 3, a1 = 6 17. Prove this identity relating the Fibonacci numbers and the
b) an = 7an−1 − 10an−2 for n ≥ 2, a0 = 2, a1 = 1 binomial coefficients:
c) an = 6an−1 − 8an−2 for n ≥ 2, a0 = 4, a1 = 10
d) an = 2an−1 − an−2 for n ≥ 2, a0 = 4, a1 = 1 fn+1 = C(n, 0) + C(n − 1, 1) + ⋯ + C(n − k, k),
e) an = an−2 for n ≥ 2, a0 = 5, a1 = −1 where n is a positive integer and k = ⌊n ∕ 2⌋. [Hint: Let
f ) an = −6an−1 − 9an−2 for n ≥ 2, a0 = 3, a1 = −3 an = C(n, 0) + C(n − 1, 1) + ⋯ + C(n − k, k). Show that
g) an+2 = −4an+1 + 5an for n ≥ 0, a0 = 2, a1 = 8
the sequence {an } satisfies the same recurrence relation
5. How many different messages can be transmitted in n mi- and initial conditions satisfied by the sequence of Fi-
croseconds using the two signals described in Exercise 19 bonacci numbers.]
in Section 8.1?
6. How many different messages can be transmitted in n mi- 18. Solve the recurrence relation an = 6an−1 − 12an−2 +
croseconds using three different signals if one signal re- 8an−3 with a0 = −5, a1 = 4, and a2 = 88.
quires 1 microsecond for transmittal, the other two sig- 19. Solve the recurrence relation an = −3an−1 − 3an−2 −
nals require 2 microseconds each for transmittal, and a an−3 with a0 = 5, a1 = −9, and a2 = 15.
signal in a message is followed immediately by the next
20. Find the general form of the solutions of the recurrence
signal?
relation an = 8an−2 − 16an−4 .
7. In how many ways can a 2 × n rectangular checkerboard
be tiled using 1 × 2 and 2 × 2 pieces? 21. What is the general form of the solutions of a linear ho-
8. A model for the number of lobsters caught per year is mogeneous recurrence relation if its characteristic equa-
based on the assumption that the number of lobsters tion has roots 1, 1, 1, 1, −2, −2, −2, 3, 3, −4?
caught in a year is the average of the number caught in 22. What is the general form of the solutions of a linear ho-
the two previous years. mogeneous recurrence relation if its characteristic equa-
a) Find a recurrence relation for {Ln }, where Ln is the tion has the roots −1, −1, −1, 2, 2, 5, 5, 7?
number of lobsters caught in year n, under the as- 23. Consider the nonhomogeneous linear recurrence relation
sumption for this model. an = 3an−1 + 2n .
b) Find Ln if 100,000 lobsters were caught in year 1 and
300,000 were caught in year 2. a) Show that an = −2n+1 is a solution of this recurrence
relation.
9. A deposit of $100,000 is made to an investment fund at
the beginning of a year. On the last day of each year two b) Use Theorem 5 to find all solutions of this recurrence
dividends are awarded. The first dividend is 20% of the relation.
amount in the account during that year. The second divi- c) Find the solution with a0 = 1.
dend is 45% of the amount in the account in the previous 24. Consider the nonhomogeneous linear recurrence relation
year. an = 2an−1 + 2n .
a) Find a recurrence relation for {Pn }, where Pn is the a) Show that an = n2n is a solution of this recurrence
amount in the account at the end of n years if no relation.
money is ever withdrawn.
b) Use Theorem 5 to find all solutions of this recurrence
b) How much is in the account after n years if no money
relation.
has been withdrawn?
∗ 10. Prove Theorem 2. c) Find the solution with a0 = 2.
11. The Lucas numbers satisfy the recurrence relation 25. a) Determine values of the constants A and B such that
an = An + B is a solution of recurrence relation an =
Links Ln = Ln−1 + Ln−2 , 2an−1 + n + 5.
and the initial conditions L0 = 2 and L1 = 1. b) Use Theorem 5 to find all solutions of this recurrence
a) Show that Ln = fn−1 + fn+1 for n = 2, 3, … , where fn relation.
is the nth Fibonacci number. c) Find the solution of this recurrence relation with
b) Find an explicit formula for the Lucas numbers. a0 = 4.