0% found this document useful (0 votes)
31 views2 pages

Tutorial 4

The document outlines a tutorial for the MTH111: Calculus course at IISER Tirupati, focusing on various problems related to the convergence of sequences. It includes specific problems marked with an asterisk that will be discussed in the tutorial, as well as hints and conditions for proving convergence. Additionally, it emphasizes the importance of boundedness in relation to convergent sequences.

Uploaded by

25f2003227
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
31 views2 pages

Tutorial 4

The document outlines a tutorial for the MTH111: Calculus course at IISER Tirupati, focusing on various problems related to the convergence of sequences. It includes specific problems marked with an asterisk that will be discussed in the tutorial, as well as hints and conditions for proving convergence. Additionally, it emphasizes the importance of boundedness in relation to convergent sequences.

Uploaded by

25f2003227
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

IISER Tirupati August Session 2025

MTH111: Calculus
Tutorial-4 (October 18, 2025)

Remark: Only the problems with an asterisk sign * will be discussed in the tutorial.

1*. Determine whether the following sequences {xn } converge or not. Find the
limit whenever the sequence converges.
n n+1
(A) xn = n+1
− n
sin n
(B) xn = n

Pn 1
2*. For n ≥ 1, let xn = i=1 i(i+1) . Prove that the sequence {xn } converges. Find
limn→∞ xn .
(Hint: xn can be written as a telescopic sum.)

3. Fix x ∈ R. Suppose {xn } be an infinite sequence of real numbers satisfying


1
the condition that for each n ∈ N, |xn − x| < . Is {xn } convergent? Why?
n

4. Prove that every convergent sequence must be bounded.

1
5*. Define a sequence {xn } by xn = 1 + 2
+ · · · + n1 . Does the sequence {xn }
converge? Justify your answer.
(Hint: Is {xn } a bounded sequence? If not, it cannot converge in view of
Problem 4.)

6*. Define a sequence {xn } by xn = 1 + 212 + · · · + n12 . Show that the sequence {xn }
converges.
1 1 1
(Hint: Use the fact that if k ≥ 2, then k2
≤ k(k−1)
= k−1
− k1 .)

7*. Define a sequence {xn } recursively as follows:



x1 = 1, and xn+1 = 2 + xn for all n ≥ 1.

Prove that the sequence {xn } converges and find its limit.
(Hint: Is the sequence monotone and bounded?)
8. (Sandwich theorem for sequences) Let {xn }, {yn }, {zn } be sequences satisfying
the condition xn ≤ yn ≤ zn for all n. Assume that

lim xn = L = lim zn .
n→∞ n→∞

Using the definition of limit, prove that

lim yn = L.
n→∞

∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗

You might also like