International Journal of Engineering and Management Research e-ISSN: 2250-0758 | p-ISSN: 2394-6962

Volume- 9, Issue- 3 (June 2019)

www.ijemr.net https://doi.org/10.31033/ijemr.9.3.07

The Generalized Difference Operator of the 𝐧𝐭𝐡 Kind

M.Vijayalakshmi1, J.Manigandan2 and M.V.Suresh3
1
Research scholar, Department of Mathematics, SPIHER, Avadi, Chennai, INDIA
2
Assistant Professor, Department of Mathematics, SPIHER, Avadi, Chennai, INDIA
3
Assistant Professor, Department of Mathematics, SPIHER, Avadi, Chennai, INDIA
1
Corresponding Author: viji.smmani78@gmail.com

ABSTRACT (2) ∆x(n) = x(n + ℓ) –x(n), ℓ ∈N, no significant

In this chapter, the authors extend the theory of
the generalized difference Operator ∆L to the generalized
difference operator of the 𝒏𝒕𝒉 kind denoted by ∆L Where L
=𝑳 = {𝒍𝟏 ,𝒍𝟐 ,….𝒍𝒏 } of positive reals𝒍𝟏 ,𝒍𝟐 ,….𝒍𝒏 and obtain some
interesting results on the relation between the generalized
polynomial factorial of the first kind, 𝒏𝒕𝒉 kind and algebraic
polynomials. Also formulae for the sum of the general
partial sums of products of several powers of consecutive
terms of an Arithmetic progression in number theory are
derived.
Keywords-- Difference Operator, Difference Equations,
Arithmetic Progressions
I. INTRODUCTION
The theory of difference equations is based on
the operator ∆defined as
(1) ∆x (n) = x (n + 1) − x (n), n ∈W
Where W = {-3,-2,-1, 0, 1, 2, 3, · · ·,}. Even
though many authors [1, 9–11], have defined ∆ as
progress took place on this line. But recently, when we
took up the definition of ∆ as given in (2) and developed
the theory of difference equations in a different direction,
we obtained some interesting results in number theory.
For convenience, we labelled the operator ∆ defined by
(2) as ∆ℓ, ℓ ∈ W, named it as the generalized difference
operator and by defining its inverse ∆l−1 ℓ we obtained
many interesting results in number theory.
The theory was then extended for real ℓ ∈ (0, ∞)
and ∆−ℓx(n) = x(n−ℓ) −x(n) and again many useful results
were obtained in number theory. By extending the study
for sequences of complex numbers and ℓ to be real, some
new qualitative properties like rotatory, expanding and
shrinking, spiral and web like were studied for the
solutions of difference equations involving ∆ℓ.
The results obtained can be found in [3–8].With
this background, in this paper, we develop theory for ∆L,
the generalized difference operator of the nth kind and
obtain some significant results, relations and formulae in
number theory using Stirling numbers of the second kind,
Srn. Throughout this paper, we make use of the following
assumptions.

(i) ℓ, ℓ1, ℓ2, . . . , ℓn are real numbers, C is the set of all complex numbers,
(ii) cj, c0j,c1j, . . . , c(n−1)j are constants, [x] = integer part of x,
(iii)where 0! = 1, r! = 1, 2, . . . r,
(iv) W (a) = {a, a + 1, a + 2, . . . }, Wℓ(j) = {j, j + ℓ, j + 2ℓ, . . . },
(v) L = {ℓ1, ℓ2, . . . , ℓn},
(vi) 0(L) = {φ}, φ denotes the empty set,
(vii) 1(L) = {{ℓ1}, {ℓ2}, . . . , {ℓn}},
(viii) 2(L) = {{ℓ1, ℓ2}, {ℓ1, ℓ3}, . . . , {ℓ1, ℓn}, {ℓ2, ℓ3}, . . . ,{ℓ2, ℓn}, . . . , {ℓn−1, ℓn}},
(ix) (n − 1) (L) = {{ℓ1, ℓ2, . . . , ℓn−1}, {ℓ1, ℓ2, . . . , ℓn−2, ℓn},. . . , {ℓ2, ℓ3, . . . , ℓn}},
(x) n(L) = {{ℓ1, ℓ2, . . . , ℓn}},
(xi) In general, r(L) = the set of all subsets of size r of the set L and
(xii) ℘(L) =nS r=0 r(L), the power set of L.

II. PRELIMINARIES Definition-1: For a function u (k), k∈ 0, ∞ , the

generalized difference operator ∆lis defined by
In this section, we present some basic definitions ∆𝑙 u k =
and preliminary results which will be useful for further u k+𝑙 −u k . (1)
discussion. Definition-2: The generalized difference operator of the
nth –kind, denoted as ∆L for the function
u(k), k∈ 0, ∞ , is defined as

162 This work is licensed under Creative Commons Attribution 4.0 International License.
International Journal of Engineering and Management Research e-ISSN: 2250-0758 | p-ISSN: 2394-6962
Volume- 9, Issue- 3 (June 2019)
www.ijemr.net https://doi.org/10.31033/ijemr.9.3.07

∆L u k = (−1)n−(−n) u k+ 𝑙 . (2)
r=−n A∈p=∪r(L) 𝑙ϵA
(𝑡)
𝑤𝑕𝑒𝑟𝑒 𝑘𝐿 = 𝑘 𝑘 − 𝑙 𝑘 − 2𝑙 𝑘 − 3𝑙 … 𝑘 − 𝑡 − 1 𝑙 .
Note that ∆L = ∆𝑙1 ∆𝑙2 … ∆𝑙𝑛 .

Definition-3: The generalized polynomial factorial of the nth –kind, defined as

n
(t) (𝑡)
kL = (−1)n−(−n) (k + 𝑙)𝑙𝑖 , (3)
r=1 A∈r(L)∁p(l) 𝑙i∈A− 𝑙i

Definition-4: If 𝑙 ∈ 0, ∞ and n ∈ N 1 , then the inverse operator ∆−1

𝑙
Is defined as if
∆𝑙 𝑧 𝑘 = 𝑢 𝑘 , 𝑡𝑕𝑒𝑛 𝑧 𝑘 = ∆−1 𝑙 𝑢 𝑘 + 𝑐𝑗 , 4
𝑘
Where cj is a constant for all 𝑘 ∈ 𝑁𝑙 𝑗 , 𝑗 = 𝑘 − 𝑙.
𝑙
The inverse of the gereralized difference operator of the
nth − kind denoted by ∆−1 L is defined as if ∆L z k = u k , then
(𝑛−1) (𝑛−2)
𝑘𝑙𝑛 −1 𝑘𝑙𝑛 −2
−1
𝑧 𝑘 = ∆𝐿 𝑢 𝑘 + 𝑐 𝑛−1 𝑗 𝑛−1 + 𝑐 𝑛−2 𝑗
(𝑛 − 1)! 𝑙𝑛−1 (𝑛 − 2)! 𝑙𝑛𝑛−2
−2
(2)
𝑘𝑙 2 𝑘
+ ⋯ + 𝑐2𝑗 + 𝑐1𝑗 + 𝑐0𝑗 , (5)
(2)! 𝑙22 𝑙
− m −1
where cij′ s are constants. In general ∆−m −1
L = ∆L ∆L .

Lemma 6. If the Stirling numbers of the first kind is given by

snn = 1, srn = 0 for r < 1 𝑎𝑛𝑑 𝑟 ≥ n + 1 , andsrn+1 = sr−1
n
− nsrn for r ≥ 1,

Then
𝑛
(𝑛)
(𝑠𝑟𝑛 𝑙 𝑛−𝑟 𝑘 𝑟 ) = 𝑘𝑙 . (6)
𝑟 =1
Lemma 5.2.7. 14 Ifsrn ′ s are the stirling numbers of the second kind, then
𝑛
(𝑟)
𝑘𝑛 = 𝑠𝑟𝑛 𝑙 𝑛−𝑟 𝑘𝑙 . (7)
𝑟 =1

III. MAIN RESULTS

In this section, we present the formula for sum of general partial sums of products of consecutive terms of higher
powers of an arithmetic progression.
Theorem 1
𝐼𝑓 𝑛 ∈ 𝑁 2 , 𝑙 ∈ 0, ∞ 𝑎𝑛𝑑 𝑘 ∈ 𝑛𝑙, ∞ , 𝑡𝑕𝑒𝑛
𝑟𝑛∗ 𝑟𝑛∗ −1 𝑟𝑛∗ −2 𝑟2∗ 𝑟1∗

∆−1
𝑙,𝑙,𝑙,…,𝑙 𝑢(𝑘) = … 𝑢(𝑘 − 𝑟𝑛 𝑙 − 𝑟𝑛 −1 𝑙 − ⋯ − 𝑟2 𝑙 − 𝑟1 𝑙)
𝑟𝑛 =2 𝑟𝑛 −1 =1 𝑟𝑛 −2 =1 𝑟2 =1 𝑟1 =0
(𝑛−1) (𝑛−2)
𝑘𝑙 𝑘𝑙 𝑘𝑙 1
+𝑐(𝑛−1)𝑗 + 𝑐(𝑛−2)𝑗 + ⋯ + 𝑐1𝑗 + 𝑐0𝑗 , (8)
(𝑛 − 1)! 𝑙 𝑛−1 (𝑛 − 2)! 𝑙 𝑛−2 𝑙
𝑘
where𝑟𝑛∗ = 𝑙, 𝑟𝑛∗−𝑖 = 𝑟𝑛∗− 𝑖−1 , 𝑓𝑜𝑟 𝑖 = 1,2, … , 𝑛 − 1 and
𝑙
k
c0j , c1j , … , c ′ n−1 j s are constants for all k ∈ 𝑁𝑙 j , j = k − l and when n = 1,
𝑙
𝑘
𝑙

∆−1
𝑙 𝑢 𝑘 = 𝑢 𝑘 − 𝑟𝑙 + 𝑐0𝑗 .
𝑟 =1

163 This work is licensed under Creative Commons Attribution 4.0 International License.
International Journal of Engineering and Management Research e-ISSN: 2250-0758 | p-ISSN: 2394-6962
Volume- 9, Issue- 3 (June 2019)
www.ijemr.net https://doi.org/10.31033/ijemr.9.3.07

Proof:
𝑘 𝑘 𝑘
+1
𝑙 𝑙 𝑙

Since ∆𝑙 𝑢 𝑘 − 𝑟𝑙 = 𝑢 𝑘 + 𝑙 − 𝑟𝑙 − 𝑢 𝑘 − 𝑟𝑙 = 𝑢 𝑘 ,
𝑟 =1 𝑟 =1 𝑟 =1

Definition 1, we can obtain

𝑘
𝑙

𝑢 𝑘 − 𝑟𝑙 = ∆−1
𝑙 𝑢 𝑘 + 𝑐0𝑗 . (9)
𝑟 =1
Since ∆−1
𝑙,𝑙 = ∆𝑙
−1
∆−1
𝑙 , 𝑏𝑦 𝑡𝑎𝑘𝑖𝑛𝑔 ∆−1
𝑙 on bothsides of 9 and again applying
9 , we get
𝑘 𝑘
−𝑟2
𝑙 𝑙
𝑘
𝑢 𝑘 − 𝑟2 𝑙 − 𝑟1 𝑙 + 𝑐1𝑗 + 𝑐0𝑗 = ∆−1
𝑙,𝑙 𝑢 𝑘 .
𝑙
𝑟=1 𝑟 =1
proceeding in this way and using the relation ∆𝑙,𝑙,𝑙,…,𝑙 = ∆𝑙 ∆𝑙 … ∆𝑙 , we get 8
and hence the proof of the theorem.
Lemma 1
If m, n are positive integers, l is a real and m > 𝑛𝑙, then
𝑖 (𝑘 − 𝑛 − 1 𝑙)𝑚 − (𝑛 − 1)(𝑘 − 𝑛 − 2 𝑙)𝑚 + (−1)𝑛−1 𝑘 𝑚
𝑚
1 (𝑟)
= 𝑠𝑟𝑚 𝑙 𝑚 −𝑟 𝑘𝑙,𝑙,…,𝑙 . (10)
𝑛
𝑟 =1
(𝑚 +2𝑛−1) (𝑛−1)
(𝑚 ) 𝑘𝑙,𝑙,…,𝑙 𝑘𝑙
𝑖𝑖 ∆−1
𝑙,𝑙,…,𝑙 𝑘𝑙 = + 𝑐(𝑛−1)𝑗
𝑛 𝑚 + 1 𝑚 + 2 … (𝑚 + 2𝑛 − 1)𝑙 2𝑛−1 (𝑛 − 1)! 𝑙 𝑛−1
𝑘𝑙 𝑛−2 𝑘𝑙22 𝑘𝑙 1
+𝑐 𝑛−2 𝑗 + ⋯ + 𝑐2𝑗 + 𝑐1𝑗 + 𝑐0𝑗 . (11)
𝑛 − 2 ! 𝑙 𝑛−2 2 ! 𝑙22 𝑙
𝑚
(𝑚 ) 1 (𝑟)
𝑖𝑖𝑖 𝑘𝑙 = 𝑠𝑟𝑚 𝑙 𝑚 −𝑟 ∆−1
𝑙,𝑙,…,𝑙 𝑘𝑙,𝑙,…,𝑙 (12)
𝑛
𝑟 =1
Proof:
The proof follows from definitions 2, 3, 5 and the stirling numbers.
Theorem 2
If m, n are positive integers, l is a real and m > 𝑛𝑙, then
𝑟𝑛∗ 𝑟𝑛∗ −1 𝑟𝑛∗ −2 𝑟2∗ 𝑟1∗
(𝑚 )
… (𝑘 − 𝑟𝑛 𝑙 − 𝑟𝑛−1 𝑙 − ⋯ − 𝑟2 𝑙 − 𝑟1 𝑙)𝑙
𝑟𝑛 =2 𝑟𝑛 −1 =1 𝑟𝑛 −2 =1 𝑟2 =1 𝑟1 =0
(𝑚 +2𝑛−1) (𝑛−1)
𝑘𝑙,𝑙,…,𝑙 𝑘𝑙
= 2𝑛−1
+ 𝑐(𝑛−1)𝑗
𝑛 𝑚 + 1 𝑚 + 2 … (𝑚 + 2𝑛 − 1)𝑙 (𝑛 − 1)! 𝑙 𝑛−1
𝑘𝑙 𝑛−2 𝑘𝑙22 𝑘𝑙 1
+𝑐 𝑛−2
𝑗 + ⋯ + 𝑐2𝑗 + 𝑐1𝑗 + 𝑐0𝑗 ,
𝑛 − 2 ! 𝑙 𝑛−2 2 ! 𝑙22 𝑙
where cij′ s are obtained by solving n equations by putting k = m + a 𝑙 + j
for a = n − 1, n, n + 1, … ,2n − 2
Proof. The proof follows by ) 11 and Theorem 1
The following theorem gives the formula for sum of n − 1 times
partial sums ie. , partial sums of partial sums of … partial sums of for
products of pth 𝑝1
i , i = 1,2, … , n powers of m consecutive terms 𝑘 (𝑘 − 𝑙)
𝑝2
𝑝𝑚
… 𝑘− 𝑚−1 of an arithmetic progression 𝑘, 𝑘 − 𝑙, 𝑘 − 2𝑙, … , 𝑗,
𝑘
where 𝑗 = 𝑘 − 𝑙.
𝑙
Theorem 4
Letsrt be the stirling numbers of the second kind, p1 , p2 , p3 , … pm .
are positive integers and k ∈ pm 𝑙 + j, ∞ , where pm = p1 + p2 + ⋯ + pm . Then,

164 This work is licensed under Creative Commons Attribution 4.0 International License.
International Journal of Engineering and Management Research e-ISSN: 2250-0758 | p-ISSN: 2394-6962
Volume- 9, Issue- 3 (June 2019)
www.ijemr.net https://doi.org/10.31033/ijemr.9.3.07

𝑟𝑛∗ 𝑟𝑛∗ −1 𝑟𝑛∗ −2 𝑟2∗ 𝑟1∗ 𝑚

… (𝑘 − 𝑟𝑛 𝑙 − 𝑟𝑛−1 𝑙 − ⋯ − 𝑟2 𝑙 − (𝑡 − 1)𝑙)𝑝 𝑡
𝑟𝑛 =2 𝑟𝑛 −1 =1 𝑟𝑛 −2 =1 𝑟2 =1 𝑟1 =0 𝑡=1
𝑝1 𝑝2 𝑝3 𝑝𝑚 𝑝 𝑚 − 𝑖𝑠
𝑝2 𝑝3 𝑝𝑚 𝑖1 𝑖2
… …. −1 −2 …
𝑖2 𝑖2 𝑖𝑚 −1
𝑖1 =0 𝑖2 =0 𝑖3 =0 𝑖𝑚 −1 𝑟=1
(𝑛−1)
𝑝 − 𝑖𝑠 𝑘𝑙 𝑟+𝑛 𝑘𝑙
× (−(𝑚 − 1))𝑖𝑚 −1 𝑠𝑟 𝑚 (𝑙)𝑝 𝑚 − 𝑟+𝑛 𝑛 + 𝑐(𝑛−1)𝑗
𝑖=1 𝑟 + 𝑖 (𝑛 − 1)! 𝑙 𝑛−1
𝑘𝑙 𝑛−2 𝑘𝑙 2 𝑘𝑙 1
+𝑐 𝑛−2 𝑗 + ⋯ + 𝑐2𝑗 + 𝑐1𝑗 + 𝑐0𝑗 , (13)
𝑛 − 2 ! 𝑙 𝑛−2 2 ! 𝑙2 𝑙
where is = i1 + i2 + ⋯ + im−1 and the constants c n−1 j , c n−2 j , … , c0j are
given by solving the n equations obtained by putting k = (pm + a)𝑙 + j for
a = n − 1, n, n + 1, … ,2n − 2 in 13
Proof. From the Binomial Theorem and 4 , we find
𝑝2 𝑝3 𝑝4 𝑝𝑚 𝑝 𝑚 − 𝑖𝑠
𝑝1 𝑝2 𝑝3 𝑝𝑚
𝑝2 𝑝3 𝑝𝑚 𝑖1 𝑖2
𝑘 (𝑘 − 𝑙) (𝑘 − 2𝑙) … 𝑘− 𝑚−1 𝑙 = … …. −1 −2 …
𝑖2 𝑖2 𝑖𝑚 −1
𝑖1 =0 𝑖2 =0 𝑖3 =0 𝑖𝑚 −1 𝑟=1
𝑖𝑚 −1 𝑝 𝑚 − 𝑖𝑠
(−(𝑚 − 1)) 𝑠𝑟 (𝑙)𝑝 𝑚 −𝑟 𝑘𝑙 𝑟
th
Now applying the inverse operator of the n kind and making the substitution
k = (pm + a)𝑙 + j for a = n − 1, n, n + 1, … ,2n − 2 in 14 , we obtain the
required result.
The following corollary shows the formula for sum of partial sums for
products of pth 𝑝1 𝑝2
i powers of m consecutive terms 𝑘 (𝑘 − 𝑙) … (𝑘 − (𝑚 − 1)𝑙)
𝑝𝑚

𝑘
of an arithmetic progression 𝑘, 𝑘 − 𝑙, 𝑘 − 2𝑙, … , 𝑗, 𝑤𝑕𝑒𝑟𝑒 𝑗 = 𝑘 − 𝑙.
𝑙
t
𝐂𝐨𝐫𝐨𝐥𝐥𝐚𝐫𝐲 𝟓. If pm , is , sr , k and are as in Theorem 4,
𝑘 𝑘
−𝑟2
𝑙 𝑙 𝑚

(𝑘 − 𝑟𝑛 𝑙 − 𝑟𝑛 −1 𝑙 − ⋯ − 𝑟2 𝑙 − (𝑡 − 1)𝑙)𝑝 𝑡
𝑟2 =2 𝑟1 =0 𝑡=1
𝑝2 𝑝3 𝑝4 𝑝𝑚 𝑝 𝑚 − 𝑖𝑠
𝑝2 𝑝3 𝑝𝑚 𝑖1 𝑖2
= … …. −1 −2 …
𝑖2 𝑖2 𝑖𝑚 −1
𝑖1 =0 𝑖2 =0 𝑖3 =0 𝑖𝑚 −1 𝑟=1

𝑝 − 𝑖𝑠 𝑘𝑙 𝑟+2 𝑐𝑖𝑗 𝑘
(−(𝑚 − 1))𝑖𝑚 −1 𝑠𝑟 𝑚 (𝑙)𝑝 𝑚 − 𝑟+2 ×
+ + 𝑐0𝑗 (15)
𝑟+1 𝑟+2 𝑙
where c0j and c1j are constants obtained by solving the two simultaneous
equations obtained by substituting k = (pm + a)𝑙 + j for a = 1,2 in 15 .
Proof. The proof follows by n = 2 in Theorem 4.
The following corollary shows the formula for sum of partial sums for
products of pth 𝑝1 𝑝2
i powers of m consecutive terms 𝑘 (𝑘 − 𝑙) … (𝑘 − (𝑚 − 1)𝑙)
𝑝𝑚

𝑘
of an arithmetic progression 𝑘, 𝑘 − 𝑙, 𝑘 − 2𝑙, … , 𝑗, 𝑤𝑕𝑒𝑟𝑒 𝑗 = 𝑘 − 𝑙.
𝑙
n
Corollary 6. If pm ,⅀is ,sr ,k and l are as in theorem 4,
𝑘 𝑘 𝑘
[ ] −𝑟3 −𝑟3 −𝑟2
𝑙 𝑙 𝑙 𝑚

(𝑘 − 𝑟𝑛 𝑙 − 𝑟𝑛 −1 𝑙 − ⋯ − 𝑟2 𝑙 − (𝑡 − 1)𝑙)𝑝 𝑡 =
𝑟3=2 𝑟2=1 𝑟1=0 𝑡=1
𝑝2 𝑝3 𝑝4 𝑝𝑚 𝑝 𝑚 − 𝑖𝑠
𝑝2 𝑝3 𝑝𝑚 𝑖1 𝑖2
… …. −1 −2 … (−(𝑚 − 1))𝑖𝑚 −1
𝑖2 𝑖2 𝑖𝑚 −1
𝑖1 =0 𝑖2 =0 𝑖3 =0 𝑖𝑚 −1 𝑟 =1

𝑝 − 𝑖𝑠 𝑘𝑙 𝑟+3 𝑐2𝑗 𝑘𝑙 2
𝑠𝑟 𝑚 (𝑙)𝑝 𝑚 − 𝑟+3 × + + 𝑐0𝑗 , (16)
𝑟+1 𝑟+2 𝑟+3 2! 𝑙 2

165 This work is licensed under Creative Commons Attribution 4.0 International License.
International Journal of Engineering and Management Research e-ISSN: 2250-0758 | p-ISSN: 2394-6962
Volume- 9, Issue- 3 (June 2019)
www.ijemr.net https://doi.org/10.31033/ijemr.9.3.07

where c0j , c1j and c2j are constants obtained by solving the two simultaneous
equations obtained by substituting k = (pm + a)𝑙 + j for a = 2,3,4 in 16 .
Proof. The proof follows by n = 3 in Theorem 4.

APPLICATIONS
In this section, we present some examples to illustrate the main results.
The following example is an illustration of Corollary 5.
Examples 1
Formula for sum of partial sums of products of 1st , 2nd and3rd powers of three consecutiveterms 𝑘 𝑘 −
𝑙2𝑘−2𝑙3𝑜𝑓 𝐴.𝑃.𝑘,𝑘−𝑙,
𝑘
𝑘 − 2𝑙, … , 𝑗, 𝑤𝑕𝑒𝑟𝑒 𝑗 = 𝑘 − 𝑙 is given by
𝑙
𝑘 𝑘
−𝑡
𝑙 𝑙

𝑘 − 𝑡𝑙 − 𝑠𝑙 (𝑘 − 𝑙 − 𝑡𝑙 − 𝑠𝑙)2 (𝑘 − 2𝑙 − 𝑡𝑙 − 𝑠𝑙)3 =
𝑡=2 𝑠=0
1 1 1
[ 𝑘 8 − 7𝑙 + 𝑗)𝑙 8 + [ 𝑘𝑙 7 − 7𝑙 + 𝑗)𝑙 7 + [ 𝑘𝑙 6 − (7𝑙 + 𝑗)𝑙 6 ]
56𝑙 2 𝑙 6𝑙 3
7 7−𝑙
𝑙
+ [ 𝑘𝑙 5 − 7𝑙 + 𝑗)𝑙 5 + 7𝑙 + 𝑗 − 𝑡𝑙 − 𝑠𝑙 (7𝑙 + 𝑗 − 𝑙 − 𝑡𝑙 − 𝑠𝑙)2
10
𝑡=2 𝑠=0
(7𝑙 + 𝑗 − 2𝑙 − 𝑡𝑙 − 𝑠𝑙)3
5
𝑘 − (7𝑙 + 𝑗) 1 1
(7𝑙 + 𝑗 − 𝑠𝑙)(6𝑙 + 𝑗 − 𝑠𝑙)2 (5𝑙 + 𝑗 − 𝑠𝑙)3 − 2
[(8𝑙 + 𝑗)𝑙 8 − 7𝑙 + 𝑗)𝑙 8 − [(8𝑙 + 𝑗)𝑙 7 )
𝑙 56𝑙 6𝑙
𝑠=1
1 𝑙
− 7𝑙 + 𝑗)𝑙 7 − [(8𝑙 + 𝑗)𝑙 6 − (7𝑙 + 𝑗)𝑙 6 ] + [(8𝑙 + 𝑗)𝑙 5 − 7𝑙 + 𝑗)𝑙 5
3 10
𝐒𝐨𝐥𝐮𝐭𝐢𝐨𝐧: By taking p1 = 1, p2 = 2, p3 = 3, m = 3 in corollary 5, we find
𝑘 𝑘
−𝑡
𝑙 𝑙
𝑘𝑙 8 𝑘𝑙 7
𝑘 − 𝑡𝑙 − 𝑠𝑙 (𝑘 − 𝑙 − 𝑡𝑙 − 𝑠𝑙)2 (𝑘 − 2𝑙 − 𝑡𝑙 − 𝑠𝑙)3 = +
56𝑙 2 6𝑙
𝑡=2 𝑠=0
𝑘𝑙 6 𝑙𝑘5 𝑘
+ 𝑙 + 𝑐1𝑗 + 𝑐0𝑗 .
+
3 10 𝑙
𝑃𝑢𝑡𝑡𝑖𝑛𝑔 𝑘 = 7𝑙 + 𝑗 𝑎𝑛𝑑 𝑘 = 8𝑙 + 𝑗 𝑖𝑛 17 , 𝑤𝑒 𝑔𝑒𝑡
7 7−𝑡

7𝑙 + 𝑗 − 𝑡𝑙 − 𝑠𝑙 (7𝑙 + 𝑗 − 𝑡𝑙 − 𝑠𝑙 − 𝑙)2 (7𝑙 + 𝑗 − 2𝑙 − 𝑡𝑙 − 𝑠𝑙)3 =

𝑡=2 𝑠=0
(7𝑙 + 𝑗)𝑙 8 (7𝑙 + 𝑗)𝑙 7 (7𝑙 + 𝑗)𝑙 6 𝑙(7𝑙 + 𝑗)𝑙 5 (7𝑗 + 𝑙)
2
+ + + + 𝑐1𝑗 + 𝑐0𝑗 . (18)
56𝑙 6𝑙 3 10 𝑙
8 8−𝑡

8𝑙 + 𝑗 − 𝑡𝑙 − 𝑠𝑙 (8𝑙 + 𝑗 − 𝑡𝑙 − 𝑠𝑙 − 𝑙)2 (8𝑙 + 𝑗 − 2𝑙 − 𝑡𝑙 − 𝑠𝑙)3 =

𝑡=2 𝑠=0
(8𝑙 + 𝑗)𝑙 8 (8𝑙 + 𝑗)𝑙 7 (8𝑙 + 𝑗)𝑙 6 𝑙(8𝑙 + 𝑗)𝑙 5 (8𝑗 + 𝑙)
2
+ + + + 𝑐1𝑗 + 𝑐0𝑗 . (19)
56𝑙 6𝑙 3 10 𝑙

Hence, c0j and c1j are obtained by solving 18 and 19 . now the proof
follows by substituting the values of c0j and c1j in 17 .
In particular, taking k = 38 and 𝑙 = 3, we obtain
32 29 2 26 3 + 29 26 2 23 3 + ⋯ + 8 5 2 2 3 + [ 29 26 2 23 3 +
26 23 2 20 3 + ⋯ + 8 5 2 2 3 ] + ⋯ + 8 5 2 2 3
1 1 1
= [(38)38 − 23)38 + [(38)37 − 23)37 + [(38)36 − 23)36 +
504 18 3
7 7−t
3
[(38)35 − 23)35 + 23 − 3t − 3s (20 − 3t − 3s)2 (17 − 3t − 3s)3
10
t=2 s=0

166 This work is licensed under Creative Commons Attribution 4.0 International License.
International Journal of Engineering and Management Research e-ISSN: 2250-0758 | p-ISSN: 2394-6962
Volume- 9, Issue- 3 (June 2019)
www.ijemr.net https://doi.org/10.31033/ijemr.9.3.07

5
1 1 1
+(5) [(23 − 3s)(20 − 3s)2 17 − 3s)3 − [(26)38 − 23)38 − [(26)37 − 23)37 − [(26)36 − 23)36
504 18 3
s=1
3
− [(26)35 − 23)35
10
= 1573644096
The following example illustrates corollary 6.

𝐄𝐱𝐚𝐦𝐩𝐥𝐞 𝟐. Formula for sum of second partial sums of products of

2nd and 3rd powers of two consecutive terms 𝑘 2 𝑘 − 𝑙 3
𝑜𝑓 𝐴. 𝑃. 𝑘, 𝑘 − 𝑙,
𝑘
𝑘 − 2𝑙, … , 𝑗, 𝑤𝑕𝑒𝑟𝑒 𝑗 = 𝑘 − 𝑙 𝑖𝑠
𝑙
𝑘 𝑘 𝑘
−𝑡 −𝑡−𝑠
𝑙 𝑙 𝑙

(𝑘 − 𝑡𝑙 − 𝑠𝑙 − 𝑟𝑙)2 (𝑘 − 𝑙 − 𝑡𝑙 − 𝑠𝑙 − 𝑟𝑙)3 =
𝑡=2 𝑠=1 𝑟=0
1 1 1
[ 𝑘𝑙 8 − 7𝑙 + 𝑗)𝑙 8 + [ 𝑘𝑙 7 − 7𝑙 + 𝑗)𝑙 7 + [ 𝑘 6 − (7𝑙 + 𝑗)𝑙 6 ]
336𝑙 3 30𝑙 2 12𝑙 𝑙
7 7−𝑡
𝑙 5 5
+ [ 𝑘𝑙 − 7𝑙 + 𝑗)𝑙 + (7𝑙 + 𝑗 − 𝑡𝑙 − 𝑠𝑙 − 𝑟𝑙 )2 (7𝑙 + 𝑗 − 2𝑙 − 𝑡𝑙 − 𝑠𝑙)3
30
𝑡=2 𝑟=0
8 8−𝑡
𝑘 − (7𝑙 + 𝑗)
{ (8𝑙 + 𝑗 − 𝑡𝑙 − 𝑠𝑙 )2 (8𝑙 + 𝑗 − 𝑙 − 𝑡𝑙 − 𝑠𝑙)3
𝑙
𝑡=2 𝑠=1
1 1
− [(8𝑙 + 𝑗)𝑙 − 7𝑙 + 𝑗)𝑙 8 −
8
[(8𝑙 + 𝑗)𝑙 7 ) − 7𝑙 + 𝑗)𝑙 7
336𝑙 3 30𝑙 2
1 𝑙
− [[(8𝑙 + 𝑗)𝑙 6 − (7𝑙 + 𝑗)𝑙 6 ] + [(8𝑙 + 𝑗)𝑙 5 − 7𝑙 + 𝑗)𝑙 5 }
12𝑙 30
1 𝑘 − (7𝑙 + 𝑗)
+ 2
[ 𝑘𝑙 2 − 7𝑙 + 𝑗)𝑙 2 + [(8𝑙 + 𝑗)𝑙 2 − (7𝑙 + 𝑗)𝑙 2 ]
2! 𝑙 𝑙
5
1 1 1
(8𝑙 + 𝑗 − 𝑡𝑙)2 (8𝑙 + 𝑗 − 𝑡𝑙 − 𝑙)3 − 3
[(9𝑙 + 𝑗)𝑙 8 − 7𝑙 + 𝑗)𝑙 8 − 2
[(9𝑙 + 𝑗)𝑙 7 ) − 7𝑙 + 𝑗)𝑙 7 − [(9𝑙
336𝑙 30𝑙 12𝑙
𝑠=1
1 1
+ 𝑗)𝑙 6 − 7𝑙 + 𝑗)𝑙 6 − [(9𝑙 + 𝑗)𝑙 5 − 7𝑙 + 𝑗)𝑙 5 − 2 (− [(8𝑙 + 𝑗)𝑙 8 − 7𝑙 + 𝑗)𝑙 8
30 336𝑙 3
1 1 1
− 2
[ 8𝑙 + 𝑗)𝑙 7 − 7𝑙 + 𝑗)𝑙 5 ] − [(8𝑙 + 𝑗)𝑙 6 − 7𝑙 + 𝑗)𝑙 6 ] − [(8𝑙 + 𝑗)𝑙 5
30𝑙 12𝑙 30
− 7𝑙 + 𝑗)𝑙 5 ]

𝐬𝐨𝐥𝐮𝐭𝐢𝐨𝐧: By taking p1 = 2, p2 = 3, n = 3, m = 2 in corollary 6, we find

𝑘 𝑘 𝑘
−𝑡 −𝑡−𝑠
𝑙 𝑙 𝑙

(𝑘 − 𝑡𝑙 − 𝑠𝑙 − 𝑟𝑙)2 (𝑘 − 𝑙 − 𝑡𝑙 − 𝑠𝑙 − 𝑟𝑙)3 =
𝑡=2 𝑠=0 𝑟=0
𝑘𝑙 8 𝑘𝑙 7 𝑘𝑙 6 𝑘𝑙 5 𝑘𝑙 2 𝑘
3
+ 2
+ + + 𝑐2𝑗 2
+ 𝑐1𝑗 + 𝑐0𝑗 . (20)
336𝑙 30𝑙 12𝑙 30 2! 𝑙 𝑙

𝑝𝑢𝑡𝑡𝑖𝑛𝑔 𝑘 = 7𝑙 + 𝑗 , 𝑘 = 8𝑙 + 𝑗 𝑎𝑛𝑑 𝑘 = 9𝑙 + 𝑗 𝑖𝑛 20 , 𝑤𝑒 𝑜𝑏𝑡𝑎𝑖𝑛

7 7−𝑡 7−𝑡−𝑠
7𝑙 + 𝑗 𝑙 8
(7𝑙 + 𝑗 − 𝑡𝑙 − 𝑠𝑙 − 𝑟𝑙)2 (7𝑙 + 𝑗 − 𝑙 − 𝑡𝑙 − 𝑠𝑙 − 𝑟𝑙)3 = +
336𝑙 3
𝑡=2 𝑠=1 𝑟=0
(7𝑙 + 𝑗)𝑙 7 (7𝑙 + 𝑗)𝑙 6 (7𝑙 + 𝑗)𝑙 5 (7𝑙 + 𝑗)𝑙 2 (7𝑙 + 𝑗)
2
+ + + 𝑐2𝑗 2
+ 𝑐1𝑗 + 𝑐0𝑗 . , (21)
30𝑙 12𝑙 30 2! 𝑙 𝑙
8 8−𝑡 8−𝑡−𝑠
8𝑙 + 𝑗 𝑙 8
(8𝑙 + 𝑗 − 𝑡𝑙 − 𝑠𝑙 − 𝑟𝑙)2 (8𝑙 + 𝑗 − 𝑙 − 𝑡𝑙 − 𝑠𝑙 − 𝑟𝑙)3 = +
336𝑙 3
𝑡=2 𝑠=1 𝑟=0
(8𝑙 + 𝑗)𝑙 7 (8𝑙 + 𝑗)𝑙 6 (8𝑙 + 𝑗)𝑙 5 (8𝑙 + 𝑗)𝑙 2 (8𝑙 + 𝑗)
2
+ + + 𝑐2 2
+ 𝑐1𝑗 + 𝑐0𝑗 . , (22)
30𝑙 12𝑙 30 𝑗 2! 𝑙 𝑙
167 This work is licensed under Creative Commons Attribution 4.0 International License.
International Journal of Engineering and Management Research e-ISSN: 2250-0758 | p-ISSN: 2394-6962
Volume- 9, Issue- 3 (June 2019)
www.ijemr.net https://doi.org/10.31033/ijemr.9.3.07

𝑎𝑛𝑑
9 9−𝑡 9−𝑡−𝑠
9𝑙 + 𝑗 𝑙 8
(9𝑙 + 𝑗 − 𝑡𝑙 − 𝑠𝑙 − 𝑟𝑙)2 (9𝑙 + 𝑗 − 𝑙 − 𝑡𝑙 − 𝑠𝑙 − 𝑟𝑙)3 = +
336𝑙 3
𝑡=2 𝑠=1 𝑟=0
(9𝑙 + 𝑗)𝑙 7 (9𝑙 + 𝑗)𝑙 6 (9𝑙 + 𝑗)𝑙 5 (9𝑙 + 𝑗)𝑙 2 (9𝑙 + 𝑗)
2
+ + + 𝑐2𝑗 2
+ 𝑐1𝑗 + 𝑐0𝑗 . , (23)
30𝑙 12𝑙 30 2! 𝑙 𝑙
Solving 21 , 22 and 23 , we can find c2j , c1j and c0j . Now, the proof
follows by substituting the values of c2j , c1j and c0j in 20 .
In particular, taking k = 70 and 𝑙 = 4, we get
{[(58)2 (54)3 + (54)2 (50)3 + ⋯ + (6)2 2)3 + [(54)2 (50)3 + (50)2 (46)3
+ ⋯ + 6)2 2)3 + {[(54)2 (50)3 + (50)2 (46)3 + ⋯ + (6)2 2)3 + [(50)2 (46)3
1
+(46)2 (42)3 + ⋯ + 6)2 2)3 + ⋯ + (6)2 (2)3 = [(70)48 − (30)48 ]
336 4 3
1 1 1
+ 2
[(70)47 ) − (30)47 ] + [(70)46 − (30)46 ] + [(70)45 − (30)45 ]
30(4) 48 30
7 7 7−𝑠

+ (7𝑙 + 𝑗 − 𝑡𝑙 − 𝑠𝑙 − 𝑟𝑙)2 (7𝑙 + 𝑗 − 𝑙 − 𝑡𝑙 − 𝑠𝑙 − 𝑟𝑙)3 + (10)

𝑡=2 𝑠=1 𝑟 =0
8 8−𝑡
1
{ (8𝑙 + 𝑗 − 𝑡𝑙 − 𝑠𝑙)2 (8𝑙 + 𝑗 − 𝑙 − 𝑡𝑙 − 𝑠𝑙)3 − [(34)48 − (30)48 ]
336 4 3
𝑠=1 𝑟=0
1 1 1
− 2
[ 34)47 − 30)47 − [(34)46 − 30)46 − [ 34)45 − 30)45
30 4 48 30
1
+ [(70)42 ) − (30)42 + (10)[(34)42 − 30)42 ]
2! 𝑙 2
5
1
{ (8𝑙 + 𝑗 − 𝑡𝑙)2 (8𝑙 + 𝑗 − 𝑡𝑙 − 𝑙)3 − [(38)48 − (30)48 ]
336 4 3
𝑡=2
1 1 1
− 2
[ 38)47 − 30)47 − [(38)46 − 30)46 − [ 38)54 − 30)45
30 4 48 30
1 1
−2(− 3
[(34)48 − 30)48 − [ 34)47 − 30)47
336 4 30 4 2
1 1
− [(34)46 − 30)46 − [ 34)45 − 30)45 )
48 30
= 9293238528

IV. CONCLUSION of certain class of difference equations. Far East Journal

We conclude that the theory, the results and the
applications obtained in this dissertation are derived using
the generalized difference operators, their inverses and
using the Stirling numbers of the first and second kinds.
Theory and applications of the solutions of the
generalized equations established in this dissertation,
which are not developed earlier are applicable to the area
in Numerical Methods.
REFERENCES
[1] R. P Agarwal. (2000). Difference equations and
inequalities. New York: Marcel Dekker.
[2] M. Maria Susai Manuel, G. Britto Antony Xavier, &
E. Thandapani. (2006). Theory of generalized difference
operator and its applications. Far East Journal of
Mathematical Science, 20(2), 163–171.
[3] M. Maria Susai Manuel, G. Britto Antony Xavier, &
E. Thandapani. (2006). Qualitative properties of solutions
of Mathematical Science, 23(3), 295–304.
[4] M. Maria Susai Manuel, G. Britto Antony Xavier, &
E. Thandapani. (2007). Generalized bernoulli
polynomials through weighted pochhammer symbols. Far
East Journal of Applied Mathematics, 26(3), 321–333.
[5] M. Maria Susai Manuel, A. George Maria Selvam, &
G. Britto Antony Xavier. (2006). Rotatory and
boundedness of solutions of certain class of difference
equations, International Journal of Pure and Applied
Mathematics, 33(3), 333–343.
[6] M. Maria Susai Manuel & G. Britto Antony Xavier.
(2007). Recessive, dominant and spiral behaviours of
solutions of certain class of generalized difference
equations. International Journal of Differential Equations
and Applications, 10(4), 423–433.
[7] M. Maria Susai Manuel, G. Britto Antony Xavier, &
V. Chandrasekar. (2008). Generalized difference operator
of the second kind and its application to number theory.
International Journal of Pure and Applied Mathematics,
47(1), 127–140.

168 This work is licensed under Creative Commons Attribution 4.0 International License.
International Journal of Engineering and Management Research e-ISSN: 2250-0758 | p-ISSN: 2394-6962
Volume- 9, Issue- 3 (June 2019)
www.ijemr.net https://doi.org/10.31033/ijemr.9.3.07

[8] M. Maria Susai Manuel, G. Britto Antony Xavier, V.
Chandrasekar, R. Pugalarasu, & S. Elizabeth. (2009). On
generalized difference operator of third kind and its
applications in number theory. International Journal of
Pure and Applied Mathematics, 53(1), 69–81.
[9] R. E. Mickens. (1990). Difference equations. New
York: Van Nostrand Reinhold Company.
[10] S. N. Elaydi. (1999). An introduction to difference
equations. (2nd ed.). Springer.
[11] W. G. Kelley & A. C. Peterson. (1991). Difference
equations. An introduction with applications. Academic
Press.

169 This work is licensed under Creative Commons Attribution 4.0 International License.