DMS-Unit-IV- Recurrence relation

1. Describe sequences of numbers and explain their properties. Discuss the arithmetic,
geometric, and Fibonacci sequences in detail. Calculate the Fibonacci numbers f 2, f 3, f 4, f 5,
and f 6.
2. What is a recurrence relation? Explain the general and closed-forms of recurrence relations.
Derive an expression for the closed form of recurrence relation a n=a n−1 +3 , a 0=2.
3. Explain the classifications of recurrence relations through degree and order of recurrence
relations with suitable examples. Estimate order and degree of the recurrence relations
a ( n )=a ( n−1 )−10 a ( n−2 )−a ( n−3 ) and a n=5 an−1−16 a3n−2 +n+2 n2.
4. Construct the recurrence relation of the data: A new species of bacteria doubles its population
every hour. At the end of every third hour, 50 bacteria are removed. If the initial population is
100, create a recurrence relation to model this growth and solve it to find the population after
10, and 12 hours.
5. Describe bit strings of length n . Determine a recurrence relation and give initial conditions for
the number of bit strings of length n that do not have two consecutive 0s. How many such bit
strings are there of length five?
6. Describe permutations of a set with n elements. Construct a recurrence relation for the
number of permutations of a set with n elements. Use this recurrence relation to find the
number of permutations of a set with 5 elements using iteration.
7. What is the solution of recurrence relation? Explain general and particular solutions of linear
n n
recurrence relations with constant coefficients. Show that a n=c 2 + d 5 is the solution of the
recurrence relation a n−7 a n−1 +10 a n−2=0.
8. Explain substation method for solving linear recurrence relations with constant coefficients
and determine whether the sequence {an }, where a n=3 n, a n=2n or a n=5 for every
nonnegative integer n , is a solution of the recurrence relation a n=2 an−1−an−2 for n=2, 3, 4
,….
9. Describe iteration method for solving linear recurrence relations. Use this iterative approach,
find the solution to each of these recurrence relations with the given initial conditions:
a) a n=−a n−1, a 0=5
b) a n=a n−1 −n, a 0=4
c) a n=a n−1 +2 n+3 , a 0=4
10. Set up a recurrence relation for the sequence {H n } when H n denote the number of moves
needed to solve the Tower of Hanoi puzzle with n disks. Also, use an iterative approach to
solve this recurrence relation.
11. Explain the method of characteristic roots? How is it used to solve linear recurrence relations
with constant coefficients? Solve the recurrence relation:
a) a n=4 an−1−4 a n−2, a 0=1 and a 1=4 .
b) f ( n )=f ( n−1 ) + f ( n−2 ) , f ( 0 )=0 and f ( 1 ) =1
c) a n=a n−1 +2 a n−2 with a 0=2 and a 1=7.
d) a ( n )=6 a ( n−1 )−11 a ( n−2 ) +6 a ( n−3 ) , a ( 0 )=2, a ( 1 )=5, and a ( 2 ) =15.
e) a n−3 an−1 +2 an −2=0 is unique if initial conditions a 0 and a 1 are given.
12. Discuss the role of real and complex roots in the solution recurrence relations, and solve (a)
a n−2 an−1 +5 an−2=0 with initial conditions a 0=1 and a 1=0, (b) 2 ( a n−1 −an−2 )=an, n ≥ 2
with initial conditions a 0=1 and a 1=2.
13. Explain how to solve a linear non-homogeneous recurrence relation with constant
coefficients, and illustrate with an example where the non-homogeneous term is a
2
polynomial. Find all solutions of the recurrence relation a n=5 an−1−6 an−2 +1+n+n .
14. Find all solutions of the recurrence relation a n=3 an−1 +2 n. What is the solution with a 1=3?
15. Write the properties of generating functions and explore the implications of using generating
functions for recurrences. Derive the generating function for the Fibonacci sequence { f n } and
explain its role in finding the closed-form expression for the Fibonacci numbers.
16. What is generating function? Explain the properties of generating function. Identify the
5+2 z 3−5 z
sequence having the generating function (a) 2 (b) 2.
1−4 z 1−2 z−3 z
17. Describe the technique of solving recurrence relations using generating functions. How does
it simplify the process? Use generating functions to find an explicit formula for a n when
and the initial condition a 1=9.
n−1
a n=8 a n−1 +10
18. Derive a closed-form expression for a n using both recurrence relation techniques and
generating functions for a n=5 an−1−6 an−2 +2n with initial conditions a 0=2 and a 1=7.
Compare the two methods.
19. Use generating functions to find an explicit formula for a n when
a n=6 a n−1+6 where a 1=9
n−1

a n−4 an−1 +4 an−2=n, where a 0=2 and a 1=5.