Indian Institute of Technology Kanpur

Department of Mathematics and Statistics

Single Variable Calculus (MTH 111)
Hints for Exercise Sheet 2
1. To be discussed in the tutorial session
(1) Show that a real sequence can converge to at most one real number.
Sketch of the proof. Suppose that a sequence {xn }∞n=1 converges to two different real numbers
ℓ and ℓ′ . Can you choose an ε > 0 such that (ℓ − ε, ℓ + ε) ∩ (ℓ′ − ε, ℓ′ + ε) = ∅? Since
{xn }∞ ′
n=1 converges to both ℓ and ℓ , using that can you show that there is n ∈ N such that
′ ′
xn ∈ (ℓ − ε, ℓ + ε) ∩ (ℓ − ε, ℓ + ε)?

(2) Suppose that xn −−−→ x. Show that if x ̸= 0 then there exists N ∈ N such that ∀n ≥ N , xn
n→∞
has the same sign with that of x.
x
Solution. Assume that x > 0. Then ∃N > 0 such that ∀n ≥ N , x − 2
< xn < x + x2 . Thus
∀n ≥ N , xn > x2 > 0. The case x < 0 can be dealt with similarly.

(3) Suppose xn −−−→ x, yn −−−→ y and α ∈ R. Then prove the following:

n→∞ n→∞
(a) |xn | −−−→ |x|.
n→∞

Sketch of the proof. ||xn | − |x|| ≤ |xn − x|

(b) If |xn | −−−→ |x|, does that always imply xn −−−→ x? If not, then can you provide a
n→∞ n→∞
sufficient condition for that?
Solution. {(−1)n }∞
n=1 . It is obvious that xn −−−→ 0 if and only if |xn | −−−→ 0.
n→∞ n→∞

(c) xn ± yn −−−→ x ± y.
n→∞

Sketch of the proof. |(xn ± yn ) − (x ± y)| ≤ |xn − x| + |yn − y|.

(d) xn yn −−−→ xy. (Hint Observe that |xn yn − xy| ≤ |xn ||yn − y| + |y||xn − x|. Recall that
n→∞
convergent sequences are bounded)
(e) αxn −−−→ αx.
n→∞  
 1 1 
(f) If yn ̸= 0, for all n ∈ N and y ̸= 0 then, xynn −−−→ xy . (Hint Observe that  −  =
  n→∞ yn y
 yn − y 
 yn y . From yn − −−→ y, can you get a lower bound for all |yn |, when n is sufficiently
 
n→∞
large?)
1
Solution. We first show that yn
−−−→ y1 . Since yn −−−→ y, there exists N1 ∈ N such
n→∞ n→∞
|y|
that ∀n ≥ N1 , |yn | > 2
.
Hence we have the following:
 
 yn − y 
∀n ≥ N1 ,   < 2 |yn − y|. (1.1)
yn y  |y|2
Let ε > 0. Then there exists N2 ∈ N such that
|y|2
∀n ≥ N2 , |yn − y| < ε. (1.2)
2  
def  yn − y 
Take N = max{N1 , N2 }. From (1.1) and (1.2), it follows that, for all n ≥ N , 
 <
yn y 
2
|yn − y| < ε. Now xynn −−−→ xy is immediate in view of (3d).
|y|2 n→∞
1
 2
√ √
(g) If xn ≥ 0, for all n ∈ N, then xn −−−→ x. (Hint x = 0 case is easy. So assume x ̸= 0.
n→∞
√ √ |xn − x| |x − x|
Observe that | xn − x| = √ √ ≤ n√ .)
xn + x x
(h) If xn ≥ 0, for all n ∈ N, then x ≥ 0.
Sketch of the proof. How about proving by contradiction?

(4) Suppose that {xn }∞ ∞ ∞ ∞

n=1 , {yn }n=1 and {zn }n=1 are three sequence such that both {xn }n=1 and
{zn }∞
n=1 converges to ℓ ∈ R. Assume that, there exists N ∈ N such that ∀n ≥ N , one has
xn ≤ yn ≤ zn . Show that yn −−−→ ℓ.
n→∞

Solution. Observe that ∀n ≥ N , we have xn − ℓ ≤ yn − ℓ ≤ zn − ℓ. Let ε > 0. Then there

exist N1 , N2 ∈ N such that one has the following:
∀n ≥ N1 , |xn − ℓ| < ε,
and
∀n ≥ N2 , |zn − ℓ| < ε.
def
From this it is clear that ∀n ≥ N0 = max{N, N1 , N2 }, −ε < xn − ℓ ≤ yn − ℓ ≤ zn − ℓ < ε.

The above exercise (4) is referred to as the Sandwich theorem. This theorem is extremely useful in
many occasions to compute the limit of certain sequences.
def
(5) (a) Let 0 ≤ r < 1. Show that rn −−−→ 0. (Hint Put 1 + a = 1r , where a > 0 (why?). Now,
n→∞
n
for all n ∈ N, observe that (1 + a) ≥ na.)
1
Sketch of the proof. Thus rn ≤ na
, for any n ∈ N.
(b) Let r ∈ (−1, 1). Show that rn −−−→ 0.
n→∞

Sketch of the proof. Use (5a) with |r|.

1 1
(c) Let a > 1. Show that a n −−−→ 1. (Hint a > 1 implies a n > 1, so that one can write
n→∞
1
a n = 1 + hn . Now show that hn −−−→ 0.)
n→∞

Sketch of the proof. Observe that, for all n ∈ N, a = (1 + hn )n > nhn . So, for all
n ∈ N, 0 < hn < na .
1 1 2
(d) Show that n n −−−→ 1. (Hint Write n n = 1 + hn . Can you see h2n ≤ n−1
?)
n→∞

n(n−1) 2
Sketch of the proof. Observe that, for all n ∈ N, n = (1 + hn )n > 2
hn .

xn+1
(6) Ratio test: Let {xn }∞
n=1 be a sequence of positive real numbers and lim = λ. Then
n→∞ xn
show the following:
(a) If λ < 1, the lim xn = 0.
n→∞

Solution. Choose ε0 > 0 such that λ + ε0 < 1. Then there exists N ∈ N such that, for
all n ≥ N , one has xxn+1
n
< λ + ε0 . Let n ≥ N + 1. Then
xn xN +1 xN
0 ≤ xn = ... xN < xN (λ + ε0 )n−N = N
(λ + ε0 )n .
xn−1 xN (λ + ε0 )
Now Sandwich theorem yields xn −−−→ 0.
n→∞
 3

(b) if λ > 1, then lim xn = ∞ (i.e., ∀M ∈ R ∃N ∈ N such that ∀n ≥ N, xn > M ) The

n→∞
following will be used to prove (6b):
If a > 1 then an −−−→ ∞.
n→∞
n n
To see this, write a = 1 + b. Now a = (1 + b) > nb, for any n ∈ N. Let M ∈ R. Choose
N ∈ N such that N > Mb . Then clearly ∀n ≥ N , we have an > nb ≥ N b > M .
Solution. Choose ε0 > 0 such that λ − ε0 > 1. Then there exists N ∈ N such that, for
all n ≥ N , one has xxn+1
n
> λ − ε0 . Clearly,
xn xN +1 xN
∀n ≥ N + 1, xn = ... xN > xN (λ − ε0 )n−N = (λ − ε0 )n . (1.3)
xn−1 xN (λ − ε0 )N
Let M ∈ R. Since (λ − ε0 )n −−−→ ∞, as λ − ε0 > 1, so there exists N ′ ∈ N such that,
n→∞

(λ − ε0 )N
∀n ≥ N ′ , (λ − ε0 )n > M. (1.4)
xN
def
Put Ñ = max{N + 1, N ′ }. It now follows from (1.3) and (1.4) that, whenever n ≥ Ñ ,
xn > M .
(c) What can you say if λ = 1?
Sketch of the proof. How about the sequences {n}∞ 1 ∞
n=1 and { n }n=1 ?

(d) Do we need the positivity of xn ’s in the hypothesis of the ratio test? Explain your answer.

Sketch of the proof. How about the sequences {(−1)n }∞ n ∞

n=1 and {−2 }n=1 ?
∞
(−1)n−1

1 1 1
(7) (a) Show that 1 − + − + · · · + is convergent.
2 3 4 n n=1

Sketch of the proof. Observe that, for any m, n ∈ N with m > n, considering successive
terms we have
 
 1 1 1 1  ≤ 1 < 1.

 − +
n + 1 n + 2 n + 3 − · · · ±
m n + 1 n
(b) Let {xn }∞
n=1 be a sequence. Assume that there exist C > 0 and a > 1 such that
C
∀n ∈ N, |xn+1 − xn | ≤ n .
a
∞
Show that {xn }n=1 is convergent.
1
Solution. Let ε > 0. Since an
−−−→ 0, there exists N ∈ N such that one has the
n→∞
following:
1 a−1
∀n ≥ N, n
< ε. (1.5)
a aC
Let m > n ≥ N . Then, in view of (1.5), we obtain that
|xm − xn | ≤ |xm − xm−1 | + · · · + |xn+1 − xn |
 
1 1
≤C + · · · + m−1
an a
 
aC 1 1
= 1 − m−n
a−1 a an
aC 1
<
a − 1 an
< ε.
 4

(c) Suppose {xn }∞

n=1 is a sequence and α ∈ (0, 1) is such that the following holds for all
n ∈ N:
|xn+2 − xn+1 | ≤ α|xn+1 − xn |, ∀n ∈ N.
Then show that {xn }∞n=1 is convergent.

Sketch of the proof. Use (7b).

def
(8) Nested interval theorem: Let In = [an , bn ], ∀n ∈ N. Assume that, In+1 ⊆ In , for any
∞
\
n ∈ N and lim (bn − an ) = 0. Then, show that In contains only one point. (Hint Can
n→∞
n=1
you think of an exercise from the previous sheet which applies here?)
Solution. It is clear that {an }∞ ∞
n=1 is increasing and {bn }n=1 is decreasing. Observe that,
∞
∀n ∈ N, an ≤ bn ≤ b1 . This shows that {an }n=1 is bounded above, consequently it is convergent.
def
Let ℓ = sup{an : n ∈ N} = lim an . It now follows from lim (bn − an ) = 0 that {bn }∞ n=1 is
n→∞ n→∞
convergent, and furthermore, lim bn = inf{bn : n ∈ N} = ℓ. Thus ℓ ∈ In , for all n ∈ N. Let
n→∞
\∞
x∈ In . Then for all n ∈ N, an ≤ x ≤ bn . Now passing through limits, we see that x = ℓ.
n=1
∞
\
Hence In = {ℓ}.
n=1

2. Additional exercises
(1)∗ Are the following statements equivalent for a real sequence {xn }∞
n=1 ?
∞
(a) {xn }n=1 is Cauchy; and
(b) For any ε > 0, there is N ∈ N such that ∀n ≥ N , |xn+1 − xn | < ε.
Justify your answer.
n
(2) (a) Let a ∈ R. Does { an! }∞
n=1 converge? If so, then can you find its limit?
1
(b) Show that (n!) −−−→ ∞. (Hint You may use (2a).)
n
n→∞
1
(3) Let a, b ∈ R. Find lim (|a|n + |b|n ) n .
n→∞

(4)∗ Let {rn }∞ be an enumeration of all rational numbers in [0, 1]. Show that {rn }∞
n=1 n=1 is not
convergent.
(5)∗ Let a, b > 0. We define the following sequence recursively:
 
1 a
x1 = b, xn+1 = xn + , ∀n ∈ N.
2 xn
Is {xn }∞
n=1 convergent? If so, then can you find the limit?