ng dng ca mt bt ng thc o hm

Ngy 10 thng 6 nm 2013

Tm tt ni dung
Mt s kin thc c s
Bi ton m u
Mt s v d in hnh
Mt s bi tp p dng
Cc ti liu tham kho
1 Nhc li v nh l Lagrange
Cho f(x) l hm lin tc trn [a, b] v kh vi ( c o hm ) trn (a, b) khi tn
ti mt im c thuc (a, b) sao cho
f(b) f(a)
b a
= f

(c)
Chng minh nh l ny c th tm trong [1] hoc mt s ti liu khc trn mng.
nh l Lagrange l mt nh l c nhiu ng dng trong gii tch, c th ni y
l nh l p nht trong cc nh l v gi tr trung bnh ca gii tch.
1.1 Bi ton m u
Cho hm s f(x) c o hm cp hai trn R hn na f(x) 0, x R ( nghim
ca o hm cp hai f(x) = 0 l hu hn m c ). Chng minh rng:
f(n) f(0) <
n

i=1
f

(i) < f(n + 1) f(1), n N

()
y l mt bt ng thc rt p mt v mnh. Chng minh bt ng thc
ny bng cch s dng nh l gi tr trung bnh ( nh l Lagrange).
Chng Minh
1
V f

(x) 0, x R (nghim ca o hm cp hai f

(x) = 0 l hu hn m
c ) nn f

(x) ng bin trn R.

Theo nh l Lagrange tn ti mt s thc x
i
(i; i + 1) sao cho :
f

(x
i
) = f(i + 1) f(i), i R
V f

(x) ng bin trn R nn ta c

f

(i) < f

(x) < f

(i + 1)
= f

(i) < f(i + 1) f(i) < f

(i + 1), i R
=
n

i=1
f

(i) <
n

i=1
[f(i + 1) f(i)] = f(n + 1) f(1) n N

v
n

i=1
f

(i) <
n

i=1
[f(i) f(i 1)] = f(n) f(0)
Nhn xt: Nu f

(x) 0, x R th bt ng thc trn i chiu tc l

f(n + 1) f(1) <
n

i=1
f

(i) < f(n) f(0), n N

Ton b ch ny chng ta s ni v ng dng ca bt ng thc trn. Trc

ht ta s tm hiu qua cc v d sau
V d 1 Chng minh rng
2

n + 1 2 <
n

k=1
1

k
< 2

n
Li Gii
Ta xt hm f(x) = 2

x th r rng f

(x) =
1

x
> 0 v f

(x) < 0 nn theo bt ng

thc () ta c
f(n + 1) f(1) <
n

i=1
< f(n) f(0)
2

n + 1 2 <
n

k=1
1

k
< 2

n.
Bi ton trn cng c th gii bng bt ng thc AM-GM. Tng qut bi ton ny
2
ta c c v d sau:
V d 2 Chng minh rng
p(
p

n + 1 1) <
1
p

1
+
1
p

2
p1
+ ... +
1
p

n
p1
< p
p

n p N, p 2
Li Gii
Ta chng minh v tri ca bt ng thc
T bt ng thc AM-GM ta c
n + 1 + (p 1)n > p
p
_
n
p1
(n + 1)
pn + 1 > p
p
_
n
p1
(n + 1)
1 > p
p

n
p1
(
p

n + 1
p

n)

1
p

n
p1
> p(
p

n + 1
p

n)
= p(
p

n + 1 1) <
1
p

1
+
1
p

2
p1
+ ... +
1
p

n
p1
Tng t ta chng minh cho v phi ca bt ng thc
n 1 + (p 1)n > p
p
_
(n 1)n
p1
pn 1 > p
p
_
(n 1)n
p1

1
p

n
p1
< p(
p

n
p

n 1)
=
1
p

1
+
1
p

2
p1
+ ... +
1
p

n
p1
< p
p

n
By gi ta s chng minh bng cch s dng bt ng thc ()
Ta xt f(x) = p
p

x, ta c f

(x) =
1
n

x
p1
v f

(x) < 0. Vy t ta c
p(
p

n + 1 1) <
1
p

1
+
1
p

2
p1
+ ... +
1
p

n
p1
< p
p

n, p N, p 2
3
Bi ton c gii mt cch nhanh chng v p mt
V d 3 Chng minh bt ng thc
1 + ln n >
n

1
1
n
> ln(n + 1), n N

Gii
Ta tm hm nguyn hm ca f

(x) =
1
n
, mt nguyn hm ca hm ny l
_
1
n
=
ln n ( ly hng s C = 0 )
R rng hm s f(x) = ln n l hm ng bin v f

(x) =
1
n
> 0, n N

p dng bt ng thc trn ta c

f(n) f(1) + f

(1) >

n
i=1
f

(i) > f(n + 1) f(1), n N

= 1 + ln n >

n
1
1
n
> ln(n + 1), n N

T bt ng thc trn ta p dng vo bi ton ban u:

Ch : Mu cht ca vic p dng bt ng thc dng (*) vo chng minh cc
bt ng thc khc l tm c hm f(x)
V d 4 Tm gii hn ca
lim
n
1
n
n1

i=0
cos
i
2n
Gii
p dng nguyn l kp
Xt hm s f(x) =
2n

sin
x
2n
= f

(x) = cos
x
2n
. Vy suy ra f

(x) 0, x [n, n]
hay ngha l hm f

(x) ng bin trn [n, n].

p dng bt ng thc (*) suy ra f(n) f(0) <

n
i=1
f

(i) < f(n + 1) f(1)

Vy ta c
2n

cos
x
2n
<
n

i=1
cos
x
2n
<
2
n
sin

2n
=
2

cos
x
2n
<
1
n
n

i=1
cos
x
2n
<
2

1
n
sin

2n
.
V lim
x
_
2

cos
x
2n
_
= lim
x
_
2

1
n
sin

2n
_
=
2

.
4
Theo nguyn l kp suy ra gii hn cn tm l
2

.
Cch 2: p dng nh ngha v tch phn xc nh ( tng tch phn Riemann)
Ta chia on [0; 1] thnh n on con bng nhau bi n + 1 im chia 0 = x
0
<
x
1
< . . . < x
n
= 1.Mi on con c di l x
i
=
1
n
.
Trn mi on con [x
i
; x
i+1
] ta ly im
i
=
1
n
. Lp tng tch phn

f
(T, ) =
1
n
_
cos

2n
+ cos
2
2n
+ ... + cos
n
2n
_
Cho n th gi tr gii hn bng gi tr ca tch phn
_
1
0
cos
x
2
dx
Tch phn trn d dng tch c v ta tm c kt qu l
_
1
0
cos
x
2
dx =
2

.
2 Mt s bi tp p dng
2.1 Tnh gii hn ca cc biu thc sau
lim
x
1
n
_
_
1
n
+
_
2
n
+ . . . +
_
n 1
n
+
_
n
n
_
lim
x
1
n
_
sin

n
+ sin
2
n
+ . . . + sin
(n 1)
n
_
lim
x

2n
_
1 + cos

2n
+ cos
2
2n
+ ... + cos
(n 1)
2n
_
lim
x+
n
_
1
4

1
3
+
1
4

2
3
+ ... +
1
4

n
3
_
4

1 +
4

2 + ... +
4

n
2.2 Chng minh bt ng thc
2
3
n

n <

1 +

2 + . . . +

n
1
3

1
+
1
3

2
+ . . . +
1
3

n
>
3
2
_
3
_
(n + 1)
2
1
_
4498 <
1
4

1
+
1
4

2
+
1
4

15
4
< 4500
5
2.3 Tm phn nguyn ca biu thc sau
A =
1
3

4
+
1
3

5
+
1
3

6
+ . . . +
1
3

216
2.4 Chng minh rng
n!e
n
< (n + 1)
n+1
n 1 ( sng tc)
n
3
4
+
4n
2
3
+ 3n
23
12n
+ 3 >
n

n! +
n
_
(n!)
2
+
n
_
(n!)
3
( sng tc)
Chng minh rng n N

ta lun c:
2
3
n

n <

1 +

2 + +

n
Ti liu tham kho chnh
[1] K yu ton hc 2010 hi cc trng chuyn pha Bc.
[2] Din n http://www.artofproblemsolving.com/Forum/portal.php?ml=1
[3] Din n http://diendantoanhoc.net/forum/
[4] Din n http://forum.mathscope.org/index.php
Bi vit c vit vi mt tinh thn v trch nhim cao tuy nhin kh c th
trnh khi nhng thiu xt do trnh cn nhiu hn ch, tc gi mong nhn c
s nhn xt ca mi ngi v bi vit bi vit c hon thin thm.
Cui cng xin cm n thy gio Hong Minh Qun ( THPT Ngc To-H Ni)
c bn tho v cho nhiu kin xc ng.
Ngi thc hin
Trn Vn Lm
6