SEQUENCE & SERIES

Theory & Solved Example (A)

SEQUENCE AND SERIES
A sequence is a function defined on the set of positive integers. Thus the domain of
the sequence is the set of natural numbers. The range of the sequence can be any
subset of real numbers. Sequences are generally denoted by <a
n
>, {a
n
} or f(n)
where a
n
or f(n) give us the value at n. A sequence can be described in three ways
i) By explicit formula (i.e. just like functions)
ii) By recursion formula i.e. two or more terms are connected through some
definite relation
iii) By describing through language
For example a
n
=
1
n
n +
is a sequence given by explicit formula. The sequence
whose n
th
and (n 1)
th
terms are connected as a
n
=
1
2
n
a

is called a recursion
sequence. In such sequences if the first term is known then all other terms can be
found by applying recursion formula successively.
Finally a sequence given by a
n
= n
th
prime (a
1
= 2, a
2
= 3, a
3
= 5, a
4
= 7 etc.) can
neither be expressed by explicit formula nor by recursion formula. (Still remains a
mystery and conjecture in number theory). But there are sequences, which can be
given both by recursion formula and by explicit formula. For example a
n
= a + (n
1) d (a and d are constants) or a
n
a
n 1
= d with a
1
= a describe the same sequence
which is called an arithmetic sequence. An advanced example is the sequence {u
n
}
where u
n
denote the number of no match of n different objects. The recursion
formula is
u
n
= (n 1) (u
n1
+ u
n2
) with u
0
= 1, u
1
= 0 while the explicit formula is
1 1 1 1 ( 1)
! ...
1! 2! 3! 4! !
n
n
u n
n
_
+ + +

,
MONOTONICITY OF A SEQUENCE
A sequence {a
n
} is said to be monotonically increasing (MI) if a
n+1
> a
n
for all n and
is said to monotonically decreasing (MD) if a
n+1
< a
n
for all n. A sequence is said to
be non monotonic if it is neither MI nor MD. For example the sequence
1
n
n
a
n

+
is
MI,
1
n
a
n
is MD while a
n
= n
1/n
is non monotonic (Note that the a
n
= n
1/n
is MD if n
3).
The advanced examples for MI, MD and non monotonic sequence are
1
1
1 1
1 , 1
n n
n n
a a
n n
+
_ _
+ +

, ,
and a
n
= sin n respectively
BOUNDEDNESS OF A SEQUENCE
A sequence {a
n
} is said to be bounded if |a
n
| < k for all natural numbers n. For
example the sequence a
n
= sin n is bounded since |a
n
| < 1 for all n.
CONVERGENCE OF A SEQUENCE
A sequence {a
n
} is said to be convergent if
lim
n
n
a

exist. If
lim
n
n
a

the sequence
diverges to . If a sequence neither diverges to nor tends to a limit it is said to be
oscillatary. For example
a
n
= sin n is oscillatary. There is a remarkable theorem in mathematical analysis
which states that every bounded monotonic sequence is convergent.
Note:
i) If
1 1 1 1
...
1 2 3 2
n
a
n n n n
+ + + +
+ + +
then
1
1 1 1 1 1 1
...
2 3 4 2 2 1 2 2
n
a
n n n n n n
+
+ + + + + +
+ + + + +

1
1 1 1 1
0 { }
2 2 2 1 1 (2 1)(2 2)
n n n
a a a
n n n n n
+
+ >
+ + + + +
is MI
ii) If f(n) is a sequence then the function f(x) (where x is in some subset of real
numbers) may differ from f(n) in various ways. For example range of the sequence
sin n is the set {sin 1, sin 2, sin 3, } while range of the function sin x is [1, 1]. f(x)
may not even make sense.
iii) If <a
n
> is given by
1 1 1 1 1
1 ...
2 3 4 5 2 1
n n
a + + + + + +

then
2
n
n
a n < < which clearly
proves that a
n
diverges to .
iv) At times the monotonicity of a sequence can be proved by proving the
monotonicity of corresponding real function by using differentiable functions. For
example f(x) = x
1/x
is MD in (e, ) which implies
4 3 5
3 4 5 ... > > > since 3, 4, 5,
(e, ) otherwise a monotonicity is proved by showing a
n+1
a
n
> 0 for all n
v) If {a
n
} is MI and converges to l then a
n
< l for all n
SERIES
A pattern of the type given by S = a
1
+ a
2
+ a
3
+ + a
n
+ is called a series
where the terms a
1
, a
2
, a
3
,
are related through some definite rule.
2
ARITHMETIC SERIES OR ARITHMETIC PROGRESSION (A.P)
A series in which every term is obtained by adding a constant to the preceding term
is called an arithmetic series or A.P. This constant (normally denoted by d) is called
common difference of the A.P. Thus if the first term of an A.P. is a and its common
difference be d then its nth terms T
n
is given by
T
n
= a + (n1) d
The sum S
n
of first n terms of AP is given by [2 ( 1) ] [ ]
2 2
n
n n
S a n d a l + + , where l = a
+ (n 1)d
GEOMETRIC SERIES
A series of the type a + ar + ar
2
+ ar
3
+ (r 0) is called a geometric series or
geometrical progression or G.P. The nth term of GP is given by T
n
= ar
n1
.
The sum of n terms S
n
of a GP is given by
1
( 1) (1 )
1
1 1
n n
n
na if r
S
a r a r
if r
r r

'

The sum of an infinite GP makes sense if |r| < 1 and is lim ( 0
1
n
n
n
a
S S r
r

Q as
n )
HARMONIC SERIES
A series a
1
+ a
2
+ a
3
+ + a
n
+ where all terms are non zero is called a
harmonic series or H.P if the series of reciprocals of a
1
, a
2
, a
n
, i.e. the series
1 2
1 1 1
, ,... ,...
n
a a a
is an A.P. An H.P is always dealt by taking its corresponding A.P. The
sum of n term of an H.P can not be determine in general means.
MEANS
If a and b are two non zero numbers we defined their arithmetic mean A, geometric
mean G and harmonic mean H as
2
, ,
2
a b ab
A G ab H
a b
+

+
Insertion of Several Means between two given numbers
Suppose a and b be two non-zero numbers then
i) If n arithmetic means x
1
, x
2
, , x
n
are inserted between a and b then the
numbers a, x
1
, x
2
, , x
n
,
b must be in A.P. with common difference as
1
b a
n

+
The j
th
arithmetic mean x
j
is
given by x
j
= a + jd
3
ii) If n geometric means g
1
, g
2
, , g
n
are inserted between positive numbers a
and b then the numbers a , g
1
, g
2
, , g
n
, b must be in G.P. with common ratio as
1
1
1
( )
n
n
b
r b ar
a
+

_


,
Q
and g
j
= ar
j
(j = 1, 2, , n).
iii) If n harmonic means h
1
, h
2
, , h
n
inserted between a and b then the numbers
1 2
1 1 1 1 1
, , ,..., ,
n
a h h h b
must be in A.P. with common difference as
1 1
1 1
1 ( 1)
j
a b
b a
d and jd
n n ab h a

+
+ +
(i = 1, 2, , n).
Arithmetico-Geometric Series (AGP)
If the numbers b
0
, b
1
, b
2
, , are in A.P. then the series b
0
+ b
1
x + b
2
x
2
+ b
3
x
3
+ +
b
n
x
n
+ is called an Arithmetico-Geometric Series (AGP). Since 1, x, x
2
are in
G.P.
The n
th
term of such a series can be found by multiplying the n
th
terms of A.P. and
G.P. involved in the AGP .The sum upto n terms is found by using the following
technique
Let S = b
0
+ b
1
x + b
2
x
2
+ b
3
x
3
+ + b
n
x
n
Sx = b
0
x + b
1
x
2
+ b
2
x
3
+ + b
n1
x
n
+ b
n
x
n+1
S (1 x) = b
0
+ (b
1
b
0
) x + (b
2
b
1
) x
2
+ + (b
n
b
n1
) x
n
b
n
x
n+1
Now b
1
b
0
= b
2
b
1
= . = b
n
b
n1
= d
S (1 x) = b
0
+ d(x + x
2
+ + x
n
) b
n
x
n+1
= b
0
+
(1 )
1
n
x x
d
x

b
n
x
n+1

1
0
2
(1 )
1 (1 ) 1
n n
n
b dx x b x
S
x x x
+

+


SUMMATION OF SERIES
Finding the summation of series is not always possible in algebra. The summation of
only limited class of series can be found. We can find the sum of an AP, GP, AGP up
to n terms. The sum of an HP cannot be found in general the sum of a series whose
n
th
term is a polynomial can be found by using the summation formulae
2 3
, , n n n

where

1
( 1)
2
j n
j
n n
j

,
2
1
( 1)(2 1)
6
j n
j
n n n
j

+ +

,
2
3
1
( 1)
2
j n
j
n n
j

+ _

.(*)
4
The summation can be found in two steps
i) Finding n
th
term T
n
ii) Finding sum by using formule (*)
To find nth term T
n
of a series we first of all find the difference of successive terms.
If it a constant then the series is an AP and the sum is determined by usual formula.
In case these difference are not constant then we find the second order differences
if they are constant the nth term T
n
should be a polynomial of degree 2 otherwise
we find third order differences and so on.
Other Cases of Summation
i) Method of differences: We have already described the method of
difference when n
th
term is a polynomial in n. The method of difference may work
out in general. In this method we try to express n
th
term T
n
as a difference of two
terms. Suppose we want the sum of the series
u
1
+ u
2
+ u
3
+ + u
n
. We try to express U
n
as a difference of two terms
If u
n
= v
n+1
v
n
, then
u
1
+ u
2
+ + u
n
= (v
2
v
1
) + (v
3
v
2
) + + (v
n+1
v
n
) = v
n+1
v
1
Thus
S
n
= v
n+1
v
1
At times we do partial fractions by hit and trial by expressing the
numerator as a difference of extreme terms. For instance we want to find the
sum of the series
1 1 1
...
1.2.3 2.3.4 3.4.5
+ + + upto n terms we note that
1 1 ( 2)
( 1)( 2) 2 ( 1)( 2)
n
n n
T
n n n n n n
1 +

1
+ + + +
]
1 1 1
2 ( 1) ( 1)( 2) n n n n
1

1
+ + +
]

1 1 1
2 1.2 ( 1)( 2)
n
S
n n
1

1
+ +
]
(on putting n = 1, 2, 3, and
adding)
Standard Results and Important Tips
i)
1
2 1 3
n
n
_
< + <

,
for all n
ii) The infinite AGPs play a dominant role in binomial problems. They are also
used in finding number of ways of dividing identical objects in distinct boxes.The
important infinite AGPs are
a) 1 + 2x + 3x
2
, = (1 x)
2
|x| < 1 b) 1 + 3x + 6x
2
+ 10x
3
+
= (1 x)
3
, |x| < 1
((b) the second order differences are constant).
5
iii) At times by adding a suitable quantity to the first term of a series the series
will reduce to a single term only. For instance to find sum of the series
3 1 2
1 1 2 1 2 3
...
1 (1 )(1 ) (1 )(1 )(1 )
n
b b b
S
b b b b b b
+ + +
+ + + + + +
up to n terms
We add 1 to the first term then
1
1 1
1
1
1 1
b
b b
+
+ +
and
2
1 1 2 1 2
1 1
1 (1 )(1 ) (1 )(1 )
b
b b b b b

+
+ + + + +
and so on.
Therefore
1 2 1 2
1 1
1 1
(1 )(1 )...(1 ) (1 )(1 )...(1 )
n
n n
S
b b b b b b

+
+ + + + + +
iv) If T
n
is linear expression in n (i.e. T
n
= An + B), then it will represent an A.P.
v) In S
n
is quadratic expression in n (i.e. An
2
+ Bx + C ), then again it will
represent an A.P.
vi) If log x, log y, log z are in a.P. iff x, y, z are in G.P.
vii) If A, G and H represent A.M., G.M. and H.M. means respectively then
a) A, G, H are in G.P. i.e. G
2
= AH
b) A G H, equality holds only when the two numbers are same.
viii) The least value of the expression
1 2 3
1 2 3
1 1 1 1
( ..... ) .....
n
n
a a a a
a a a a
_
+ + + + + + + +

,

is n
2
ix) In an A.P. x, y, z are the pth, qth and rth term respectively then
log log log
0
1 1 1
x y z
p q r
x) In an G.P. x, y, z are the pth, qth and rth term respectively then
0
1 1 1
x y z
p q r
6
xi) In an H.P. x, y, z are the pth, qth and rth term respectively then
1 1 1
log log log
0
1 1 1
x y z
p q r
xii) The sum of an AGP can also be found by differentiating a series which is a
G.P. For example to find the sum S = 1 + 2x + 3x
2
+ + nx
n1
We take the integration of every term and write S
1
= x + x
2
+ x
3
+ + x
n
It is clear that
1
(1 )
( 1)
1
n
x x
S x
x

and
1
dS
S
dx

SOLVED EXAMPLES ( CONVENTIONAL )

1. Show that the following sequences are monotonic.
(i)
3 1
5 2
n
n
a
n

+
(ii)
1 1 1
....
1 2
n
a
n n n
+ + +
+
SOLUTION (i)
( )
( ) ( ) ( )
1
3 1 1 3 2 3 1 11
5 1 2 5 7 5 2 5 7 5 2
n n
n n n
a a
n n n n n
+
+ +

+ + + + +

1
0
n n
a a
+
> for all n
1 n n
a a
+
> for all n which shows that the sequence { }
n
a is monotonically increasing.
(ii) We have
1
1 1 1 1 1 1
.......
1 2 3 2 2 1 2 2
n
a
n n n n n n
+
+ + + + + +
+ + + + +
1
1 1 1 1 1
2 2 2 1 1 2 1 2 2
n n
a a
n n n n n
+
+
+ + + + +
( ) ( )
1
1
0
2 1 2 2
n n
a a
n n
+
> >
+ +
for all n.
2. Beginning with what n do the terms of a sequence
2
5 6
n
y n n + satisfy
1
.
n n
y y
+
>
SOLUTION: We have ( ) ( )
2
2
1
1 5 1 6 5 6
n n
y y n n n n
+
+ + + +
( )
1
2 4 2 2 3.
n n
n n y y if n
+
>
7
Thus , the sequence { }
n
y is monotonically increasing if 3. n
3. If
1 2
0 S S > > and ( )
1 1
1
2
n n n
S S S
+
+ then show that the sequence { }
2n
S is monotonically
increasing. Further show that
( )
2 1
2 1 2 1 2
1
2
n
n n
S S S S

+
_


,

SOLUTION: Since arithmetic mean of two positive numbers lies between them we have
2 3 1
S S S < < (A)
Since ( )
3 1 2
1
2
S S S + and
2 1
, S S < again , ( )
4 2 3
1
2
S S S +
We have
2 4 3
S S S < < (B)
Combining (A) and (B) we get
2 4 3 1
S S S S < < <
(C)
We similarly have
2 4 5 3 1
S S S S S < < < < (D)
and
2 4 6 5 3 1
S S S S S S < < < < < and so on.
Thus
2 4 6 7 5 3 1
...... S S S S S S S < < < < < < <
That last inequality written clearly that the sequence { }
2n
S monotonically
increasing and the sequence{ }
2 1 n
S
+
is monotonically decreasing. To prove the other
part we have,
( )
2 1 2 2 1
1
2
n n n
S S S
+
+ ( )
2 1 2 2 2 1
1
2
n n n n
S S S S
+
_


,
(E)
( ) ( )
2 1 2 2 2 2 2 3
1 1 1 1 1
2 2 2 2 2
n n n n
S S S S

_ _ _ _ _


, , , , ,
(On successive application of recursion relation (E) continuing in this manner
we get
( ) ( )
2 1 2 1
2 1 2 2 1 1 2
1 1
2 2
n n
n n
S S S S S S

+
_ _


, ,
NOTE: If
2 1
S S > then { }
2n
S is decreasing while { }
2 1 n
S
+
is increasing .
4. If
1 1
1
1
1, ,
n n
n
a a a
a

+
if 1 n > show that
100
14 18. a < <
8
SOLUTION : Since
1
1 0 a > and all other
i
a s

are of
the form
1
x
x
+ all
i
a s

are essentially greater then or equal to 2, if 1 i >

Now
2 2
1 2
1
1
2
n n
n
a a
a

+ +
(A)
2 2
1
2
n n
a a

> +
(B) Now
2 2
2 3
1 2 3 2 2 1, 3 2 5 2 3 1 a a > + > + and
2
4
5 2 7 2 4 1 a > + and so on. Thus
2 2
100 100 100
2 100 1 199 196 14 a a a > > > which
proves the first part.
Again
2 2 2 2
1 1 2
1
1
2 3
n n n n
n
a a a a
a

+ + < +

2
1
1
1
n
a

_
<

,
Q
2 2
2 3
1 3 4 3 2 2 , 4 3 7 3 3 2 a a < + < + and
2
4
7 3 10 3 4 2 a < + and so on.
Thus
2 2
100 100 100
3 100 2 298 324 18. a a a < < < <
Thus
100
14 18 a < <
5. Show that
( ) ( )
1000 999
1000 1001 . >
SOLUTION : We have
( )
( )
( )
( )
999 1000
1000 1000
1001 1001
1
1001
1000 1000

1000
1 1 3 1
1 1 ( 1
1000 1001 1001 1001
n
e
n
_ _ _
+ < < < +

, , ,
Q is MI and

e as n
)
Which proves the given numerical inequality.
6. Show that
( ) ( )
2
66........6 88......8
44.....4
.
2 ndigits n digits n digits
+
SOUTION : The LHS =
( ) [ ]
2
6 8
999....9 999.....9
9 9
1
+
1
]
( ) ( ) ( )
2
2 2 2
36 8 4 8
10 1 10 1 10 2.10 1 10 1
81 9 9 9
n n n n n
1 + + +
]
9
2 2 2
4 4
10 2.10 1 2.10 2 10 1
9 9
n n n n
1 1 + +
] ]
4
(99.....2
9
n times
44....4
)
2n digits

.
7. If
1 1
1, 2
n n
a a a
+
+ for all 1. n Show that the sequence { }
n
a is
monotonically increasing. Hence show that 1 2
n
a < < for all n > 1.
SOLUTION: We have
2 2
1 1
2 , 2
n n n n
a a a a
+
+ +
2 2
1 1 n n n n
a a a a
+
(A)
Now , as
2 1
2 3 . a a + We note that
2 1
. a a >
On putting n=2 in (A), we get
( )
2 2 2 2
3 2 2 1 3 2 3 2 2 3
0 , 0 a a a a a a a a a a > > > > Q
Again putting n=2 in (A) , we get
2 2
4 3 3 2 4 3
0 a a a a a a > > and so on.
Thus
1 n n
a a
+
> for all n ( ) ( ) 2 1 0 1 2
n n n
a a a + < < <
But as
1
1 a and { }
n
a is MI all
n
a s

are greater than 1 2

n
a < for all n.
8. If
1
0( 1, 2,......., a i > .n) be in A.P. show that
1 2 2 3 1 1
1 1 1 1
..... .
n n n
n
a a a a a a a a

+ + +
SOLUTION: Let d be the common difference of the A.P. we have
2 1
1 2 1 2 1 2
1 a a d
a a d a a d a a

3 1
2 3 2 3 2 3 2 3
1 1 1 1 a a d
a a d a a d a a d a a

_


,
and so on.
1 1
1 1 1 1
n n n n
a a d a a

_

,
10
On adding these we get LHS =
1
1 1
1 1 1
n
n n
a a
d a a d a a
_


,
(A)
Now ( ) ( )
1 1
1 1 .
n n
a a n d a a n d + Thus, LHS =
1
1
n
n
a a

RHS.
9. For an A.P.
1 2
, ,...... ( 0)
n i
a a a a > prove that
1 2 1 3 2 1 1 1 2
1 1 1 1 2 1 1 1
.... ....
n n n n n n
a a a a a a a a a a a a a

_
+ + + + + + +

+
,
SOLUTION : In any A.P. we have
( ) ( ) ( )
1 1 1 1 1 1
1 1
k n k n
a a a k d a n k d a a n d a a
+
+ + + + + + +
Which shows that
1 k n k
a a
+
+ is idependent of k.
1 2 1 3 2
......
n n n
a a a a a a

+ + +
Now, LHS =
1 1 1
1 1 2 1 1
1
.....
n n n
n n n n
a a a a a a
a a a a a a a a

1 + + +
+ + +
1
+
]
=
1 2 1 1
1 1 2 1 1
1
.....
n n n
n n n n
a a a a a a
a a a a a a a a

1 + + +
+ + +
1
+
]
=
1 1 1 2 1
1 1 1 1 1 1 1
....
n n n n
a a a a a a a a

1
+ + + + + +
1
+
]
=
1 1 2
2 1 1 1
..... .
n n
a a a a a
1
+ + +
1
+
]
10. Show that if the expression ( ) ( ) ( )
2 2
a b c x b c a xy c a b y + + is a perfect
square then , , a b c are in H.P..
SOULTION :Since the given expression is a perfect square . We must have
( ) ( ) ( ) ( )
2
2 2
4 4 b c a ac b c a b ac ab ac b bc +
( ) ( )
2 2 2 2
2 4 4 b c a ac ac ab ac bc acb + +
( ) ( )
2
2 2 2
4 4 b c a abc a c a c + +
11
( ) ( )
2 2
2 0 2 0
ac
b c a ac b c a ac b
a c
+ + 1
]
+
The last relation shows that , , a b c are in H.P. .
11. A G.P. and an H.P. have the same , ,
th th th
p q r terms as , , a b c respectively .
Prove that if , , 0 a b c > then ( ) ( ) ( ) log log log 0. a b c a b c a b c a b c + +
SOLUTION :The result to be proved is based on two basic result of G.P. and H.P.
(i) If , , ,
th th th
p q r terms of G.P. are , , a b c then , 1
q r r p p q
a b c

Proof: We have
1 1 1
, , ,
p q r
a AR b AR c AR


the LHS =
( ) ( ) ( )
1 1 1
q r r p p q
p q r
AR AR AR


=
( ) ( ) ( ) ( ) ( ) ( ) 1 1 1 0 0
1.
p q r q r p r p q q r r p p q
A R A R
+ + + +

(ii) If , ,
th th th
p q r terms of a H.P. are , , a b c then
( ) ( ) ( ) 0 q r bc r c ca p q ab + +
Proof : Let B be the first terms , D be the common difference of the
corresponding A.P.
we must have
( ) 1 1/ B p D a +
( ) 1 1/ B q D b + (A) (
1 1 1
, ,
a b c
Q are in
A.P.)
( ) 1 1/ B r D c +
( ) 1 Babc abc p bc +
( ) 1 Babc abc q ac + (B)
( ) 1 Babc abc r ab +
Froms the last system (B) we easily conclude that
( ) ( ) ( ) 0 bc q r ac r p ab p q +
(iii) To prove the given result we make use of the two relations
12
1
q r r p p q
a b c

(C)
( ) ( ) ( ) 0 q r bc r p ca p q ab + + (D)
Form (C), ( ) ( ) ( ) log log log 0 q r a r p b p q c + + (E)
Solving (D) and (E) in the variables
, q r r p
and
, p q
we get
,
log log log log log log
q r r p p q
k
ab b ac c bc c ab a ca a bc b



say
( ) log log . q r k ab b ac c
( ) log log r p k bc c ab a
( ) log log p q k ca a ab b
On adding the last three relations, we get
( ) ( ) ( ) 0 log log log k a b c a b c a b c a b c 1
]
( ) ( ) ( ) log log log 0 a b c a b c a b c a b c + +
12. Determine an A.P. for which
2
3 5 .
n
S n n
SOLUTION : To determine an A.P. means to determine the first terns and the
common difference. We will explain three methods to determine the A.P.
First Method : We have
1 2
.....
n n
S a a a + + +
2 2
1 1, 2 1 2 1 1 2
3 1 5 1 , 3 2 S a S a a a a a + +
1 1 2 1 2
2, 14 2, 12 a a a a a +
12 2 10 d +
Thus the first terms of the A.P. is -2 and the common difference is
-10.Therefore
( ) ( ) 2 1 10 8 10 .
n
a n n +
Second Method : We have
( ) ( )
1 2 1 1 2 1 1
.... ....
n n n n n n
a a a a a a a a S S

+ + + + + + +
13
= ( ) ( ) ( ) ( )
2 2
2
3 5 3 1 5 1 8 10 2 1 10 n n n n n n
1
1 +
]
]
Third Method : We must have ( )
2
1
2 1 3 5
2
n
a n d n n + 1
]
2 2
2 2
1 1
3 5 , 3 5
2 2 2 2
dn nd dn d
a n n n a n n n
_
+ +

,
On comparing coefficients, we get
1
5, 3
2 2
d d
a which easily gives
1
2 a
and 10. d
13. For which values of the common ratio can three successive terms of a G.P. be
the side of a triangle
SOLUTION :Let the three successive terms of the G.P. be
2
, , . a ar ar The three
numbers
2
, , a ar ar can be sides of a triangle if the following two condition are
satisfied.
(i)
2
, , a ar ar are positive numbers .
(ii) Sum of any two is greater than the third.
If r=1 then all the numbers are equal and hence an equilateral triangle is
possible in this case.
If r 1 then r is either greater than 1 or r lies between 0 and 1.
(i) If 1 r > then
2
a ar ar < <
(because 0 a > ) and the triangle is possible if
2
ar ar a < +
2
1 0 r r < (because 0 a > )
1 5 5 1 5 1
2 2 2
r r
+ +
< < <
(because 1 r > ) (A)
(ii) If 0 1 r < < then we have
2
a ar ar > >
and the triangle is possible if
2
a ar r > +
2
1 5 1 5
1 0 , ,
2 2
r r
_ _
+
+ >


, ,
U
( )
1 5
1 0 1
2
r r
+
< < < < Q
(B)
14
Combining (A) and (B) we get
5 1 5 1
.
2 2
r
+
< <
15