Professional Documents
Culture Documents
Limit of sequence
chapter 1
Outline
1. Definitions
2. Properties
3. Operations
4. Criterion
机动 目录 上页 下页 返回 结束
1 、 Definitions
A function with domian N ( all Natural numbers) is called a
sequence, denoted by xn f (n), or xn .
xn is called the general
item.
Example Let S be the area of a disk with radius r , let An
. be the area of regular polygon inscribed in this disk, then as
n becomes more and more big, An is more and more closed
to S . As you could see the picture, we have
An n r 2 sin cos n
n n r
( n 3, 4 , 5, )
1 2 3 n n
Examples : , , , , , xn
2 3 4 n 1 n 1
2 , 4 , 8 , , 2n , xn 2 n
n
See xn ,
n 1
as n approches to infinity ,xn approches
机动 目录 上页 下页 返回 结束
Definition:
If the sequence xn and constant a satisfies:
| xn C || C C | 0 ,
i.e. lim C C
n
机动 目录 上页 下页 返回 结束
(1) n lim xn 0 .
Ex2. Let xn , to show
(n 1) 2 n
pf: (1) n 1 1
xn 0 2
0 2 (0 ,1) ,
(n 1) (n 1) n 1
1
if we want xn 0 , we only need to ask , i.e.
1 n 1
n 1. Then we should take N [ 1 1] , so as n N
we have xn 0 , n
(1)
hence lim xn lim 2
0 since x 0 1
n n ( n 1) n ( n 1) 2
Notice: N is related to , but not take N 1 1
unique.
n
we don’t xhave 0
to 1 1,
find the
n 1 n 故也可取
samllest N . N [ 1]
机动 目录 上页 下页 返回 结束
Ex3. Let q 1 , to show that the limit of the geometric
2 n 1
sequence 1 , q , q , , q , is 0.
n 1
pf: xn 0 q
n 1
0 q (0 ,1) ,
n 1
If we want xn 0 , we only need ask q , i.e.
ln
(n 1) ln q ln , that is n 1 .
ln q
ln
so, take N 1 , as n > N , we have
ln q
n 1
q 0
n 1
so lim q 0
n
Ex4. Show that lim n a 1 , a 0.
n
lg a
if we want | a 1| a 1 , we need n
n n .
lg(1 )
lg a
so, take N , as n > N , we have
lg(1 )
| n a 1| .
i.e. lim n a 1 , a 1.
n
(2) if a = 1 , n N , a 1 . is
n
constant
sequence ,
so lim n a 1 , a 1.
n
机动 目录 上页 下页 返回 结束
1
(3) if 0<a <1, let a , then b>1,we know
b
1 1 n
b
| a 1| n 1 n
n
| n b 1| .
b b
(1) 0 , exists N lg b lg a N
lg(1 ) lg(1 )
shows ,
s.t. n N , we have | n a 1 | n b 1 ,
Hence lim n a 1 , a 0.
n
机动 目录 上页 下页 返回 结束
2.Properties
Th.1. If the limit exists then it must be b a b a
2 2
unique.
a ab b
pf: (we proof by contradiction.) 2
a 1 xn a 1
2 2 a1 a a 1
2 2