Chapter 10 Homework

P.468

1. Solve the following recurrence relation. (No final answer should involve complex numbers.)

(a) a n = 5a n 1 + 6a n 2 , n 2, a 0 = 1, a 1 = 3
(b) 2a n+2 11a n +1 + 5a n = 0, n 0, a 0 = 2, a 1 = 8
(c) a n +2 + a n = 0, n 0, a 0 = 0, a 1 = 3
(d) a n 6a n 1 + 9a n 2 = 0, n 2, a 0 = 5, a 1 = 12
(e) a n + 2a n 1 + 2a n 2 = 0, n 2, a 0 = 1, a 1 = 3

P.469

9. For 0 n , let a n count the number of ways a sequence of 1s and 2s will sum to n . For example, a 3 = 3
because (1)1,1,1; (2)1,2;and(3)2,1 sum to 3. Find and solve a recurrence relation for a n .

11.

(a) For n 1,let a n count the number of binary strings of length n , where there are no consecutive 1s.
Find and solve a recurrence relation for a n .
(b) For n 1,let b n count the number of binary strings of length n , where there are no consecutive 1s and
the first and last bit of string are not both 1. Find and solve a recurrence relation for b n .

P.481

5. Solve the following recurrence relations.

(a) a n +2 + 3a n+1 + 2a n = 3n , n 0, a 0 = 0, a 1 = 1
(b) a n +2 + 4a n+1 + 4a n = 7, n 0, a 0 = 1, a 1 = 2

P.509

13.

(a) For n Z + , determine the number of ways one can tile a 1 n chessboard using 1 1 white (square)
tiles and 1 2 blue(rectangular) tiles.
(b) How many of the tilings in part (a)use (i) no blue tiles;(ii)exactly one blue tile; (iii)exactly two blue
tiles;(iv)exactly three blues; and(v)exactly k blue tiles, where 0 k bn/2c?
(c) How are the results in parts (a)and(b)related?