CSC325 tutorial

Problem 1
Consider the following recurrence equation.
Tn = Tn−1+1; T1 = 0

a) Expand it to find a closed-form solution.

b) Prove by induction that Tn = n-1

Problem 2
Consider the following linear homogeneous recurrence equation
a n=−4 an−1−5 an−2−2 an−3 ; a0 =0 , a1=1 , a2=¿ -1
a) What is its order?
b) Derive its characteristic equation.
c) Show that the characteristic equation can be put in the for (r+2) (r+1)2 = 0
d) Using the result in c) obtain the solution of the homogeneous recurrence equation.

Problem 3

a) Consider the following recurrence equation

T(n) = 3T(n-1) + 1; T(1) = 1
(i) Find its closed form solution by expanding it; you may use the geometric series
n n +1
−1
∑ ai= aa−1 ,a≠1
i=0
b) Consider the following linear recurrence equation
a n=a n−1 +2 a n−2 , a0 =2 , a1=7 ;
Solve it

Problem 4:
Consider the following linear homogeneous recurrence relation
an = 4an-1 - 9an-2 + 10an-3 - 4an-4, a0 = 0, a1 = 1, a2 = 3, a3 = -1;
a) Derive the characteristic equation
b) Find the solution;
hints: the characteristic equation can be put in the form: (r-2)2 (r-1)2 = 0
Problem 5
The recurrence relation T(n) = T(n−1)+1; T(1) = 0 has closed-form solution T(n) = n − 1. Prove it by
induction