You are on page 1of 1

WINTER 2022-2023

BMAT205L - DISCRETE MATHEMATICS AND GRAPH THEORY

DIGITAL ASSIGNMENT-2
(To access the students’ understanding on Solving Recurrence relations)

Due date: 7th March, 2023

Slot: A2+TA2+TAA2

1. The Lucas numbers satisfy the recurrence relation Ln = Ln−1 + Ln−2 and the initial
conditions L0 = 2 and L1 = 1. Find an explicit formula for the Lucas numbers.
(2.5 Marks)

2. Find the solution of the recurrence relation an = 2an−1 + 3 · 2n . (2.5 Marks)

3. A new employee at an exciting new software company starts with a salary of $50,000
and is promised that at the end of each year her salary will be double her salary of the
previous year, with an extra increment of $10,000 for each year she has been with the
company.

(a) Construct a recurrence relation for her salary for her nth year of employment.
(b) Solve the recurrence relation you obtained in (a) to find her salary for her nth
year of employment.

(2.5 Marks)

4. Use generating functions to solve the recurrence relation ak = 4ak−1 − 4ak−2 + k 2 with
initial conditions a0 = 2 and a1 = 5. (2.5 Marks)

You might also like