_ -::. :=:....-c::rence relation for.

{Ln}, where Ln is the

o: lobsters caught in year n, under the as-
a for this model.
::=- _:: .=.., c 100,000 lobsters were caught in year 1 and
===-=- were caught in year 2.
- -. =-=- - .:;i, of SIOO,OOO is made to an investment fund at
-= of a year. On the last day of each year two
_ .:=r:-'- are awarded. The first dividend is 20% of the
i:I the account during that year. The second divi-
::.. -' - .; "% of the amount in the account in the previous
::Iild a recurrence relation for {Pn}, where Pn is the
amount in the account at the end of n years if no money
is ever withdrawn.
b How much is in the account after n years if no money
has been withdrawn?
. Prove Theorem 2.
U. The Lncas numbers satisfy the recurrence relation
Ln = Ln-l + Ln-2,
and the initial conditions Lo = 2 and L
1
= 1.
a) Show that Ln = fn-1 + fn+l for n = 2, 3, .. . ,
where fn is the nth Fibonacci number.
b) Find an explicit formula for the Lucas numbers.
12. Find the solution to an = 2an-1 + an-2- 2an-3
for n = 3, 4, 5, ... , with ao = 3, a1 = 6, and a
2
= 0.
13. Find the solution to an = 7an-2 + 6an-3 with ao = 9,
a1 = 10, and a2 = 32.
14. Find the solution to an = San- 2 - 4an-4 with ao = 3,
a1 = 2, a2 = 6, and a3 = 8.
15. Find the solution to an = 2an-l + San-2 - 6an-3 with
ao = 7, a1 = -4, and a2 = 8.
* 16. Prove Theorem 3.
17. Prove this identity relating the Fibonacci numbers and the
binomial coefficients:
fn+1 = C(n, 0) + C(n- 1, 1) + + C(n- k, k),
where n is a positive integer and k = l n / 2 J. [Hint: Let
an= C(n, 0) + C(n- 1, 1) + + C(n - k, k). Show
that the sequence {an} satisfies the same recurrence re-
lation and initial conditions satisfied by the sequence of
Fibonacci numbers.]
18. Solve the recurrence relation an = 6an- l - 12an-2 +
8an-3 with ao = -5, a1 = 4, and a2 = 88.
19. Solve the recurrence relation an = -3an- l - 3an-2-
an-3 with ao = 5, a1 = -9, and a2 = 15.
20. Find the general form of the solutions of the recurrence
relation an = 8an-2 - 16an- 4
21. What is the general form of the solutions of a linear homo-
geneous recurrence relation if its characteristic equation
has roots 1, 1, 1, 1, -2, - 2, -2, 3, 3, -4?
22. What is the general form of the solutions of a linear homo-
geneous recurrence relation if its characteristic equation
has the roots -1, -1, - .1, 2, 2, 5, 5, 7?
8.2 Solving Linear Recurrence Relations 525
23. Consider the nonhomogeneous linear recurrence relation
an= 3an-l +2n.
a) Show that an = -2n+
1
is a solution of this recurrence
relation.
b) Use Theorem 5 to find all solutions of this recurrence
relation.
c) Find the solution with ao = 1.
24. Consider the nonhomogeneous linear recurrence relation
an = 2an-1 + 2n.
a) Show that an = n2n is a solution of this recurrence
relation.
b) Use Theorem 5 to find all solutions of this recurrence
relation.
c) Find the solution with ao = 2.
25. a) Determine values of the constants A and B such
that an = An + B is a solution of recurrence relation
an = 2an-l + n + 5.
b) Use Theorem 5 to find all solutions of this recurrence
relation.
c) Find the solution &f this recurrence relation with
ao = 4.
26. What is the general form of the particular so-
lution guaranteed to exist by Theorem 6 of
the linear nonhomogeneous recurrence relation
an = 6an-1 - 12an-2 + 8an-3 + F(n) if
a) F(n) = n
2
? b) F(n) = 2n?
c) F(n) = n2n? d) F(n) = (-2)n?
e) F(n) = n
2
2n? f) F(n) = n
3
(- 2)n?
g) F(n) = 3?
27. What is the general form of the particular solution guaran-
teed to exist by Theorem 6 of the linear nonhomogeneous
recurrence relation an = 8an- 2- 16an-4 + F(n) if
a) F(n) = n
3
? b) F(n) = (-2)n?
c) F(n) = n2n? d) F(n) = n
2
4n?
e) F(n) = (n
2
- 2)(-2)n? f) F(n) = n
4
2n?
g) F(n) = 2?
28. a) Find all solutions of the recurrence relation
an = 2an-l + 2n
2
.
b) Find the solution of the recurrence relation in part (a)
with initial condition a1 = 4.
29. a) Find all solutions of the recurrence relation
an= 2an-1 + 3n .
b) Find the solution of the recurrence relation in part (a)
with initial condition a1 = 5.
30. a) Find all solutions of the recurrence relation an =
-San- 1 - 6an- 2 + 42 4n .
b) Find the solution of this recurrence relation with a 1 =
56 and a2 = 278.
31. Find all solutions of the recurrence relation an =
San-1 - 6an-2 + 2n + 3n. [Hint: Look for a particular
solution of the formqn2n + p1n + p2, where q, PJ , and
P2 are constants.]
32. Find the solution of the recurrence relation an =
2an-l + 3 2n.
33. Find all solutions of the recurrence relation an =
4an-1 - 4an-2 + (n + 1)2n .