You are on page 1of 33

Nguyn Vn Gip - THPT Nguyn Trung Ngn: Gii hn dy s trong

cc thi HS gii.
M U
1. L do chn ti
Dy s l mt lnh vc kh v rt rng, trong cc thi hc sinh gii quc
gia, quc t cng thng xut hin cc bi ton v dy s. gii c cc bi
ton v dy s i hi ngi lm ton phi c kin thc tng hp v s hc, i
s, gii tch. Cc vn lin quan n dy s cng rt a dng v cng c nhiu
ti liu vit v vn ny, cc ti liu ny cng thng vit kh rng v cc vn
ca dy s, cc vn c quan tm nhiu hn l cc tnh cht s hc v
tnh cht gii tch ca dy s.
Tnh cht s hc ca dy s th hin nh tnh chia ht, tnh nguyn, tnh
chnh phng , tnh cht gii tch c nhiu dng nhng quan trng l cc bi
ton tm gii hn dy s. Cc bi ton v dy s thng l cc bi ton hay v
kh, tc gi su tm, chn lc v phn loi theo tng ch
Sng kin kinh nghim vi ti Gii hn dy s trong cc thi hc
sinh gii c mc ch trnh by mt cch h thng, chi tit gii hn dy s.
ti c trnh by vi 2 chng.
Chng 1. Mt s kin thc chun b. Chng ny h thng li kin thc
c bn nht v dy s, s hc, phng php sai phn s c dng gii quyt
cc bi ton trong chng 2.
Chng 2. Gii hn ca dy s. Chng ny cp n mt s bi ton
v gii hn dy s nh: Gii hn ca tng, dy con v s hi t ca dy s, dy
s xc nh bi phng trnh cng vi phng php gii c th cho tng dng
ton.
2. Mc ch v nhim v nghin cu
Nghin cu l lun v k nng, k nng gii ton v mt
s bin php rn luyn k nng gii ton cho hc sinh THPT
Rn luyn k nng gii cc bi ton v gii hn dy s
Tm hiu thc trng ca vic hc dy s trong chng trnh mn
ton ca trng THPT
Tm hiu bi ton kh v gii hn dy s trong cc thi hc sinh
gii

Xy dng h thng cc bi tp in hnh nhm rn


luyn k nng tng hp kin thc i vi hc sinh gii
Gi cch vn dng h thng bi tp in hnh trong
vic rn luyn k nng gii ton ni chung, gp phn pht trin
tr tu cho hc sinh.
3. Phng php nghin cu
a) Phng php nghin cu l lun:
Nghin cu mt s gio trnh phng php dy hc
mn ton, SGK ph thng, Sch bi dng gio vin THPT, cc
sch tham kho, cc tp ch v gio dc lin quan n ti.
b) Phng php tng kt kinh nghim:
Tng kt kinh nghim qua nhiu nm trc tip ging
dy, qua trao i kinh nghim vi mt s gio vin gii b mn
Ton trng THPT. T xy dng c h thng cc bi tp
in hnh v nhng gi dy hc nhm rn luyn k nng tm
gii hn hm s
c) Phng php quan st, iu tra:
Quan st v iu tra thc trng dy hc gii ton v dy s
i vi hc sinh lp 11 v 12, qua nm bt c nhu cu
ca vic rn luyn k nng gii ton v dy s ca hc sinh
4. i tng v phm vi nghin cu
ti c nghin cu i vi hc sinh cc lp 11A1, 11A2, 11A3 v
hc sinh trong i tuyn hc sinh gii ton lp 12 trng THPT Nguyn Trung
Ngn.
5. Thi gian nghin cu.
ti c nghin cu trong cc nm hc 2009 2010, 2010 2011,
2011- 2012

Chng 1
MT S KIN THC CHUN B
1.1.DY S
1.1.1.nh ngha
Mi hm s u xc nh trn tp cc s nguyn dng N* c gi l mt
dy s v hn (gi tt l dy s). K hiu:
u: N* R
n a u(n)
Dy s thng c vit di dng khai trin
u1, u2, u3,, un,
Trong un = u(n) v gi u1 l s hng u, un l s hng th n v l s hng
tng qut ca dy s
Mi hm s u xc nh trn tp M = {1,2,3,, m} vi m N* c gi l
mt dy s hu hn
Dng khai trin ca n l u1, u2, u3,,um trong u1 l s hng u, um l
s hng cui.
Dy s (un) c gi l:
-

Dy n iu tng nu un+1 > un, vi mi n = 1, 2,


Dy n khng gim nu un+1 un, vi moi n = 1, 2,
Dy n iu gim nu un+1 < un, vi mi n = 1, 2,
Dy n iu khng tng nu un+1 un, vi mi n = 1, 2,

Dy s (un) c gi l
- Dy s b chn trn nu tn ti s M sao cho un < M, vi mi n = 1, 2,

- Dy s b chn di nu tn ti s m sao cho un > m, vi mi n = 1, 2,

- Dy s b chn nu va b chn trn va b chn di


Dy s (un) c gi l tun hon vi chu k k nu un + k = un, vi n

Dy s (un) c gi l dy dng nu tn ti mt s N0 sao cho un = C


vi mi n N0, (C l hng s, gi l hng s dng)

1.1.2. Cch cho mt dy s


- Dy s cho bng cng thc ca s hng tng qut
V d:
n

1 1 5
1 1 5
un

2
2
5

- Dy s cho bng phng php truy hi


V d: Dy s (un) c xc nh bi:
u1 1, u2 50

un 1 4un 5un 1 1975 n 2,3, 4...

- Dy s cho bng phng php m t:


V d: Cho a1 = 19, a2 = 98. Vi mi s nguyn n 1, xc nh an +2 bng
s d ca php chia an + an +1 cho 100.
1.1.3. Mt vi dy s c bit
a) Cp s cng.
nh ngha. Dy s u1, u2, u3, c gi l mt cp s cng vi cng
sai d (d 0) nu un = un 1 + d vi mi n = 2, 3,
Tnh cht
un =u1 + (n 1)d
uk =

uk 1 uk 1
vi mi k =2, 3,
2

Nu cp s cng hu hn phn t u1, u2, , un th


u1 + un = uk + u n k vi mi k = 2, 3, , n 1.
Sn = u1 + u2 + + u n =

n
n
(u1 un ) 2u1 n 1 d
2
2

b)Cp s nhn.
nh ngha.. Dy s u1, u2, u3, c gi l mt cp s nhn vi cng
bi q (q 0, q 1) nu un = un 1q vi mi n = 2, 3,
Tnh cht.
un = u1qn 1 vi mi n = 2, 3,
uk2 uk 1uk 1 vi mi k = 2, 3,
u1 (q n 1)
Sn = u1 + u2 + + u n =
q 1

c)Dy Fibonacci.
nh ngha. Dy u1, u2, c xc nh nh sau:

u1 1, u2 1

un un 1 un 2 n 3, 4...

c gi l dy Fibonacci.
Bng phng php sai phn c th tm c cng thc tng qut ca dy
l:
n

1 1 5
1 1 5
un

2
2
5

1.1.4 Gii hn ca dy s
nh ngha. Ta ni rng dy s (un) c gii hn l hng s thc a hu hn
nu vi mi s dng (c th b ty ), lun tn ti ch s n0 N (n0 c th ph
thuc vo v vo dy s (un) ang xt), sao cho vi mi ch s n N, n n0 ta
un a hoc limun = a v cn ni rng dy
lun c un a .Khi k hiu nlim

s (un) hi t v a. Dy s khng hi t gi l dy phn k


nh l 1. Nu mt dy s hi t th gii hn ca n l duy nht
nh l 2.(Tiu chun hi t Weierstrass)
a) Mt dy s n iu v b chn th hi t.
b) Mt dy s tng v b chn trn th hi t.
c) Mt dy s gim v b chn di th hi t.
nh l 3. Nu (un) a v (vn) (un), (vn) C th (vn) a
nh l 4.(nh l kp gia v gii hn)
Nu vi mi n n0 ta lun c un xn vn v limun = limvn = a th limxn =
a
nh l 5 (nh l Lagrange) Nu hm s y = f(x) lin tc trn on [a;
b] v c o hm trong khong (a; b) th tn ti c (a; b) tha mn: f(b) f(a) =
f(c)(b a)
nh l 6 (nh l trung bnh Cesaro)
Nu dy s (un) c gii hn hu hn l a th dy s cc trung bnh cng
u1 u2 ... un

cng c gii hn l a
n

nh l ny c th pht biu di dng tng ng sau:


nh l Stolz

un1 un a th lim un a
Nu nlim

n
n

Ta ch cn chng minh cho trng hp a = 0

un1 un a nn vi mi > 0 lun tn ti N0 sao cho vi mi n N0, ta


V nlim

c
un 1 u n . Khi , vi mi n > N0 ta c
un 1
1

u N u N 1 u N ... un un 1 u N . n N 0
n
n
n
n

Gi N0 c nh, ta c th tm c N1>N0 sao cho

N1 u N
0

Khi vi mi n>N1 ta s c

un
u
2 . Vy nn lim n 0
n n
n

nh l 7: Cho f: D D l hm lin tc. Khi


1) Phng trnh f(x) = x c nghim phng trnh fn(x) = x c nghim
[f ( x) x] v
2) Gi , l cc mt tri, mt phi ca D. Bit xlim

lim [f ( x) x] cng dng hoc cng m. Khi phng trnh f(x) = x

c nghim duy nht phng trnh fn(x) = x c nghim duy nht


f ( f (....( f ( x)...)
Trong fn(x) = 1 4 4 n2ln4 4 3

Chng minh
1) a) Nu x0 l nghim ca phng trnh f(x) = x th x0 cng l nghim
ca phng trnh fn(x) = x
b) Nu phng trnh f(x) = x v nghim th f(x) x > 0 hoc f(x) x <
0 vi mi x D do fn(x) x > 0 hoc fn(x) x < 0 vi mi x D
nn phng trnh fn(x) = x cng v nghim
2) a)Gi s phng trnh f(x) = x c nghim duy nht l x0 th y cng
l mt nghim ca phng trnh fn(x) = x. t F(x) = f(x) x do F(x) lin tc
trn (x0; ) v ; x0 nn F(x) gi nguyn mt du.
[f ( x) x] v lim [f ( x) x] cng dng th F(x) > 0 trong
Nu xlim
x

khong (x0; ) v ; x0 suy ra f(x) > x vi mi x D\{x0}


Xt x1 D\{x0} suy ra f(x1) > x1 f(f(x1)) > f(x1)> x1. T fn(x1) > x1
nn x1 khngl nghim ca phng trnh fn(x) = x. Vy phng trnh fn(x) = x c
nghim duy nht x = x0.
[f ( x) x] v lim [f ( x) x] cng m chng minh tng t.
Nu xlim
x

b)Ta thy mi nghim ca phng trnh f(x) = x u l nghim ca


phng trnh fn(x) = x, do nu phng trnh fn(x) = x c nghim duy nht th
phng trnh f(x) = x c nghim duy nht.
nh l 8. Cho hm f: D D l hm ng bin, dy (xn) tha mn xn+1
= f(xn), x N * . Khi :
a) Nu x1< x2 th dy (xn) tng
b) Nu x1> x2 th dy (xn) gim
Chng minh
a) Ta chng minh bng phng php quy np
Vi n = 1 ta c x1 < x2 mnh ng
Gi s mnh ng vi n = k (k 1) tc uk < uk +1 khi f(uk) < f(uk+1) suy
ra uk+1 < uk+2 (pcm)
b) Chng minh tng t
nh l 9.Cho hm f: D D l hm nghch bin, dy (xn) tha mn
xn+1 = f(xn), x N * . Khi :
a) Cc dy (x2n+1) v (x2n) n iu, trong mt dy tng, mt dy gim
b) Nu dy (xn) b chn th = limx2n v =limx2n+1.
c) Nu f(x) lin tc th , l nghim ca phng trnh f(f(x)) = x (1).
V vy nu phng trnh (1) c nghim duy nht th = v limxn = =
Chng minh
a) V f(x) l hm nghch bin nn f(f(x)) ng bin. p dng nh l 2 ta c
iu phi chng minh.
b) Suy ra t a)
c) Ta c f(f(x2n) = f(x2n+1) = x2n+2 v limf(f(x2n) =limx2n+2= , limx2n = do
f(x) lin tc nn f(f( ) =
Chng minh tng t ta c f(f( ) =
Vy , l nghim phng trnh f(f(x)) = x
1.2.S LC V PHNG PHP SAI PHN
1. nh ngha 1. Cho hm s y = f(x) xc nh trn R, t xk = x0 + kh (k
N*) vi x0 R, h R bt k, cho trc. Gi yk = f(xk), khi hiu s
yk : yk 1 yk (k N*) c gi l sai phn cp 1 ca hm s f(x)

Hiu s 2 yk : yk 1 k (yk )

(k N*) c gi l sai phn cp 2

ca hm s f(x). Tng qut i yk : i 1 yk 1 i 1k ( i 1 yk ) (k N*) c gi l


sai phn cp i ca hm s f(x) (i = 1, 2, , n, )
Mnh . Sai phn mi cp u c th biu din theo cc gi tr ca hm
s: y0, y1, y2, , yn,
2.nh ngha 2. Phng trnh sai phn (cp k) l mt h thc tuyn tnh
cha sai phn cp k
f yn , yn , 2 yn ,..., k yn 0

(1)

V sai phn cc cp u c th biu din theo cc gi tr ca hm s nn ta c th


vit phng trnh dng
a0yk+1 + a1yn+k-1 + +akyk = f(n)
(2)
trong a0, a1, ., ak, f(n) l cc gi tr bit, cn yn, yn+1, , yn+k l cc gi tr
cha bit.
Hm s yn bin n tha mn (2) gi l nghim ca phng trnh sai phn
tuyn tnh (2)
3. Phng php gii phng trnh sai phn tuyn tnh
Phng trnh a0yn+k + a1yn+k-1+ + akyn = f(n) c gi l phng trnh sai phn
tuyn tnh cp k.
Gii
Gii phng trnh sai phn tuyn tnh thun nht tng ng
- Gii phng trnh c trng
a0 k a1 k 1 ... ak 1 ak 0 (*)

-Tm nghim tng qut ca phng trnh thun nht tng ng


+ Nu (*) c k nghim thc khc nhau l 1 , 2 ,..., k th nghim tng qut
l
$
y n c11n c2 2n ... ck kn

(1)

Trong c1, c2, , ck l cc hng s ty


+Nu trong (*) c nghim thc j bi s th nghim tng qut l

$
yn

s 1

c
i 1

j i

n ci in
i 1,i j

n
j

+Nu phng trnh (*) c nghim phc n j r (cos isin ) th cng


c nghim j r (cos isin )

t j 1 j . thu c cng thc tng qut, trong cng thc (1) ta


n
n
n
n
thay b phn c j j c j 1 j 1 bi b phn tng ng c j r cosn c j 1r sinn

+Nu phng trnh (*) c nghim phc bi s


j j 1 ... j s 1 r (cos isin )
Th (*) cng c nghim phc bi s lin hp vi j l j m ta t l
j s j s 1 ... j 2 s 1 r (cos isin )

Trong trng hp ny, thu c cng thc nghim tng qut, trong
cng thc (1) ta thay b phn
c j jn c j 1 jn1 ... c j 2 s 1 jn 2 s 1

bi b phn tng ng

i
n
c j i n r cos
i 0

s 1

s 1

c
i 0

j s i

ni r n sin n

Tm nghim tng qut ca phng trnh sai phn tuyn tnh cp k.


Nghim
tng qut c dng
yn $
y n yn*

Trong

+ yn l nghim ca phng trnh sai phn tuyn tnh cp k


+ $y n l nghim ca phng trnh sai phn tuyn tnh thun nht

tng ng
+ yn* l mt nghim ring ca phng trnh khng thun nht

Chng 2.
GII HN CA DY S
2.1.GII HN CA TNG
Cc bi ton v tm gii hn ca tng ta thu gn tng bng cch phn
tch hng t tng qut thnh hiu cc hng t ni tip nhau cc hng t c
th trit tiu, cui cng a tng v biu thc ch cn cha xn , sau tm
limxn.
Bi 1.
Cho dy s (xn) (n = 1, 2, ) c xc nh nh sau:
x1 = 1 v xn1 xn ( xn 1)( xn 2)( xn 3) 1 vi n = 1, 2,
n

t yn
i 1

1
xi 2

yn
(n = 1, 2, .). Tm lim
n

Li gii
Ta c x2 = 5 v xn > 0 vi mi n = 1, 2,
xn 1 xn ( xn 1)( xn 2)( xn 3) 1

2
n

3xn xn2 3xn 2 1 xn2 3xn 1 (1)

T suy ra
xn+1 +1 = xn2 3xn 2 = (xn + 1)(xn + 2)
1
xn 1 1
n

Do yn
i 1

x n 1 xn 2

1
1

x n 1 xn 2

1
1
1

xn 2 xn 1 xn 1 1

n
1
1
1
1
1
1
1

xi 2 i 1 xi 1 xi 1 1
x1 1 xn 1 1 2 xn 1 1

T (1) xk+1 = xk2 3xk 1 3xk 3.3k 1 3k


Ta d dng chng minh bng quy np xn > 3n-1

(2)

1
(v do (2) xn+1 > 3n)
2

yn
Nn lim
n

. Ta c th chng minh limxn = vi cch khc:


D thy (xn) l dy tng, gi s limxn = a (a 1)
Nn ta c a a(a 1)(a 2)(a 3) 1
Suy ra a2 = a(a+1)(a+2)(a+3) + 1 hay a4 + 6a3 + 10a2 + 6a +1 = 0
R rng phng trnh ny khng c nghim tha mn a 1. Vy limxn =
Bi 2. (HSG QG nm 2009)
Cho dy (xn) (n = 1, 2, ) xc nh bi:

1
x1 2

x
n

xn21 4 xn 1 xn 1
2

(n 2,3,...)
n

Chng minh rng dy (yn) (n = 1, 2, ) vi yn


i 1

1
c gii hn hu
xi2

hn, tm gii hn .
Li gii
T gi thit ta c xn > 0 n 1
Ta c xn xn-1 =

xn21 4 xn 1 xn1
- xn-1 =
2

xn21 4 xn1 xn 1
> 0 n 2
2

Do dy (xn) tng. Gi s limxn = a th a > 0 v


a

a 2 4a a
a = 0 (v l)
2

Vy limxn =
T xn =

xn21 4 xn 1 xn 1
n 2 suy ra
2

xn2 ( xn 1) xn 1

1
1
1

2
xn xn 1 xn

n 2

Do
n

yn
i 1

1 1

1
1 1 1
1 1
1 1 1
1

...

2 6 n 2

2
2
xi x1 x1 x2
x1 x1 xn
xn
x2 x3
xn 1 xn
1

Suy ra yn < 6 n 1 v dy (yn) tng v yn = yn-1 + x > yn-1


n
Vy (yn) c gii hn hu hn v limyn = 6
Bi 3.

Xt dy s (xn) (n = 1, 2, 3, ) xc nh bi:
1
2

x1 = 2 v xn 1 ( xn2 1) vi mi n = 1, 2,3, .
1

t Sn 1 x 1 x ... 1 x
1
2
n
Sn
Tm nlim

Li gii
Ta c th tng qut ha bi ton nh sau:
u1 a

Cho dy (un) tha mn

un 1

Ta chng minh Sn
i 1

un2 (b c)un c 2
bc

1
1
1

ui b u1 c un 1 c

Tht vy.
Ta c un 1

un2 (b c)un c 2
suy ra
bc

un2 (b c )un bc (un b)(un c)


un 1 c

bc
bc
1

T u c u c u b
n 1
n
n

1
1
1

un b un c un 1 c

Khai trin v c lng c


1
1
1

u1 b u1 c u2 c
1
1
1

u2 b u2 c u3 c

.
1
1
1

un b un c un 1 c
1

Do Sn u c u c
1
n 1
T vn dng vo bi ton trn vi b =1, c = - 1 ta c
Sn

1
1
1

1
x1 1 xn 1 1
xn1 1

M xn+1 xn =

1
2
xn 1 > 0 n N * nn dy (xn) l dy tng. Gi s
2

lim xn a (a > 2). Th 2a = a2 + 1 suy ra a = 1. V l.

xn . Do lim Sn 1
Vy nlim

Nhn xt. Trong cc bi ton tng qut ta c th thay cc gi tr ca a, b, c khc


nhau c cc bi ton mi. Chng hn:
Cho dy s (un) tha mn:
u1 3

un 1

un2 un 9
5

t Sn 2 u 2 u ... 2 u
1
2
n
Tm limSn
Bi 4.
Cho dy s (xn) c xc nh bi: x1 = 1; xn 1

(2 xn 1) 2012
xn . Vi n l
2012

s nguyn dng.
t un

(2 xn 1) 2011
(2 x1 1) 2011 (2 x2 1) 2011 (2 x3 1) 2011

...
2 x2 1
2 x3 1
2 x3 1
2 xn 1 1

Tm limun
Li gii
(2 xn 1) 2012
Ta c xn+1 xn =
, n 1
2012

Suy ra

2 xn 1 2 xn 1 1

2( xn 1 xn )
(2 xn 1) 2011

(2 xn 1)(2 xn 1 1) 1006(2 xn 1 1)

(2 x i 1) 2011
1
1
1
1

1006

1006

2 xi 1 1
2 xi 1 1
i 1
i 1 2 xi 1
2 x1 1 2 xn 1 1
n

Mt khc: xn + 1 xn 0 nn dy (xn) l dy s tng n 1 . Nu (xn) b chn th


limxn tn ti.
(a 1)
t limxn = a a 1 v a

2012

2012

a (v l). Suy ra (xn) khng b

chn trn hay limxn = suy ra lim 2 x 1 =0


n 1
Suy ra lim un
n

1006
3

Bi 5
Cho dy s (xn) vi n = 1, 2, c xc nh bi:
x1 = a, (a > 1), x2 = 1.

xn+2 = xn lnxn (n N*)


n 1

t Sn (n k ) ln x2 k 1

(n 2)

k 1

n
Tm nlim

Li gii
x2 n 1
Nhn xt rng x2n = 1, n =1, 2, do ln1 = 0 suy ra nlim

Tip theo ta chng minh dy (x2n+1) cng c gii hn l 1.


Xt hm s f(x) = x lnx lin tc v ng bin trong (1; + ) v f(x) = 1-

1
>0
x

vi mi x > 1
Trc ht ta chng minh bng phng php quy np, dy (x2n+1) b chn
di bi 1. Theo gi thit th x1 = a > 1, gi s x2k+1 > 1 th f(x2k+1) > f(1) > 1 nn
hin nhin x2k+3>1 tc dy (x2n+1) b chn di bi 1.
Tip theo ta chng minh dy (x2n+1) l dy gim. Tht vy, do x2n+1 > 1 nn
lnx2n+1> 0 v th x2n+3 x3n+1 = - lnx2n+1 < 0, tc dy (x2n+1) l dy gim
x2 n 1
T suy ra (x2n+1) c gii hn c nlim

Chuyn qua gii hn dy s ta c c = c lnc c=1


Vy dy s (xn) c gii hn l 1.
Theo nh l Cessaro, ta c
x1 x2 ... x2 n
( x x ... x2 n 1 ) ( x2 x4 ... x 2 n )
1 hay lim 1 3

1
n
n
2n
2n

lim

nx1 (n 1) ln x1 (n 2) ln x3 ... ln x2 n 3 n
1
2n

lim
n

a 1
a S n 1
S
1 hay lim n
x 2
x
n 2
2

lim

2.2.DY CON V S HI T CA DY S
Khi kho st s hi t ca dy s ta thng s dng cc nh l v tnh
n iu v b chn, nu dy khng n iu th xt dy vi ch s chn, ch s
l. Tuy nhin c nhng dy s phc tp, tng gim bt thng, trong trng hp
nh th ta thng xy dng cc dy s ph n iu, chng minh cc dy s

ph c gii hn, sau chng minh dy s ban u c cng gii hn, cc dy s


ph phi c xy dng t dy s chnh
Nhn xt: Mi dy con ca dy hi t u hi t v ngc li nu limx2n =
limx2n+1 = a th limxn= a
Mt cch tng qut ta c
Cho s nguyn m 2 nu limxmn+i = a i = 0, 1, 2, , m 1 th limxn= a
Bi 1.
Dy s (xn) c xc inh bi cng thc:
x0 x1 1

5 xn 2 xn 2 xn 1

Chng minh rng dy (xn) hi t


Li gii
Xt dy s (an) c xc nh bi a0= 1, an 1

2an
, d thy (an) gim dn v 0.
3

Ta chng t max{x2n, x2n+1} an, n


(1)
Tht vy, (1) ng vi n = 0 v n = 1. Gi s (1) ng vi n v do (an) l dy
gim nn
5x2n+2 = x2n + 2x2n+1 3an x2n+2 an+1
V 5x2n+3 = x2n+1 + 2x2n+2 an + 2an+1 3an x2n+3 an+1
Nh vy (1) ng vi n + 1 hay (1) ng n = 0, 1, 2,
D thy xn > 0 n v t (1) theo nguyn l kp ta c limx2n = limx2n+1 = 0 suy ra
limxn=0
Nhn xt:
Vic a vo dy ph (an) c tc dng chn c hai dy con (x2n) v (x2n+1)
v lm chng cng hi t v mt im
C th s dng phng php sai phn tm c s hng tng qut
1
xn C1
5

1 6
6

Thay cc gi tr ca x0, x1 tm C1, C2 t tm c limxn =0


Bi 2.
Dy (xn) c xc nh bi:
x0 , x1 , x2 0;1

2
2
3 xn 3 xn xn 2

Chng minh rng dy (xn) hi t

Li gii
Ta xt dy s (an) xc nh bi:
a0= max{x0, x1, x2}, an 1

2an2

D thy dy s (an) gim dn v 0. Ta chng t max{x3n, x3n+1, x3n+2} an, n


(1)
Tht vy, (1) ng vi n = 0, 1, 2, , Gi s (1) ng vi n v do (an) l dy
gim nn ta c:
3x3n+3 = x32n x32n 2 2an2

x3 n 3 an 1

3x3n+4 = x32n 1 x32n3 an2 an21 2an2

x3 n 4 an 1

v 3x3n+5 = x32n 2 x32n 4 an2 an21 2an2

x3n 5 an 1

Nh vy, (1) ng vi n + 1, theo nguyn l quy np, (1) c chng


minh. D thy xn > 0 T theo nguyn l kp gia ta c limx3n+i = 0 (i = 0, 1, 2)
do limxn = 0
T cc cch chn dy s ph nh trn ta c cc dy s sau u hi t v 0
vi x0, x1, x2, x3 u thuc (0; 1)
3 xn 3 xn2 xn 1 xn 2 ,
xn2 xn2 2
xn21
2

3 xn 3

3 xn 3 xn2 xn xn 1
6 xn 4 xn 1 xn 2 xn2 2 xn xn 1

Bi 3.
Dy (xn) c xc nh bi:
x0 , x1 , x2 0

xn 3 xn xn 2

Chng minh rng dy (xn) hi t


Li gii
Ta xy dng hai dy (an) v (bn) nh sau:
b0 min{x0 , x1 , x2 , 2}

an 1 2an

bn 1 2bn

a0 max{x0 , x1 , x2 , 2}

Dy (an) l dy gim dn v 2, dy (bn) tng dn v 2.


Bng quy np d chng minh c
bn 1 min{x3 n , x3 n 1 , x3n 2 } max{x3 n , x3 n 1 , x3n 2 } an

T , dn n limx3n =limx3n+1 = limx3n+2 = 2 suy ra limxn = 2


Bi 4.

Cho dy (xn) (n = 0, 1, 2) c xc nh nh sau:


x0, x1, x2 l cc s dng cho trc
xn 2 xn 1 x n xn 1

vi mi n 1

Chng minh rng dy (xn) hi t v tm gii hn ca dy


Li gii
Ta xy dng hai dy (an) v (bn) nh sau:
a0 max{x0 , x1 , x2 ,9}

b0 min{x0 , x1 , x2 ,9}

an 1 3 an

bn 1 3 bn

n 0,1, 2,...

n 0,1, 2,...

Dy (an) l dy gim dn v 9, dy (bn) tng dn v 9 suy ra


lim an lim bn 9

Ta chng minh bn1 min{x3n , x3n 1 , x3n 2 } max{x3n , x3n 1 , x3n 2 } an

n (1)

Tht vy, vi n = 0 th (1) hin nhin ng


Gi s (1) ng vi n = k, khi vi n = k + 1 ta c
bn bn 1 3 bn x3 k 3 x3 k 2 x3k 1 x3 k 3 an an 1 an
bn bn 1 3 bn x3 k 4 x3 k 3 x3k 2 x3 k 1 3 an an 1 an
bn bn 1 3 bn x3 k 5 x3 k 4 x3 k 3 x3 k 2 3 an an 1

Vy (1) cng ng vi n = k + 1
Theo nguyn l quy np th (1) ng vi mi s t nhin n
T theo nh l kp ta c
lim x3 n lim x3 n 1 lim x3 n 2 lim an lim bn 9

xn 9
Nn nlim

Di y l mt s bi ton tm gii hn dy s dng xn+1 = f(xn)(dy s


xc nh nh vy gi l cho di dng lp). y l dng ton thng gp nht
trong cc bi ton v tm gii hn dy s, dy s hon ton c xc nh khi
bit f v gi tr ban u x 0. Do vy s hi t ca dy s ph thuc vo tnh cht
ca f(x) v x0. Mt c im quan trng khc ca dy s dng ny l nu a l
gii hn ca dy s th a l nghim ca phng trnh x = f(x).
Bi 5.
Cho dy s (xn) c xc nh nh sau:
1
x1= 0, xn + 1 =
27

xn

vi mi n N*

Chng minh rng dy s (xn) c gii hn v tm gii hn .


Li gii
x

1
Nhn xt rng xn 0, n N*. Xt hm s f(x) = nghch bin
27
trong khong [0; + ). Khi xn+1 = f(xn) , n N* v f(x) f(0) nn 0 xn 1

Ta c x1 = 0, x2 = 1, x3 =

1
nn x1 x3 v x4 = f(x3) f(x1)=x2
27

By gi ta chng minh bng phng php quy np x2n 1 x2n + 1, v x2n+2


x2n
vi n N*
Tht vy, gi s c x2n-1 x2n + 1 th f(x2n-1) f(x2n+1) nn x2n x2n+2 v v vy
f(x2n) f(x2n+2) suy ra x2n+1 x2n+3.
Tng t, gi s c x2n x2n+2 th f(x2n) f(x2n+2) suy ra x2n+1 x2n+3 v vy
f(x2n+1) f(x2n+3) suy ra x2n+2 x2n+4
Vy dy (x2n-1) l dy tng v dy (x2n) l dy gim v u thuc [0; 1] nn
x2 n a , lim f ( x2 n 1 ) b
c gii hn hu hn: nlim

n
x2 n 2 lim f ( x2 n 1 ) lim f ( f ( x2 n )) f ( f (a ))
V a = nlim

n
n

Nn a 1
27

1

27

suy ra a =

1
3
1
3

Tng t ta cng tm c b = . Vy a = b =

1
1
xn
nn nlim

3
3

Bi 6. (HSG QG 2008)
Cho dy s thc (xn) xc nh nh sau:
x
x1 = 0, x2 = 2 v xn+2 = 2
n

1
vi mi n= 1, 2, 3,
2

Chng minh rng dy s (xn) c gii hn hu hn, tm gii hn .


Li gii
Xt hm s f(x) = 2 x

1
xc dnh trn R.
2

Vi mi n N*, ta c xn+4 = f(xn+2) = f(f(xn)) hay xn+4 = g(xn), trong g l hm


s xc nh trn R v g(x) = f(f(x)) x R (1)
D thy hm s f gim trn R, do hm s g tng trn R. V th t (1)
suy ra vi mi k {1; 2; 3; 4}, dy (x4n+k), n N l dy n iu, Hn na, t

cch xc nh dy (xn) d thy 0 xn 2 , n N*. Do vi mi k {1; 2; 3;


4}, dy (x4n+k) l dy hi t
x4 n k ak ta c 0 ak 2 . Hn na, do
Vi mi k {1; 2; 3; 4}, t xlim

hm s g lin tc trn R nn t (1) suy ra g(ak) = ak (2)


Xt hm s h(x) = g(x) x trn [0; 2]. Ta c h(x) = 2- (f(x) + x).(ln2)2 1 < 0
x [0;2] (do f(x) + x > 0 x [0;2] )
Suy ra, hm s h gim trn [0; 2]. V th c nhiu nht mt im x [0;2]
sao cho h(x) = 0 hay g(x) = x. M g(1) = 1 nn t (2) ta c ak = 1 vi mi k
{1; 2; 3; 4}.
T y, v dy (xn) l hp ca bn dy con (x4n+k) nn dy (xn) hi t v
lim xn 1

Bi 7.
Chng minh rng vi mi s nguyn dng n cho trc th phng trnh
xn
x2n+1 = x + 1 c ng mt nghim thc. Gi nghim l xn. Tnh nlim

.
Li gii: Nu x < -1 th x2n+1 < x < x+1. Nu 1 x 0 th x2n+1 x = (-x)(1x2n) < 1 suy ra x2n+1 < x + 1. Nu 0 < x 1 th x2n+1 x < x + 1. Vy nu x l
nghim ca phng trnh x2n+1 = x + 1 th ta phi c x > 1. t fn(x) = x2n+1 x
1. Ta c fn(x) = (2n+1)x2n 1 > 0 trn [1, +) suy ra hm f tng trn na
khong ny. V f(1) = - 1 < 0 v f(2) = 22n+1 3 > 0 nn phng trnh ny c
nghim xn thuc (1, 2). Theo l lun trn, nghim ny l suy nht.
Xt fn+1 = x2n+3 x 1. Ta c f n+1(1) = - 1 < 0 v fn+1(xn) = xn2n+3 xn 1 = xn2n+3
xn2n+1 > 0. T ta suy ra 1 < xn+1 < xn. Dy {xn} gim v b chn di bi 1, suy
ra dy (xn) c gii hn hu hn a, hn na a 1. Ta chng minh a = 1. Tht vy,
gi s a > 1. Khi xn a vi mi n v ta tm c n ln sao cho: x n2n+1
a2n+1 > 3. Trong khi ta c xn + 1 < x1 + 1 < 3. Mu thun v fn(xn) = 0.
Bi 8.

x1 2007

Cho dy s thc (xn) xc nh bi:

x n 1 3

xn
x 1
2
n

n 1

1/ Chng minh dy s (xn) b chn.


2/ Chng minh dy s (xn) c gii hn v tm gii hn .
Li gii
Hin nhin xn > 3
xn

xn 1 3

x 1
2
n

3 1

1
3 2 n 1
x 1
2
n

Vy xn 2007 vi mi n dy b chn
Cch 1:
x

Hm f(x) =

3 1

1 =

1
x 1
2

nghch bin trn (

3 ; )

nn chng

minh c cc dy con (x2n) v (x2n+1) l n iu. Theo 1/cc dy b chn


x

n
nn c limx2n =a; limx2n+1 =b; T x n1 3 x 2 1 qua gii hn ta c :
n

b2 1

a 3

b 3

g(x) =

Suy ra

a
a 1
2

b
b2 1

a2 1
x

x 1
2

c g(x) = 1 -

1
( x 1) x 2 1
2

>0

nn g(x) ng bin

t a = b hay limx2n =limx2n+1 limxn = a= b.


Lc a l nghim pt

x
x 1
2

x=

3 15
2

3 15
2

lim xn =

Cch 2
f(x) =
C

x 1
2

f(x) = x

f(x) = f ' ( x)
khi x >
( x 2 1) 3
2 2

x 1
2

2
( x 3 ) 2 2x
x 1

x 2 3 x 1(l )

( x 3 x) 2( x 3 x) 3 0
2

x 3 x 3
2

x = 3 15 =a
2

p dng nh l Lagrang c:
x n 1 a f ( x n ) f (a ) f ' ( n ) x n a

Do limxn = a =

3 15
2

1
2 2

x n a ... (

1
2 2

) n x1 a

Bi 9.
Cho dy s (xn) tha mn:
x1 a , a 2

xn1 a a xn

n N *

Chng minh rng dy s (xn) c gii hn hu hn


Li gii
Bng quy np chng minh c rng 0 xn a n N *
Xt hm f(x) =
f '( x)

a a x , x 0; a c xn+1 = f(xn) v
1

4 a ax ax

0 , x 0; a

Suy ra f(x) l hm nghch bin


Do dy (xn) c tch thnh hai dy con (x2n) v (x2n+1), trong mt dy
tng v mt dy gim, mt khc li c dy (xn) b chn nn tn ti limx2n = ,
limx2n+1= , trong , l nghim ca phng trnh:
f(f(x)) = x

a a a ax x

Xt hm F(x) =

a a a a x x , vi x 0; a
1

F '( x)
a a a ax

a a ax a ax ax

vi x 0; a , ta c
a ax ax a a a a a a a
1

a a
a
2

Thay vai tr ca x bi

1
3

a
a
2
4

1
2
2

1
a
4
3
2 0,12 0,3
4

a a x chng minh tng t ta c

a a a ax

a a a x 0,3

Suy ra F(x) < - 0,9 < 0 nn F(x) l hm nghch bin, li c F(0) > 0, F( a ) < 0
nn phng trnh F(x) bng 0 c nghim duy nht. Do
Suy ra limx2n = limx2n+1 = limxn
Vy c limxn= T vi T tha mn f(f(T)) = T
2.3.DY S XC NH BI PHNG TRNH
Dy s c mi quan h cht ch vi phng trnh iu ny thy r qua
hai ni dung c bn l phng trnh sai phn tuyn tnh c gii bng phng
trnh c trng, gii hn ca dy s cng thng c gii ra t phng trnh.
y l mt trong cc ni dung quan trng nht ca phn dy s.
Vi dng ton tm gii hn ca dy s c lin quan n phng trnh ta
thng xt tnh n iu ca hm s, p dng nh l Lagrange v nh l v
gii hn kp gia.
Bi 1.
Gi s xn thuc khong (0; 1) l nghim ca phng trnh
1
1
1

...
0
x x 1
xn

Chng minh dy (xn) hi t. Tm gii hn .


f n ( x)

Nhn xt: xn c xc nh duy nht v hm s

1
1
1

...
x x 1
xn

lin

tc v n iu trn (0, 1). Tuy nhin, ta khng th xc nh c gi tr c th


ca xn. Rt may mn, chng minh tnh hi t ca xn, ta khng cn n iu
. Ch cn chng minh tnh n iu v b chn l . Vi tnh b chn l hin
nhin v 0< xn< 1. Vi tnh n iu, ta ch mt cht n mi lin h gia
fn(x) v fn+1(x): fn+1(x) = fn(x) +

f n 1 ( x ) f n ( x )

1
.
x n 1

y chnh l cha kho

chng minh tnh n iu ca xn.


Li gii
1
x

xn c xc nh duy nht v hm s f n ( x)

1
1
...
lin tc v n
x 1
xn

iu trn (0; 1)
chng minh dy hi t ta chng minh dy (xn) b chn v n iu,
hin nhin dy b chn v 0 < xn < 1. By gi ta chng minh dy (xn) n iu

Ta thy 0 < xn < 1 nn


f n 1 ( xn ) f n ( xn )

1
1

0
xn n 1 xn n 1

Trong khi fn+1(0+) > 0. Theo tnh cht ca hm lin tc, trn khong (0; xn) c
t nht mt nghim ca fn+1(x). Nghim chnh l xn+1. Suy ra xn+1 < xn. Tc dy
s (xn) gim, do dy s ny b chn di bi 0 nn dy s c gii hn
Ta chng minh dy s trn c gii hn bng 0. Ta d dng chng minh kt
qu sau:
1

1 1
1
... ln n
2 3
n

(C th chng minh bng cch nh gi ln 1 )


n
n

xn a 0 . Khi do dy (xn) gim nn ta c xn


Tht vy, gi s nlim

a n
1
2

1
3

Do 1 ...
1

1
khi n , nn tn ti N sao cho vi mi n N ta c
n

1 1
1 1
...
2 3
n a

Khi vi mi n N th
0

1
1
1
1
1
1
1 1 1

...


...
0
xn xn 1
xn n x n 1 2
n a a

xn 0
iu ny mu thun. Vy phi c nlim

Bi 2. (HSG QG 2007)
Cho s thc a > 2. t fn(x) = a10xn+10 + xn + + x + 1 (n = 1, 2, )
Chng minh rng vi mi s nguyn dng n, phng trnh fn(x) = a lun
c ng mt nghim xn (0; ) v dy s (xn) c gii hn hu hn khi n
Li gii.
Vi mi n, t gn(x) = fn(x) a, khi gn(x) l hm lin tc, tng trn [0; + ).
Ta c gn(0) = 1 a < 0; v gn(1) = a10 + n + 1 a > 0 nn gn(x) = 0 c nghim
duy nht xn trn (0; + ).
xn , ta chng minh dy (xn) (n = 1, 2,
chng minh tn ti gii hn nlim

) tng v b chn.
Ta c

1
g n 1 a10 1
a

1
= a 1
a

n 1

n 10

1 1
n 1
1
a

1 9

a a 1
a 1
1
a

a 1 1 0
9

1
a

Suy ra xn 1 , n = 1, 2,
Mt khc, t
gn(xn) = a10 xnn10 xnn ... 1 a 0 , suy ra
xngn(xn) = a10 xnn 11 xnn1 ... xn axn 0
gn+1(xn) = xngn(xn) + 1 + axn a = axn + 1 a < 0 do xn 1

1
.
a

V gn+1 l hm tng v 0 = gn+1(xn+1) > gn+1(xn) nn xn < xn+1. Vy dy (xn) (n = 1,


xn
2, ) tng v b chn, nn tn ti nlim

xn 1
Nhn xt. Ta c th chng minh nlim

1
bng cch chng minh bt
a

ng thc

1
1
9

1 a a 1 1 1
a
a

n 1

xn 1

1
a

Tht vy, ta c
aa x

n 10
n

10

1
x ... xn 1 a 1
a

n
n

10

n 10

1
1

Suy ra
1
a a 1
a

10

n 10

1
1
a 1 1

a
a
2

1
1
9

T xn 1 a a 1 1 1
a
a

xn
Cch khc chng minh nlim

t c

n 1

xn 1

n 1

a 1
a

a 1
< 1 ta c
a

fn(c) fn(xn) = kcn (vi k = (a 1)((a 1)9 1) > 0)


Theo nh l Lagrang th

1
... 1

xn 1

fn(c) fn(xn) = f( )(c xn) vi (xn; c)


Nhng f( ) = (n + 10)a10 n+9 + n n-1 + + 1 > 1 nn kcn > c xn
xn =c
T c kcn < xn < c suy ra nlim

Bi 3. (HSG QG 2002)
Xt phng trnh
1
1
1
1
1

... 2
... 2
trong n nguyn dng
x 1 4x 1
k x 1
n x 1 2

1)Chng minh rng vi mi s nguyn dng n, phng trnh trn c duy nht
nghim ln hn 1, k hiu nghim l xn
2)Chng minh rng dy s (xn) c gii hn bng 4 khi n
Li gii
1
1
1
1
1

... 2
... 2

x 1 4x 1
k x 1
n x 1 2
1).D thy, vi mi n N*, hm s fn(x) lin tc v nghch bin trn

K hiu fn(x) =

khong 1; . Hn na fn(x) khi x 1+ v fn(x)

1
khi x . T
2

suy ra vi mi n N * phng trnh fn(x) c nghim duy nht xn > 1


2).Vi mi n N * , ta c
1
1
1
1
1
f n (4) 2
2
...
...
2
2 2 1 4 1
(2k ) 1
(2n) 2 1
1
1 1 1
1
1
1
1
1 1 ...

...

2
3 3 5
2k 1 2k 1
2n 1 2 n 1

1
0 f n ( xn )
2(2n 1)

T , do hm fn(x) nghch bin trn 1; suy ra xn < 4 vi mi n N * (1)


Mt khc, vi mi n N * , hm fn(x) kh vi trn [xn; 4] nn theo nh l
Lagrange, vi mi n N * tn ti t (xn; 4) sao cho
f n (4) f n ( xn )
1
4
n 2
1
f n' (t )

...

vi mi n N *
2
2
2
2
4 xn
(t 1) (4t 1)
( n t 1)
9

Suy ra

1
1
9
vi mi n N * xn 4
2(2n 1)(4 xn )
9
2(2n 1)

T (1) v (2) ta c 4

9
xn 4 vi mi n N *
2(2n 1)

T , theo nh l v gii hn kp gia ta c iu phi chng minh

(2)

Bi 4.
Cho dy s (un) (n = 0, 1, 2, ) c xc nh nh sau:
u0 = a v un+1 = sin2(un+11) 2007 vi mi s t nhin n, trong a l s
thc cho trc. Chng minh rng
a).Phng trnh sin2(x + 11) x = 2007 c nghim duy nht. K hiu
nghim l b
b).limun = b
Li gii
a)T gi thit ta thy ngay un - 2007 n N*
Xt hm s f(x) : = sin2(x + 11) 2007, x R
Ta thy
f(x) = 2sin(x +11)cos(x + 11) = sin2(x + 11) v un+1= f(un)
hm s g(x) : = f(x) x c g(x) = sin2(x + 11) - 1 0
g ( x) , lim g ( x)
g(- 2007) = sin2(- 2006) > 0 v xlim

Vy hm s g(x) nghch bin v c nghim duy nht trong [- 2007; ) gi


nghim l b, th phng trnh sin2(x + 11) x = 2007 c nghim duy nht l
b
b)K hiu max g '(t ) . Khi [0;1]
[ 2007; 2006]

trn

Ta thy -2007 un -2006 v phng trnh sin 2( x 11) 1 v nghim


[-2007;-2006] nn 0 < <1.
Theo nh l Lagrange, ng vi mi n N*, tn ti cn (-2007;-2006) ssao

cho
un 1 b g (un ) g (b) g '(cn ) un b u n b
n
T y theo phng php quy np ta c un1 b u1 b

un b
un 1 b 0 tc l lim
Suy ra lim
n
n

Bi 5.
Chng minh rng vi mi s nguyn dng n cho trc th phng trnh x2n+1 =
xn .
x + 1 c ng mt nghim thc. Gi nghim l xn. Tnh nlim

Li gii:
Nu x < -1 th x2n+1 < x < x+1. Nu 1 x 0 th x2n+1 x = (-x)(1-x2n) <
1 suy ra x2n+1 < x + 1. Nu 0 < x 1 th x2n+1 x < x + 1. Vy nu x l nghim
ca phng trnh x2n+1 = x + 1 th ta phi c x > 1. t fn(x) = x2n+1 x 1. Ta c

fn(x) = (2n+1)x2n 1 > 0 trn [1, +) suy ra hm f tng trn na khong ny. V
f(1) = - 1 < 0 v f(2) = 2 2n+1 3 > 0 nn phng trnh ny c nghim x n thuc (1,
2). Theo l lun trn, nghim ny l suy nht.
Xt fn+1 = x2n+3 x 1. Ta c f n+1(1) = - 1 < 0 v f n+1(xn) = xn2n+3 xn 1 =
xn2n+3 xn2n+1 > 0. T ta suy ra 1 < x n+1 < xn. Dy {xn} gim v b chn di
bi 1, suy ra dy {xn} c gii hn hu hn a, hn na a 1. Ta chng minh a =
1. Tht vy, gi s a > 1. Khi xn a vi mi n v ta tm c n ln sao
cho: xn2n+1 a2n+1 > 3. Trong khi ta c x n + 1 < x1 + 1 < 3. Mu thun v f n(xn)
= 0.
Bi 6.
Cho phng trnh x + 2x2 + + nxn =
a)

b)

3
vi n nguyn dng
4

Chng minh rng vi mi n nguyn dng, trn khong (0; + ),


phng trnh trn c nghim duy nht, k hiu l xn
Chng minh rng dy (xn) c gii hn hu hn khi n + . Tm gii
hn .

Li gii.
a) Xt hm s fn(x) = x + 2x2 ++nxn -

3
lin tc trn R v c
4

f n' (x) = 1 + 22x + + n2xn 1 v f n' (x) > 0 x 0; nn hm s fn(x)

tng trn 0;
M fn(0) = -

3
< 0, fn(1) > 0 nn phng trnh f n(x) = 0 c duy nht trong
4

khong 0;
b) Ta c
1
1
1
3 f n 1 2. ... n
3
3
3
1 1
1
f n 2.
3 3
3

n 1

1
... n
3

9
4

3
4

Tr v theo v ta c:
1
1
1
2 f n 1 ...
3
3
3
1
3

n 1

Do : xn > , n Z

n 3 3 1
n 3
2n 3
1 n n
0
n
3 2 2 3
3 2
3.3n


p dng nh l Lagrange, tn ti yn

1
; xn sao cho:
3

2n 3
1
1
1
f n ( xn ) f n xn f n' ( yn ) xn v f n' ( yn ) > 1 vi yn > 0
n
4.3
3
3
3

Mt khc lim

2n 3
1
0 limx n
n
4.3
3

Qua cc bi ton trn, chng ta thy cng c c bn kho st cc dy


s cho bi dy cc phng trnh l cc nh l c bn ca gii tch (v hm lin
tc, hm n iu, nh l v s hi t ca dy s n iu v b chn, nh l
Lagrange) v mi lin h mang tnh truy hi gia cc phng trnh.
BI TP
Bi 1. Chng minh rng vi mi s nguyn dng n cho trc th phng
xn .
trnh x2n+1 = x + 1 c ng mt nghim thc. Gi nghim l xn. Tnh nlim

2

n
Bi 2 Cho dy s (xn) c xc nh nh sau: x1 3 , x n 1 2( 2n 1) x 1
n

n N*.
n

Tnh nlim
xi .

i 1

Bi 3. ( d b VMO 2008) Cho s thc a v dy s thc {xn} xc nh


bi:
x1 = a v xn+1 = ln(3+cosxn + sinxn) 2008 vi mi n = 1, 2, 3,
Chng minh rng dy s {xn} c gii hn hu hn khi n tin n dng v cng.

Bi 4. Cho dy xn n 1 tha mn x1 1; x2 x3 9; x4 1 v

xn 4 4 xn xn 1 xn 2 xn 3 , n 1 . Chng minh rng tn ti lim xn v tnh gii hn .

Bi 5.Cho phng trnh vi n l tham s nguyn dng


7
2
3
n
x 2 x 1 3 x 1 ... n x 1 0 (1)
4
a) Chng minh phng trnh thn c 1 nghim duy nht ln hn 1 vi mi n
nguyn dng k hiu l xn .
b) Chng minh dy xn c gii hn hu hn khi n . Tnh gii hn .
Bi 6. Cho dy s (un) c xc nh nh sau :
u1 1

un 1 1 u1.u2 ....un

n 1, 2,3...

Tm lim u
i 1

Bi 7.Cho dy s (un) tha mn


u1 2009

un 1 un
n

Tm lim
i 1

un 1

n 1, 2,3...

1
u1 1

Bi 8. Cho dy s (xn) xc nh bi :
x1 2,1

xn 2 xn2 8 xn 4
xn 1

(n 1, 2,...)
n

Vi mi s nguyn dng n t yn
i 1

1
. Tm limyn
x 4
2
i 1

Bi 9. Cho dy s (un) xc nh bi :
u1 1

un 1

un2
un
1996

n 1, 2...

Tm lim 1 2 ... n
un 1
u2 u3
Bi 10. Cho dy s (un) c xc nh bi :
u0 0

un 2008
u

un 2010

n 0,1, 2...

a)Chng minh rng (un) c gii hn hu hn. Tm limun


n

Tn
b)t Tn u 2008 . Tm lim
n 2009
k 0 k

KT LUN
1.Kt qu t c
Dy s l mt lnh vc kh rng v kh, cc bi ton dy s rt a dng.
Trong ti ny ch cp gii hn ca dy s.
ti ny trnh by mt s dng ton v gii hn dy s nh gii hn
ca tng, dy con v s hi t ca dy s, dy s xc nh bi phng trnh. Cc
bi ton dng ny u c phng php gii c th vn dng cc kin thc v dy
s, cc nh l v gii hn.
ti chn lc c cc bi ton in hnh cho mi dng ton, c
bit c nhiu bi ton l thi hc sinh gii quc gia, quc t nhng nm gn
y qua thy vai tr quan trng ca bi ton v dy s trong cc thi ny.
Qua qu trnh p dng ti vo thc t ging dy, c bit l trong qu
trnh tham gia dy i tuyn hc sinh gii ti nhn thy hc sinh hiu r c
bn cht ca nhiu bi ton kh v dy s, hc sinh c hng th v ch ng
trong hc tp.
Kt qu t c kh r rng khi ti tham gia dy i tuyn hc sinh gii
c nhiu hc sinh t gii cp tnh. T nm hc 2009 -2010 n nay nm hc
no cng c 2 hc sinh t gii, c bit cc em thng gii tt cc bi ton v
dy s trong cc thi trong khi cc nm trc hc sinh thng khng gii
c bi ton ny.
Khi thc hin ti ny ti nhn thy nng lc t duy v k nng thc
hin cc thao tc t duy cng tng ln r rt t hc sinh c t duy hc tp tt
hn cc phn khc v cc b mn khc, hc sinh c t duy phn tch, tng hp
tt hn, nng cao nng lc t hc cho hc sinh.

2. Bi hc kinh nghim.
Qua qua trnh trnh thc hin ti ny ti nhn thy nng cao cht
lng trong dy hc, c bit l trong vic bi dng hc sinh gii cn pht huy
tnh tch cc ch ng cho hc sinh, hc sinh phi c hng th trong hc tp v
phi c nng lc t hc. Chnh v l m gio vin cng cn c s say m
trong chuyn mn, lun c s hng dn hc sinh khng ch kin thc m cn
c cc k nng t duy, hng dn hc sinh cch t hc, bit tng hp kin thc.
Cc gio vin trong t chuyn mn cng cn kt hp nghin cu cc chuyn
v phn cng bi dng hc sinh gii cc bi ging c chuyn su hn.
Vic bi dng i tuyn hc sinh gii cng rt cn s quan tm ch o chung
ca nh trng, nh trng cn c k hoch ngay t u nm hc giao cho cc
gio vin chu trch nhim bi dng hc sinh, i tuyn hc sinh gii cng cn
c bi dng ngay khi cc em hc lp 10 ch khng phi ch n lp 12 mi
tp trung rn luyn cho cc em. Cc gio vin dy i tuyn cng cn bit kt
hp cc kin thc thi hc sinh gii v thi i hc to hng th hc tp cho
hc sinh.
3. Hng tip tc nghin cu m rng ti.
Cc bi ton v dy s thng kh v nhiu dng khc nhau, ti ny
mi ch cp n bi ton tm gii hn dy s. nng cao cht lng hc tp
cho hc sinh v cc dng ton c y hn ti s nghin cu tip cc bi
ton v dy s thng gp trong cc thi hc sinh gii nh tm s hng tng
qut ca dy s, nghin cu cc tnh cht s hc ca dy s.

TI LIU THAM KHO


[1].Phan Huy Khi Chuyn bi dng hc sinh gii ton thpt cc bi ton v
dy s . NXB Gio dc 2007
[2].Phan Huy Khi 10.000 bi ton s cp dy s v gii hn. NXB H Ni
1997
[3] Nguyn V Lng (ch bin), Nguyn Lu Sn, Nguyn Ngc Thng, Phm
Vn Hng. Cc bi ging v s hc. NXB i hc Quc gia H ni 2006.
[4] Nguyn Vn Mu. K yu tri h Hng Vng nm 2010
[5] Nguyn Vn Mu (ch bin), Nguyn Vn Tin.Mt s chuyn gii tch
bi dng hc sinh gii trung hc ph thng NXB Gio dc Vit Nam 2009
[6] Nguyn Sinh Tin, Nguyn Vn Nho, L Honh Ph. Tuyn tp cc bi d
tuyn Olympic Ton hc quc t 1991 2001. NXB Gio dc 2003.
[7] Nguyn , Nguyn Khnh Nguyn (dch). Cc thi v ch Ton 19 nc
trong c Vit Nam. NXB Gio dc 1996
[8] L nh Thnh (ch bin), ng nh Chu, L nh nh, Phan Vn Hp.
Phng trnh sai phn v mt s ng dng. NXB Gio dc 2001.
[9]. Cc bi ton chn lc 45 nm tp ch ton hc tui tr
[10] Tuyn tp THTT tp 3. (sch mng)
[11] T sch ton hc v tui tr. Cc bi thi Olympic ton Trung hc ph thng
Vit Nam (1990 2006). NXB Gio dc 2007

MC LC
M U
Chng 1.

MT S KIN THC CHUN B


1.1 Dy s
1.2 S lc v phng php sai phn
Chng 2.

3
7
7

GII HN CA DY S
2.1 Gii hn ca tng
2.2 Dy con v s hi t ca dy s
2.3. Dy s xc nh bi phng trnh
KT LUN
TI LIU THAM KHO

10
10
14
22
30
32

You might also like