See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/269348232

On sequences of numbers in generalized arithmetic and geometric

progressions

Article · January 2015

CITATIONS READS

5 2,478

1 author:

Julius Fergy Tiongson Rabago

Kanazawa University
72 PUBLICATIONS 366 CITATIONS

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Supplement to the paper of halim, touafek and elsayed: Part II View project

A Non-funded Research Study View project

All content following this page was uploaded by Julius Fergy Tiongson Rabago on 10 December 2014.

The user has requested enhancement of the downloaded file.

Palestine Journal of Mathematics

Vol. 4(1) (2015) , 170–176 © Palestine Polytechnic University-PPU 2015

ON SEQUENCES OF NUMBERS IN GENERALIZED

ARITHMETIC AND GEOMETRIC PROGRESSIONS
Julius Fergy T. Rabago
Communicated by Ayman Badawi

MSC 2010 Classifications: Primary 11B25, 11B83; Secondary 11Y55.

Keywords and phrases: Sequence of numbers with m alternate common differences, sequence of numbers with m
alternate common ratios, the general term and the sum of a sequence of numbers.

Abstract The paper provides a further generalization of the sequences of numbers in gener-
alized arithmetic and geometric progressions [1].

1 Introduction
The usual arithmetic sequence of numbers takes the form:
a, a + d, a + 2d, a + 3d, . . . , a + (n − 1)d, a + nd, . . .

while the geometric sequence of numbers has the form

a, ar, ar2 , ar3 , . . . , arn−1 , arn , . . . .

Formally speaking, an arithmetic sequence is a number sequence in which every term except
the first is obtained by adding a fixed number, called the common difference, to the preceeding
term and a geometric sequence is a number sequence in which every term except the first is ob-
tained by multiplying the previous term by a constant, called the common ratio. The sequence
1, 3, 5, 7, 9, 11, . . . is an example of arithmetic sequence with common difference 2 and the se-
quence 2, 4, 8, 16, . . . is a geometric sequence with common ratio 2. Certain generalizations of
arithmetic and geometric sequence were presented in [1], [3], [4]. Particularly, in [3], Zhang and
Zhang introduced the concept of sequences of numbers in arithmetic progression with alternate
common differences and in [4], Zhang, et.al. provided a generalization of the sequence. It was
then extended by Majumdar [1] to sequences of numbers in geometric progression with alternate
common ratios and the periodic sequence with two common ratios. The author [1] also provided
a simpler and shorter forms and proofs of some cases of the results presented by Zhang and
Zhang in [3]. Recently, Rabago [2] further generalized these concepts by introducing additional
common differences and common ratios. Here we will provide another generalization of the
sequences of numbers defined in [1] and [3] by providing a definition to what we call sequences
of numbers with m alternate common differences (Section 2) and sequence of numbers with m
alternate common ratios (Section 3).

Throughout in the paper we denote the greatest integer contained in x as bxc.

2 Sequence of numbers with m alternate common differences

We start-off this section with the definition of what we call sequence of numbers with m alternate
common differences.
Definition 2.1. A sequence of numbers {an } is called a sequence of numbers with m alternate
common differences if for a fixed natural number m and for all j = 1, 2, . . . , m,
am(k−1)+j +1 − am(k−1)+j = dj ,

for all k ∈ N. Here dj is the j -th common difference of {an }.

With the above definition, a sequence of numbers with m alternate common differences takes
the following form:
a, a + d1 , a + d1 + d2 , . . . , a + d1 + d2 + · · · + dm , a + 2d1 + d2 + · · · + dm ,
a + 2d1 + 2d2 + · · · + dm , a + 2d1 + 2d2 + · · · + 2dm , . . . (2.1)
 ON SEQUENCES OF NUMBERS 171

The sequence
2, 3, 5, 8, 9, 11, 14, 15, 17, 20, . . .
is an example of a sequence of numbers with 3 alternate common differences. The common
differences are d1 = 1, d2 = 2, and d3 = 3.
Theorem 2.2. Let {an } be a sequence of number that takes the form (2.1). Then, the formula for
the nth term of the sequence {an } is given by
m  
X n + (m − 1) − i
an = a1 + di . (2.2)
m
i=1

Proof. Obviously, (2.2) holds for n ≤ m. We only need to show that (2.2) is true for n > m to
prove the validity of the fomula. Suppose (2.2) holds for some natural number k . Hence,
m  
X k + (m − 1) − i
ak = a1 + di .
m
i=1

Let k = m(p − 1) + j and p ∈ N. Now, for every j = 1, 2, . . . , m ∈ N, we have ak+1 = ak + dj .

Thus,
m  
X k + (m − 1) − i
ak+1 = a1 + di + dj
m
i=1
m  
X m(p − 1) + j + (m − 1) − i
= a1 + di + dj
m
i=1
j−1   m  
X j−1−i X j−1−i
= a1 + p+ di + p+ di + dj
m i=j
m
i=1
j−1
X m
X
= a1 + pdi + (p − 1)di + dj
i=1 i=j
j
X m
X
= a1 + pdi + (p − 1)di
i=1 i=j +1
j   m  
X j−i X m+j−i
= a1 + p+ di + p−1+ di
m m
i=1 i=j +1
j  
X (m(p − 1) + j ) + 1 + (m − 1) − i
= a1 + di
m
i=1
m  
X (m(p − 1) + j ) + 1 + (m − 1) − i
+ di
m
i=j +1
m  
X (k + 1) + (m − 1) − i
= a1 + di .
m
i=1

Below is a table of formulas for the nth term an of the given sequence for specific values of
m.
m nth term an
1 a1 + (n − 1)d
 
jnk n−1
2 a1 + d1 + d2
2  2  
n+1 jnk n−1
3 a1 + d1 + d2 + d3
 3  3  3  
n+2 n+1 jnk n−1
4 a1 + d1 + d2 + d3 + d4
 4   4  4  4  
n+3 n+2 n+1 j n k n−1
5 a1 + d1 + d2 + d3 + d4 + d5
5 5 5 5 5
.. ..
. .
172 Julius Fergy T. Rabago

Corollary 2.3. Let m and n be natural numbers. If m|(n − 1) then we have

  m
n−1 X
an = a1 + di .
m
i=1

Proof. Suppose m|(n − 1) then n − 1 = mk for some k ∈ N. Then,

m   m   m
X m−i X n−1 X
an = a1 + k+ di = a1 + k di = a1 + di .
m m
i=1 i=1 i=1

Corollary 2.4. If m|n, we have

m
 n X
an = a1 + di − dm .
m
i=1

Proof. Suppose m|n then n = mk for some k ∈ N. So,

m   m m
X i+1 X  n X
an = a1 + k+1− di = a1 + k di − dm = a1 + di − dm .
m m
i=1 i=1 i=1

Lemma 2.5. For any natural numbers m and n, we have

m   m  
X n + (m − 1) − i X i+n−2
=n−1= .
m m
i=1 i=1

Proof. Note that jnk n

=k ⇒ k≤ < k + 1.
m m
Hence,
m     j n k n − 1
X n + (m − 1) − i n + (m − 2)
= + ... + +
m m m m
i=1

= k + k + . . . + k + (k − 1) = mk − 1 = n − 1.

Theorem 2.6. If di = d1 for i ≤ m − 1, we have

    
n−1 n−1
an = a1 + n − 1 − d1 + dm . (2.3)
m m

Proof. Let di = d1 , for i ≤ m − 1, in (2.2). Hence,

m  
X n + (m − 1) − i
an = a1 + di
m
i=1

X1 
m−
n + (m − 1) − i
 
n−1

= a1 + d1 + dm
m m
i=1
    j n k  n − 1 
n + (m − 2) n + (m − 3)
= a1 + d1 + + ... + + dm
m m m m
( m  !  ) 
X n + (m − 1) − i  n−1 n−1

= a1 + d1 − + dm
m m m
i=1
    
n−1 n−1
= a1 + n − 1 − d1 + dm .
m m
 ON SEQUENCES OF NUMBERS 173

Theorem 2.7. Let {an } be a sequence of number that takes the form (2.1). Then, the formula for
the sum of the first n terms of the sequence {an } is given by
m    
X N −i m N −i
Sn = na1 + N −i− + 1 di , (2.4)
m 2 m
i=1

where N = n + m − 1.

Proof. Consider a sequence {an } that takes the form (2.1). Then,
n n m   ! m X
n  
X X X j + (m − 1) − i X j + (m − 1) − i
aj = a1 + di = na1 + di
m m
j =1 j =1 i=1 i=1 j =1
m    
X n + (m − 1) − i m n + 2m − (1 + i)
= na1 + n+m−i− di
m 2 m
i=1

Letting N = n + m − 1, conclusion follows.

Theorem 2.8. The sum of the first n terms of the sequence {an } that takes the form (2.1) with
di = d1 , for i ≤ m − 1, is given by
   
n(n − 1) n−1 m n+m−1
Sn = na1 + d1 + (dm − d1 ) n− . (2.5)
2 m 2 m

Proof. Consider a sequence {an } that takes the form (2.1). Then,
n n       
X X j−1 j−1
aj = a1 + j − 1 − d1 + dm
m m
j =1 j =1
n   n  
n(n − 1) X j−1 X j−1
= na1 + d1 − d1 + dm
2 m m
j =1 j =1
 n 
n(n − 1) j−1 X
= na1 + d1 + (dm − d1 )
2 m
j =1
   
n(n − 1) n−1 m n+m−1
= na1 + d1 + (dm − d1 ) n− .
2 m 2 m

3 Sequence of numbers with m alternate common ratios

We define the sequence of numbers with m alternate common ratios {an } as follows:

Definition 3.1. A sequence of numbers {an } is called a sequence of numbers with m alternate
common ratios if for a fixed natural number m and for all j = 1, 2, . . . , m,
am(k−1)+j +1
= rj ,
am(k−1)+j

for all k ∈ N. Here rj is the j -th common ratio of {an }.

With the above definition, we can see immediately that a sequence of numbers {an } with m
alternate common ratios has the following form:

a, ar1 , ar1 r2 , . . . , ar1 r2 · · · rm , ar12 r2 · · · rm , ar12 r22 · · · rm , ar12 r22 · · · rm

2
,.... (3.1)

The sequence
1, 2, 6, 24, 48, 144, 576, 1152, . . .
is an example of a sequence of numbers {an } with 3 alternate common ratios. The common
ratios are r1 = 2, r2 = 3, and r3 = 4.
174 Julius Fergy T. Rabago

Theorem 3.2. Let {an } be a sequence of number that takes the form (3.1). Then, the formula for
the nth term of the sequence {an } is given by
m
Y
an = a1 riei , (3.2)
i=1
j k
n+(m−1)−i
where ei = m .

In particular, if m|(n − 1), we have

!( n− 1
m m )
Y
an = a1 ri , (3.3)
i=1

and if m|(n − 1),

m
!( m
n
)
a1 Y
an = ri . (3.4)
rm
i=1

Proof. The proof is by induction on n. Obviously, (3.2) holds for n ≤ m. We will show that
(3.2) is true for n > m. Suppose (3.2) holds when for some natural number k . That is,
m
Y
ak = a1 riei ,
i=1
j k
where ei = m(p−1)+jm+(m−1)−i .

Let k = m(p− 1)+ j and p ∈ N. Now, for every j = 1, 2, . . . , m ∈ N, we have ak+1 = ak ·rj .
Thus,
m  
Y
ei m(p − 1) + j + (m − 1) − i
ak+1 = a1 ri · rj , where ei =
m
i=1

Y1
j− m
Y 
j−1−i

= a1 riei · riei · rj , where ei = p +
i=j
m
i=1

Y1
j− m
Y
= a1 rip · rip−1 · rj
i=1 i=j
j m    
Y Y j−i m+j−i
= a1 rifi · rigi , where fi = p + , gi = p − 1 +
m m
i=1 i=j +1
m  
Y (k + 1) + (m − 1) − i
= a1 rihi , where hi = .
m
i=1

If m|n (resp. m|(n − 1)) then (3.3) (resp. (3.4)) follows immediately.
Theorem 3.3. Consider a sequence {an } that takes the form (3.1) and suppose ri = r1 , for
i ≤ m − 1. Then,
an = a1 r1e · rm
s
, (3.5)
 n−1   n−1 
where e = n − 1 − m and s = m .
Proof. Let r1 = ri , for i ≤ m − 1, in (3.2). Hence,
m  
Y
ei n + (m − 1) − i
an = a1 ri , where ei =
m
i=1

X1 
m−
n + (m − 1) − i
 
n−1

= a1 r1e · s
rm , where e = and s =
m m
i=1

 n−1 
But, by Lemma (2.5), e = n − 1 − m . Thus, an = a1 r1e · rm
s
.
 ON SEQUENCES OF NUMBERS 175

Theorem 3.4. Let {an } be a sequence of number that takes the form (3.1). Then, the formula for
the sum of the first n terms of the sequence {an } is given by
X1  N − i   N − 1 − i  X
m− i Y j
1 − ren−1
  
Sn = a1 1 + R + a1 ren−1 − rk ,
1−r m m
i=1 j =1 k=1
Pm Qi Qm  n−1 
where R = i=1 j =1 rj , r= and N = n + m − 1.
i=1 ri , en−1 = m

Proof. Consider a sequence {an } that takes the form (3.1) and let R = m
P Qi
i=1 j =1 rj , r =
Qm  n−1

r
i=1 i , p = e n−1 = m then
n n Y
m j k
e j +(m−1)−i
X X
aj = a1 ri j where ej = m .
j =1 j =1 i=1

Expanding the expression, we obtain

n p−1
X X e e e e
aj = a1 + a1 R rj + a1 r1 n+(m−3) r2 n+(n−4) · · · rm
en−2 en−1
+ . . . + a1 r1 n+(m−2) r2 n+(m−1) · · · rm .
j =1 j =0

Simplifying and rewriting the expression in compact form, we obtain

n X1
m− j
i Y
1 − rp
X    X
p
aj = a1 1 + R + a1 r Mi rk
1−r
j =1 i=1 j =1 k=1
 N −i   N −1−i 

where Mi = m − m which is the desired result.
Theorem 3.5. Let {an } be a sequence of number that takes the form (3.1) with ri = r1 , for all
i ≤ m − 1. Then, the formula for the sum of the first n terms of the sequence {an } is given by
! !

1 − r1m

1 − (r1m−1 rm )p  p 1 − rn−mp
m−1 1
Sn = a1 + a1 r1 rm ,
1 − r1 1 − r1m−1 rm 1 − r1
 1
where p = n−m .

 1  a sequence {an } that takes the form (3.1) with ri = r1 , for all i ≤ m − 1 and
Proof. Consider
let p = n− m ,
n n  b j− 1
m c
X X j−1 rm
aj = a1 r1
r1
j =1 j =1

m   X 2m  2 X 3m
X rm rm
= a1 r1j−1 + r1j−1 + r1j−1 + . . .
 r1 r1
j =1 j =m+1 j =2m+1

 p−1 mp  p X n
rm X j−1
 rm
+ r1 + a1 r1j−1
r1  r1
j =(p−1)m+1 j =mp+1

m  m X m  m 2 X m
X r1 rm r1 rm
= a1 r1j−1 + r1j−1 + r1j−1 + . . .
 r1 r1
j =1 j =1 j =1

 m p−1 X m  m p n−mp
r1 rm j−1
 r rm X j−1
+ r1 + a1 1 r1
r1  r1
j =1 j =1
(  m   m 2  m p−1 )
1 − r1m

r1 rm r1 rm r rm
= a1 1+ + + ... + 1
1 − r1 r1 r1 r1
p n−mp
r1m rm
 X
+ a1 r1j−1
r1
j =1
! !
r1m 1 − (r1m−1 rm )p 1 − r1n−mp
 
1−  p
= a1 + a1 r1m−1 rm ,
1 − r1 1 − r1m−1 rm 1 − r1
which is desired.
 176 Julius Fergy T. Rabago

4 Some Remarks
If we replace m by t in (2.2) and define t as the period of the sequence {an } and by considering
di = d∗1 for i ≤ m − 1 as the first common difference of the sequence and dm = d∗2 as the second
difference then we obtain,
    
n−1 ∗ n−1 ∗
an = a1 + n − 1 − d1 + d2 . (4.1)
t t

Equation (4.1) is exactly the formula for the nth term of a periodic number sequence with two
common differences obtained by Zhang and Zhang in [4]. Furthermore, it can be observed from
(4.1) that an → a1 +(n− 1)d1 as m → ∞. Similarly, if di = d1 for all i ≤ m, an = a1 +(n− 1)d1 .
n(n−1)
In (2.5), on the other hand, would have Sn = na1 + 2 d1 if m → ∞ and a similar result
will be obtained if di = d1 for all i ≤ m.

Also, note that in (3.2), an → a1 r1n−1 if we apply the same argument letting either m → ∞
or ri = r1 for all i ≤ m. Furthermore, the limit of the sum given by
n  b n− m c
1
1 − r1n
 
X
n−1 rm
a1 r1 · −→ a1 as m → ∞.
r1 1 − r1
j =1

References
[1] A.A.K. Majumdar, Sequences of numbers in generalized arithmetic and geometric progressions, Scientia
Magna, 4 (2008), No. 2, 101-111.
[2] J.F.T. Rabago, Sequence of numbers with three alternate common differences and common ratios, Int. J.
of Appl. Math. Res., 1 (2012), No.3, 259-267.
[3] X. Zhang and Y. Zhang, Sequence of numbers with alternate common differences, Scientia Magna, 3
(2007), No. 1, 93-97.
[4] X. Zhang, Y. Zhang, and J. Ding, The generalization of sequence of numbers with alternate common
differences, Scientia Magna, 4 (2008), No. 2, 8-11.

Author information
Julius Fergy T. Rabago, Department of Mathematics and Computer Science, College of Science, University of
the Philippines, Baguio Governor Pack Road, Baguio City 2600, PHILIPPINES.
E-mail: [email protected]

Received: December 3, 2013.

Accepted: April 7, 2014.

View publication stats