Limit of sequences

10000
1.

(a)

lim

10000 n

1+

lim

(c)

Since

n2

n +1

1+ 0

=0

n +1 n

-1 sin (n!) 1

n2

n + 1 n = lim

(b)

= lim

n +1

n +1 + n

n lim
n
1 n
1+
n

lim

) = lim
n

n2

n +1

lim
n

n +1 + n

n +1 + n

=0

n N.

n 2 sin( n!)
n +1

)(

n 2 sin( n!)
n +1

n2

n +1

lim

n 2 sin( n!)
n +1

lim
n

n2

n +1

1
3

2
n 0 lim n sin( n!) 0
n
n
1
n +1
1+
n

lim

By sandwich theorem, result follows.

n

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

(d)

2.

lim

2
+1
1
1 0 +1 1
= lim 3 n +1
=
=
n
3
3 0 +1 3
2
+1
3

1 + a + a 2 + ... + a n

1 a n +1 1 b
(1 a )(1 + a + a 2 + ... + a n ) 1 b
=
lim
=
1 a n (1 b )(1 + b + b 2 + ... + b n ) 1 a n 1 b n +1 1 a

1 b

(e)

lim

(a)

2
n 1
1
1
1 + 2 + ... + ( n 1)
lim 2 + 2 + ... + 2 = lim
= lim
2
n
n

n
n
n
n
n2

or

(b)

1 + b + b 2 + ... + b n

2
n 1
11 2
n 1
1
lim 2 + 2 + ... + 2 = lim + + ... +
=

n
n
n
n
n
nn n
n

When

When

lim

n
L=

is even,

is odd,

L = lim
n

L = lim
n

1
n

1
n

or

xdx =

x2 1 1
=
2 0 2

(1 2) + (3 4) + ... + [( n 1) n ] = lim
n

[n ( n 1)] + ... + (3 2) + 1 = lim

n

1 n +1
n

1
n

n
2

1
2

1 1 1
= lim 1 + =
n
2 n 2

2
n
1 2 3
lim + ... + ( 1) n does not exist
n
n n n
n
since it is equal to

L = lim

Note that :

(c)

( n 1) n 1
1 1

= lim
1 =
n

2 2
n 2

1
2

when n is even

and

1
2

when n is odd.

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

= lim
1 1 2 =
3
n

6
n
n
6
n 3
2
2
2
1 1 2
n 1
...
+
+
+

=
n
n
n n n

L = lim

1
0

x 2 dx =

x3 1 1
=
3 0 3
1

(d)

n 3
n

L = lim

(2i 1)2 = lim

i =1

( 4i

i =1

= lim

1 n
1 4
4
(4n 2 1) = lim
3=
3

3 3n 3
n 3

Let

x=

(e)

n 3
n

1
2

2x = 1 +

2
5

+ ... +

+ ... +

4i + 1) = lim 3
n
n

2n 1

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

4
+ n
4

6
2

(1)

2n

2n 1

(2)

2 n 1

1
1
1 1
1
2n 1
(1) (2), x = 1 + 1 + + 2 + ... + n 2 n = 1 + 2
1
2 2
2
2
1
2
n

1 2n 1
L = lim 1 + 2 1 n = 3
n
2

n 1

2n 1
2n

1 n 2n 1
= 1 + 2 1 n
2
2

(f)

1
1
1
1
1

1 1 1
1
lim
=1
= lim 1
+
+ ... +
= lim 1 + + ... +

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

(g)

L = lim
n

1
1 1 1
n
n
2 4 2 8 2 2 2 = lim 2 2 2 4 2 8 ...2 2
n

1 n
1
1 n
1 1
1 1 1

= lim 1 = 1
log 2 L = lim + + + ... + n = lim
n
2 2 n 1 1 n 2
2 4 8

3.

(a)

L = 2.

Method 1

To prove

P(n) :

(n 5)

2n > n2

For P(5), 25 = 32 > 25 = 52 .

Assume
For

P(5) is true.

kN,

P(k) is true for some

n 5.

2k + 1 = 2k .2 k2 . 2,

P(k + 1),

(*)

, by (*)

= k + k = (k + 1) + (k 2k 1) = (k + 1)2 + [(k 1)2 2]

2

(k + 1)2 + [52 2]

(k + 1)2.

P(k + 1)

is also true.

By the Principle of Mathematical Induction, P(n)

Therefore n N ,

Since

lim

1
n

= 0,

n 5,

0<

0 lim
n

n
2
n

<

n
n

lim
n

=
1
n

1
n

is true n N ,

n 5.

, by P(n) above.

= 0.

By sandwich theorem, result follows.

Method 2

For

Take

n > 2,

2 n = (1 + 1) n > 1 + n +

and

n ( n 1)
2

0<

n
2

<
1+ n +

n
n (n 1)
2

apply Sandwich theorem, result follows.

2

3.

(b)

0<

2n
n!

0 lim
n

(c)

2 2 2 2 2
2
2 2
2 2 2
... < 2 1 ... = 2
3 3 3
1 2 3 4 5
n
3 3

2
lim 2
n! n 3

2n

n 2

=0

First we like to prove that

Let

0<

a=1+h,

n
a

0 < lim
n

(1 + h )

n
a

lim
n

lim
n

1 + nh +

2
(n 1) h

Let
lim
n

(d)

a=b ,
nk
an

Let
0<

an

=0,

=0

an

where

h2

2
( n 1) h 2

, by Sandwich Theorem.

k = constant

a > 1.
k0.

since the identity is obvious true where

a>1,

b>1.
k

= lim n = 0 k = 0
k n
n
n

(b )
b

be a fixed natural number greater than

a , then for

n>k,

a
a ak a
a a a a a
=

<

n! 1 2 3 k k + 1 k + 2 n k! n
n

an
n!

ak a

n
k! n

lim

|q| < 1.

0 < nq n =

>

n
(1 + h )

0 lim nq n lim
n

(i)

If

a > 1,

lim
n

1,

=
1 + nh +
2

(n 1)h
put

let

=0

Taking limit
(ii)

If

(iii) If

Now,

n!

=0,

by Sandwich Theorem.
h>0

<
h 2 + ... + h n

n
n ( n 1)
2

q=

and

1+ h

(n 1)h 2

h2

lim nq n = 0 , by Sandwich Theorem.

n

a n = n a 1 , then

an > 0 .

1 + na n (1 + a n ) = a .
n

0 < an

Hence

a 1
n

n and using Sandwich theorem, result follows.

a = 1, the result is obvious.

0 < a < 1, then put

Since
If

an

= 1 + h.

n
n (n 1)

By Bernoullis inequality,

(g)

nk

an

(f)

h 2 + ... + h n

lim

n
n ( n 1)

<

lim

nk

= lim

lim 0 lim

(e)

h>0.

=0

k>0,

since

=0

an

Now we like to prove that

We can assume that

n
n ( n 1)

By sandwich theorem, result follows.

a > 1,

since

n 2

b > 1, by (i),

an = n n ,

b = 1/a .
lim n b = 1
n

let us write

n = ann = (1 + bn)n =

lim n
n

an = 1 + bn , where
1 + nbn +

n(n 1)
2

1
a

=1

1
n

lim a

=1

lim n a = 1
n

bn > 0.

b n + ... + b n >
2

n(n 1)
2

bn .
3

0 < bn <

Thus,

n 1
lim a n = lim(1 + b n ) = 1 .
n

0<n

(h)

0 lim b n lim
n

1
n!

1
1 1
1 1
= 2n

...
n n ( n 1) ( n 1)(n 2) 3 2 2 1
( n!)
1

= 2n

1 1 1
1

1 1
+
+

+
+ ... +
3 2 2 1
n n n ( n 1) ( n 1)(n 2)

<2

1 1 1
1 1
1
1 1 1
+

+ ... + + 1 =
+

2 3 2
n n n 1 n n 2 n 1
0 lim n

n!

lim

=0

lim n

=0
n
n!
Note : 3(f), (g), (h) can be proved by the result of No.7.

(A.M. > G.M.)

1
n

, by Sandwich Theorem.

lim a n = a > 0 , N N s . t . n > N a n a <

n

lim a n = a

> 0, N N s.t. n > N a n a a n a <

The converse is not true.

an

Counterexample :

lim ( 1) n = lim1 = 1
n

So that,
Since

Then

lim b n = 0 lim
n

b1 + b 2 + ... + b p

n
b1 + b 2 + ... + b n

b1 + b 2 + ... + b n

n
b p+1 + b p+2 + ... + b n

+
n
n
n
lim b n = 0 , we can choose p so that for n > p,

After choosing

(2) and (3) ,

< 2

we can choose
(1) becomes:

+ ... +
n

2 =

N so that

2<
n
2

n > N > p,

b1 + b 2 + ... + b n
n

( n p)

(1)

|bn| < /2.

b p+1 + b p+2 + ... + b n

=0.

b p+1 + b p+ 2 + ... + b n

n
b1 + b 2 + ... + b p

Then

does not exist.

we must prove that

b1 + b 2 + ... + b n

Now,

an = (-1)n.

exist.

Let an = bn + a,

Consider

lim( 1) n

is an oscillating sequence and

But
5.

lim b n = 0

<2

4.

=0

n 1

<

(2)

b1 + b 2 + ... + b p
n

for

<

(3)

n>N.

Thus proving the result.

6.

lim a n = a > 0, n N s.t. n > N a n a < a

n

log e a n log e a = log e

(Note :

loge (1 + x) < x

and

an > 0

a a a n a a
= log e 1 + n
=
=
<

a
a
a
a

an

for

( since

a>0)

lim log e a n = log e a

n

x > -1 , x 0 . )

7.

By (6),

lim a n = a

By (5),

lim

lim log e a n = log e a

(a>0),

log e a 1 + log e a 2 + ... + log e a n

= log e a

lim log e n a 1a 2 ...a n = log e a

n

lim n a 1a 2 ...a n = a
n

8.

9.

b1 = a 1 ,

Put

a2

b2 =

an

a1

Then

lim b n = lim

By (7),

lim n b1b 2 ...b n = b

Put

a n +1
an

a n 1

= lim

a n +1

( 2n )!
( n!)

an
a n 1

(say)

lim n a 1
n

a n +1 =

then

=b

an

an =

bn =

...,

a2
a1

an

...

a n 1

= lim
n

a n +1

lim n a n = lim
n

an

a n +1
an

[2(n + 1)]!
.
[(n + 1)!]2

1
2

2 + 2 +
( 2n + 1)( 2n + 2)
n
n .
=
=
2
2
( n + 1)
1
1 +
n

lim
n

a n +1
an

=4 .

1/ n

By

10.

( 2n )!

lim a n = lim
2
n
n
( n!)
n

No. 4,

First we like to prove that

yn

1
n

n +1

n +1

1
n +1

n+2

n+2

yn > yn+1 .

1
1

1
n +1

n+2
=

n +1

n +1

n+2

lim y n

1
lim1 +
n
n

1
y n = 1 +
n

1
1

1 1

n +1

= 1 +

n +1

is monotonic decreasing .

=4 .

n +1

n +1

<

n +1
=

n +1

1
1

1 + ( n + 1)1 n + 1

1 + ( n + 1)

n +2

, A.M. > G..M.

n+2

= y n +1

It is also bounded below since

yn > 0 .

exists.
n +1

1 1
1
1
= lim1 + 1 + = lim1 + lim1 + = e .
n
n

n
n
n n

11.

1
x n = 1 + ,
n

Let

yn =

r!
1

r =0

2
k
n
n 1 n 1
n 1
n 1
1
x n = 1 + = 1 + + + ... + + ... +
n
1 n 2 n
k n
n n

= 1+1+

Since

xn < 2 +

k < n,

Clearly,

xn < yn

a n +1 a n =

1
ln 1 + ,
n
n

n +1
n

n +1

<

n +1

dx
x

<

n +1

dx

+ ... +

1
n +1

, by Sandwich theorem.

1
ln 1 +
n
n +1
<

<

1
n

1 1
< ln 1 + <
n n
n +1
1

b n +1 b n < 0 .
and

{bn}

is monotonic decreasing.

an < bn .

Hence

a1 = 0

is the lower bound of

bn

bn > an > an 1 > > a1.

and

b1 = 1

is the upper bound of

an

an < b n < < b 1 .

lim(a n b n ) = lim
n

0 < an =

But
If

lim a n = lim b n
n

an > 0

a1 > 2,

a2 =

a n +1 2 =

an > 2,

Similarly, if

0 lim a n lim

n , we have ,

as

It can be seen that

Now,

=0

lim a n , lim b n exists.

3 5 7
2n 1
1
1
...

<
4 6 8
2n
2n + 2 2n + 2

Taking limit
14.

By Monotone Bounded Convergence theorem,

13.

we have

is monotonic increasing

Furthermore,

b n +1 b n =

n < x < n + 1,

dx

= yk
2! 3!
k!
lim y n exists and is equal to

and so as

a n +1 a n > 0,
{an}

e 2+

Since for

1 1 1 1 2
1 1 k 1
1 + 1 1 + ... + 1 ...1

2! n 3! n n
k! n
n

n , we have:

Letting

12.

1 1 n 1
1 1 1 1 2
1 1 k 1
1 + 1 1 + ... + 1 ...1
+ ... + 1 ...1

2! n 3! n n
k! n
n
n! n
n

1 + an

then

6
1 + a1

2=

, then

2n + 2

=0

lim a n = 0 .
n

nN.
<

6
1+ 2

= 2.

4 2a n

an 2 > 0,

an < 2

1 + an

from (*)

2( a n 2)

(*)

1 + an
since

1 + an > 0,

we have

an+1 2 > 0

or

an+1 > 2.

an+1 < 2.

By the Principle of Mathematical Induction,

a2k 1 > 2 ,

a2k < 2

kN.

a n+2 a n =

Now,

6
1+ an

If

n = 2k 1 , then

If

n = 2k , then

{ a2k 1 }
{ a2k }

a=

b=

1+

and

a 2k+2 =

7+a

7 + a 2k1

(a 2k 2)(a 2k + 3)

7+b

{ a2k }

6(1 + a 2 k 1 )

b=2

a n +1 1 =

to

a = lim a 2 k = lim a 2 k + 2 ,
k

a=2

(a = - 3 is rejected as

we get

a > 0)

2.

k , putting

The sequence

an > 0

an >1

a n +1 a n =

1
1
a n +
an
2

an+1 - an < 0 ,

an+1 < an.

{ an }

lim a n

a2k 1 > 2.

b = lim a 2 k 1 = lim a 2 k +1 ,
k

{ a2k 1 } is also convergent

to

we get

2.

lim a n = a = b = 2 .
n

nN.

2
2
2
1
1
a +1
a + 1 2a n (a n 1)
a n + 1 = n
1 = n
=
>0
2
an
2a n
2a n
2a n

a n +1 > 1

Since

7 + an

2.

(a + 3)(a 2) = 0,

is convergent

It can be seen easily that

since

(a n 2)(a n + 3)

2.

k , putting

. Take limit

7 + a 2 k 1

< 0,

7 + an

> 0, since a2k < 2.

7 + a 2k

. Take limit

7 + a 2k

an + an 6
2

an =

have limits.

a2 + 7a 6 = 0 ,

a 2 k +1 =

6(1 + b )

{ a2k }

6(1 + a 2 k )

The sequence

Now,

7 + an

(a 2k1 2)(a 2k1 + 3)

Since limit of a sequence is unique if exists,

15.

6(1 + a n )

1+ an

a 2k+1 a 2k1 =

a 2k+2 a 2k =

an =

is increasing and is bounded above by

6(1 + a )

Since

is decreasing and is bounded below by

{ a2k 1 }

Since

an =

n N

(1)

2
2
2

(1 a n )(1 + a n )
a + 1 2a n
1 a n
a +1
a n = n
an = n
=
=
< 0 , by (1).
2a n
2a n
2a n
2a n

is decreasing and is bounded below by

a n +1 =

exists.

Let

1
1
a n +
an
2

1.

L = lim a n = lim a n +1
n

take

n ,

we have

L=

1
1 L2 + 1
L
+
=

2
L
2L

2L2 =L2 + 1
L2 = 1

Since

an > 0,

L > 0,

L = 1.

16.

(i)

an

is strictly increasing

Let

P(n)

be the proposition :

For

P(1),

a1 = 6 ,

a 2 = 6 + 6 > 6 + 0 = 6 = a1

is true for some

kN.

Assume

P(k)

(1)

P(k+1)

an < an+1.

i.e.

ak < ak+1

an

is true.
is true nN.

is bounded above.

Since

a n = 6 + a n1 a n = 6 + a n1 a n =
2

an > 0,

But

an > an-1 > > a1 =

n ,

By taking
Since
(i)

(ii)

un =

( n + 1) + 2

2n 3
n+2

an

exists.

and
=2

un
1

n+2

2n 3
n+2

2n + 5
n+3

2n 3
n+2

<2

un

diverges.

(b)

Sn

converges.

(c)

Sn

diverges.

(d)

Sn

converges.

(e)

Sn

diverges.

(f)

Sn

converges.

(g)

Sn

diverges.

It is unbounded.

It is true that

Sn

(h)

Sn

diverges.

It is unbounded.

It is true that

Sn

a
n =0

= 1+

+1

L = lim a n = lim a n+1

n

2 + 3/ n
1+ 2 / n

=2.

It is bounded.
Sn 0

as

It is unbounded.
Sn 1

n .
It is not true that

as

n .

as

n .

Sn

as

n.

It is bounded.
Sn 0

However, it is not true that

take

an <

lim u n = lim

Sn

No,

+ 1 , an is increasing.

an

is bounded above.

(a)

(a)

is a montonic increasing sequence.

19.

Let

<

(2 n + 5)( n + 2 ) (2 n 3)( n + 3)
1
=
>0
( n + 2 )( n + 3)
( n + 2 )( n + 3)

By Monotone Bound Theorem, the limit lim u n exists.

18.

an

an

a n 1

a n = 6 + a n1 L = 6 + L L2 L + 6 = 0 ( L 3)( L 2) = 0

2( n + 1) 3

un+1 > un

<

L = 3.

L > 0,

u n +1 u n =

lim a n

(iii) By Bounded Monotone Theorem,

17.

(1)

a k +1 = 6 + a k < 6 + a k +1 = a k+2

6 + ak < 6 + ak+1

By the Principle of Mathematical Induction, P(n)

(ii)

an = 1/n ,

Sn +

as

n.

an 0

as

n.

then

as
as

n.
n.

1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1
+ + + + + + + ... > 1 + + + + + + + + ... = 1 + + + + ...
2 3 4 5 6 7 8
2 4 4 8 8 8 8
2 2 2

Since the last series diverges,

an diverges.

(b)

Yes, put
an

sn = a1 + a2 + + an .

converges, then

lim s n exists and is equal to

> 0, N N s.t. n > N s n L < / 2

Then , for this

N,

L , say.

s n1 L < / 2

and

n > N,

a n 0 = s n s n1 = (s n L ) ( L s n1 ) < s n L + L s n 1 < / 2 + / 2 = .
(c)

| an |

If

lim a n = 0.
n

is convergent, then by Cauchy definition:

> 0, N N s.t. n > N , p N a n+1 + a n+2 + ... + a n+p <

(d)

0 < a n +1 + a n +2 + ... + a n < a n +1 + a n+2 + ... + a n + p <

an

No,

take

is convergent.
a n = ( 1)
s n+p s n =

Proof :
>0, take

s n+p s n =

Take

20.

an =
an =

1
n2 + 1
1
n2 + 1

n +1

n2 + n

n
n2 + n

1
2

(a)

1
n+2

is convergent.

n+3

... + ( 1)

<

<

n+p

n > N, s n + p s n <

if

p 1

n +1

<

1
n

holds.

is not convergent.
1

n+2

1
n+p

1
2

>

n+p

1
n+p

If we take

+ ... +

n2 + n
1

+ ... +

n2 + 2

n2 + n

< an <

<
>

1
n2 + 1
1
n2 + n

n2 + 1

+ ... +

>

n+p

p
n+p

, no matter how large is N, we cannot have

+
+

1
n2 + 1

+ ... +

1
n2 + n

n2 + 1

+ ... +

<

1
n2 + n

n2 + 1
>

n
n2 + n

(1)

n.

= lim
n

1
1 + 1/ n

=1

Assume that

lim
n

n
n2 + 1

= lim
n

1
1 + 1/ n2

=1.

12

P(1),

and

lim a n = 1 .

x1 = 21 2 , ... , x n = (2 x n 1 ) .
For

an

then

=.

By Sandwich theorem,
21.

n +1

s2 n sn >

n2 + 2

Taking limit as
lim

(1/n)

p = n,

s2 n sn <

N = [1/] , then

an =

But

x1 = 2 < 2

First we like to prove that

P(1)

P(n) : xn < 2

n N.

is true.

P(k-1) is true for some k N, i.e.

xk-1 < 2.
9

For

x k = (2 x k 1 )

< (2 2 )

1/ 2

P(k),

1/ 2

=2
n N.

By the Principle of Mathematical Induction, P(n) is true

Now, x n = (2 x n 1 )

12

xn

x n 1

2
xn

=1,

since

is an increasing function and is bounded above by

By the Monotone Bound Theorem,

Since

by taking

Since

xn > 0,

n N.

xn > 0

(ii)

Claim:

L = (2 L )

and

xn < 2.

2.
L (say).

L2 = 2 L L = 0,2

1/ 2

L = 2.
12

(i)

12

xn > 0

exists and is equal to

lim x n

x n = (2 x n 1 )

n,

x1 = c1 2 , ... , x n = (c + x n 1 )

(b)

xn

x n = 2 x n1

, c > 0.

(obviously true, or prove by math. induction)

n N.

xn < xn+1

x1 = c < c + c = x 2

Use M.I.

x n 1 < x n c + x n 1 < c + x n c + x n1 < c + x n x n < x n+1

22.

u n +1 =

(i)

6(1 + u n )
7 + un

(ii)

un+1 < un

Similar to

2=

6(1 + u n )
7 + un

and

un

4u n 8

un =

un+1 > un

and

6(1 + u n )
7 + un
un

un =

n N.

Limit exists in both the above cases. Let

6(1 + L )
7+L

un < 2

n N.

>0

lim x n = lim x n+1 = L , then from

n

( L 2 )( L + 3) = 0 L = 2 .
L > 0.

un > 0

0<ba

(*)

is monotonic increasing.

un < 2

is rejected since

, L > 0.

un+1 > 2.

7 + un

is bounded above in (ii) since

u n = n a n + bn ,

7 + un

( u n 2 )( u n + 3)

un

L = -3

is monotonic decreasing.

n N.

L=

1 + 1 + 4c

< 0.

7 + un

un > 0

7 + un

4( u n 2 )

un > 2

( u n 2 )( u n + 3)

is bounded below in (i) since

6(1 + u n )

7 + un

un

u n+1 =

23.

7 + un

(i) , we can use mathematical induction to show that

u n+1 u n =

6 + 6u n 14 2u n

un > 0 , n N. Hence by (*),

Now, u n+1 u n =

L= c+L L=

u1 = c > 2

7 + un

It is clear that

12

6(1 + u n )

u n+1 2 =

x n = (c + x n1 )

lim x n = lim x n +1 = L ,then

(iii) Let

b
a

b
1,
a

a = a n a n + b n = a n ( b / a ) + 1n 1n + 1n = a (2 )
n

Taking limit as

n and using Sandwich theorem,

1/ n

lim u n = lim a n + b n = a .
n

10

24.

We like to use Math. Induction to show that

For

Assume
For

P(k)

a < xk < b

(since

a a + c = 0)

xk+1 = xk2 + c < b2 + c = b

(since

b2 b + c = 0)

and

P(k + 1)

is also true.
n N.

By the Principle of Mathematical Induction, P(n) is true

We like to use Math. Induction to show that
P(1),

a, b

P(n) :

xn+1 < xn

x2 x + c = 0

are roots of

P(1)

P(k)

n N.

is true for some

xk+1 < xk

P(k + 1),

25.

xn

xk+1 < xk

xk+1 < xk

n ,

xn+1 = xn2 + c,

(a)

We like to prove that

n +1

But

n +1
3

Take

<

1
N = ,

sin n
n

<

or if

1/n <

Take

1
N = ,

n 1
2

Take

n +1
n +1
3

and

hb<0)

<

<

> 0,

n + n +1

<

n +1
n3 + 1

lim x n = lim x n +1 = L .

Let

n +1
n3 + 1

< n2 >

or

(L=b

is rejected)

<.
1

<.

N() > 0,

< ,

P(k + 1) is true.

n>N

since

sin n
n

<.

|sin n| < 1.

n > 1/.

then

n>N

> 0,

n + ( 1)

sin n
n

< .

N() > 0,

n>N
n +1

n 1
2

1
N = 1 , then

|un+p - up | =

is true if
or if

n>N

n N.

N() > 0,

n>N

then

We like to prove that

But

ha>0

xk+2 < xk+1

L = L 2 + c L2 L + c = 0 L = a

> 0,

We like to prove that

n + ( 1)

(d)

as

We like to prove that

But

(c)

ab = c

n N.

for some

xk+1 + c < xk + c

is bounded and is monotonic decreasing, limit exists.

By

(b)

and

a<h<b

since

By the Principle of Mathematical Induction, P(n) is true

Since

h2 h + c < 0 )

is true.

Assume
For

n N.

(since

a+b=1

h2 h + c = h2 (a + b) h + ab = (h a)(h b) < 0

is true

x2 = x12 + c = h2 + c = (h2 h + c) + h < h

x1 = h ,

(Note that

(1)

xk+1 = xk + c > a + c = a

a < xk+1+ < b

For

n N.

is true

is true.

n N.

is true for some

P(k + 1),

P(1)

a < x1 = h < b.

P(1),

P(n) : a < xn < b

<

( n 1)

n>N

n + ( 1)
n2 1

> 0,

N() > 0,

( p + 1)n

( p + 2 )n

n 1
2

n + ( 1)
n2 1

<

< ( (-1) n 1)

1
n 1

<n>

<.
p > 0, n > N |un+p - up | <

+ ... + ( 1)

n +1

(n + p) 2

<

is true

11

if

(e)

( p + 1)n

<

<n>

> 0,

We like to prove that

2 n1 2 >

we have > 0,

26.

(a)

(b)
(d)

n = 2k,

When

n = 2k 1 ,

(c)

(e)
(f)

=1

2k
lim

2k 1

=1

r2k 1 1.

rn 1.

M > 0, N > 0,

is true

n > M2.

if

n > N |n1/2| > M

|n1/2| > M.

N = M2 , n > N

Take

1 1
1

lim 1 + + + ... + = . See solution in No. 19 (d).

2 3
n
lim log 10 n =
|log10 n| > M
> 0,

1/ > 0,

Yes. Proof :

is true if

n > 10M.

N() > 0,

n > N xn < .

N() > 0,
N() > 0,

n > N |log10 n| > M

N = 10M, then

Take

n > N 1/ x n >

lim

xn has limit xn

xn A ,

> 0,

N() > 0,

n > N |xn A| <

yn B,

> 0,

N() > 0,

n > N |yn B| <

The converse is not true.

xn = n,

0<

Take

1
n

1
( n + 1)

+ ... +

n , 0

1
n

xnyn = 1,

(2 n )
+

<

1
( n + 1)

1
n

+ ... +

Take

M = [1/], then

1
xn

=.
|xn| < M .

is bounded

|xn| |yn B| + |B||xn A|

+ .... +
1

(2 n )

|log10 n| > M .

lim x n y n = AB .

|xnyn AB| < M + B = (M + |B|)

Take

n>N

since x n 0 .

n > N 1/ x n > M .

xn A , yn B .

Let

M > 0, N > 0,

We like to prove that

lim x n = 0.

(a)

n1 2 + n1 2 >

n1 2 < .

12

|xnyn AB| = |xnyn xn B + xn B AB| |xnyn xn B| + |xn B AB| =

29.

r2k 1.

(2 k 1) + 1

+ n1 2 >

M > 0,
28.

2k 1

We like to prove

|n1/2| > M

n > N ( n + 1)

12

But:

1
N=
,
2

Take

n1 2 < .

3/2

lim n 1 / 2 = .

But
27.

lim

But

12

< ( n + 1)

12

n>

N() > 0,

When

(n + 1) + n
12

n > N |un+p - up | < .

then

n > N ( n + 1)

N() > 0,

(n + 1)1 2 n 1 2 < (n + 1)1 2 n 1 2 =

n 1 2 + n1 2 >

1
N = ,

. Take

yn = 1/n .
1
n

lim

<
1
n

n
n

=0

1
n
lim

1
n

1
( n + 1)

+ ... +

(2 n ) 2

=0

12

n
1 n
1
1
1 / 1
1
1 + + ... + n
2 3
2 = 3
2
2 = lim 2
= lim
lim
n
n
n
n
n
1
1

1
1
1
2
2
1 + + ... + n
1 / 1
1
4
4

4
4
4

(b)

(sin n!) is bounded and

(c)

lim

n 1

= lim

n2 1

n 1
lim (sin n! ) 2
=0
n
n 1
18

1
n +1

=0

1
1
1
1
1 1 1 1
1
1
lim
+
+ ... +

1 = 1
+ + ... +
= lim
= lim

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

lim

2n 2 + 1
n2 1

= lim

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

=2,

1
1 2n 2 + 1
1
n 1
lim (sin n! ) 2

+
+
...
+

= 2
n
n + 1
( n 1) n n 2 1
1 2 2 3

18

n
( 2 ) n + 3n
( 2 / 3) n + 1 1
3 n [( 2 / 3) + 1]
1
=
lim
=
lim
=
n
( 2 ) n +1 + 3n +1 n 3n +1 [( 2 / 3) n +1 + 1] 3 n ( 2 / 3) n +1 + 1 3

lim

(d)

30.

Put

a = 1 + b,

given that

a n = (1 + b ) > 1 + nb +
n

n ,

Take
0<

n5
2n

Take

31.

(a)

(1 + 1)n

lim

tan

sin
(b)

lim
n

<

n
a

b2

lim
n

1
a

<

1
1 + nb + n ( n 1) b / 2
2

n
1 + nb + n ( n 1) b / 2
2

5
2

n = lim 5
n
1

sin

n
5

1
n = lim

sin

n5
2n

<

lim

where

n
1 + nb + n ( n 1) b 2 / 2

n
an

=0.

n 6.

=0.

tan

n 2 = lim 5 sin x
x 0
1
x

n2

n2

lim

1 + n + n ( n 1) / 2 + ... + n ( n 1)...( n 5) / 6!

and use Squeeze Theorem,

0<

=0

n5

n2

(c)

n5

sin

n ( n 1)

0 lim

b>0

a>1

tan x
x

=5

n2

1
n n = lim sin x lim n = 1 =
x 0
x n

2
ln1 +

n = 1 lim[x ln(1 + x )] = 1 lim x lim[ln(1 + x )] = 1 0 0 = 0

lim
2
n
2 x 0
2 x 0 x 0
2
n
x=
n

(d)

(e)

lim

lim

1 + 2 + ... + n
n +1
2

= lim

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

n2 + 1 + n n2 1
n +1

= lim

1
2

lim

n2 + n
n +1
2

1
2

lim

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

1 + (1 / n )

1 + (1 / n

)
1 (1 / n 2 )
2

1
2

=0

13

32.

Given that
xn
x n 1

x1 = 1 , x 2 = 2

x n 1 x n 2

x n 1

x n = 2 ( 1 / 2 )

n 2

x n 2
x n 1

x n = x n 1x n 2

and

x
= n 1
x n 2

1 / 2

x
= n 2
x n 3

(n>2)

( 1 / 2 ) 2

x
= ... = 2
x1

n 2
n 3
1
x n 1 = 2 ( 1 / 2 ) 2 ( 1 / 2 ) x n 1 = ... = 2 exp
2

n2

( 1 / 2 ) n 2

= 2 ( 1 / 2 )

1
+
2

n 2

n 2

1
+ ... + x 1
2
0

1 ( 1 / 2 )n 1
3 1 n
= 2 exp
= 2 exp 1 .
1 ( 1 / 2)
2 2

lim x n = 2 3 / 2 = 2 2 .

33.

a > b > 0 , a1 =

(a + b ),

b1 =

anbn = an-1bn-1 = = a1b1 = ab .

an =

bn =

2a n 1b n1

(a n1 + b n1 )

a n 1 + b n 1

a+b

an =

Obviously

(a n1 + b n1 ),

bn =
since
.

(1)

b n ab

(2)

2a n 1b n1
a n1 + b n 1

a > b > 0.

a n ab
2

a n b n = ab

H . M .G . M .

an > 0, bn > 0,

a n b n = ab

A . M .G . M .

2ab

2
1
1
ab 1 ab a n1
0 , by (1)
=
a n a n1 = a n (a n 1 + b n 1 ) = a n a n1 +
2
2
a n 1 2 a n 1

b n b n 1 =

2a n 1b n 1
a n1 + b n1

ab a n a n 1 ,
an

a n 1b n 1 b n1
a n1 + b n 1

ab b n b n 1 .

is montonic decreasing and is bounded below.

lim a n = lim a n1 = L ,

Let

34.

b n 1 =

an =

(i)

x n+1 x n =

(a n1 + b n1 ),

bn =

(a n1 + b n1 ) = a n1 +
2

x n x n1 =

3(1 + x n )
3 + xn
3 x n1

2a n 1b n 1
a n1 + b n1

L=

L+M

(ii)

xn

L+M

ab
1
ab
L = L + L = ab
a n 1
2
L

xn =

3 xn

3(1 + x n1 )
6(3 x n1 )
= 3
=
(3 + x n1 )2
3 + x n1

(negative root rejected)

(1)

(2)

(3)

(2),

xn+1 - xn

are of the same sign.

and

xn xn-1

are of the same sign.

is monotonic.

x n +1 3 =

(L, M 0)

and

L=M

3 + xn

3 x n , 3 x n1

From (3),

2 LM

3 + x n1
3 xn

From (1)

, M=

Now,

is montonic increasing and is bounded above.

lim b n = lim b n1 = M .

an =

bn

3(1 + x n )
3 + xn

3 =

3 + 3x n 3 3 3x n
3 + xn

(3 3 )(x

3 + xn

) = 3

3 + xn

xn 3
14

<

3
3 + xn

xn 3 = k xn 3

where

k=

, 0 < k < 1,

3 + xn

since

xn > 0.

x n+1 3 < k x n 3 < k 2 x n1 3 < ... < k n x1 3

By

3 k n x1 3 < x n+1 < 3 + k n x1 3

(i)

xn

is monotonic,

( u n A)2

(i)

x n +1 =

un + A2

u n +1 A =

2u n

un + A2

A=

u n+1 u n =

2u n

un =

un+1 un .

2u n

A2 u n

xn+1 (hence xn)

is bounded.

has a limit.

lim x n = lim x n+1 = L , then from

Let

35.

xn

and

3(1 + x n )
3+ xn

since

, L=

3(1 + L )

L=3

(-ve root rejected)

un+1 A.

(un is bounded.)

3+ L

un 0 .

2u n

but

un A un 2 A2 ,

since

un 0 , A > 0.

(un is montonic decreasing.)

u n + A2
2

(ii)

A
2
2
u n + A 2 2u n A u n A
2u n
= d n 2
d n+1 =
=
= 2
= 2
2
2
u n+1 + A u n + A
u n + A + 2 u n A u n + A
+A
2u n
u n+1 A

(iii) By (i), limit exists.

d n+1 = d n = (d n1 ) = ... = d1
2

By (ii),
Since

As

0 < A u1 ,

u1 + A
2

2 u1
u2 + A2

2u 2
u3 + A2

u4 =

2u 3

u4 + A2

u5 =

u1 A
u1 + A

2u 4

2n

24

(1)

0 < d1 < 1.

16 + 11

u1 = 4

un A
un + A

= 0 lim u n = A .
n

0 < A < u1 .

= 3.375 ,

3.3752 + 11
2 3.375

3.3173

3.31732 + 11
2 3.3173

3.31662 + 11
2 3.3166

11 3.317

2n

lim d1 = 0 lim d n = lim

A2 = 11,

11 ,

u3 =

d1 =

n , by (1),

Let A =
u2 =

3.3166

3.3166

(correct to 3 decimal places)

15