4.3.

LIMIT OF A SEQUENCE: THEOREMS 115

4.3 Limit of a Sequence: Theorems
These theorems fall in two categories. The rst category deals with ways to
combine sequences. Like numbers, sequences can be added, multiplied, divided,
... Theorems from this category deal with the ways sequences can be combined
and how the limit of the result can be obtained. If a sequence can be written
as the combination of several "simpler" sequences, the idea is that it should be
easier to nd the limit of the "simpler" sequences. These theorems allow us to
write a limit in terms of easier limits. however, we still have limits to evaluate.
The second category of theorems deal with specic sequences and techniques
applied to them. Usually, computing the limit of a sequence involves using
theorems from both categories.
4.3.1 Limit Properties
We begin with a few technical theorems. They do not play an important role in
computing limits, but they play a role in proving certain results about limits.
Theorem 310 Let r be a number such that \c 0, [r[ < c, then r = 0.
Proof. See problems at the end of the section.
Theorem 311 If a sequence converges, then its limit is unique.
Proof. We assume that a
n
1
1
and a
n
1
2
and show that 1
1
= 1
2
. Given
c 0 choose
1
such that : _
1
== [a
n
1
1
[ <
c
2
. Similarly, choose
2
such that : _
2
==[a
n
1
2
[ <
c
2
. Let = max (
1
,
2
). If : _ , then
[1
1
1
2
[ = [1
1
a
n
+a
n
1
2
[
_ [a
n
1
1
[ +[a
n
1
2
[
<
c
2
+
c
2
= c
By theorem 310 , it follows that 1
1
1
2
= 0, that is 1
1
= 1
2
.
Theorem 312 If a sequence converges, then it is bounded, that is there exists
a number ' 0 such that [a
n
[ _ ' for all :.
Proof. Choose such that : _ ==[a
n
1[ < 1. By the triangle inequality,
we have
[a
n
[ [1[ _ [a
n
1[
< 1
Thus, if : _ , [a
n
[ < 1 + [1[. Let '
1
= max ([a
1
[ , [a
2
[ , ..., [a
N
[). Let ' =
max ('
1
, 1 +[1[). Then, clearly, [a
n
[ < '
Theorem 313 If a sequence converges, then \c 0 : :, : _ ==
[a
n
a
m
[ < c
116 CHAPTER 4. SEQUENCES AND LIMIT OF SEQUENCES
Proof. Given c 0, we can choose such that :, : _ == [a
n
1[ <
c
2
and [a
m
1[ <
c
2
. Now,
[a
n
a
m
[ = [a
n
1 +1 a
m
[
= [(a
n
1) (a
m
1)[
_ [(a
n
1)[ +[a
m
1[ by the triangle inequality
<
c
2
+
c
2
= c
The above theorem simply says that if a sequence converges, then the dif-
ference between any two terms gets smaller and smaller. It should also be clear
to the reader that if a
n
1, then so does a
n+k
where / is any natural number.
The above theorem can be used to prove that a sequence does not converge
by proving that the dierence between two of its terms does not get smaller and
smaller.
Example 314 Find limcos :
We suspect the sequence diverges, as its values will oscillate between -1 and
1 . We can actually prove it using theorem 313. We notice that for any :,
[cos 2: cos ((2: + 1) )[ = 2. For the sequence to converge, this dierence
should approach 0. Hence, the sequence diverges.
Theorem 315 Suppose that (a
n
) converges. Then, any subsequence (a
n
k
) also
converges and has the same limit.
Proof. Suppose that a
n
1. Let /
k
= a
n
k
be a subsequence. We need to prove
that given c 0, there exists such that / _ == [/
k
1[ < c. Let c 0
be given. Choose such that :
k
_ == [a
n
k
1[ < c. Now, if / _ , then
:
k
_ therefore
[/
k
1[ = [a
n
k
1[
< c
This theorem is often used to show that a given sequence diverges. To do so,
it is enough to nd two subsequences which do not converge to the same limit.
Alternatively, once can nd a subsequence which diverges.
Example 316 Study the convergence of cos :
The subsequence cos 2: converges to 1, while the subsequence cos (2: + 1)
converges to 1. Thus, cos 2: must diverge.
In the next two sections, we look at theorems which give us more tools to
compute limits.
4.3. LIMIT OF A SEQUENCE: THEOREMS 117
4.3.2 Limit Laws
The theorems below are useful when nding the limit of a sequence. Finding the
limit using the denition is a long process which we will try to avoid whenever
possible. Since all limits are taken as : , in the theorems below, we will
write lima
n
for lim
n!1
a
n
.
Theorem 317 Let (a
n
) and (/
n
) be two sequences such that a
n
a and /
n
/
with a and / real numbers. Then, the following results hold:
1. lim(a
n
/
n
) = (lima
n
) (lim/
n
) = a /.
2. lim(a
n
/
n
) = (lima
n
) (lim/
n
) = a/.
3. if lim/
n
= / ,= 0 then lim

a
n
/
n

=
lima
n
lim/
n
=
a
/
.
4. lim[a
n
[ = [lima
n
[ = [a[.
5. if a
n
_ 0 then lima
n
_ 0.
6. if a
n
_ /
n
then lima
n
_ lim/
n
.
7. if lima
n
= a _ 0 then lim
_
a
n
=
_
lima
n
=
_
a.
Proof. We prove some of these items. The remaining ones will be assigned as
problems at the end of the section.
1. We prove lim(a
n
+/
n
) = (lima
n
)+(lim/
n
). The proof of lim(a
n
/
n
) =
(lima
n
) (lim/
n
) is left as an exercise. We need to prove that \c 0,
: : _ == [a
n
+/
n
(a +/)[ < c. Let c 0 be given, choose
1
such that : _
1
== [a
n
a[ <
c
2
. Choose
2
such that : _
2
==
[/
n
/[ <
c
2
. Let = max (
1
,
2
). If : _ , then
[a
n
+/
n
(a +/)[ = [(a
n
a) + (/
n
/)[
_ [a
n
a[ +[/
n
/[ by the triangle inequality
<
c
2
+
c
2
= c
2. We need to prove that \c 0, : : _ == [a
n
/
n
a/[ < c. Since
a
n
converges, it is bounded, let ' be the bound i.e. [a
n
[ < '. Choose

1
such that : _
1
== [a
n
a[ <
c
2 ([/[ + 1)
. Choose
2
such that
118 CHAPTER 4. SEQUENCES AND LIMIT OF SEQUENCES
: _
2
==[/
n
/[ <
c
2 (' + 1)
. Let = max (
1
,
2
). If : _ then
[a
n
/
n
a/[ = [a
n
/
n
a
n
/ +a
n
/ a/[
= [a
n
(/
n
/) +/ (a
n
a)[
_ [a
n
[ [/
n
/[ +[/[ [a
n
a[
< '
c
2 (' + 1)
+[/[
c
2 ([/[ + 1)
<
c
2
+
c
2
= c
3. See problems
4. We need to prove that [a
n
[ [a[ that is \c 0, : : _ ==
[[a
n
[ [a[[ < c. Let c 0 be given, choose such that : _ ==
[a
n
a[ < c (since a
n
a) . If : _ , then we have:
[[a
n
[ [a[[ < [a
n
a[ by the triangle inequality
< c
5. We prove it by contradiction. Assume that a
n
a < 0. Choose such
that : _ =[a
n
a[ <
1
2
a. Then,
a
n
a <
1
2
a
=a
n
<
1
2
a
=a
n
< 0
which is a contradiction.
6. We apply the results found in parts 1 and 5 to the sequence a
n
/
n
.
7. See problems
Remark 318 Parts 1, 2 and 3 of the above theorem hold even when a and /
are extended real numbers as long as the right hand side in each part is dened.
You will recall the following rules when working with extended real numbers:
1. += = () () =
2. = () = () =
3. If r is any real number, then
(a) +r = r +=
4.3. LIMIT OF A SEQUENCE: THEOREMS 119
(b) +r = r =
(c)
r

=
r

= 0
(d)
r
0
=

if r 0
if r < 0
(e) r = r =

if r 0
if r < 0
(f ) () r = r () =

if r 0
if r < 0
4. However, the following are still indeterminate forms. Their behavior is
unpredictable. Finding what they are equal to requires more advanced tech-
niques such as lHpitals rule.
(a) + and
(b) 0 and 0
(c)

and
0
0
Remark 319 When using theorems from this category, it is important to re-
member previous results since these theorems allow us to write a limit in terms
of other limits, we hopefully know. The more limits we know, the better o we
are.
Example 320 If c ,= 0, nd lim
c
n
. We know from an example in the previous
section that lim
1
n
= 0. Therefore
lim
c
:
= c lim
1
:
= c 0
= 0
Example 321 Find lim
1
n
2
. In the previous section, we computed this limit
using the denition. We can also do it as follows.
lim
1
:
2
= lim

1
:

1
:

=

lim
1
:

lim
1
:

= 0 0
= 0
Remark 322 From the above example, we can see that if j is a natural number,
lim
1
n
p
= 0.
120 CHAPTER 4. SEQUENCES AND LIMIT OF SEQUENCES
Example 323 Find lim
n
2
+3n
2n
2
+1
.
This problem involves using a standard technique you should remember. We
show all the steps, then we will draw a general conclusion. We begin by factoring
the term of highest degree from both the numerator and denominator.
lim
:
2
+ 3:
2:
2
+ 1
= lim
:
2

1 +
3
n

:
2

2 +
1
n
2

= lim
1 +
3
n
2 +
1
n
2
Now,
lim

1 +
3
:

= lim(1) + 3 lim
1
:
= 1
and
lim

2 +
1
:
2

= lim(2) + lim
1
:
2
= 2
Since both the limit of the numerator and denominator exist and the limit of the
denominator is not 0, we can write
lim
:
2
+ 3:
2:
2
+ 1
=
lim

1 +
3
n

lim

2 +
1
n
2

=
1
2
Remark 324 The same technique can be applied to every fraction for which
the numerator and denominator are polynomials in :. We see that the limit
of such a fraction will be the same as the limit of the quotient of the terms of
highest degree. Let us look at some examples:
Example 325 lim
3:
2
+ 2: 10
2: + 5
= lim
3:
2
2:
= lim
2
3
: =
2
3
lim: =
Example 326 lim
5:
3
2: + 1
2:
4
+ 5:
2
2
= lim
5:
3
2:
4
= lim
5
2:
=
5
2
lim
1
:
= 0
Example 327 lim
2:
3
:
2
+ 2: + 1
:
3
+ 10:
2
5
= lim
2:
3
:
3
= lim2 = 2
4.3.3 More Theorems on Limits
In example 304 , we used an approximation to simplify the problem a little bit.
In this particular example, the approximation was not really necessary, it was
4.3. LIMIT OF A SEQUENCE: THEOREMS 121
more to illustrate a point. Sometimes, if the problem is more complicated, it
may be necessary to use such an approximation in order to be able to nd the
condition : has to satisfy. In other words, when we try to satisfy [r
n
1[ < c,
we usually simplify [r
n
1[ to some expression involving :. Let 1
1
(:) denote
this expression. This gives us the inequality 1
1
(:) < c which we have to solve
for :. If it is too hard, we then try to nd a second expression we will call 1
2
(:)
such that 1
1
(:) < 1
2
(:) < c. 1
2
(:) should be such that solving the inequality
1
2
(:) < c is feasible and easier. In order to achieve this, several tricks are used.
We recall some useful results, as well as some theorems below.
Theorem 328 (Bernoullis inequality) If r _ 1, and : is a natural num-
ber, then (1 +r)
n
_ 1 +:r.
Theorem 329 (binomial theorem) (a +/)
n
= a
n
+:a
n1
/+
:(: 1)
2
a
n2
/
2
+
:(: 1) (: 2)
3!
a
n3
/
3
+... +:a/
n1
+/
n
.
Corollary 330 (1 +r)
n
= 1 + :r +
:(: 1)
2
r
2
+
:(: 1) (: 2)
3!
r
3
+ ... +
:r
n1
+r
n
.
In particular, when r _ 0, then (1 +r)
n
is greater than any part of the right
hand side. For example, we obtain Bernoullis inequality: (1 +r)
n
_ 1 + :r.
We could also write (1 +r)
n
_
:(: 1)
2
r
2
or (1 +r)
n
_
:(: 1) (: 2)
3!
r
3
.
And so on. This is useful to get approximations on quantities like 3
n
. We
rewrite it as
3
n
= (1 + 2)
n
Theorem 331 (squeeze theorem) If a
n
1, c
n
1 and a
n
_ /
n
_ c
n
,
then /
n
1
Proof. We need to prove that \c 0 : : _ == [/
n
1[ < c. Let c 0
be given. Choose
1
such that : _
1
== [a
n
1[ < c or c < a
n
1 < c.
Similarly, choose
2
such that : _
2
== c < c
n
1 < c. Let =
max (
1
,
2
). If : _ then
a
n
_ /
n
_ c
n
==a
n
1 _ /
n
1 _ c
n
1
==c < a
n
1 _ /
n
1 _ c
n
1 < c
==c < /
n
1 < c
==[/
n
1[ < c
Theorem 332 If 0 < a < 1 then a
n
0
122 CHAPTER 4. SEQUENCES AND LIMIT OF SEQUENCES
Proof. Let r =
1
a
1. Then, r 0 and a =
1
1 +r
. For : _ 1,
a
n
=
1
(1 +r)
n
_
1
1 +:r
by Bernoullis inequality
<
1
:r
To show that a
n
0, we need to show that [a
n
[ < c, for any c whenever : _ ,
that is
a
n
< c ==
1
:r
< c
==:
1
rc
So, given c 0, , =
1
rc
will work.
We look at a few more examples, to see how all these results come into play.
Example 333 Find lim
2:
2
+ 1
:
2
+ 1
using the denition
Of course, we can nd this limit by using the theorems on limits. Here, we do
it using the denition, as asked. We think the limit is 2. We want to show that
for every c 0, there exists such that : _ ==

2:
2
+ 1
:
2
+ 1
2

< c. First,
we simplify the absolute value.

2:
2
+ 1
:
2
+ 1
2

1
:
2
+ 1

=
1
:
2
+ 1
<
1
:
2
<
1
:
if : 1
So, we see that if
1
:
< c, which happens when :
1
c
, then we will have

2:
2
+ 1
:
2
+ 1
2

< c. So, =
1
c
will work.
Example 334 Find lim
1
:
2
+ 2: 4
We think the limit is 0. We need to prove that for every c 0, there exists
4.3. LIMIT OF A SEQUENCE: THEOREMS 123
such that : _ ==

1
:
2
+ 2: 4

< c. We begin by noticing that

:
2
+ 2: 4 = :
2
+ 2 (: 2)
:
2
if : 2
Therefore, if : 2,

1
:
2
+ 2: 4

=
1
:
2
+ 2: 4
<
1
:
2
<
1
:
If : max

2,
1
c

, then

1
:
2
+ 2: 4

< c. So, = max

2,
1
c

will work.
Remark 335 The two examples above could have been done using the tech-
niques discussed in the previous subsection, that is without using the denition.
Example 336 Prove that lim
4
n
:!
= 0
The trick we use is worth remembering. We will use the squeeze theorem. We
note that
0 _
4
n
:!
=
4 4 4 ... 4
1 2 3 ... :
_
4
3
3!

4
:
since
4 4 ... 4
4 5 ... : 1
_ 1
But lim
4
3
3!

4
n
= 0 hence the result follows by the squeeze theorem.
Example 337 Find lim
:
4
n
We suspect the limit will be 0 since the denominator grows much faster than
the numerator. So, we need to nd a fraction slightly larger than
:
4
n
which we
know converges to 0. Then, we will be able to invoke the squeeze theorem. Using
the corollary of the binomial theorem, we note that 4
n
= (1 + 3)
n
_
9:(: 1)
2
thus 0 _
:
4
n
_
2:
9:(: 1)
=
2
9: 9
0. Hence, by the squeeze theorem,
lim
:
4
n
= 0.
Example 338 Find lim
:
2
4
n
This is similar to the problem above. However, the numerator is a higher power
124 CHAPTER 4. SEQUENCES AND LIMIT OF SEQUENCES
of :, so we need to write 4
n
in terms of a higher power of :.
4
n
_ (1 + 3)
n
_
3
3
:(: 1) (: 2)
3!
_
9:(: 1) (: 2)
2
Thus,
0 _
:
2
4
n
_
2:
2
9:(: 1) (: 2)
_
2:
9 (: 1) (: 2)
And lim
2:
9 (: 1) (: 2)
= 0 (why?) hence by the squeeze theorem, lim
:
4
n
= 0.
Example 339 Find lim
4
n
2:
We suspect this sequence diverges to innity. We need to prove that
4
n
2:
grows
without bounds, that is for every ' 0, there exists such that : _ ==
4
n
2:
'. First, we notice that
4
n
2:
=
(1 + 3)
n
2:

:(: 1) 3
2
2
2:
by using the binomial theorem

9 (: 1)
4
We can see that
9 (: 1)
4
' ==: 1
4'
9
==:
4' + 9
9
so, =
4' + 9
9
will work.
Remark 340 We used the binomial theorem to deduce that (1 + 3)
n
_
:(: 1) 3
2
2
.
Often, when using this theorem, students do not know which term to keep, the
term in r, or r
2
, or r
3
,... The answer is that it depends on what we are trying
to achieve. Here, we wanted to show that
4
n
2:
' for any ', in other words,
4.3. LIMIT OF A SEQUENCE: THEOREMS 125
4
n
2:
can be made as big as we want simply by taking : large enough. Since we
could not solve for :, we replaced
4
n
2:
by a smaller term. That smaller term
should have similar properties, in other words, the smaller term should also get
arbitrarily large. If we take the smaller term too small, it will not work. For
example, it is true that
4
n
2:

1
2:
. However,
1
2:
cannot be made as large as
we want, so this does not help us. If instead of using (1 + 3)
n
_
:(: 1) 3
2
2
(terms of second degree), we had used (1 + 3)
n
_ 1 + 3:, then we would have
obtained
1 + 3:
2:
' ==2:' < 1 + 3:
== 2:' 3: < 1
== :(2' 3) < 1
== : <
1
2' 3
So, this does not work. This tells us that
1+3n
2n
' only for a few values of :.
This is why we used terms of higher degree.
Example 341 Find lim
_
: + 2
_
:

lim
_
: + 2
_
:

= lim
_
: + 2
_
:
_
: + 2 +
_
:

_
: + 2 +
_
:

= lim
2
_
: + 2 +
_
:
=
2
lim
_
: + 2 +
_
:

= 0
Remark 342 In many proofs or problems, dierent versions of the triangle
inequality are often used. As a reminder, here are the dierent versions of the
triangle inequality students should remember.
[[a[ [/[[ _ [a /[ _ [a[ +[/[
and
[[a[ [/[[ _ [a +/[ _ [a[ +[/[
Finally, we give a theorem which generalizes some of the examples we did
above.
Theorem 343 All limits are taken as : .
1. If j 0 then lim
1
:
p
= 0.
126 CHAPTER 4. SEQUENCES AND LIMIT OF SEQUENCES
2. If j 0 then lim
n
_
j = 1.
3. lim
n
_
: = 1.
4. If j 1 and c R then lim
:

j
n
= 0.
5. If [j[ < 1 then limj
n
= 0
6. \j R, lim
j
n
:!
= 0.
Proof. We prove each part separately.
1. We can use the denition. Let c 0 be given. We show there exists
0 : : _ ==

1
:
p
0

< c. We begin with what we want to achieve.

1
:
p
0

< c ==
1
:
p
< c
== :
p

1
c
== :
1
p
_
c
So, we see that if is the smallest ineteger larger than
1
p
p

, the result will

follow.
2. See problems
3. Let r
n
=
n
_
: 1. Proving the result amounts to proving that limr
n
= 0.
From r
n
=
n
_
: 1, we can write
n
_
: = r
n
+ 1
: = (r
n
+ 1)
n
Using the binomial theorem, we see that if : _ 2
: _
:(: 1)
2
r
2
n
Thus
r
2
n
_
2
: 1
It follows that for all : _ 2 we have
0 _ r
n
_
r
2
: 1
Since lim
q
2
n1
= 0, it follows using the squeeze theorem that limr
n
= 0.
4.3. LIMIT OF A SEQUENCE: THEOREMS 127
4. Here again, we will use the binomial theorem. Since j 1, we can write
j = 1 + with 0. Therefore, if / is a positive integer such that / c,
we have
j
n
= (1 +)
n

:(: 1) ... (: / + 1)
/!

k
Now, if : 2/, then / <
1
2
:. It follows that : / +1
1
2
: +1
1
2
:. It
follows that
:(: 1) ... (: / + 1)
/!

:
k
2
k
/!
and therefore
0 _
:

j
n
_
2
k
/!

k

1
:
k
Since
lim
n!1
2
k
/!

k

1
:
k
=
2
k
/!

k
lim
n!1
1
:
k
= 0
It follows from the squeeze theorem that lim
:

j
n
= 0
5. See problems (hint: write j =
1
q
and use part 4 of the theorem with
c = 0).
6. See problems.
4.3.4 Exercises
1. Prove that
5
n
:!
0.
2. Prove that
:!
:
n
0.
3. Finish proving theorem 343.
4. Consider (r
n
) a sequence of real numbers such that lim
n!1
r
n
= r where
r 0, prove there exists an integer 0 such that : _ ==r
n
0.
5. Consider (r
n
) a sequence of real numbers such that r
n
_ 0 for any :. If
r is a partial limit of (r
n
), prove that r _ 0. Prove the same result if
r = limr
n
. Use this to show that if r
n
_ j
n
then limr
n
_ limj
n
.
6. Consider (r
n
) a sequence of real numbers and let r R. Prove the two
conditions below are equivalent.
128 CHAPTER 4. SEQUENCES AND LIMIT OF SEQUENCES
(a) r
n
r as : .
(b) [r
n
r[ 0 as : .
7. Consider (r
n
) a sequence of real numbers and let r R. If limr
n
= r,
prove that lim[r
n
[ = [r[.
8. Show by examples that if [r
n
[ [r[ then r
n
does not necessarily converge.
If it does converge, it does not necessarily converge to r.
9. Consider (r
n
) a sequence of real numbers and let r R. Suppose that
limr
n
= r. Dene j
n
= r
n+p
for some integer j. Prove that limj
n
= r.
10. Given that a
n
_ /
n
for every : and that lima
n
= , prove that lim/
n
=
.
11. Suppose that (a
n
) and (/
n
) are sequences of real numbers such that
[a
n
/
n
[ < 1 for every :. Prove that if is a partial limit of (a
n
)
then is also a partial limit of (/
n
).
12. Two sequences are said to be eventually close if \c 0, 0 : : _
==[a
n
/
n
[ < c.
(a) Prove that if two sequences (a
n
) and (/
n
) are eventually close and if
a number r is the limit of the sequence (a
n
) then r is also the limit
of the sequence (/
n
).
(/) Prove that if two sequences (a
n
) and (/
n
) are eventually close and if
a number r is a partial limit of the sequence (a
n
) then r is also a
partial limit of the sequence (/
n
).
13. Determine if the sequences below have limits. In each case, if a limit 1
exists, given c 0, nd such that : _ ==[r
n
1[ < c.
(a)
: 1
: + 1
(b)
3:
2
+ 1
:
2
+ 1
(c)
5:
3
+: 4
2:
3
+ 3
(d)
:
3
: + 1
(e)
4:
2
+ 1
:
3
+:
(f)
1
:
2
+
2
:
2
+... +
:
:
2
(g) (1)
2n1

1
1
2
n

4.3. LIMIT OF A SEQUENCE: THEOREMS 129

(h)

1
1
2

1
1
3

1
1
4

...

1
1
:

(i)
5
n
2:
(j) Prove that if a 1 then a
2
a
_
a 1
(k) Prove that
:
2
n
0,
:
2
2
n
0,
:
3
2
n
0,
:
4
2
n
0
14. Prove theorem 310
15. Finish proving theorem 317
16. Let (r
n
) and (j
n
) be two sequences. Assume further that limr
n
= r and
j is a partial limit of (j
n
). Prove that r+j is a partial limit for (r
n
+j
n
).
17. State and prove similar results for subtraction, multiplication and division.
18. Give an example of two divergent sequences (r
n
) and (j
n
) such that
(r
n
+j
n
) is convergent.
19. Give an example of two sequences (r
n
) and (j
n
) such that r
n
0, j
n

and:
(a) r
n
j
n
0
(b) r
n
j
n
c where 0 < c <
(c) r
n
j
n

(d) (r
n
j
n
) is bounded but has no limit.
20. Let (r
n
) be a sequence of real numbers such that r
n
0. Prove that
r
1
+r
2
+... +r
n
:
0
21. Let (r
n
) be a sequence of real numbers such that r
n
r for some real
number r. Prove that
r
1
+r
2
+... +r
n
:
r
22. Prove that [r
n
[ 0 ==r
n
0.
23. Show by examples that if (r
n
) and (j
n
) are divergent sequences then
(r
n
+j
n
) is not necessarily divergent. Do the same for (r
n
j
n
)
24. Show that if (r
n
) 0 and (j
n
) is bounded then (r
n
j
n
) 0.
25. Prove that if (r
n
) is a sequence in a set o _ R, then every nite partial
limit of (r
n
) must belong to o.
130 CHAPTER 4. SEQUENCES AND LIMIT OF SEQUENCES
26. Prove that if o _ R and r o then there exists a sequence (r
n
) in o such
that r
n
r.
27. Let o _ R. Prove that the following conditions are equivalent:
(a) o is unbounded above.
(b) There exists a sequence (r
n
) in o such that r
n
.