1

SEQUENCES AND SERIES

M. Arokiasamy - Dept of Mathematics –ALC-VJA
I. SEQUENCES term.
----------------------------------------------------------------
Definition: A sequence is a set of numbers arranged Examples :
according to a particular order.
(i) : < ( -1) > . Here an=(-1)n.
n

Eg : (i) 1, 2, 3, 4 , … (ii) 1, 3, 5, 7, … (iii) 2, 4 ,

6, … (iv) 1, -1, 2, -2, …. a1 = -1, a2 = 1, a3 = -1, a4 = 1,...
Definition: A sequence is a function whose domain < (-1) n >= {-1,1, - 1, 1,...}
. Range={1,-1}, a finite set.
is the set N of all natural numbers.
(ii) : < n(-1) > . Here an=n(-1)n.
n
Definition: Real Sequence :
A real sequence is a function from the set N of all a1 = 1(-1) = -1, a2 = 2(1) = 2, a3 = 3(-1) = -3, a4 = 4,...
natural numbers to the set R of all real numbers. Here the sequence is {-1, 2, - 3, 4, - 5,...} .
If f : N � R then f is called a real sequence. Range={ …, -5, -3, -1, 2, 4, 6, 8,… }, an infinite set.
Consider the function f(n) = 2n + 1. This function < an > = < 1, 2, 3, 4,... > = < n >
(iii) : .
describes the sequence 3, 5, 7, 9, 11, ...
Definition: Complex Sequence : 1 1 1 1
< an > = < 1, , , ,... > =
A complex sequence is a function from the set �of (iv) : 2 3 4 n
all natural numbers to the set � of all complex (v) : < an > = < 1 + (-1) n > = < 1 + (-1)1,1 + (-1) 2 ,1 + (-1) 3 ,...}
numbers.
=< 0, 2, 0, 2, 0,... >
If f : N � C then f is called a complex sequence. Its range ={0, 2 }.
Note: We confine our attention only to real
sequences. (vi) : S1=1, S=1, and Sn+2 = Sn+1 + Sn , " n �1 .
From the above recurrence formula,
Representation of a sequence: Let a : N � R be a
S3=S2+S1=1+1=2.S4=S3+S2=1+2=3, and so on.
sequence. Each number in a sequence is a term of
\< sn > = {1,1, 2, 3, 5, 8, 13, 21, ...}
the sequence. The image n ��instead of denoting
it as a(n), we generally denote it by an . This sequence is called Fibonacci sequence , named
an is called the general term or nth term of a after the Italian Mathematician Leonardo Fibonacci.
sequence. Thus a1, a2 , a3, are the first, second, ----------------------------------------------------------------
third terms respectively. Definition: Constant Sequence :
A sequence is usually denoted by writing its nth A sequence in which all the terms are equal is known
term inside the brackets i.e. by {an} or i.e. by as constant sequence.
< an > . Sometimes it is denoted by writing all its Eg : < an > = {3, 3, 3, 3, 3, 3, ...} .
terms with in the brackets i.e. {a1, a2, a3, … }. < an > is {3}
Range of this sequence , a singleton set.
th th
Note : (i) The m and n terms am and an for Definition: Subsequence :
m �n are treated as distinct terms, even if am = an If n1 < n2 < n3 < n4 ,... i.e. if < nk > is an increasing
(i.e. even if they have the same value). < ank >
(ii) It is not necessary that all the terms of the sequence of positive integers then is called a
sequence should be distinct. < an >
subsequence of .
Definition: Range of a sequence : < an > = < 1, 2, 3, 4, 5, 6,..., n >=< n >
The range or range set is the set consisting of all Eg : If then (i)
the distinct elements of a sequence without < 2, 4, 6, 8, 10, ..., 2n > is a subsequence of < an > .
repetition and without regard to the position of a
M. Arokiasamy-Dept of Mathematics-ALC
 2

Definition: Equality of sequences : (ii) But < 8, 6, 4, 2, 10, 12, 14,..., 2n > is not a
< an > < bn > subsequence. Why?
Two sequences and are said to be
an = bn $ k �R + ' x �k , "x �S .
equal if for every n. i.e.
-------------------------------------------------------------- Note : upper bound , lower bound may or may not
Boundedness of subsets of R belong to the set S.
Examples :
A non empty subset A of R is called an aggregate. (i) : Any finite set is bounded.
Definition: Bounded above set:
A set S is said to be bounded above if $ a real (ii) : The subsets N, Z, Q, R of R are not bounded.
� (-1) n �
number k ' x ≤ k , " x �S . The number k is called � 1+ / n �N �
n
an upper bound for the set S. (iii) The aggregate � is bounded.
Any number greater than an upper bound is also an ----------------------------------------------------------------
upper bound for the set. Definition: Bounded above sequence :
If u is an upper bound of S and any real number < an >
less than u is not an upper bound of S, then u is A sequence is said to be bounded above if $
called the least upper bound (lub) or supremum k �R ' an �k "n �N.
The number k is called an
(sup) of S. < an >
The smallest upper bound is called the supremum. upper bound for .
Any number greater than an upper bound is also an
If u �� is the supremum of S, then for each e > 0
upper bound for the sequence.
, u - e is not an upper bound of S.
Definition: Bounded below set: a �k "n �N
Note : If no such k exists satisfying n
A set S is said to be bounded below if $ a real then the sequence is not bounded above.
number l ' x �l , " x �S . The number l is called a Examples :
(i) : < an > = < (-1) >= {-1, 1, - 1, 1,...} .
n
lower bound of S.
If l is a lower bound of S then any real number an �1 "n �N
less than l is also a lower bound of S. Here .
If v is a lower bound of S and any real number \ 1 is an upper bound for < an > .
greater than v is not a lower bound of S, then v is 1.01, 1.00, 1.0001, 1.1, 1.11, 2, 3, 3.0001, … are all
called the greatest lower bound (glb) or infimum < an >
(inf) of S. upper bounds for , but they need not belong
If v �R is the infimum of S, then for each e > 0 , to the sequence.
v + e is not a lower bound of S. 1 1 1 1
< an >=< >=< 1, , , ,... >
Examples : (ii) : n 2 3 4 .
-
(i) : R is bounded above and 0 is an upper bound. an �1 "n �N
. Here 1 is an upper bound for the
+
(ii) : R is bounded below and 0 is a lower bound. sequence or any number greater than 1 is also an
(iii) : N is bounded below and not is bounded above. < an >
upper bound for .
(iv) : 0 and 1 are infimum and supremum of the 1 1 1 1
�1 � < an >=< >=< , , ,... >
S = � / n ��� (iii) : n +1 2 3 4 .
set �n 1 1
Definition: Bounded set: an <"1 Σ"n � N or an n N \
Here 2 . 2 , 1 are all
A set S is said to be bounded if it is both bounded
upper bounds.
above as well as bounded below, that is to say, if
Examples :
M. Arokiasamy-Dept of Mathematics-ALC
 3

$ l , k �R ' l �x �k , "x �S . < an >=< n >=< 1, 2, 3, 4,... >

(i) : . Here we cannot
(ii) : < an > = < n(-1) > = < -1, 2, - 3, 4, - 5,... > .
n
k ' an �k "n �N.
produce a real number Hence the
This sequence is also not bounded above. above sequence is not bounded above.
< an > = < (- n) >= {-1, - 2, - 3, -4,...}
(iii) : is Behavior of a sequence: A sequence may (i)
bounded above . 0 is an upper bound. converge , (ii) diverge , (iii) oscillate.
-------------------------------------------------------------- ----------------------------------------------------------------
Definition: Bounded below sequence : Definition: Convergent sequence :
< an > < an >
A sequence is said to be bounded below if A sequence is said to converge to a real
e > 0, $ m �N ( m depends
$ l �R ' l �an "n �N. The number l is called a number l if for a given
' an - l < e "n �m.
lower bound for
< an >
. up on e )
Any number less than a below bound is also a ower i.e. l - e < an < l + e "n �m.
bound for the sequence. lim an = l < an >
l �an "n �N (Or if n �� , then we say that
Note : If no such l exists satisfying
then the sequence is not bounded below.
< an >
converges to l or is convergent.)
Examples : ----------------------------------------------------------------
Geometrical Representation: Geometrically a
(i) : < an > = < (-1) > = {-1, 1, - 1, 1,...} .
n

< an >
-1 �an "n �� sequence converges to l means from mth term
Here .
and after mth term, every term in the sequence must
\ -1 is a lower bound for < a >
n . lie between the strip l - e and l + e . (fig-ppt)
Any number less than -1, viz , -2, -3, -4, … are all Note : (i) : Convergence of a sequence means for
< an >
lower bounds for , but they need not large values of n, the terms of the sequence will be
very very close to l.
belong to the sequence.
The number l is called a limit of the sequence an.
(ii) : The sequence < an > = < n > is bounded (ii) : l need not be a member of the sequence.
2

below. 1 is a lower bound. < an > lim an = l

-------------------------------------------------------------- (iii) : If converges to l , we write n ��
Definition: Bounded sequence : a � l as n � �.
or n
< an >
A sequence is said to be bounded if it is ----------------------------------------------------------------
both bounded above and bounded below, that is Definition: Diverges to + � :
$ l , k �R ' l �an �k , "n �N. < an >
A sequence is said to diverge to + � if for a
given k �R (however large) $ m �N ( depending
i.e. if the range of the sequence is bounded. +

Examples :
' an > k "n �m.
on k )
(i) : The sequence < (-1) >= {-1, 1, - 1, 1,...} is
n

lim an = �
bounded. 1 and -1 are its upper and lower bounds Symbolically it can be written as n�� or
respectively. an � �as n � �.
1 1 1 1
< >=< 1, , , ,... > ---------------------------------------------------------------
(ii) : The sequence n 2 3 4 is Examples :
bounded. 1 is the least upper bound and 0 is the 1 1 1 1
greatest lower bound. < >=< 1, , , ,... >
(i) : The sequence n 2 3 4 converges
M. Arokiasamy-Dept of Mathematics-ALC
 4

to 0.
(iii) : The sequences < n >, < (-1) n >, and
3 n 2

n 1 2 3 4
< (-2)n > are unbounded sequences. < an > = < > = < , , , ,... >
(ii) : n +1 2 3 4 5
n a1= 0.5, a3= 0.6666, a1000= 0.999000999001
< >
The sequence n + 1 converges to 1. a1000 000 = 0.999999000001. The limit is 1.
n Definition: Diverges to - �:
< an > = < >
< an >
(iii) : Consider the sequence 2n - 1 . A sequence is said to diverge to - � if for a
Here a1= 3, a2= 4/3 , a3= 1, a1000= .5012506253127,
given k �R (however large) $ m �Z ( depending
+

a1000 000 = 0.5000012500006. The limit is 0.5. The

n+2 ' an < k "n �m.
on k )
< an > = < >
sequence 2n - 1 converges to 0.5=1/2. lim an = -�
n �� or
(iv) : Let a n = n. Symbolically it can be written as
< an > an � - �as n � �.
Then =<1, 2, 3, 4, …> = <n>
< an >
The sequence <n> diverges to + � because for a Equivalently, is said to diverge to - � if for
' a > k "n �m.
given k (however large) $ m �� n a given k �R
-
(however small) $ m �Z
' an < k
(v) : The sequence < 2n + 3 >=< 5, 7, 9,11,... > "n �m.
diverges to + �. Examples (cont) :
Convergent Sequences a = -n
(vi) : : Let n .
The values get closer and Then < a n >=<-1, -2, -3, -4, …> = <-n>
closer to a fixed value.
This sequence < - n > diverges to - �because for a
There is a horizontal
asymptote. $ m �N ' an < - k "n �m
given k
The values of this $ m = 899 ��' an < - k
convergent sequence In particular if k=898,
oscillate back and forth "n �m. \< -n > is said to diverge to - �.
(vii) : Similarly the sequences < - n >, < -2 >,
2 n
about one value. There is a
horizontal asymptote
n2
< 2n - n 2 >, < - >,...
Divergent Sequences n +1 diverge to - �.
----------------------------------------------------------------
The sequence diverges Definition: Divergent sequence :
to +∞. The values grow + � or to - � is said
in size becoming A sequence which diverges to
infinitely large. to be a divergent sequence.
----------------------------------------------------------------
The sequence is Remark : (i) : A sequence < an > which is divergent
periodic. A set of values to + �is not bounded above but it is bounded below.
is repeated at periodic
intervals. (ii) : A sequence which is divergent to - � is not
bounded below but it is bounded above.
(iii) Therefore every divergent sequence is
The sequence is both unbounded.
oscillatory and (iv) : The converse of the statements are not true.
M. Arokiasamy-Dept of Mathematics-ALC
 5

divergent. < an >

Let be a sequence where
�n if n is even
�
an = �1
� if n is odd
�n
< an >
is bounded below by zero but is not bounded
above . The sequence does not diverge to + �

M. Arokiasamy-Dept of Mathematics-ALC