Defence University, College of Engineering

Department of Basic Science and Humanities

Discrete Mathematics (Math 2022)
Worksheet III (Recurrence Relation)
November, 2022
n
1. a) Show that the sequence {fn} defined explicitly by an= (-4) is a solution of
the recurrence relation an = -3 an-1+4 an-2.
b) Show that the explicitly defined sequence 𝑔𝑛 = 7(2𝑛 ) − 𝑛 + 2 solves the recurrence
relation:𝑔𝑛 − 𝑔𝑛−1 − 2𝑔𝑛−2 − 2𝑛 + 9 = 0, 𝑛 ≥ 2.
c) Show that the explicit sequence {𝑔𝑛 } n = 0 such that 𝑔𝑛 = (A+Bn) (4n) for all non zero
constants A and B solves the recurrence relation: gn+2 – 8gn+1+16gn= 0, n  0.
2. Which of the following recurrence relations are homogenous and which are non-
homogeneous? Which are linear and non linear? Tell the order and describe the coefficients
(as constant or variable) in each case.
𝑎) 𝑠𝑛 = 𝑠𝑛−2 + 𝑠𝑛−4 𝑏) 𝑦1/2 + 𝑦𝑛−1 − 6𝑦𝑛−2 = 0
𝑐) 5𝑛𝑎𝑛 + 2𝑛𝑎𝑛−1 − 2𝑎𝑛−2 = 6 𝑑) 𝐻𝑛 = 2𝐻𝑛−1 + 2𝑛 − 7
3
𝑒) 𝑎𝑛3 = 7𝑎𝑛−1 𝑓) 𝑎𝑘+1 − 5𝑎𝑘 + 4𝑎𝑘−1 − 6𝑎𝑘−2 = 𝐴𝑘 + 10
3. Find an explicit formula for the Fibonacci numbers 0,1,1,2,3,5,8,13, …
(𝑝)
4. Find the particular solution 𝑎𝑛 of the recurrence relation 𝑎𝑛 + 5𝑎𝑛−1 + 6𝑎𝑛−2 = 3𝑛2 .
5. Solve the following recurrence relations
a) 𝑎𝑛 − 𝑎𝑛−1 − 2𝑎𝑛−2 = 0, 𝑎0 = 2 & 𝑎1 = 7.
b) 𝑎𝑘 = 2𝑎𝑘−1 + 𝑎𝑘−2 − 2𝑎𝑘−3 for 𝑛 ≥ 3, 𝑤ℎ𝑒𝑟𝑒 𝑎0 = 0 𝑎𝑛𝑑 𝑎1 = 1 = 𝑎2 .
c) 𝑦𝑥+2 − 4𝑦𝑥+1 + 64 = 0
d) 𝑓𝑛 = 3𝑓𝑛−1 + 2𝑓𝑛−2 + 2; 𝑛 ≥ 2 with (𝑓0 , 𝑓1 ) = (1,1)
e) 𝑓𝑛+2 + 4𝑓𝑛+1 + 4𝑓𝑛 = 𝑛2 ; 𝑛 ≥ 0 with (𝑓0 , 𝑓1 ) = (0,2)
f) 𝑎𝑛 − 4𝑎𝑛−1 = 5(4)𝑛 ; 𝑛 ≥ 1, 𝑎0 = 2.

6. Find the solution of the recurrence relation

𝑎𝑛 = 6𝑎𝑛−1 − 11𝑎𝑛−2 + 6𝑎𝑛−3 with 𝑎0 = 2, 𝑎1 = 5 and 𝑎2 = 15