DISCRETE NUMERIC FUNCTION (DNF),

GENERATING FUNCTIONS &

RECURRENCE RELATIONS
DISCRETE NUMERIC FUNCTION (DNF)

A function whose domain is the set of non negative integers and whose range is the set of
real numbers is called Discrete Numeric Function (DNF) or Numeric Function (NF).
The NF often termed as Sequence.
If 𝑎: 𝑊 → 𝑅 is a DNF, then 𝑎0 , 𝑎1 , 𝑎2 , … , 𝑎𝑛 , … denote the value of the function 𝑎 at
0,1,2, … , 𝑛, …
i.e. 𝑎 0 = 𝑎0 , 𝑎 1 = 𝑎1 , 𝑎 2 = 𝑎2 , … , 𝑎 𝑛 = 𝑎𝑛 , …
Or the DNF can be written as-
𝑎 = 𝑎0 , 𝑎1 , 𝑎2 , … , 𝑎𝑛 , …
REPRESENTATION OF NF

(1) A NF can be specified by exhaustively listing its values. i.e.

𝑎0 , 𝑎1 , 𝑎2 , … , 𝑎𝑛 , … 𝑜𝑟 921, 937,946.29, … .
OR
(2) A NF can be presented by writing down the explicit formula of its general term.
Ex.1 𝑓 𝑛 𝑜𝑟 𝑎𝑛 = 3𝑛2 + 𝑛 + 8

3𝑛 ; 0 ≤ 𝑛 ≤ 1
Ex. 2 𝑓 𝑛 𝑜𝑟 𝑎𝑛 = ቊ 𝑛
5 ; 𝑛>1
EXAMPLE

A ball is dropped on a floor from a height of 40 metres. It is assumed that the ball always
rebounds and reaches half of the height from which it falls. If 𝑎𝑛 denotes the height it
reaches in the nth rebound, then build the numeric function and find 𝑎𝑛 , If 𝑏𝑛 is the loss in
height during the nth rebound, then find 𝑏𝑛 and write it in terms of 𝑎𝑛 .
Sol.
40 1 40 40 1 40 40
∵ 𝑎1 = , 𝑎2 = . = 2 , 𝑎3 = . 2 = 3 , … … … .
2 2 2 2 2 2 2
40
𝑎𝑛 = 𝑛
2
 40 40 40
∵ 𝑏1 = 40 − , 𝑏2 = 40 − 2 , 𝑏3 = 40 − 3 , … . .
2 2 2
40
∴ 𝑏𝑛 = 40 − 𝑛
2
EXAMPLE

Let 𝑎𝑛 denote the altitude of an aircraft in thousands of meters at the n-th minute. Let the
aircraft takes off after spending 10 minutes on the ground, climbs up at a uniform speed at
an altitude 10,000 meters in 10 minutes, starts to descend uniformly 2 hours of flying time
and lands 10 minutes later. Then the NF 𝑎𝑛 of the altitude of the aircraft is given by-
 0 ; 0 ≤ 𝑛 ≤ 10
𝑛 − 10; 11 ≤ 𝑛 ≤ 20
𝑎𝑛 = 10 ; 21 ≤ 𝑛 ≤ 130
140 − 𝑛 ; 131 ≤ 𝑛 ≤ 140
0 ; 𝑛 > 140
SUM OF DNFS

Let 𝑎 and 𝑏 are DNFs, then their sum ‘c = 𝑎 + 𝑏’ is a DNF whose value at ‘n’ is equal to
the sum of their individual values at ‘n’.
Ex. Let us consider two NF 𝑎 and 𝑏 as
0 ; 0≤𝑛≤3
𝑎𝑛 = ቊ −𝑛
2 + 3 ;𝑛 ≥ 4
and

2 − 3𝑛 ; 0 ≤ 𝑛 ≤ 2
𝑏𝑛 = ቊ
2𝑛 + 5 ; 𝑛 ≥ 3
 0 + 2 − 3𝑛 ; 0 ≤ 𝑛 ≤ 2
𝑐𝑛 = 𝑎𝑛 + 𝑏𝑛 = ൞ 0 + 2 × 3 + 5 ; 𝑛 = 3
2−𝑛 + 3 + 2𝑛 + 5 ; 𝑛 ≥ 4

2 − 3𝑛 ; 0 ≤ 𝑛 ≤ 2
=ቐ 11; 𝑛 = 3
2−𝑛 + 2𝑛 + 8; 𝑛 ≥ 4
PRODUCT OF DNFS

The product of NFs 𝑎 and 𝑏 is denoted by ‘d = 𝑎𝑏’ is also a NF, whose value at ‘n’ is equal
to the product of the individual values of NFs 𝑎 and 𝑏 at ‘n’.
For the previous example where
0 ; 0≤𝑛≤3
𝑎𝑛 = ቊ −𝑛
2 + 3 ;𝑛 ≥ 4
and

2 − 3𝑛 ; 0 ≤ 𝑛 ≤ 2
𝑏𝑛 = ቊ
2𝑛 + 5 ; 𝑛 ≥ 3
 0; 0 ≤ 𝑛 ≤ 2
𝑑𝑛 = 𝑎𝑛 × 𝑏𝑛 = ቐ 0; 𝑛 = 3
2−𝑛 + 3 2𝑛 + 5 ; 𝑛 ≥ 4

0; 0 ≤ 𝑛 ≤ 3
= ቊ −𝑛
2 + 3 2𝑛 + 5 ; 𝑛 ≥ 4
MULTIPLICATION OF A NF BY A REAL NUMBER

Let ‘𝑎’ be a NF and 𝛼 be any real number. Then 𝛼𝑎 is a NF whose value at ‘n’ is equal to 𝛼
times 𝑎𝑛 . The function 𝛼𝑎 is called a scaled version of ‘𝑎’ with scale factor 𝛼.
Ex. If 𝑎 = 3𝑛3 − 1 and 𝛼 = 10 then
𝛼𝑎 = 𝛼 3𝑛3 − 1 = 10 3𝑛3 − 1
NUMERIC FUNCTION 𝑆 𝑖 𝑎

Let 𝑎 be a NF and ‘𝑖’ be a positive integer, then 𝑏 = 𝑆 𝑖 𝑎 is a NF whose value at ‘n’ is 0 for
𝑛 = 0,1,2, … , 𝑖 − 1 and is 𝑎𝑛−𝑖 for 𝑛 ≥ 𝑖.
0 ;0 ≤ 𝑛 ≤ 𝑖 − 1
𝑏𝑛 = 𝑆 𝑖 𝑎 =ቊ
𝑛 𝑎𝑛−𝑖 ;𝑛 ≥ 𝑖

Ex. Consider the NF 𝑎 as

1 ; 0 ≤ 𝑛 ≤ 10
𝑎𝑛 = ቊ
2; 𝑛 ≥ 11
Then find the NF 𝑏 = 𝑆 7 𝑎.
SOLUTION

0 ;0 ≤ 𝑛 ≤ 6
𝑏𝑛 = 𝑆 7 𝑎 𝑛 =ቊ
𝑎𝑛−7 ;𝑛 ≥ 7

0 ;0 ≤ 𝑛 ≤ 6
𝑏𝑛 = ቐ1 ; 7 ≤ 𝑛 ≤ 17
2; 𝑛 ≥ 18
NUMERIC FUNCTION 𝑆 −𝑖 𝑎

Let 𝑎 be a NF and ‘𝑖’ be a positive integer, then 𝑏 = 𝑆 −𝑖 𝑎 is a NF whose value at ‘n’ is 𝑎𝑛+𝑖
for 𝑛 ≥ 0.
𝑏𝑛 = 𝑆 −𝑖 𝑎 𝑛
= 𝑎𝑛+𝑖

Ex. Consider the NF 𝑎 as

1 ; 0 ≤ 𝑛 ≤ 10
𝑎𝑛 = ቊ
2; 𝑛 ≥ 11
Then find the NF 𝑏 = 𝑆 −5 𝑎.
SOLUTION

𝑏𝑛 = 𝑆 −5 𝑎 𝑛 = 𝑎𝑛+5

1 ;0 ≤ 𝑛 ≤ 5
𝑏𝑛 = ቊ
2 ;𝑛 ≥ 6
ACCUMULATED SUM OF A NF

The accumulated sum of a NF 𝑎 is a NF 𝑏, whose value at ‘n’ is given by-

𝑛

𝑏𝑛 = ෍ 𝑎𝑖 ; n ≥ 0
𝑖=0

i.e. 𝑏𝑛 = 𝑎0 + 𝑎1 + 𝑎2 + ⋯ + 𝑎𝑛
GENERATING FUNCTION (GF)

If 𝑎1 , 𝑎2 , … , 𝑎𝑛 , … is a sequence of real or complex numbers, then the power series given by

∞

𝐺 𝑥 = ෍ 𝑎𝑛 𝑥 𝑛 = 𝑎0 + 𝑎1 𝑥 + 𝑎2 𝑥 2 + 𝑎3 𝑥 3 + ⋯
𝑛=0

…(1)
Is called the Generating Function (GF) for the given sequence.
∞
𝑎𝑛 𝑛=1 , where 𝑎𝑛 =coefficient of 𝑥 𝑛 in 𝐺 𝑥
𝑡ℎ
= 𝑛+1 term in series (1)
 OR
Let 𝑎0 , 𝑎1 , 𝑎2 , … , 𝑎𝑛 , … be a NF ‘𝑎’. Then the infinite series in terms of the parameter 𝑥
𝑎0 + 𝑎1 𝑥 + 𝑎2 𝑥 2 + 𝑎3 𝑥 3 + ⋯ + 𝑎𝑛 𝑥 𝑛 + ⋯
Is called GF of NF of 𝑎.
The word GF is used, because, in some sense 𝐺 𝑥 generates its coefficients. In (1), 𝑥 is
considered just a symbol, called an indeterminate, it is not a variable which is replaced by
numbers belonging to some domain.
Q1. Find the GF for the sequence 1,1,1,1,1,……
Sol. Here 𝑎0 = 𝑎1 = 𝑎2 = ⋯ . . = 1

2 3 −1
1
∴𝐺 𝑥 =1+𝑥+𝑥 +𝑥 +⋯= 1−𝑥 = ; 𝑥 <1
1−𝑥
Q2. Find the GF for the sequence 𝑎, 𝑎, 𝑎, 𝑎, 𝑎, …
Sol. Here 𝑎0 = 𝑎1 = 𝑎2 = ⋯ . . = 𝑎
∴ 𝐺 𝑥 = 𝑎 + 𝑎𝑥 + 𝑎𝑥 2 + 𝑎𝑥 3 + ⋯
2 3 −1
𝑎
=𝑎 1+𝑥+𝑥 +𝑥 +⋯ =𝑎 1−𝑥 = ; 𝑥 <1
1−𝑥
Q3.Find the GF for the sequence 1,2,3,4,5,……
Sol. Here 𝑎0 = 1, 𝑎1 = 2, 𝑎2 = 3, …
1
∴ 𝐺 𝑥 = 1 + 2𝑥 + 3𝑥 2 + 4𝑥 3 +⋯= 1−𝑥 −2 = 2
1−𝑥
Q4. Find the GF for the sequence 0,1,2,3,4,……
Sol. Here 𝑎0 = 0, 𝑎1 = 1, 𝑎2 = 2, … . .
∴ 𝐺 𝑥 = 0 + 𝑥 + 2𝑥 2 + 3𝑥 3 + ⋯ = 𝑥(1 + 2𝑥 + 3𝑥 2 + 4𝑥 3 + ⋯ )

−2
𝑥
=𝑥 1−𝑥 = 2
1−𝑥
Q5. Find the GF for the sequence 1, 𝑎, 𝑎2 , 𝑎3 , …
Sol. Here 𝑎0 = 1, 𝑎1 = 𝑎, 𝑎2 = 𝑎2 …
∴ 𝐺 𝑥 = 1 + 𝑎𝑥 + 𝑎2 𝑥 2 + 𝑎3 𝑥 3 + ⋯

−1
1
= 1 − 𝑎𝑥 = ; 𝑎𝑥 < 1
1 − 𝑎𝑥
Alternative Way
𝐺 𝑥 = 1 + 𝑎𝑥 + 𝑎2 𝑥 2 + 𝑎3 𝑥 3 + ⋯
⇒ 𝐺 𝑥 − 1 = 𝑎𝑥 + 𝑎2 𝑥 2 + 𝑎3 𝑥 3 + ⋯
𝐺 𝑥 −1
= 1 + 𝑎𝑥 + 𝑎2 𝑥 2 + 𝑎3 𝑥 3 + ⋯
𝑎𝑥
𝐺 𝑥 −1
=𝐺 𝑥
𝑎𝑥
1
⇒𝐺 𝑥 =
1 − 𝑎𝑥
GENERATING FUNCTIONS FOR SOME NFS
General term of Numeric Function ‘𝒂’ Generating Function 𝐺 𝑥
𝑎𝑛 = 1 1
𝐺 𝑥 =
1−𝑥
𝑎𝑛 = 𝑛 𝑥
𝐺 𝑥 =
1−𝑥 2
𝑎𝑛 = 𝑛 + 1 1
𝐺 𝑥 =
1−𝑥 2
𝑎𝑛 = 𝑛 𝑛 + 1 2𝑥
𝐺 𝑥 =
1−𝑥 2
𝑎𝑛 = 𝑛 + 1 𝑛 + 2 2
𝐺 𝑥 =
1−𝑥 3
𝑎𝑛 = 𝑎 𝑛 1
𝐺 𝑥 =
1 − 𝑎𝑥
𝑎𝑛 = (−1)𝑛 1
𝐺 𝑥 =
1+𝑥
𝑎𝑛 = 𝑛 2 𝑥(𝑥 + 1)
𝐺 𝑥 =
1−𝑥 3
GENERATING FUNCTIONS FOR SOME NFS
General term of Numeric Function ‘𝒂’ Generating Function 𝐺 𝑥
𝑎𝑛 = 𝑛𝑎𝑛 𝑎𝑥
𝐺 𝑥 = 2
1 − 𝑎𝑥
1 𝐺 𝑥 = 𝑒𝑥
𝑎𝑛 =
𝑛!
𝑎𝑛 = 𝐶(𝑚, 𝑛) 𝐺 𝑥 = 1+𝑥 𝑚
ADDITION AND MULTIPLICATION OF TWO GFS

Th.1 Let 𝑎,𝑏 and 𝑐 be NFs and their GFs are 𝐺1 𝑥 , 𝐺2 𝑥 and 𝐺3 𝑥 respectively. Then
(i) If 𝑏𝑛 = 𝛼𝑎𝑛 for some constant 𝛼, then 𝐺2 𝑥 = 𝛼𝐺1 𝑥 .
(ii) If 𝑐𝑛 = 𝑎𝑛 + 𝑏𝑛 , then 𝐺3 𝑥 = 𝐺1 𝑥 + 𝐺2 𝑥
(iii) If 𝑐𝑛 = 𝑎𝑛 ∗ 𝑏𝑛 , then 𝐺3 𝑥 = 𝐺1 𝑥 𝐺2 𝑥
(iv) If 𝑏𝑛 = 𝛼 𝑛 𝑎𝑛 for some constant 𝛼, then 𝐺2 𝑥 = 𝐺1 𝛼𝑥
 1
Th. 2 Let 𝐺(𝑥) be the GF of the NF 𝑎 = (𝑎0 , 𝑎1 , 𝑎2 , … , 𝑎𝑛 , … ) then 𝐺(𝑥) is the GF for the NF
1−𝑥
𝑏, which is accumulated sum of 𝑎 i.e.
𝑛

𝑏𝑛 = ෍ 𝑎𝑖 ; n ≥ 0
𝑖=0

i.e.
𝑏𝑛 = 𝑎0 + 𝑎1 + 𝑎2 + 𝑎3 + ⋯ + 𝑎𝑛
PROOF:
∵ 𝐺 𝑥 = 𝑎0 + 𝑎1 𝑥 + 𝑎2 𝑥 2 + 𝑎3 𝑥 3 + ⋯ + 𝑎𝑛 𝑥 𝑛 + ⋯
…(1)
1
Also = 1 + 𝑥 + 𝑥2 + 𝑥3 + ⋯ + 𝑥𝑛 + ⋯
1−𝑥

…(2)
(1)X (2), we have
𝐺(𝑥)
= 1 + 𝑥 + 𝑥2 + 𝑥3 + ⋯ + 𝑥𝑛 + ⋯
1−𝑥
∗ (𝑎0 + 𝑎1 𝑥 + 𝑎2 𝑥 2 + 𝑎3 𝑥 3 + ⋯ + 𝑎𝑛 𝑥 𝑛 + ⋯ )
= 𝑎0 + (𝑎0 + 𝑎1 )𝑥 + (𝑎0 + 𝑎1 + 𝑎2 )𝑥 2 + (𝑎0 + 𝑎1 + 𝑎2 +𝑎3 )𝑥 3 + ⋯
+ (𝑎0 + 𝑎1 + 𝑎2 + ⋯ + 𝑎𝑛 )𝑥 𝑛 + ⋯
= 𝑏0 + 𝑏1 𝑥 + 𝑏2 𝑥 2 + 𝑏3 𝑥 3 + ⋯ + 𝑏𝑛 𝑥 𝑛 + ⋯
Where 𝑏𝑛 = 𝑎0 + 𝑎1 + 𝑎2 + ⋯ + 𝑎𝑛
Q1. Find GF for the series 1,-1,1,-1,1,-1,….
Sol. Here 𝑎0 = 1, 𝑎1 = −1, 𝑎2 = 1, …
1
∴ 𝐺 𝑥 = 1 − 𝑥 + 𝑥2 − 𝑥3 + ⋯ = 1 + 𝑥 −1 =
1+𝑥
Q2. Find GF for the series 1,1,1,1,1,1,1
Sol. Here 𝑎0 = 1, 𝑎1 = 1, 𝑎2 = 1, … , 𝑎6 = 1
∴ 𝐺 𝑥 = 1 + 𝑥 + 𝑥2 + 𝑥3 + ⋯ + 𝑥6 …(1)
∴ 𝑥𝐺 𝑥 = 𝑥 + 𝑥 2 + 𝑥 3 + ⋯ + 𝑥 7 …(2)
(1)-(2), we get 1 − 𝑥 𝐺 𝑥 = 1 − 𝑥 7

1−𝑥 7
Or 𝐺 𝑥 =
1−𝑥
Q3. Find GF for the series 2,3,5,9,17,33,…
Sol. Here 𝑎0 = 2, 𝑎1 = 3, 𝑎2 = 5, …
∴ 𝐺 𝑥 = 2 + 3𝑥 + 5𝑥 2 + 9𝑥 3 + 17𝑥 4 + 33𝑥 5 + ⋯
= 1 + 𝑥 + 𝑥 2 + 𝑥 3 + ⋯ + 1 + 2𝑥 + 22 𝑥 2 + 23 𝑥 3 + ⋯
1 1 2 − 3𝑥
= + =
1 − 𝑥 1 − 2𝑥 1 − 3𝑥 + 2𝑥 2
Q4. Find GF for the series 2,5,13,35,…
Sol. Here 𝑎0 = 2, 𝑎1 = 5, 𝑎2 = 13, …
∴ 𝐺 𝑥 = 2 + 5𝑥 + 13𝑥 2 + 35𝑥 3 + ⋯
= 1 + 3𝑥 + 32 𝑥 2 + 33 𝑥 3 + ⋯ + 1 + 2𝑥 + 22 𝑥 2 + 23 𝑥 3 + ⋯
1 1 2 − 5𝑥
= + =
1 − 3𝑥 1 − 2𝑥 1 − 5𝑥 + 6𝑥 2
Q5. Find GF of a NF 𝑎, where

2𝑛 𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛
𝑎𝑛 = ቐ−2𝑛 𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑
1 ; 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
Sol. Here 𝐺 𝑥 = 1 − 2𝑥 + 22 𝑥 2 − 23 𝑥 3 + 24 𝑥 4 − 25 𝑥 5 + ⋯
1
=
1 + 2𝑥
Q6. Find the GF for the NF 𝑎, such that 𝑎𝑛 = 2𝑛 + 3𝑛
Sol.
∞ ∞

∵ 𝐺 𝑥 = ෍ 𝑎𝑛 𝑥 𝑛 = ෍ 2𝑛 + 3𝑛 𝑥 𝑛
𝑛=0 𝑛=0

∞ ∞

= ෍ 2𝑛 𝑥 𝑛 + ෍ 3𝑛 𝑥 𝑛
𝑛=0 𝑛=0

1 1 2 − 5𝑥
= + =
1 − 2𝑥 1 − 3𝑥 1 − 5𝑥 + 6𝑥 2
Q7. Find the GF of the sequence 𝑦1 , 𝑦2 , 𝑦3 , … , 𝑦𝑛 , … defined as
𝑦𝑛 + 2𝑦𝑛−1 − 15𝑦𝑛−2 = 0 ; 𝑛 ≥ 2
With boundary conditions 𝑦0 = 0, 𝑦1 = 1.
Sol. As for the given sequence GF is
∞

𝐺 𝑥 = 𝑦0 + 𝑦1 𝑥 + 𝑦2 𝑥 2 + ⋯ = ෍ 𝑦𝑛 𝑥 𝑛 … (1)
𝑛=0

Also 𝑦𝑛 + 2𝑦𝑛−1 − 15𝑦𝑛−2 = 0 …(2)

Multiply with 𝑥 𝑛 and taking summation from 𝑛 = 2 to 𝑛 = ∞, we have
∞ ∞ ∞

෍ 𝑦𝑛 𝑥 𝑛 + 2 ෍ 𝑦𝑛−1 𝑥 𝑛 − 15 ෍ 𝑦𝑛−2 𝑥 𝑛 = 0
𝑛=2 𝑛=2 𝑛=2
 ∞ ∞ ∞

⇒ ෍ 𝑦𝑛 𝑥 𝑛 − 𝑦0 − 𝑦1 𝑥 + 2𝑥 ෍ 𝑦𝑛−1 𝑥 𝑛−1 − 2𝑥𝑦0 − 15 𝑥 2 ෍ 𝑦𝑛−2 𝑥 𝑛−2 = 0

𝑛=0 𝑛=1 𝑛=2

⇒ 𝐺 𝑥 − 𝑦0 − 𝑦1 𝑥 + 2𝑥 𝐺 𝑥 − 𝑦0 − 15𝑥 2 𝐺(𝑥) = 0

⇒ 𝐺 𝑥 1 + 2𝑥 − 15𝑥 2 − 𝑥 = 0

𝑥 𝑥
⇒𝐺 𝑥 = 2
=
1 + 2𝑥 − 15𝑥 (1 + 5𝑥)(1 − 3𝑥)
RECURRENCE RELATION (RR)

A formula which defines any term of a sequence in terms of any number of its previous terms
or
which express any term of a sequence as a function of its previous terms, is called Recursive
and the relation is called Recurrence Relation.
The nth term of the sequence 3,8,13,18,23,… can be written as-
𝑎𝑛 = 𝑎𝑛−1 + 5 ; 𝑛 ≥ 1 𝑎𝑛𝑑 𝑎0 = 3
This relation is called Recurrence Relation and the condition 𝑎0 = 3 is called initial
condition/boundary condition for the sequence.
ORDER OF THE RECURRENCE RELATION

The difference between highest and lowest subscript in the RR is the order of that RR.
Ex.1 For the RR 𝑎𝑛+2 − 3𝑎𝑛+1 − 𝑎𝑛 = 0, the order is
= 𝑛+2 −𝑛 =2
Ex.2 For the RR 𝑎𝑛+1 − 3𝑎𝑛2 − 2𝑎𝑛−2 = 0, the order is
= 𝑛 + 1 − (𝑛 − 2) = 3
DEGREE OF RR

The highest power of 𝑎 with any argument is the degree of the RR.
Ex.1 For the RR 𝑎𝑛+2 − 3𝑎𝑛+1 − 𝑎𝑛 = 0, the degree is 1.
Ex.2 For the RR 𝑎𝑛+1 − 3𝑎𝑛2 − 2𝑎𝑛−2 = 0, the degree is 2.
2
Ex.3 For the RR 𝑎𝑛+1 − 3𝑎𝑛3 − 2𝑎𝑛−2 = 0, the degree is 3.
LINEAR AND HOMOGENEOUS RR

A RR is called Linear if it is in first degree.

A RR is called Homogeneous if it contains no terms that depend only on the argument (n in this
case).
A RR which is not homogeneous, is called Non – Homogeneous.
Ex.1 The RR 𝑎𝑛+2 − 3𝑎𝑛+1 − 𝑎𝑛 = 2𝑛 , is Non- Homogeneous and Linear.
Ex.2 The RR 𝑎𝑛+1 − 3𝑎𝑛 − 2𝑎𝑛−2 = 0, is Linear and Homogeneous.
2
Ex.3 The RR 𝑎𝑛+1 − 3𝑎𝑛3 − 2𝑎𝑛−2 = 0, is Non linear and Homogeneous.
Ex.4 The RR 𝑎𝑛 𝑎𝑛+1 − 3𝑎𝑛 − 2𝑎𝑛−2 = 0, is Non linear and Homogeneous
SOLUTION OF RR BY GF

Let us consider the RR

𝑐0 𝑎𝑛 + 𝑐1 𝑎𝑛−1 + 𝑐2 𝑎𝑛−2 + ⋯ + 𝑐𝑘 𝑎𝑛−𝑘 = 𝑓 𝑛 … (1)
Where 𝑐0 , 𝑐1 , 𝑐2 , … , 𝑐𝑘 are constants and the relation is valid for 𝑛 ≥ 𝑘.
Multiply (1) with 𝑥 𝑛 on both sides and taking summation from 𝑛 = 𝑘 to 𝑛 = ∞, we get
∞ ∞

෍ 𝑥 𝑛 𝑐0 𝑎𝑛 + 𝑐1 𝑎𝑛−1 + 𝑐2 𝑎𝑛−2 + ⋯ + 𝑐𝑘 𝑎𝑛−𝑘 = ෍ 𝑥 𝑛 𝑓 𝑛 … (2)

𝑛=𝑘 𝑛=𝑘
∞

∵ 𝐺 𝑥 = ෍ 𝑎𝑛 𝑥 𝑛 = 𝑎0 + 𝑎1 𝑥 + 𝑎2 𝑥 2 + ⋯ + 𝑎𝑘−1 𝑥 𝑘−1 + 𝑎𝑘 𝑥 𝑘 + ⋯
𝑛=0
 ∞ ∞

∴ ෍ 𝑎𝑛 𝑥 𝑛 = ෍ 𝑎𝑛 𝑥 𝑛 − 𝑎0 − 𝑎1 𝑥 − 𝑎2 𝑥 2 − ⋯ − 𝑎𝑘−1 𝑥 𝑘−1
𝑛=𝑘 𝑛=0
∞ ∞

∴ 𝑐0 ෍ 𝑎𝑛 𝑥 𝑛 = 𝑐0 ෍ 𝑎𝑛 𝑥 𝑛 − 𝑎0 − 𝑎1 𝑥 − 𝑎2 𝑥 2 − ⋯ − 𝑎𝑘−1 𝑥 𝑘−1
𝑛=𝑘 𝑛=0
∞ ∞

∵ ෍ 𝑎𝑛−1 𝑥 𝑛−1 = ෍ 𝑎𝑛 𝑥 𝑛 − 𝑎0 − 𝑎1 𝑥 − 𝑎2 𝑥 2 − ⋯ − 𝑎𝑘−2 𝑥 𝑘−2

𝑛=𝑘 𝑛=0
∞ ∞

∴ 𝑐1 ෍ 𝑎𝑛−1 𝑥 𝑛 = 𝑐1 𝑥 ෍ 𝑎𝑛 𝑥 𝑛 − 𝑎0 − 𝑎1 𝑥 − 𝑎2 𝑥 2 − ⋯ − 𝑎𝑘−2 𝑥 𝑘−2

𝑛=𝑘 𝑛=0

Similarly
 ∞ ∞

𝑐2 ෍ 𝑎𝑛−1 𝑥 𝑛 = 𝑐2 𝑥 2 ෍ 𝑎𝑛 𝑥 𝑛 − 𝑎0 − 𝑎1 𝑥 − 𝑎2 𝑥 2 − ⋯ − 𝑎𝑘−3 𝑥 𝑘−3

𝑛=𝑘 𝑛=0

:
:
∞ ∞

𝑐𝑘 ෍ 𝑎𝑛−𝑘 𝑥 𝑛 = 𝑐𝑘 𝑥 𝑘 ෍ 𝑎𝑛 𝑥 𝑛
𝑛=𝑘 𝑛=0

Putting these values in (2) and write 𝐺 𝑥 = σ∞ 𝑛

𝑛=0 𝑎𝑛 𝑥 , we have
𝑐0 𝐺(𝑥) − 𝑎0 − 𝑎1 𝑥 − 𝑎2 𝑥 2 − ⋯ − 𝑎𝑘−1 𝑥 𝑘−1 + 𝑐1 𝑥 𝐺(𝑥) − 𝑎0 − 𝑎1 𝑥 − 𝑎2 𝑥 2 − ⋯ − 𝑎𝑘−2 𝑥 𝑘−2
∞

+ 𝑐2 𝑥 2 𝐺(𝑥) − 𝑎0 − 𝑎1 𝑥 − 𝑎2 𝑥 2 − ⋯ − 𝑎𝑘−3 𝑥 𝑘−3 + ⋯ + 𝑐𝑘 𝑥 𝑘 𝐺 𝑥 = ෍ 𝑥 𝑛 𝑓 𝑛

𝑛=𝑘
 𝐺 𝑥 𝑐0 + 𝑐1 𝑥 + 𝑐2 𝑥 2 + ⋯ + 𝑐𝑘−1 𝑥 𝑘−1 + 𝑐𝑘 𝑥 𝑘
∞

= ෍ 𝑥 𝑛 𝑓 𝑛 + 𝑐0 𝑎0 + 𝑎1 𝑥 + 𝑎2 𝑥 2 + ⋯ + 𝑎𝑘−1 𝑥 𝑘−1 + 𝑐1 𝑥 𝑎0 + 𝑎1 𝑥 + 𝑎2 𝑥 2 + ⋯ + 𝑎𝑘−2 𝑥 𝑘−2

𝑛=𝑘
+ 𝑐2 𝑥 2 𝑎0 + 𝑎1 𝑥 + 𝑎2 𝑥 2 + ⋯ + 𝑎𝑘−3 𝑥 𝑘−3 + 𝑐𝑘−1 𝑥 𝑘−1 𝑎0
𝐺 𝑥 𝑐0 + 𝑐1 𝑥 + 𝑐2 𝑥 2 + ⋯ + 𝑐𝑘−1 𝑥 𝑘−1 + 𝑐𝑘 𝑥 𝑘
𝐺 𝑥
∞
1 𝑛 2 𝑘−1
= ቎෍ 𝑥 𝑓 𝑛 + 𝑐0 𝑎0 + 𝑎1 𝑥 + 𝑎2 𝑥 + ⋯ + 𝑎𝑘−1 𝑥
𝑐0 + 𝑐1 𝑥 + 𝑐2 𝑥 2 + ⋯ + 𝑐𝑘−1 𝑥 𝑘−1 + 𝑐𝑘 𝑥 𝑘
𝑛=𝑘
Ex. 1 Solve the RR 𝑎𝑛 − 7𝑎𝑛−1 + 10𝑎𝑛−2 = 0 ; 𝑛 ≥ 2, given that 𝑎0 = 10, 𝑎1 = 41
Sol. ∵ 𝑎𝑛 − 7𝑎𝑛−1 + 10𝑎𝑛−2 = 0 …(1)
Multiplying with 𝑥 𝑛 and taking summation from 𝑛 = 2 𝑡𝑜 ∞, we get
∞ ∞ ∞

෍ 𝑎𝑛 𝑥 𝑛 − 7 ෍ 𝑎𝑛−1 𝑥 𝑛 + 10 ෍ 𝑎𝑛−2 𝑥 𝑛 = 0
𝑛=2 𝑛=2 𝑛=2

∴ 𝐺 𝑥 − 𝑎0 − 𝑎1 𝑥 − 7𝑥 𝐺 𝑥 − 𝑎0 + 10𝑥 2 𝐺(𝑥) = 0
∴ 𝐺 𝑥 − 10 − 41𝑥 − 7𝑥 𝐺 𝑥 − 10 + 10𝑥 2 𝐺(𝑥) = 0
∴ 𝐺 𝑥 1 − 7𝑥 + 10𝑥 2 + 10 7𝑥 − 1 − 41𝑥 = 0
10 − 29𝑥 3 7
∴𝐺 𝑥 = 2
= +
1 − 7𝑥 + 10𝑥 1 − 2𝑥 1 − 5𝑥
∞ ∞ ∞

෍ 𝑎𝑛 𝑥 𝑛 = 3 ෍ 2𝑛 𝑥 𝑛 + 7 ෍ 5𝑛 𝑥 𝑛
𝑛=0 𝑛=0 𝑛=0

∴ 𝑎𝑛 = 3. 2𝑛 + 7. 5𝑛