HOMEWORK 2

SHUANGLIN SHAO

Abstract. Please send me an email if you find mistakes. Thanks.

1. P38. #7.3

Proof. The sequences in (b), (d), (f ), (j),(p),(r), (t) converge; their limits
are 1, 1, 1, 27 , 2, 1 and 0, respectively.

The limit in (h) diverges because it is not bounded.

The limit in (l) diverges because it is a sequence consisting of0, 1, 1;

the
limit in (n) diverges because it is a sequence consisting of 0, 2 and 23 .
3

You can refer to Example 4 in Section 8 for a discussion. 

P38. # 7.4

1
Proof. (a). xn =
n 2
; Then
lim xn = 0.
n

Pn 1
(b). rn = k=1 k2 . Then
2
lim rn = .
n 6


2. P44. # 8.2

Proof. (b). limn bn = 73 . For any  > 0, we need to find N N such

that for any n N ,
 
 7n 19 7 
(1)  3n + 7 3  < .
 
1
In order for (3) to hold,
106 7
n> .
9 3
So we take N N and N > 106 9 7
3 . To conclude, for any  > 0, there exists
N N such that for n N ,
 
 7n 19 7 
 3n + 7 3  < .
 

Similarly in (d),
2
lim dn = .
n 5


3. P44. # 8.4

Proof. limn sn = 0: for any  > 0, there exists N N such that for
n N,

|sn 0| .
M +1
Then

|sn tn 0| |tn ||sn | M < .
M +1
This proves that limn sn tn = 0. 

4. P44. # 8.5(a)(b).

Proof. (a). This is proven in class. Please refer to the class notes.

(b). limn tn = 0: for any  > 0, there exists N N such that for any
n N,
|tn 0| = tn < .
Since |sn | tn ,
|sn 0| < .
Therefore
lim sn = 0.
n


5. P44. # 8.6

Proof. (a) (b).This is proven in class. Please refer to the class notes. 
2
 6. P45. # 8.8

Proof. (a).
p 1 1
0 n2 + 1 n = .
n2 +1+n n
1
Since limn n = 0,
p
lim n2 + 1 n = 0.
n

(b).For any  > 0, we need to find N N such that for any n N ,

p 1
(2) |( n2 + n n) | < .
2
We know that
 
p 1  n 1  n 1
|( n2 + n n) | =   = .
2 2
n +n+n 2 2
2( n + n + n) 2 2n

In order for (2) to hold, it suffices that

1 1
< , i.e., n > .
2n 2
1
We can take N N and N > 2. .

The proof in (c) is similar. 

7. P54. # 9.4

p
qp
Proof. (a).s1 = 1, s2 = 2, s3 = 2 + 1, s4 = 2 + 1.

(b).
Let A = limn sn . Then taking limits on both sides of sn+1 =
sn + 1.

A = A + 1.
Therefore
A2 A 1 = 0.

1 5
So A = 2 . Since A 0, we see that

1+ 5
A= .
2

3
 8. P54. # 9.5

Proof. Let A = limn tn . Obviously by math induction tn 0; then

2
tn+1 2tn 2. Taking limits on both sides of tn+1 = tn2t+2
2 2tn
n
, we see that
A2 + 2
A= .
2A
This proves that

A= 2.


9. P55. #9.9

Proof. (a). If limn sn = , for any M > 0, there exists N1 N such

that for any n N1 ,
sn M.
Taking n max{N0 , N1 } and then we see that
tn M.
This proves that limn tn = .

The claim in (b) is proven similarly.

(c). For the claim in (c), we prove it by contradiction. Suppose that

limn sn > limn tn . If limn sn = +, then by (a), we see that
limn tn = , A contradiction. if limn tn = , then limn sn =
, A contradiction. So we may assume that < limn tn < limn sn <
. Let
A = lim tn , B = lim sn .
n n
BA
Let  = 4 . For this  > 0, there exists N1 N such that for n N1 ,
B + 3A
A  < tn < A +  = .
4
Also for this  > 0, there exists N2 N such that for n N2 ,
A + 3B
= B  < sn < B + .
4
Since A < B,
3A + B B + 3A
< .
4 4
Therefore for n max{N1 , N2 }, tn < sn , A contradiciton. 
4
 10. P55. # 9.11

Proof. (a). Let

B = inf{tn : n N}.
As an infimum of real numbers,
B < .
So
< B < .
Since limn sn = , for any M > 0, there exists N N such that for
n N,
sn > M B.
Since B = inf{tn : n N}, tn B. Therefore
sn + tn > M,
which implies that limn (sn + tn ) = .

(b). The case where limn tn < is proven similarly as in (a). We

discuss the case where limn tn = . For M > 0, there exists N N
such that for n N ,
M M
sn > , tn > .
2 2
So we have
M M
sn + tn > + = M.
2 2
Therefore we have
lim (sn + tn ) = +.
n

The claim in (c) is proven similarly. 

11. P56. # 9.15

an an
Proof. If a = 0, then n! = 0. So limn n! = 0.

If a R and a 6= 0, we prove that

 n
a  |a|n
lim   = lim = 0.
n n! n n!

We write
|a|n |a| |a| |a| |a| |a|
= = |a| .
n! 1 2 n 2 3 n
5
Then
|a|n |a|
|a|n1 .
n! n
Therefore
|a|n
lim = 0.
n n!


12. P56. # 9.18

Proof. The proof is skipped. 

13. P64. # 10.1

1
Proof. In (a), n is a decreasing and bounded sequence.

(1)n
In (b), n2
is a bounded sequence.

In (c), n5 is an increasing sequence.

In (d), sin n
7 is a bounded sequence.

In (e), (2)n is neither increasing nor decreasing; it is not bounded either.

n
In (f ), 3n is a decreasing and bounded sequence. 

14. P65. # 10.3

Proof. We recall that sn = K + d101 + + 10dn

n for all n. Since each dj belongs
to the set {0, 1, 2, , 9}, we see that 0 dj 9. So
9 9 9 1
sn K + + 2 + + n = K + 1 n < K + 1.
10 10 10 10


15. P65. # 10.6

P n
Proof. (a). Since n=1 2 = 1, for any  > 0, there exists N N such
that for n N ,
X 1
< .
2n
nN
6
For m > n N ,

(3)
|sm sn | = |sm sm1 + sm1 sm2 + + sn+1 sn |
|sm sm1 | + + |sn+1 sn |
X 1
< .
2n
nN

Therefore we prove that {sn } is a Cauchy sequence. Hence it is convergent.

Pn 1
(b). We assume that sn = k=1 k . Then {sn } satisfies the condition

1 1
|sn+1 sn | = < .
n+1 n
P 1
However k=1 k is a harmonic series.

16. P65. # 10.7

Proof. By the completeness Axiom, = sup S exists. For any n1 > 0, there
exists n1 is not an upper bound, i.e., there exists sn S such that

1 1
< sn + .
n n
By the squeezing theorem,

lim sn = = sup S.
n

17. P65. # 10.9

Proof. (a). s1 = 1, s2 = 12 , s3 = 61 , s4 = 1
48 .

(b). Firstly sn 0. Then we prove that {sn }n1 is a decreasing sequence.

Then by the monotone convergence theorem, we see that limn sn exists.
7
Indeed,
n+1 2 n 2
sn+2 sn+1 = sn+1 s
n+2 n+1 n
n 2 n+1 2
sn+1 s
n+1 n+2 n
(4)
n+1 2
sn+1 s2n


=
n+2
n+1
= (sn+1 + sn )(sn+1 sn ).
n+2
Since s2 s1 0, inductively we prove that sn+1 sn for all n. Therefore
{sn }n1 is decreasing.

(c). In (b), we have proved that = limn sn exists. Taking limits on

n 2
both sides of sn+1 = n+1 sn , we see that
= 2 ,
which implies that
= 0, = 1.
1
Since s2 = 2 and {sn }n1 is a decreasing sequence, we see
= 0.

18. P66. # 10.12

Proof. (a). tn 0 for all n, and tn+1 tn for all n N. This proves
that {tn } is a bounded and decreasing sequence. Therefore by the monotone
convergence theorem, limn tn exists.

(b). From (c), limn tn = 21 .

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

(c). From tn+1 = (n+1)2
= n+1 n , by math induction, we prove that
n+1
tn = 2n .

Alternatively,
n+1 n1 n n2
tn = t2
n n n1 n1
n+1 n1 n n2 3 1
(5) =
n n n1 n1 2 2
n+1
= .
2n
8
(d). From (c), limn tn = 21 .

Department of Mathematics, KU, Lawrence, KS 66045

E-mail address: [email protected]