number of other terms as a,,, a,., ....
called recurrence relation.
Example : fibonacci sequence
<1, 1,2, 3, 5, 8, 13, ....>
So, a, =a,, + a,, is a recurrence relation.
Note : This relation is also called difference equation.
ORDER OF RECURRENCE RELATION
The order of recurrence relation is difference between gi LINEAR RECURRENCE RELATION
Arecurrence relation having only the first power of the
sequence
& not having any product terms is said to be
linear.
Example : 5a, -3a,,+a,,=0
LINEAR RECURRENCE RELATION WITH CONSTANT COEFFICIENT
A recurrence relation of the form
C,a, + C,a,, +... Cyan, = fn)
is called linear recurrence relation with constant coefficient.
SOLUTION OF LINEAR RECURRENCE RELATION WITH
CONSTANT COEFFICIENT
Working Rule :
(i) Find auxiliary equation
(ii) Case-1 : When roots are real & distinct then
y, = (A,(a,)" + A,(a,)" ..... A,(a,)”. where a,, a,.... are roots.
Case-2 : When roots are coincident, then
yn = (A, FAX + AX AX” Ja”
Case-3 : When roots are non-repeated complex numbers
a+iB then y, = r(A,cosnd + A,sinnd) where r= a> +f? mple
=> x=2,1
So, solution a, = A,(2)" +A,(1)" Let recurrence relation is a, + Aa,,
Working Rule :
(1) If f(n) =n, then general form of PI is (P,n +
(2) If f(n) = n’, then general form of Pl is (P,n’ + P.n
(3). If f(n) = a’, then general form of Pl is Pa”
(4) If f(n) = na’, then general form of (P,n + P.)a”
Example : Solve the difference equation a, + 5a,, + 6a.
