Recurrence Relations

A Recurrence Relation is an equation that recursively defines a sequence where the

next term is a function of the previous terms. In other words, a recurrence an equation
which is defined in terms of itself.
We recall a few examples given in that article.
S.No Sequence Recurrence Relation
1 𝑎𝑛 = 𝑛 𝑎𝑛 = 𝑎𝑛−1 + 1
2 𝑎𝑛 = 2𝑛−1 𝑎𝑛 = 2𝑎𝑛−1
3 𝑎𝑛 = 𝑛! 𝑎𝑛 = 𝑛𝑎𝑛−1
The process of finding 𝑎𝑛 satisfying the recurrence relation is regarded as solving the
recurrence relation and 𝑎𝑛 is called its general solution.
First order Linear Recurrence Relation.
This is of the form,
𝑎𝑛 = 𝑘𝑎𝑛−1 + 𝑓(𝑛), 𝑛 ≥ 1
Where 𝑘 and 𝑓(𝑛) are respectively known constant and function.
This is also known as first order linear recurrence relation with constant coefficients.
If the function 𝑓(𝑛) = 0 then the recurrence relation is said to be homogeneous, otherwise,
it is said to be non-homogeneous.

12-05-2025 Prepared by Dr. Palle Prathapa Reddy 1

General solution
We have a recurrence relation 𝑎𝑛 = 𝑘𝑎𝑛−1 + 𝑓(𝑛)
We shall take values for 𝑛 = 1,2,3, . … in the relation.
When 𝑛 = 1, 𝑎1 = 𝑘𝑎0 + 𝑓(1)
When 𝑛 = 2, 𝑎2 = 𝑘𝑎1 + 𝑓 2 ⟹ 𝑎2 = 𝑘 𝑘𝑎0 + 𝑓 1 +𝑓 2
⟹ 𝑎2 = 𝑘 2 𝑎0 + 𝑘𝑓(1) + 𝑓(2)
When 𝑛 = 3, 𝑎3 = 𝑘𝑎2 + 𝑓 3 ⟹ 𝑎3 = 𝑘 𝑘 2 𝑎0 + 𝑘𝑓 1 + 𝑓 2 +𝑓 3
⟹ 𝑎3 = 𝑘 3 𝑎0 + 𝑘 2 𝑓(1) + 𝑘𝑓(2) + 𝑓(3)
.....
Observing the progression,
𝑎𝑛 = 𝑘 𝑛 𝑎0 + 𝑘 𝑛−1 𝑓 1 + 𝑘 𝑛−2 𝑓 2 + 𝑘 𝑛−3 𝑓 3 + ⋯ + 𝑘𝑓 𝑛 − 1 + 𝑓 𝑛
𝑛

𝑎𝑛 = 𝑘 𝑛 𝑎0 + ෍ 𝑘 𝑛−𝑟 𝑓 𝑟 , 𝑛 ≥ 1
𝑟=1
This is a general solution of the recurrence relation.
Obviously if 𝑓 𝑛 = 0 the solution of the homogeneous linear recurrence relation
𝑎𝑛 = 𝑘𝑎𝑛−1 is given by 𝑎𝑛 = 𝑘 𝑛 𝑎0 , 𝑛 ≥ 1.

12-05-2025 Prepared by Dr. Palle Prathapa Reddy 2

 Problems
1. Find a recurrence relation with initial condition that uniquely determines each
of the following progression. Also write down the general solution in each
(i) 𝟏, 𝟓, 𝟗, 𝟏𝟑, . . . . (iii) 𝟔, −𝟏𝟖, 𝟓𝟒, −𝟏𝟔𝟐. . . .
𝟏𝟒 𝟐𝟖 𝟓𝟔
(ii) 𝟐, 𝟏𝟎, 𝟓𝟎, 𝟐𝟓𝟎, . . . (iv) 𝟕, , , ,.....
𝟓 𝟐𝟓 𝟏𝟐𝟓
Sol: The first term in each case will be taken as 𝑎0 and the recurrence relation in the form
𝑎𝑛 = 𝑘𝑎𝑛−1 + 𝑓(𝑛), 𝑛 ≥ 1 will be formed.
Later we use the general solution in the form 𝑎𝑛 = 𝑘 𝑛 𝑎0 + σ𝑛𝑟=1 𝑘 𝑛−𝑟 𝑓 𝑟 , 𝑛 ≥ 1
(i) 1,5, 9, 13, . . . .
𝑎0 = 1, 𝑎1 = 5 = 𝑎0 + 4, 𝑎2 = 𝑎1 + 4, 𝑎3 = 𝑎2 + 4, . … … … … … .
𝑎𝑛 = 𝑎𝑛−1 + 4, 𝑛 ≥ 1, 𝑎0 = 1 is the recurrence relation.
Next, we have 𝑘 = 1, 𝑓(𝑛) = 4 and 𝑎0 = 1
∴ General solution (GS) 𝑎𝑛 = 1𝑛 𝑎0 + σ𝑛𝑟=1 1 𝑛−𝑟 4
𝑎𝑛 = 1 + (4 + 4 + 4+. . . . 𝑛 𝑡𝑖𝑚𝑒𝑠 ) = 1 + 4𝑛
Thus general solution is given by 𝑎𝑛 = 4𝑛 + 1, 𝑎0 = 1, 𝑛 > 1
ii) 2,10, 50, 250, . . . .
𝑎0 = 2, 𝑎1 = 10 = 𝑎0 × 5, 𝑎2 = 𝑎1 × 5, 𝑎3 = 𝑎2 × 4, . … … … … … .
𝑎𝑛 = 5𝑎𝑛−1 , 𝑛 ≥ 1, 𝑎0 = 2 is the recurrence relation.
Next, we have 𝑘 = 5, 𝑓(𝑛) = 0Prepared
12-05-2025
and 𝑎0by= 2
Dr. Palle Prathapa Reddy 3
 ∴ General solution (GS) 𝑎𝑛 = 𝑘 𝑛 𝑎0 or 𝑎𝑛 = 5𝑛 2
Thus, general solution is given by 𝑎𝑛 = 2 5𝑛 , 𝑎0 = 1, 𝑛 ≥ 1.
(iii) 6, −18, 54, −162. …
𝑎0 = 6, 𝑎1 = −18 = 𝑎0 (−3), 𝑎2 = 𝑎1 (−3), 𝑎3 = 𝑎2 (−3), . … … … … … .
𝑎𝑛 = −3𝑎𝑛−1 , 𝑛 ≥ 1, 𝑎0 = 6 is the recurrence relation.
Next, we have 𝑘 = −3, 𝑓(𝑛) = 0 and 𝑎0 = 6
∴ General solution (GS) 𝑎𝑛 = 𝑘 𝑛 𝑎0 or 𝑎𝑛 = 6 −3 𝑛 , 𝑛 ≥ 1
Thus, general solution is given by 𝑎𝑛 = 6 −3 𝑛 , 𝑎0 = 6, 𝑛 ≥ 1.
14 28 56
(iv) 7, , ,
5 25 125
,.....
14 2 28 2 56 2
𝑎0 = 7, 𝑎1 = = 𝑎0 , 𝑎2 = 25 = 𝑎1 , 𝑎3 = 125 = 𝑎2 ,.…………….
5 5 5 5
2
𝑎𝑛 = 𝑎𝑛−1 , 𝑛 ≥ 1, 𝑎0 = 7 is the recurrence relation.
5
2
Next, we have 𝑘 = , 𝑓(𝑛) = 0 and 𝑎0 = 7
5
2
∴ General solution (GS) 𝑎𝑛 = 𝑘 𝑛 𝑎0 or 𝑎𝑛 = × 7, 𝑛 ≥ 1
5
2 𝑛
Thus, general solution is given by 𝑎𝑛 = 7 , 𝑎0 = 7, 𝑛 ≥ 1.
5
2. Solve : 𝒂𝒏 = 𝒂𝒏−𝟏 + 𝒏, 𝒂𝟏 = 𝟒, 𝒏 ≥ 𝟐.
Sol: Consider, 𝑎𝑛 = 𝑎𝑛−1 + 𝑛 …..(1)
12-05-2025 Prepared by Dr. Palle Prathapa Reddy 4
 We have the general solution of the relation 𝑎𝑛 = 𝑘𝑎𝑛−1 + 𝑓(𝑛), 𝑛 ≥ 1 given by
𝑎𝑛 = 𝑘 𝑛 𝑎0 + σ𝑛𝑟=1 𝑘 𝑛−𝑟 𝑓(𝑟)
with reference to (1), we have 𝑘 = 1, 𝑓(𝑛) = 𝑛
𝑛
𝑛 𝑛−𝑟
𝑎𝑛 = 1 × 𝑎0 + ෍ 1 𝑟
𝑟=1
𝑎𝑛 = 𝑎0 + σ𝑛𝑟=1 𝑟
𝑛 𝑛+1
𝑎𝑛 = 𝑎0 + , by using a standard result.
2
Putting 𝑛 = 1 in this result we have 𝑎1 = 𝑎0 + 1 or 4 = 𝑎0 + 1 ⟹ 𝑎0 = 3
𝑛 𝑛+1
Thus, the required solution is given by 𝑎𝑛 = 3 + 2 , 𝑛 ≥ 1, 𝑎0 = 3.
3. Obtain the unique solution of the following recurrence relation.
𝒂𝒏 = 𝟐𝒂𝒏−𝟏 + 𝟏, 𝒏 ≥ 𝟐, 𝒂𝟏 = 𝟕
Sol: Consider, 𝑎𝑛 = 2𝑎𝑛−1 + 1 …..(1)
We have the general equation of the recurrence relation is 𝑎𝑛 = 𝑘𝑎𝑛−1 + 𝑓(𝑛), 𝑛 ≥ 1
We have 𝑘 = 2, 𝑓 𝑛 = 1
We have the general solution of the relation 𝑎𝑛 = 𝑘 𝑛 𝑎0 + σ𝑛𝑟=1 𝑘 𝑛−𝑟 𝑓(𝑟)
𝑛 𝑛

𝑎𝑛 = 2𝑛 𝑎0 + ෍ 2𝑛−𝑟 1 = 2𝑛 𝑎0 + ෍ 2𝑛−𝑟 = 2𝑛 𝑎0 + 2𝑛−1 + 2𝑛−2 + 2𝑛−1 … + 22 + 2 + 1

𝑟=1 𝑟=1

12-05-2025 Prepared by Dr. Palle Prathapa Reddy 5

 The series in the bracket is a geometric series of the form
2 𝒏−𝟏 𝒂 𝒓𝒏 −𝟏
𝑎 + 𝑎𝑟 + 𝑎𝑟 +. . . +𝑎𝑟 = for 𝑟 > 1
𝒓−𝟏
𝑛
1 2 −1
1 + 2 + 22 + 23 + 24 + ⋯ + 2𝑛−2 + 2𝑛−1 = = 2𝑛 − 1
2−1
Now 𝑎𝑛 = 2𝑛 𝑎0 + 2𝑛−1 + 2𝑛−2 + 2𝑛−1 … + 22 + 2 + 1 = 2𝑛 𝑎0 + 2𝑛 − 1
𝑎𝑛 = 2𝑛 𝑎0 + 2𝑛 − 1
Putting 𝑛 = 1 in this result we have 𝑎1 = 21 𝑎0 + 21 − 1 ⟹ 7 = 2𝑎0 + 2 − 1 ⟹ 𝑎0 = 3
Thus the required solution is given by 𝑎𝑛 = 2𝑛 (3) + 2𝑛 − 1 = 4(2𝑛 ) − 1.
4. Show that the solution of the non-homogeneous recurrence relation
𝑎𝑛+1 = 𝑎𝑛 + 2𝑛 + 3 , 𝑛 ≥ 0, 𝑎0 = 1 is 𝑛 + 1 2 .
Sol: We have, 𝑎𝑛+1 = 𝑎𝑛 + 2𝑛 + 3 , 𝑛 ≥ 0, 𝑎0 = 1
∴ 𝑎𝑛 = 𝑎𝑛−1 + 2𝑛 + 1 , changing 𝑛 to (𝑛 − 1).
This is a non-homogeneous relation with 𝑘 = 1 and 𝑓(𝑛) = (2𝑛 + 1)
The solution is given by 𝑎𝑛 = 𝑘 𝑛 𝑎0 + σ𝑛𝑟=1 𝑘 𝑛−𝑟 𝑓(𝑟)
𝑎𝑛 = 1𝑛 𝑎0 + σ𝑛𝑟=1 1𝑛−𝑟 (2𝑟 + 1)
𝑎𝑛 = 𝑎0 + (3 + 5 + 7+. . . +2𝑛 + 1)
𝑛
The series in the bracket is an arithmetic series whose sum is given by 2 2𝑎 + 𝑛 − 1 𝑑 .

12-05-2025 Prepared by Dr. Palle Prathapa Reddy 6

 we have, 𝑎 = 3, 𝑑 = 2
𝑛 𝑛
3 + 5 + 7+. . . +2𝑛 + 1 = 6+ 𝑛−1 2 = 2𝑛 + 4 = 𝑛 𝑛 + 2 .
2 2
Using this, we get the general solution 𝑎𝑛 = 𝑎0 + 𝑛2 + 2𝑛
By using the given initial value 𝑎0 = 1 we get
𝑎𝑛 = 1 + 𝑛2 + 2𝑛 = 𝑛2 + 2𝑛 + 1 = 𝑛 + 1 2
Thus the required solution is 𝑛 + 1 2 .
5. Solve: 𝑎𝑛 = 12(𝑛 + 1)3 , 𝑛 ≥ 1, 𝑎0 = 3
Sol: 𝑎𝑛 = 12(𝑛 + 1)3 is a homogeneous relation with 𝑘 = 1 and
𝑓(𝑛) = 12(𝑛 + 1)3
The solution is, 𝑎𝑛 = 𝑘 𝑛 𝑎0 + σ𝑛𝑟=1 𝑘 𝑛−𝑟 𝑓(𝑟)
𝑎𝑛 = 1𝑛 (3) + σ𝑛𝑟=1 1 𝑛−𝑟 12(𝑟 + 1)3
𝑛

𝑎𝑛 = 3 + 12 ෍ 𝑟 3 + 3𝑟 2 + 3𝑟 + 1
𝑟=1
𝑎𝑛 = 3 + 12 σ𝑛𝑟=1 𝑟 3 + 3 σ𝑛𝑟=1 𝑟 2 + 3 σ𝑛𝑟=1 𝑟 + σ𝑛𝑟=1 1
𝑛2 𝑛+1 2 3𝑛 𝑛+1 2𝑛+1 3𝑛 𝑛+1
𝑎𝑛 = 3 + 12 + + +𝑛
4 6 2
𝑎𝑛 = 3 + 3𝑛2 𝑛 + 1 2 + 6𝑛 𝑛 + 1 2𝑛 + 1 + 18𝑛 𝑛 + 1 + 12𝑛
𝑎𝑛 = 3 1 + 𝑛2 𝑛2 + 2𝑛 + 1 + 2𝑛 2𝑛2 + 3𝑛 + 1 + 6 𝑛2 + 1 + 4𝑛
𝑎𝑛 = 3 1 + 12𝑛 + 13𝑛2 + 6𝑛3 + 𝑛4 is the required solution.
12-05-2025 Prepared by Dr. Palle Prathapa Reddy 7
6. A person invests some amount at the rate of 11%, annual compound interest. Determine the
period for his principal amount to get doubled. Also find the period if 11% interest is
compounded monthly.
Sol: If 𝑎0 is the principal amount, then the amount at the rate of 11% at the end of one year 𝑎1 , is
11 111
𝑎1 = 𝑎0 + 𝑎0 = 𝑎0
100 100
𝑎1 = 1.11 𝑎0
Next, the amount with compounded interest at the end of 2 years (𝑎2 ) is
𝑎2 = 1.11 𝑎1 = 1.11 2 𝑎0
Continuing in this way, the amount at the end of 𝑛 years 𝑎𝑛 , is 𝑎𝑛 = 1.11 𝑛 𝑎0 …..(1)
If the principal amount has to be double we must have, 𝑎𝑛 = 2𝑎0
By using (1) in LHS we have, 1.11 𝑛 𝑎0 = 2𝑎0 or 1.11 𝑛 = 2; 𝑛 =?
𝑛
To find 𝑛, we shall take logarithms to the base 10 on both sides of 1.11 = 2.
𝑙𝑜𝑔2
That is, 𝑛 𝑙𝑜𝑔 (1.11) = 𝑙𝑜𝑔2 ⟹ 𝑛 = log 1.11 ≈ 6.64
Thus we conclude that in a period of 6.64 years the principal amount will get double.
Next, we shalII find the period for the principal amount getting,
doubled if 11% interest is compounded monthly.
11/100 11
The monthly interest = = 1200
12
12-05-2025 Prepared by Dr. Palle Prathapa Reddy 8
 As in the earlier case, if 𝑎0 is the principal then the amount at the end of first month (𝑎1 ) is
11 1211
𝑎1 = 𝑎0 + 1200
𝑎0 = 1200
𝑎0
Similarly, the amount at the end of second month (𝑎2 ) is
11 1211 1211 2
𝑎2 = 𝑎1 + 1200
𝑎1 = 1200
𝑎1 = 1200
𝑎0
1211 𝑛
∴ At the end of the nth month, the amount 𝑎𝑛 , will be 𝑎𝑛 = 1200
𝑎0
Let us consider, 𝑎𝑛 = 2𝑎0
1211 𝑛 1211 𝑛
𝑎0 = 2𝑎0 or =2
1200 1200
1211 log 2
⟹ 𝑛 log 1200 = log 2 or 𝑛 = 1211 = 75.96 ≈ 76 months = 6 years 4 months =6.33 years.
log 1200
1
Thus, the required period is 6.33 years 6 3 𝑦𝑒𝑎𝑟𝑠 .

12-05-2025 Prepared by Dr. Palle Prathapa Reddy 9

The second-order linear homogeneous relation with constant coefficients.
A recurrence relation of the form 𝐶0 𝑎𝑛 + 𝐶1 𝑎𝑛−1 + 𝐶2 𝑎𝑛−2 = 0………(1)
Where 𝐶0 , 𝐶1 , 𝐶2 are all real constants with 𝐶0 ≠ 0 is called a second order
linear homogeneous relation with constant coefficients.
Let we take a solution of a first order linear homogeneous relation is
𝑎𝑛 = 𝐶𝑘 𝑛 , 𝐶 ≠ 0, 𝑘 ≠ 0 ………(2)
From equation (1) 𝐶0 𝐶𝑘 𝑛 + 𝐶1 𝐶𝑘 𝑛−1 + 𝐶2 𝐶𝑘 𝑛−2 = 0
𝐶𝑘 𝑛−2 𝐶0 𝑘 2 + 𝐶1 𝑘 + 𝐶2 = 0
𝐶0 𝑘 2 + 𝐶1 𝑘 + 𝐶2 = 0………(3)
This equation is called the characteristic equation (CE) of (1).
The characteristic equation (CE) is quadratic equation in k will have 2 roots which can be
(i) Real and distinct (ii) real and coincident
(iii) complex roots which are conjugates of each other.
The general solution of (1)
Case - (i): If 𝑘1 , and 𝑘2 are the roots of (3) then Case-(ii): If 𝑘1 = 𝑘2 = 𝑘 are the roots of (3)
𝑎𝑛 = 𝑐1 𝑘1𝑛 + 𝑐2 𝑘2𝑛 then 𝑎𝑛 = 𝑐1 + 𝑐2 𝑛 𝑘 𝑛
where 𝑐1 and 𝑐2 are arbitrary real constants. where 𝑐1 and 𝑐2 are arbitrary real constants.

12-05-2025 Prepared by Dr. Palle Prathapa Reddy 10

 Case - (iii): If 𝑘1 = 𝑎 + 𝑖𝑏 and 𝑘2 = 𝑎 − 𝑖𝑏 are the pair of complex roots of (3), then we have
𝑎𝑛 = 𝑐1 cos 𝑛𝜃 + 𝑐2 sin 𝑛𝜃 𝑟 𝑛
𝑏
Where 𝑟 = 𝑎2 + 𝑏2 and 𝜃 = 𝑡𝑎𝑛−1 𝑎
Particular solution: A Particular Solution of a recurrence relation is a solution obtained from
the General Solution by assigning specific values to the arbitrary constants 𝑐1 and 𝑐2 .
The solution in each case is presented in the following table
Case Roots Solution
(i) 𝑘1 , 𝑘2 real & 𝑘1 ≠ 𝑘2 𝑎𝑛 = 𝑐1 𝑘1𝑛 + 𝑐2 𝑘2𝑛
(ii) 𝑘1 , 𝑘2 real & 𝑘1 = 𝑘2 𝑎𝑛 = 𝑐1 + 𝑐2 𝑛 𝑘 𝑛
(iii) 𝑘1 , 𝑘2 complex pair of roots 𝑎𝑛 = 𝑐1 cos 𝑛𝜃 + 𝑐2 sin 𝑛𝜃 𝑟 𝑛
𝑘1 = 𝑎 + 𝑖𝑏, 𝑘2 = 𝑎 − 𝑖𝑏 𝑏
Where 𝑟 = 𝑎2 + 𝑏2 and 𝜃 = 𝑡𝑎𝑛−1 𝑎
Problems
1. Solve 𝑎𝑛 − 5𝑎𝑛−1 + 6𝑎𝑛−2 = 0, 𝑛 ≥ 2
Sol: Given recurrence relation is 𝑎𝑛 − 5𝑎𝑛−1 + 6𝑎𝑛−2 = 0
The characteristics equation is 𝑘 2 − 5𝑘 + 6 = 0
𝑘 − 3 𝑘 − 2 = 0 ⟹ 𝑘 = 2,3
Roots real and distinct
Thus, the general solution is 𝑎𝑛 = 𝑐1 3𝑛 + 𝑐2 2𝑛 .
12-05-2025 Prepared by Dr. Palle Prathapa Reddy 11
2. Solve 𝑎𝑛 − 6𝑎𝑛−1 + 9𝑎𝑛−2 = 0, 𝑛 ≥ 2
Sol: Given recurrence relation is 𝑎𝑛 − 6𝑎𝑛−1 + 9𝑎𝑛−2 = 0
The characteristics equation is 𝑘 2 − 6𝑘 + 9 = 0 ⟹ 𝑘 − 3 2 =0
𝑘 − 3 𝑘 − 3 = 0 ⟹ 𝑘 = 3,3
Roots real and equal
Thus, the general solution is 𝑎𝑛 = 𝑐1 + 𝑐2 𝑛 3𝑛 .
3. Solve 𝑎𝑛+2 + 𝑎𝑛 = 0, 𝑛 ≥ 0
Sol: Given recurrence relation is 𝑎𝑛+2 + 𝑎𝑛 = 0
The characteristic equation is 𝑘 2 + 1 = 0
𝑘 = ±𝑖 = 𝑎 ± 𝑖𝑏 here 𝑎 = 0 and 𝑏 = 1
Roots complex 1 𝜋
−1 −1
𝑟 = 𝑎2 + 𝑏2 = 02 + 12 = 1 𝜃 = 𝑡𝑎𝑛 = 𝑡𝑎𝑛 ∞ =
0 2
𝑛
Thus, the general solution is 𝑎𝑛 = 𝑐1 cos 𝑛𝜃 + 𝑐2 sin 𝑛𝜃 𝑟 .
𝑛𝜋 𝑛𝜋 𝑛
𝑛𝜋 𝑛𝜋
𝑎𝑛 = 𝑐1 cos + 𝑐2 sin 1 = 𝑐1 cos + 𝑐2 sin
2 2 2 2
4. Solve the Fibonacci relation 𝐹𝑛+2 = 𝐹𝑛+2 + 𝐹𝑛+2 , 𝑛 ≥ 0; 𝐹0 = 1, 𝐹1 = 1.
Sol: The given relation in the equivalence form is
𝐹𝑛 − 𝐹𝑛−1 − 𝐹𝑛−2 = 0, 𝑛≥0
1± 5
The characteristics equation is 𝑘 2 − 𝑘 − 1 = 0 ⟹ 𝑘 = 2
Roots real and distinct (irrational)
12-05-2025 Prepared by Dr. Palle Prathapa Reddy 12
 𝑛 𝑛
1+ 5 1− 5
Thus, the general solution is 𝐹𝑛 = 𝑐1 2 + 𝑐2 2 ………….(1)
Consider 𝐹0 = 1, 𝐹1 = 1
Using these conditions in (1), we have
𝐹0 = 𝑐1 + 𝑐2 ⟹ 𝑐1 + 𝑐2 = 0 ⟹ 𝑐2 = −𝑐1 ……….(2)
𝑛 𝑛 𝑛 𝑛
1+ 5 1− 5 1+ 5 1− 5
𝐹1 = 𝑐1 2 + 𝑐2 2 ⟹1= 𝑐1 2 + 𝑐2 2 ……….(3)
Using 𝑐2 = −𝑐1 in (3) we have
1+ 5 1− 5 1 −1
1 = 𝑐1 − ⟹ 1 = 𝑐1 5 ⟹ 𝑐1 = ∴ 𝑐2 =
2 2 5 5
𝑛 𝑛
1 1+ 5 1 1− 5
Thus 𝐹𝑛 = − .
5 2 5 2
5. Solve the Lucas relation 𝐿𝑛 = 𝐿𝑛−1 + 𝐿𝑛−2 , 𝑛 ≥ 0; 𝐿0 = 2, 𝐿1 = 1.
Sol: The given relation in the equivalence form is
𝐿𝑛 − 𝐿𝑛−1 − 𝐿𝑛−2 = 0, 𝑛≥0
1± 5
The characteristics equation is 𝑘 2 − 𝑘 − 1 = 0 ⟹ 𝑘 = 2
Roots real and distinct (irrational)
𝑛 𝑛
1+ 5 1− 5
Thus, the general solution is 𝐿𝑛 = 𝑐1 2 + 𝑐2 2 ………….(1)

12-05-2025 Prepared by Dr. Palle Prathapa Reddy 13

Consider 𝐿0 = 2, 𝐿1 = 1
Using these conditions in (1), we have
𝐿0 = 𝑐1 + 𝑐2 ⟹ 𝑐1 + 𝑐2 = 2 ……….(2)
𝑛 𝑛
1+ 5 1− 5 1+ 5 1− 5
𝐿1 = 𝑐1 2 + 𝑐2 2 ⟹ 2 = 𝑐1 + 𝑐2
2 2

2 = 𝑐1 1 + 5 + 𝑐2 1 − 5 ……….(3)
Using 𝑐2 = 2 − 𝑐1 in (3) we have
2 = 𝑐1 1 + 5 + 2 − 𝑐1 1 − 5 ⟹ 2 = 𝑐1 1 + 5 − 1 + 5 + 2 1 − 5
2 = 𝑐1 2 5 + 2 − 2 5 ⟹ 2 5 = 𝑐1 2 5 ⟹ 𝑐1 = 1
Since 𝑐1 + 𝑐2 = 2, evidently 𝑐1 = 2
𝑛 𝑛
1+ 5 1− 5
Thus 𝐿𝑛 = + .
2 2

12-05-2025 Prepared by Dr. Palle Prathapa Reddy 14