AHMEDABAD INSTITUTE OF TECHNOLOGY
B.E. Semester – IV (CE/IT/DS)
Discrete Mathematics and Graph Theory (BE04000261)
Unit-2: Set Theory, Counting and Combinatorics & Recurrence relations
Tutorial-5
Recurrence relations: iteration & closed-form (characteristic equation)
Q-1. Solve the recurrence relation
an − 7an−1 + 10an−2 = 0,
given that a0 = 0, a1 = 3.
Q-2. Solve the recurrence relation
an − 4an−1 + 4an−2 = 0,
given that a0 = 1, a1 = 6.
Q-3. Solve
an = 2an−1 + 3an−2 ,
given that a0 = 1, a1 = 2.
Q-4. Solve
an = an−1 + an−2 ,
given that a0 = 0, a1 = 1.
Q-5. Solve
Sn − 8Sn−1 + 12Sn−2 = 0,
given that S0 = 54, S1 = 308.
Q-6. Solve
an = 11an−1 − 39an−2 + 45an−3 ,
given that a0 = 5, a1 = 11, a2 = 25.
Q-7. Solve
an = 6an−1 − 11an−2 + 6an−3 ,
given that a0 = 2, a1 = 5, a2 = 15.