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

2050A Solution 2

This document provides solutions to exercises on limits of sequences. It establishes that: (1) The limit as n approaches infinity of the sequence n2+1n is 0, using the definition of the limit of a sequence. (2) The limit as n approaches infinity of the sequence n+12n is 2, again using the definition of the limit of a sequence. (3) If sequences {xn} and {yn} converge, then the sequences defined by un = max{xn, yn} and vn = min{xn, yn} also converge, with the limit points being functions of the limits of {xn} and {yn}.
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)
63 views2 pages

2050A Solution 2

This document provides solutions to exercises on limits of sequences. It establishes that: (1) The limit as n approaches infinity of the sequence n2+1n is 0, using the definition of the limit of a sequence. (2) The limit as n approaches infinity of the sequence n+12n is 2, again using the definition of the limit of a sequence. (3) If sequences {xn} and {yn} converge, then the sequences defined by un = max{xn, yn} and vn = min{xn, yn} also converge, with the limit points being functions of the limits of {xn} and {yn}.
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

MATH2050a Mathematical Analysis I

September 2018

Exercise 2 suggested Solution


5. Use the definition of the limit of a sequence to establish the following limits.
n 2n
(a) lim n2 +1 =0 (b)lim n+1 =2
Solution:
(a) A sequence {xn } is said to converge to x, or that x is the limit of {xn },
if for every  > 0, there exists a natural number n , such that for all n ≥ n , we
have |xn − x| < .
since |( n2n+1 ) − 0| < n
n2 = 1
n, following from Archimedean property, there
exists n > 1 , so ∀n > n
|( n2n+1 ) − 0| < n
n2 = 1
n <
n
we have lim n2 +1 =0
2n
(b) since | n+1 − 2| = | 2n−2n−1
n+1 |= 1
n+1 , for each  > 0, similar with 5(a),
there exists (n + 1) > 1 , so ∀n > n
2n
| n+1 − 2| = | 2n−2n−1
n+1 |= 1
n+1 < 1
n +1 <
2n
Hence, we have lim n+1 =2.
14. Let b ∈ R satisfy 0 < b < 1. Show that lim(nbn )=0.[Hint:Use the Binomial
Theorem as the example 3.1.11(d)]
Solution:
Let b ∈ R and 0 < b < 1, we want to show lim(nbn )=0. Since 0 < b < 1, we
1 1
obtain b > 1. Let b = 1 + t, where t > 0. Then we have
n n
(nbn ) = (1/b)n = (1+t)n

By the Binomial Theorem , since n ≥ 1, we have

1
1 + nt + 12 n(n − 1)t2 + ... ≥ 1 + 12 n(n − 1)t2 ≥ 21 n(n − 1)t2
n 2 2
It follows that (1+t)n ≤ (n−1)t2 , ∀ > 0, there exists n ∈ N , such that n > t2  ,

hence, ∀n − 1 > n ,
n 2 2
|nbn − 0| = (1+t)n ≤ (n−1)t2 ≤ (n )t2 ≤
n
Hence,lim(nb )=0.
23. Show that if {xn } and {yn } are convergent sequences, then the sequence
{un } and {vn } defined by un := max{xn , yn } and vn := min{xn , yn } are also
convergent. (See Exercise 2.2.18.)
Solution:
according to Exercise 2.2.18, un = 12 (xn + yn + |xn − yn |), and vn = 12 (xn +
yn − |xn − yn |). Since {xn } and {yn } are convergent sequences,assuming that
limxn = a, limyn = b. Therefore, ∀ > 0, there exist N1 and N2 , such that
∀n≥ N1 , k ≥ N2 , we have
|xn − a| <  |yk − b| < 
Let N3 ≥ N1 + N2 , and so ∀n≥ N3 ,|xn − a| <  , |yn − b| < 
So ∀n ≥ N3 , |xn + yn − (a + b)| < 2, and ||xn − yn | − |a − b|| < 2, which means
that |un − 21 (a + b + |a − b|)| < |xn + yn − (a + b)| + ||xn − yn | − |a − b|| < 4.
Hence, {un } is a convergent sequence, and the limit point is limxn +limyn −
|limxn − limyn |. Similarly, we can prove that {vn } converges.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy