Professional Documents
Culture Documents
Epsilon Vol02 2015april
Epsilon Vol02 2015april
T p c h
online ca
cng ng
nhng n g i
y u
T o n
i s tuyn tnh
VN TU
Nghch o Mbius
Ng Quang Hng
Phng trnh
i s 1 n s
Ng Bo Chu
Bi ton Frobenius
v nhng ng xu
Trn Nam Dng
Bi ton i nn
ng Nguyn c Tin
Khm ph ton hc
thng qua cc
nh l hnh hc.
o Thanh Oai
13 apr 2015
Laurent Schwartz
H Huy Khoi
Gii thiu
Vietnam TST 2015,
bnh lun s b v
tm tt cch gii.
Trn Nam Dng
V CC
CHUYN MC
KHC
EPSILON
Ch bin: abc TRN NAM DNG
Bin tp vin: NG NGUYN C TIN
Bin tp vin: V QUC B CN
Bin tp vin: TRN QUANG HNG
Bin tp vin: L PHC L
T p c h
online ca
cng ng
nhng n g i
y u
T o n
LI NG CHO EPSILON S 2
Ban bin tp Epsilon
T p c h
online ca
cng ng
nhng n g i
y u
T o n
MC LC
Li ng . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
Phng trnh i s mt n s
Ng Bo Chu . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
variste Galois
Lu Trng Lun . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
Nghch o M
obius
Ng Quang Hng . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41
Cc bi ton i nn
ng Nguyn c Tin . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53
10 Cc vn c in v hin i
7
T p c h
online ca
cng ng
nhng n g i
y u
T o n
13
14
T p c h
online ca
cng ng
nhng n g i
y u
T o n
PHNG TRNH I S
MT N S
Ng Bo Chu
i hc Chicago, M
Tm tt
T th k 20 trc Cng nguyn, ngi dn thnh Babylon
bit gii phng trnh bc hai. Nhng phi n th k
16 sau Cng nguyn, cc nh ton hc ca thi Phc hng:
Tartaglia, Cardano, Ferrari, mi tm ra li gii cho phng
trnh bc ba v bc bn. u th k 19, Abel v Galois,
hai thin ti ton hc bc mnh, chng minh nghim ca
phng trnh i s tng qut bc t nm tr i, khng th
biu din c nh mt biu thc i s vi cn thc nh
trong trng hp a thc bc khng qu bn. Cng trnh
ca Galois, vit ra nh li trng tri trc gi u sng,
sau c xem nh mc khai sinh ca i s hin i.
L thuyt Galois hin i c pht biu trn c s cc
khi nim m rng trng v nhm Galois. Nhng khi
nim ny khng d nm bt. Mc ch ca bi vit ny l
gip nhng ngi mi hc nm bt nhng khi nim ,
thng qua vic tm hiu m thc m chng xut hin trong
qu trnh tm nghim ca nhng phng trnh i s c
th.
Ngi vit cho rng hu ht khi nim tng nh tru
tng u c ci ngun nhng thao tc ton hc c th
v thng dng. Ngi vit cng cho rng ch khi c nng
ln tm khi nim, cc thao tc ton hc mi tr thnh
nhng cng c t duy tht s mnh m. Cu chuyn sp
k v thuyt Galois c th xem nh mt minh chng.
hiu bi vit ny, ngi c cn mt s kin thc c
bn v i s tuyn tnh, trong c bit quan trng l
khi nim chiu ca khng gian vector.
15
1. Lch s ca bi ton
Vo th k th by trc cng nguyn, li gii cho phng trnh
bc hai tng qut
x2 + ax + b = 0,
(3.1)
c nh ton hc Brahmagupta, ngi n , trnh by
mt cch tng minh dng
?
a d
,
(3.2)
x=
2
vi d = a2 4b l bit thc ca phng trnh bc hai.
Trc , t khong th k 20 trc cng nguyn, ngi Babylon
tm li gii hnh hc cho bi ton tng ng tm hai cnh
ca hnh ch nht bit trc chu vi v din tch ca n. Du vt
ca nhng phng php hnh hc khc nhau gii phng
trnh bc hai c pht hin trong hu ht cc nn vn minh
c i t Babylon, Ai cp, Hy lp, n , Trung Hoa ...
Phng trnh bc ba tng qut cng c ngi Babylon nghin
cu. Ngi Hy lp c i th xy dng nghim phng trnh
bc ba bng thc k v compa nhng khng thnh cng.
Nh ton hc Trung Hoa Wang Xiaotong a ra li gii cho 27
phng trnh bc ba khc nhau, nhng khng a ra phng
php gii phng trnh bc ba tng qut.
ng k nht l pht hin ca nh th ngi Ba t Omar
Khayyam sng vo th mi mt. ng chng minh rng nghim
c th xy dng nghim phng trnh bc ba bng cch ly giao
hai ng conic. Ngoi ra, ng pht biu rng khng th xy
dng nghim phng trnh bc ba ch bng thc k v compa.
Omar Khayyam khng a ra mt cng thc cho nghim ca
phng trnh bc ba ging nh cng thc (3.2) cho phng
trnh bc hai.
Phi ch n thi k phc hng, nh ton hc Tartaglia, sng
vo th k th mi su, mi a ra cng thc tng qut
u tin cho nghim ca phng tnh bc ba
ax3 + bx2 + cx + d = 0,
(3.3)
dng
1
x=
3a
0
b+C+
,
C
16
(3.4)
trong
d
C=
1 +
a
21 430
,
2
(3.5)
3. M rng bc hai
gii phng trnh bc hai (3.1), ta thc hin php i bin
y = x + a2 . Sau khi i bin, phng trnh (3.1) quy v dng
n gin hn
y2 d = 0.
(3.7)
Ta c th coi y l mt ci mo quy phng trnh bc hai
tng qut (3.1) v phng trnh bc hai rt gn (3.7).
Ta cng c th thay i quan im: Khng quan tm n vic
tm ra dng chnh xc (3.2) ca nghim na, m ch quan tm
n ?
vic nghim c th biu din di dng biu thc i s
ca d. Lp lun c th s phc tp hn, nhng s m ra cho
ta mt tm nhn mi.
lm n gin vn , gi s cc h s a, b l s hu t. Ta
bit rng trong C, phng trnh (3.1) c hai nghim. Ta s k
hiu 1 P C l mt trong hai nghim ca n. Gi s 1 R Q, khi
tp cc s phc c dng
L = tm + n1 | m, n P Qu,
l mt khng gian vector hai chiu trn Q. T ng thc
21 = (a1 + b),
ta suy ra rng nu u, v P L th uv P L. Ta cng c th chng
minh rng nu u P L t0u, th u1 P L. Nh vy L l mt trng
con ca C. Nu xem nh khng gian vector trn Q, n c chiu
bng 2. V th ta ni rng L l mt m rng bc hai ca Q.
Ta thy nghim cn li, k hiu l 2 , ca a thc
P = x2 + ax + b,
18
(3.9)
(3.10)
(3.12)
(3.13)
24
7. Tng ng Galois
Nh ta thy trong mc trc, nu L l trng phn r ca
a thc bt kh quy tch c P P K[x], th m rng L/K c tnh
cht s phn t ca nhm AutK (L) ng bng vi bc ca m
rng. M rng L/K c gi l m rng Galois nu tnh cht ny
c tho mn. Trng phn r ca mt a thc bt kh quy
lun lun l m rng Galois.
M rng L/K gi l m rng tch c nu tn ti mt a thc
bt kh quy P P K[x] tch c sao cho L K[x]/(P), tt nhin c
th c nhiu a thc P nh th. D thy nu L = K[x]/(P) l m
rng tch c nh trn v l m rng Galois, th L l trng
phn r ca P. Ni cch khc m rng Galois l trng phn
r ca mt a thc no . Mt khc, n c th ng thi l
trng phn r ca nhiu a thc khc nhau.
Khng phi m rng no cng l m rng Galois. Quay li v
d (3.12) m rng bc ba Q[] ca Q, vi l mt nghim ca
x3 2. Nu P AutQ (Q[]) th () cng phi l mt nghim ca
x3 2. Theo (3.12) th khng th l mt t ng cu ca Q[]
tr trng hp = 1.
Ni cch khc Q[] khng phi biu din Galois.
Ngc li, theo (3.13) th K[]/K l m rng Galois vi K = Q[j]
vi j l cn nguyn s bc ba ca n v (3.11). Tng qut hn
nh l 7.1. Nu xn a P K[x] l mt a thc bt kh quy tch
c, khi nu K cha cn nguyn s bc n ca n v, th vi
mi nghim P K ca a thc xn a, m rng L = K[] ca K l
m rng Galois.
Cc m rng trung gian gia K v L c th c phn loi da
vo . y thng c coi l mnh quan trng nht trong
l thuyt Galois, v c gi tng ng Galois. Vn ci g
quan trng nht lun lun c th bn ci.
nh l 7.2. Mi m rng trung gian K L 1 L ng vi mt nhm
con 1 ca bao gm cc phn t P tc ng ln L nh mt
1
nh x L 1 -tuyn tnh. Tng ng ngc li c cho bi L 1 = L .
Hn na, L 1 l m rng Galois ca K khi v ch khi 1 l nhm con
chun tc ca . 3
3
25
Trong trng hp , ta c L 1 /K = / 1 .
Trong mc 5, ta kho st trng phn r L ca mt a thc
bt kh quy P P K[x] thng qua chui m rng lin tip
K = L0 L1 L2 Ln = L,
vi Li l compositum ca K[1 ], K[2 ], . . . , K[i ]. Chui m rng
tng ng vi chui cc nhm con ca
= 0 1 n = 0.
(3.16)
(3.17)
(3.18)
9. Phng trnh bc ba
Li gii phng trnh bc ba ca Tartaglia kh phc tp v n
ging nh mt ci g t trn tri ri xung. Li gii phng trnh
bc bn ca Ferrari cn phc tp hn na. Sau ny, Lagrange
a ra phng php rt p tm ra phng php chung cho
li gii ca Tartaglia, Cardano v Ferrari. ng sng to ra mt
cng c mi, gi l resolvent, m chng ta s tm chuyn ng
thnh gii thc.
minh ho cho cng dng ca phng php Lagrange, ta s
trnh by li gii phng trnh bc ba tng qut theo phng
php ny vi cht t h tr ca l thuyt Galois. Mc d phng
php gii thc ca Lagrange c th din gii d dng bng l
thuyt Galois, ta cng nn lu l nhm Galois sinh ra sau
phng php gii thc Lagrange.
Trong i s hin i, ta c th gn cho ch tng qut mt
ngha chnh xc: Ta chn trng c s
K = k(a, b, c) R = k[a, b, c],
l trng cc biu thc hu t vi bin s a, b, c v h s nm
trong mt trng k no . a thc bc ba tng qut l a thc
P = x3 + ax2 + bx + c P R[x].
28
(3.19)
d=
(i j ),
ij
(3.20)
2 () = j2 ,
v t suy ra
= ()2 () = 3 .
Phn t biu din nh tch ()2 () hin nhin c tnh n
nh di tc ng ca . V vy P K+ .
Ta khng nh rng
L K+ [x]/(x3 ).
(3.21)
Tht vy ta c ng cu vnh
: K+ [x]/(x3 ) L,
xc nh bi x v 3 = . V () , cho nn R K, v nh
ca ng cu l mt m rng trung gian
K im() L
vi K im(). Ta nhn thy chiu ca im() nh khng gian
vector trn K phi bng ba v m rng bc ba L khng th cha
trong n mt m rng bc hai.
Ni cch khc, ng cu l ton nh. V khng gian ngun
v ch c cng s chiu, l ng cu. Nh vy mi phn t
ca L, trong c 1 , 2 , 3 , c th biu din mt cch duy nht
di dng
m0 + m1 + m2 2 , vi m0 , m1 , m2 P K+ .
31
33
34
T p c h
online ca
cng ng
nhng n g i
y u
T o n
variste Galois
Ngi dch: Lu Trng Lun
i hc FPT
Ngun: www-history.mcs.st-andrews.ac.uk/Biographies/Galois.html
Nh ton hc ngi Php (25/10/1811 - 31/05/1832)
35
40
T p c h
online ca
cng ng
nhng n g i
y u
T o n
NGHCH O MOBIUS
Ng Quang Hng (i hc Buffalo, M)
1. Ba v d
1.1. Ton t hp
Cng thc inclusion-exclusion ni rng, m tng s nhc t
c Ch Pho l b hoc th N l m, th ta cng s con ca ch
Pho vi s con ca th N tr i s con chung. Ni cch khc,
cho n tp hp hu hn A1 , , An th ta c th tnh lc lng
ca hi ca chng bng cng thc:
n
n
=
|A
|
A
i
i
i=1
i=1
1ijn |Ai X Aj | +
n1
|A1 X X An |
1ijkn |Ai X Aj X Ak | + (1)
Cng thc ny mt s sch ni l ca Abraham de Moivre;
nhng c v n xut hin nm 1854 t mt bi bo ca Daniel
da Silva, v ln na nm 1883 trong mt bi bo ca Joseph
Sylvester [11].
Bi tp 1.1. Nm 1891, Francois douard Anatole Lucas (cha
bi ton thp H Ni) t cu hi sau y: cho mt ci bn
trn v m cp v chng, c bao nhiu cch xp h ngi nam
n xem k sao cho khng cp v chng no ngi k nhau?" Ta
c th dng cng thc IE tr li cu hi ca Lucas.
41
1.2. L thuyt s
Trong l thuyt s c mt cng thc gi l cng thc nghch o
Mobius [10], xinh hn hoa hu! Cng thc ny pht biu nh
sau: Cho 2 hm s f, g bt k trn min s nguyn dng, ta c
f(n) =
g(d), @n 1
d|n
tng ng vi
g(n) =
(d)f(n/d), @n 1
d|n
%
0
d c c s l bnh phng ca mt s nguyn t
August Ferdinand Mobius l mt nh thin vn ngi c, tng
l tr l ca Gauss; ng cng l tc gi ca ci bng Mobius
lng danh trong hnh hc T-p.
(1)i Fi = 0.
i=1
42
2. Nghch o M
obius trn posets
2.1. Tp hp th t bn phn (Poset)
Poset i khi l mt tp hp m ta c th so snh ln nh
gia mt s cp phn t nhng khng nht thit l so c tt
c cc cp. Th t ln nh ny c tnh bc cu (transitive) v
khng to ra th t lun qun.
C th hn, mt poset (tp th t bn phn) l mt cp (P, )
trong P l mt tp hp v l mt quan h nh phn (hay
quan h hai ngi) gia cc phn t ca P tha mn 3 tnh cht
1. x y v y z suy ra x z, vi mi x, y, z P P (tnh bc cu
transitive)
2. x x, @x P P (tnh phn x reflexive)
3. x y v y x suy ra x = y (tnh phn xng antisymmetric)
V d 2.1. P = Bn l tp tt c cc tp con ca [n] v quan
h nh phn l , ngha l X Y nu v ch nu X Y. Ci
poset ny gi l i s Bool (Boolean algebra). Xem v d trn
Hnh 5.1.
43
t1, 2, 3u
t1, 2u
t1, 3u
t2, 3u
t1u
t2u
t3u
H
Hnh 5.1: i s Bool B3
V d 2.2. P = Dn l tp tt c cc c s dng ca n, quan
h nh phn l quan h chia ht, ngha l i j nu v ch nu
i|j. K hiu i|j ngha l j chia ht cho i (hay i chia ht j). Xem v
d trn Hnh 5.2.
60
12
20
30
10
15
1
Hnh 5.2: Poset cc c s ca 60
V d 2.3. P l tp tt c cc mt (faces) ca mt a in
(polytope) trong khng gian n chiu; v x y nu mt x cha
trong mt y. Mt rng cng l mt mt vi chiu 1, v ton
44
b
a
ea
ad
a
ab
e
ec
eb
c
abcd
ed
d
cb
cd
H
Hnh 5.3: Face lattice ca hnh Pyramid
2.2. Hm M
obius ca poset
Nhng iu ta vit sau y ng cho mt trng K ty h v cc
posets v hn (min l n hu hn a phng1 ). cho n
gin, ta pht biu cc kt qu vi K = C v cc posets hu hn
thi.
Gi (P, ) l mt poset hu hn. Ta xt cc ma trn kch thc
|P| |P| sao cho (x, y) = 0 nu x y. Khi x y th (x, y) P C
ty h. Tp cc ma trn ny gi l i s k (incidence algebra)
ca P, k hiu l I(P). Trong i s k th ma trn nh ngha
bng
#
1 x=y
(x, y) =
0 xy
l ma trn n v.
nh l 2.4. Cho trc poset (P, ) trong P hu hn. Xt mt
ma trn P I(P) ty th kh nghch nu v ch nu (x, x)
0, @x P P.
1
45
()(x, y) =
(x, z)(z, y) =
(x, z)(z, y),
xzy
zPP
ti v nu x z th (x, z) = 0, cn nu z y th (z, y) = 0. Do
, t = ta suy ra
(x, y) =
(x, z)(z, y) =
(x, z).
xzy
xzy
Hay vit c th hn th vi mi x, y P P ta c
#
1 nu x = y
(x, y) =
0 nu x y.
xzy
46
(5.1)
&1
(x, y) = xzy (x, z)
%
0
(5.2)
2.3. Nghch o M
obius
Xt hai hm s f, g : P C bt k. Ta c th xem chng nh hai
vectors trong khng gian C|P| . Cng thc nghch o Mobius
trn poset ni hai iu rt n gin:
f = g g = f,
(5.3)
(5.4)
g(y), @x P P g(x) =
xy
xy
47
(x, y)f(y), @y P P.
(5.5)
g(y), @x P P g(x) =
xy
(y, x)f(y), @y P P.
(5.6)
xy
(1)dim(B)dim(H) f(B) =
mt B
(1)dim(B)+1 =
mt B
(1)i Fi .
i=1
g(Y)
f(X) =
XY
f(X) = Ai .
iPX
p dng (5.5) cho poset P = Bn ta kt lun
0 = g(H) =
(1)|Y| Ai .
iPY
Y[n]
3. B SauerShelah
Chng ta t thng cng bng cch chng minh mt b t
hp quan trng gi l b Sauer-Shelah [7, 8]. B ny c
ng dng su sc trong l thuyt hc my, c th l l thuyt
chiu Vapnik-Chervonenkis (VC dimension) [13, 12].
Gi F l mt b cc tp con ca [n]. Vi S [n] bt k, nh
ngha hnh chiu ca F ln S l tp
F (S) = tF X S | F P Fu.
Ta ni F bm nt S nu F (S) = 2|S| .
B 3.1 (B Sauer-Shelah). Cho trc F l mt b cc tp
con ca [n]. Gi d l kch thc ln nht ca mt tp S [n] b F
bm nt, th
d
n
.
|F| d (n) =
i
i=0
Chng minh. Ta chng minh b ny bng phng php
[n]
chiu (i S tuyn tnh van tu!). Gi d
l tp tt c cc tp
con ca [n] vi kch thc b hn
hoc bng d. Vi mi F P F,
[n]
nh ngha mt hm s hF : d R nh sau:
#
1 XF
.
hF (X) =
0 XF
Cc hm hF l cc vectors trong khng gian Rd (n) . C tt c |F|
vectors hF , do nu chng c lp tuyn tnh th |F| d (n).
Gi s chng khng c lp tuyn tnh, ngha l tn ti cc h
s F sao cho
F hF = 0
(5.7)
FPF
[n]
cch khc vi X P d ty ta c XY Y = 0. nh ngha
[n]
X = XY g(Y), th ta va thy rng X = 0, @X P d
.
Gi Y l tp con nh nht ca [n] sao cho Y 0. (Nu ta ly tp
F P F c kch thc ln nht sao cho F 0 th F = F 0, do
49
A 0.
A[n],AXY=Z
l xong, ti v A = 0, @A R F. n y ta xt poset Bm gm tt
c cc tp con ca Y Z (t m = |Y Z|). Poset ny l i s
Bool bc m. Vi mi phn t W Y Z, nh ngha
g(W) =
X .
X:XXY=ZYW
V nh ngha, vi mi V Y Z,
f(V) =
g(W).
VWYZ
A = g(H) =
(1)|V| f(V) = (1)|YZ| Y 0.
A[n],AXY=Z
VYZ
4. Ch thch
B sch ca Stanley [10, 9] l tham kho quan trng nht cho
ton t hp m bao gm nghch o Mobius, t hp t-p. Sch
ca Vapnik [12] ni v l thuyt hc my xc sut v l thuyt
chiu Vapnik-Chervonenkis. Mt tham kho tuyt vi khc cho
ton T hp l quyn sch ca van Lint v Wilson [11]. Trong
ngnh my tnh, nghch o Mobius c ng dng trong c s
d liu [2], thut ton [3, 1].
50
[1] BJ ORKLUND
, A., HUSFELDT, T., KASKI, P., AND KOIVISTO,
M. Trimmed moebius inversion and graphs of bounded
degree. Theory Comput. Syst. 47, 3 (2010), 637654.
Indiscrete thoughts.
[7] SAUER, N. On the density of families of sets. J. Combinatorial Theory Ser. A 13 (1972), 145147.
[8] SHEL AH, S. A combinatorial problem; stability and order
for models and theories in infinitary languages. Pacific J.
Math. 41 (1972), 247261.
[9] S TANLEY, R. P. Enumerative combinatorics. Vol. 2, vol. 62 of
Cambridge Studies in Advanced Mathematics. Cambridge
University Press, Cambridge, 1999. With a foreword by
Gian-Carlo Rota and appendix 1 by Sergey Fomin.
51
[10] S TANLEY, R. P. Enumerative combinatorics. Volume 1, second ed., vol. 49 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 2012.
[11]
LINT, J. H., AND WIL SON, R. M. A course in combinatorics, second ed. Cambridge University Press, Cambridge,
2001.
VAN
52
T p c h
online ca
cng ng
nhng n g i
y u
T o n
CC BI TON I NN
ng Nguyn c Tin (i hc Trento, Italy)
1. Bi ton 3 chic nn
Nhc li : C 3 ngi chi,
cuc chin gia nhng ngi chi v ngi dn tr. Trung bnh
chin thng do vy l 58%. Liu c cch lm tt hn 58% i
ph vi ngi dn tr xo quyt?
Rt th v l chng ta c th nng cp chin thut c bo
ton kh nng chin thng 75%. Chin thut ny nh sau:
Chng ta c 8 cch i nn khc nhau v cc cch ny c th
ghp thnh tng cp i xng" nhau, i vi xanh. V d 3
nn -- , s i vi 3 nn xanh-xanh-xanh XXX, hoc
X s i vi XX. Tng tng trn mt hnh lp phng vi
ta cc nh tng ng ln lt vi cc cch i nn, v 2
nh ni vi nhau khi ch c 1 nn khc mu nhau. Cc cu
hnh i nn i xng" chnh l cc nh i xng nhau trn
hnh lp phng ny.
XX
XXX
XX
XX
XX
XX
XXX
XX
Nn 2 Nn 3
Xanh Xanh
Xanh
Xanh
Xanh Xanh
Xanh
Xanh
on 1 on 2
B qua
Xanh
Xanh
B qua
Xanh
B qua B qua
B qua B qua
Xanh
B qua
B qua
on 3
B qua
B qua
Xanh
Xanh
B qua
B qua
Kt qu
ng
ng
Sai
ng
ng
Sai
ng
ng
56
57
M HAMMING V BI TON I NN S 5
Gi s ti mun gi mt thng ip cho bn v thng ip
ny c m ha thnh cc bit nh phn (k s 0 hoc 1).
Tuy nhin gia ng truyn c k can thip, v thay i
mt bit no trc khi bn nhn c thng ip. V vy,
ti phi tm ra cch thm vo mt s thng tin b sung cho
thng ip sao cho khi nhn c, bn c th pht hin
thng ip b thay i v hn na, bn c th khi phc
li thng ip gc. Mt trong nhng phng php c bn
phng chng vic sa i ny l s dng m ti din: ti
s gi mt ln 3 bit ging nhau cho cng 1 bit m ti mun
gi cho bn: 000 hoc 111. Lc ny, d k can thip c thay
i bt k bit no, ti cng s khi phc li c. Cch lm
ny tuy t mc ch, nhng hiu qu khng cao, v ni
dung tha chim n 2 ln ni dung thng tin cn gi.
M Hamminga a ra cch tt hn cho vic sa li ny, trong
c 2k 1 bit thng tin gi i ch c k bit b sung, cn li
2k k1 bit l d liu. V d vi k = 4, khi gi mt thng ip
c chiu di 15 bit th trong 11 bit l d liu (so vi ch 5
bit l d liu phng php s dng m ti din). Chi tit
cch hot ng ca m Hamming c gi c th d dng tm
thy ti Wikipedia. y, chng ti ch ch ra mi quan h
gia Hamming v bi ton i nn s 5.
Mt c tnh ng ch ca m Hamming l bt k chui
(c chiu di 2k 1) no cng hoc l mt thng ip ng,
hoc ch b sai mt bit. iu ny khc bit vi m ti din
v m ti din c mt s thng ip s khng bao gi xut
hin. V d, bn s khng bao gi nhn c m 001011 v
y c n 2 bit b thay i. m Hamming, mi chui
u c kh nng xut hin.
By gi, gi s ta m ha nhng ngi i nn xanh l 0 v
nn l 1, khi mt cch i nn cho N ngi tr thnh
mt "thng ip" N bit. Lc ny, mi ngi s c th thy
ton b nhng bit khc, tr bit ca anh ta, v tt nhin ch
c 2 kh nng hoc anh ta l bit 0 (xanh), hoc l bit 1 ().
Ngi chi s dng chin thut l lun gi nh chui N bit
58
59
62
3. Bi ton v hn nn
Trong phn ny, chng ti tham kho v gn nh dch li phn
ln nhng ghi ch t bi ton #1179 trong chuyn mc Cu
hng tun ca nh ton hc Stan Wagon (i hc Macalester).
Nh 2 phn trc, chng ti ng li bi y c gi
tin theo di.
Bi ton ny c ra bi Lionel Levine (i hc Cornell) vo
nm 2011 nh sau: Bn ngi cng tham gia mt tr chi on
nn nh sau: Ngi dn tr s i v hn cc nn c mu trng
hoc en ln u mi ngi vi xc sut nn trng v en l nh
nhau v bng 12 . Cc nn ca mi ngi c nh s ln lt
1, 2, . . . Mi ngi chi ch thy c ton b nn ca 3 ngi
khc nhng nn ca mnh th h khng thy.
Mi ngi s c pht mt t giy v h c php ghi vo
mt con s, ng vi ch s ca nn ca h m h on l mu
en. Sau khi nhn tr li, ngi dn tr s kim tra s c
63
tn logn (2)
n!
n=0
66
67
1, 4, 3, 5,
7, 1, 3, 2,
7, 6, 8, 3,
4, 6, 5, 7,
4, 6, 2, 1,
2, 4, 5, 7,
2, 8, 6, 7, 6,
2, 1, 4, 3, 6,
7, 1, 4, 1, 2,
2, 6, 5, 6, 2,
Ma trn A
6,
5,
2,
4,
3,
1,
5,
8,
8,
1.
2,
7,
6,
1,
5,
6,
1,
8,
5,
7,
1, 3, 5, 4,
8, 1, 3, 2,
5, 8, 7, 3,
1, 5, 4, 6,
4, 1, 3, 2,
5, 4, 5, 6,
3, 7, 7, 7, 6,
3, 1, 2, 5, 6,
7, 2, 2, 3, 1,
8, 6, 1, 3, 1,
Ma trn B
6,
4,
2,
6,
7,
2,
4,
8,
8,
2.
2,
7,
6,
1,
4,
6,
2,
3,
7,
8,
1, 3, 5, 4,
8, 1, 3, 2,
5, 8, 7, 4,
6, 5, 8, 8,
5, 4, 2, 1,
7, 5, 4, 6,
3, 6, 1, 6, 7,
8, 2, 1, 4, 8,
6, 3, 1, 4, 2,
4, 5, 2, 4, 2,
Ma trn C
6,
4,
2,
6,
7,
1,
5,
6,
7,
1.
1 3 2
3 2 1
2 1 3
tng kt cc phng php, chng ti s dng li hnh nh
ca tm tt Stan Wagon v trnh by li Hnh. 6.3.
3.4. Trng hp n = 2
Ton b cc chin thut trc u c gng tm ra phng n
tt hn cho n 2, v vi n = 2, a s u ngh rng chin thut
n gin New Zealand cho kt qu ti u. Tuy nhin, Jim
Roche khm ph ra rng, ngay c trong trng hp n = 2, cc
phng n tt hn vn cn c th c pht hin! C th, chin
thut sau y s thnh cng vi xc sut 22/63 = 0.349 1/3.
A v B s tun theo 7 "mu" nh sau: nu A thy 3 nn u tin
ca B l en-en-en hoc en-en-Trng hoc Trng-enen, A s chn 1. Nu A thy 3 nn u l en-Trng-en hoc
69
70
3.5. Sng to bt tn
Liu chng ta c th nng cao hiu qu cho bi ton? gii
p c cu hi ny, trc tin cn pht biu li bi ton mt
cch h thng. Th xt vi trng hp n = 2:
Gi P l tp ca tt c cc chui 0 v 1; v N l tp s t nhin.
Khi , mt cch i nn mt ch s no l mt phn t
ca P P. 5 Mt chin thut l mt hm S : P P N, khng
quan tm nu hm ny c kh dng hay khng (hay d hiu
hn l khng quan tm n s phc tp ca hm ny). V nh
vy vi l thuyt tp hp da trn tin chn6 , tn ti mt
chin thut m nu ngi chi s dng h s a tp con ca
PP v chin thng vi o ngoi bng 1. iu ny c ngha l
lun tn ti chin thut m ngi chi khng thua! Hoc, quay
li nhng nghi ng kinh in ca Ton hc v tin chn vi
nhng tranh ci cng v tn nh chnh bn thn ca vn !
Nh vy, mc d tn ti chin thut lun chin thng (Lu :
tin chn c s dng), vi trng hp n = 2, chin thut
tt nht c ghi nhn hin ti vn ch l 35% v vi n 2, kt
qu hy cn thp hn rt nhiu. iu ny c ngha l bi ton
vn cn c m v mong ch cc ng gp t nhng ngi
yu ton hc.
4. Li kt
Nh vy l vi 2 chuyn mc u tin v ton hc gii tr ng
ti 2 s u tin ca Epsilon, chng ti gii thiu tng i
trn vn "50 nm nhng bi ton i nn". Thng qua nhng
bi ton ny, chng ti hi vng mang n cho c gi khng
5
71
72
T p c h
online ca
cng ng
nhng n g i
y u
T o n
BI TON FROBENIUS
V NHNG NG XU
Trn Nam Dng (i hc KHTN, TP. H Ch Minh)
Nguyn Tt Thu (THPT Chuyn Lng Th Vinh, ng Nai)
1. M u
Chng ta m u bng mt bi ton vui sau y: Chng ta u
c truyn hoc xem phim Ty Du K. Cu chuyn sau y
rt t chuyn i k v ca thy tr ng Tng n Ty Trc.
Va thot khi kip nn Bch ct tinh, thy tr ng tng li
i vo mt vng quc mi, gi l vng quc Ng Bt. S d c
ci tn ny l bi v Ngn hng trung ng ca Vng quc ny
ch pht hnh 2 loi tin 5 quan (Ng) v 8 quan (Bt).
Vng quc ny cng cha c pht trin lm nn ngi dn
y ch bit php tnh cng, khng bit php tnh tr. V th,
khi bn hng, nu mnh a tha ngi ta s khng tr li (cn
a thiu th ngi ta. . . khng chu - khn lm).
Thy tr ng tng ang i tung tng trong thnh th thy
mt siu th c tn l Over 28. Thy tn l l, h bn bc vo.
73
Nhn vin bo v ra chn li, xem chng khng mun cho vo.
Tr bt gii xng ra ni:
- Sao khng cho chng ta vo?
Tay bo v ch tay vo s 28 (nh thp bt) ni: ng c thy s
g y khng?
- 28 . 28 tui mi c vo . Yn tm i nh ch em. Anh y
360 tui ri nh. Cn ng anh ang gi mng kia 720 tui. Ci
ch ang gnh hng c 240 tui. Ngay c con nga ny cng
130 tui ri. Tr nht y c l l s ph ca bn anh, ng y
va lm sinh nht ln th 30. Cc ch c cn xem chng minh
nhn dn khng, loi mi nh, c c tn b m.
- Khng, khng, y khng phi tui, y l. . .
- y l g. . . Tr Bt gii c th tn cng.
- y l siu th m mi mn hng u t 28 quan tr ln. Ti
thy my ng nh qu qu, s khng tin nn khng mun
cho vo.
- y, ch ng ngh th. Bn anh y u l con nh c iu
kin nh, tin 5 quan, 8 quan bn anh mi i ca khu nch
ti nh.
- Vy xin mi cc anh vo .
Bi ton m u: Chng minh rng thy tr ng tng c th
mua ng (tc l tr ng gi tin) mi mn hng trong siu
th "Over 28".
V mt ton hc, bi ton ny tng ng vi mnh sau:
Chng minh rng vi mi s nguyn N 28, tn ti x, y nguyn
khng m sao cho N = 5x + 8y. Bi ton ny l trng hp ring
ca bi ton Frobenius v nhng ng xu m ta s ni n di
y. C hai cch gii bi ton ny, u mang tnh thut ton.
Cch 1: Ta tm cch biu din cho cc s 28, 29, 30, 31, 32. Sau
ch rng nu N biu din c th N + 5 cng biu din
c.
74
N = ax + by vi 0 x b.
Ta ch cn chng minh y 0. Tht vy
y=
ab a b a(b 1)
N ax
= 1.
b
b
M y l s nguyn nn ta c y 0.
Vy bi ton c chng minh.
Tr li bi ton trong thi VMO2015. Bi ton c th c
pht biu thnh bi ton tng qut hn nh sau
Bi ton 3. Cho cc s nguyn dng a, b nguyn t cng nhau.
Khi N0 = a2 b + b2 a a2 b2 ab l s nguyn dng ln nht
khng biu din c di dng a2 x + aby + b2 z vi x, y, z l cc
s nguyn khng m.
Li gii. Tng t nh bi ton 2 v bi ton 3, ta chng minh
bi ton qua hai bc.
Bc 1: Chng minh N0 khng biu din c di dng a2 x +
77
aby + b2 z.
Gi s tn ti cc s t nhin x, y, z
N0 = a2 x + aby + b2 z
Hay
a2 (b x 1) + b2 (a z 1) = ab(y + 1).
T y, suy ra mt trong hai s b x 1 v a z 1 c t nht
mt s dng. Khng mt tnh tng qut, ta gi s b x 1 0.
.
Khi , do (a, b) = 1 nn ta suy ra b x 1..b, dn ti b x 1 b
hay x 1 (v l).
Do vy N0 khng biu din c qua a2 x + aby + b2 z.
Bc 2: Chng minh vi mi s nguyn N N0 th N biu din
c di dng a2 x + aby + b2 z.
Do N N0 nn N ab2 + a2 + ab a ab2 b2 a nn theo nh
l Sylvester ta suy ra tn ti cc s t nhin u, z sao cho
N ab2 + a2 + ab a = ua + b2 z (4).
V u 0 nn u + ab a b + 1 ab a b nn tip tc p dng
nh l Sylvester suy ra tn ti cc s t nhin x, y sao cho
u + ab a b + 1 = xa + yb (5).
Thay (5) vo (4) ta c
N ab2 + a2 + ab a = a(ax + by ab + a + b 1) + b2 z
Hay
N = a2 x + aby + b2 z.
Bi ton c chng minh.
Ti k thi IMO nm 1983 c bi ton sau
Bi ton 4. Cho cc s nguyn dng a, b, c i mt nguyn
t cng nhau. Chng minh rng N0 = 2abc ab bc ca l
s nguyn dng nh nht khng biu din c di dng
abx + bcy + caz vi x, y, z l cc s nguyn khng m.
Li gii. Tng t nh cch chng minh nh l Sylvester, bi
ton c chng minh qua hai bc
Bc 1: Chng minh N0 khng biu din c qua abx + bcy +
caz. Chng minh iu ny tng t nh cch chng minh nh
78
l Sylvester.
Bc 2: Chng minh vi mi s nguyn dng N N0 th N
lun biu din c di dng abx + bcy + caz.
V (a; bc) = 1 nn theo bi ton 1 tn ti u, y sao cho au + bcy =
N vi 0 y a 1 . Tng t, tn ti v, z sao cho N = vb + zac
vi 0 z b 1.
.
T , suy ra bcy + caz N..ab. Hay tn ti s nguyn x sao cho
abx + bcy + caz = N.
Ta ch cn chng minh x 0. Tht vy
x=
= 1.
ab
ab
80
1
1
ka lb
pta,bu (n)zn
z
.z
=
.
=
1 za 1 zb k,l0
n=0
1
f (z) =
=
pta,bu zkn .
(1 za ) (1 zb ) zn k=0
Chui cui cng ny khng phi l chui ly tha, v n c
cha nhng s hng vi s m m. Chui ny c gi l chui
Laurent, theo tn ca Pierre Alphonse Laurent (18131854). i
vi chui ly tha, tnh s hng t do ta ch cn thay z = 0
vo. Nhng vi chui c ly tha m th vic thay z = 0 vo l
khng c php. x l tnh hung ny, ta s loi i tt c
cc s hng vi s m m c chui ly tha. S hng t
do ca n (cng l s hng t do ca chui ban u) s c
tnh bng cch thay z = 0 vo.
81
2
2
+ i sin
a
a
th 1, a , 2a , ..., a1
l tt c cc cn bc a ca n v.
a
1
Trc ht ta tm phn tch s cp cho
. V cc ca hm
1 za
s ny nm ti cc im cn bc a ca n v, do
a1
Ck
1
=
.
1 za k=0 z ka
a1
1 za
a
zk
zk
a az
a
trong a s dng quy tc LHopitale. Nh vy ta c khai
trin
a1
1
1 ka
=
.
1 za
a k=0 z ka
Tr li vi bi ton ca chng ta, cc cc ca f nm im z = 0
vi bc n, ti z = 1 vi bc 2 v ti cc cn n v bc a v bc
b khc vi bc 1 v a, b nguyn t cng nhau. Do , khai trin
ca f thnh tng cc phn s s cp s c dng
a1
b1
Ck
Dj
An
B1
B2
A1 A2
+ 2 +...+ n +
+
+
+
f=
z
z
z
z 1 (z 1)2 k=1 z ka j=1 z jb
(1).
1
a(1
k(n1)
kb
a )a
, Dk =
1
b(1
j(n1)
ja
b )b
(2).
=
,
2
a
b
n
z1
(1 z )(1 z )z
ab 2a 2b ab
ab(z 1)
vi vic p dng quy tc LHopitale mt ln na.
Ta khng cn tnh cc h s A1 , A2 , . . . , An v chng ch ng gp
cc s hng vi s m m m ta c th b qua; cc s hng ny
khng ng gp cho s hng t do ca f. V ta c tt c cc
h s khc, s hng t do ca f, nh ta ni trn, chnh l
gi tr ca hm s sau tnh ti im 0:
pta,bu (n) =
a1
b1
B2
Ck
B1
+
+
2 +
z 1 (z 1)
z ka j=1
k=1
= B1 + B2
a1
Dj
j
z b
z=0
b1
Ck
Dj
.
j
k
k=1 a
j=1 b
T
pta,bu (n) =
a1
b1
1
1
1
1
n 1
1
+ + +
+
. (3).
jn
kb
kn
2a 2b ab a k=1 (1 a )a b j=1 (1 jb
b )b
a1
!n) 1
1
1
1
=
+
. (4).
k
kn
a k=1 (1 a )a
a
2 2n
83
hni
n
u| =
+1.
a
a
pta,bu (n) =
ab
"
b1 n
a
"
a1 n
b
*
+ 1,
ab
"
b1 (ab n)
a
"
a1 (ab n)
b
*
+1
" 1 * " 1 *
" 1 * " 1 *
n
b n
a n
n
b n
a n
= 2
= +
+
= 1pta,bu (n).
ab
a
a
ab
a
a
y ta s dng tnh cht txu = 1txu vi x khng nguyn.
T b ny, ta d dng chng minh c nh l Sylvester
phn trc vi mt cch tip cn khc. Hn na, ta cn lm
c hn th: mi s t nhin nh hn ab nu biu din c
di dng ax + by vi x, y t nhin th biu din l duy nht.
84
b1
1
1
+
ka
kn
b k=1 (1 b )(1 kc
b )b
c1
1
1
+
.
kn
ka
c k=1 (1 c )(1 kb
c )c
5. Ghi ch v Ch dn lch s
1. Bi ton Frobenius c t theo tn ca nh ton hc
Georg Frobenius, ngi nu ra bi ton ny trong bi
ging ca mnh. Phn 1 ca nh l Sylvester l mt kt
qu dn gian kinh in m chng ta thng gp chung
lun vo nh l Sylvester. Tht ra, trong bi bo ca mnh,
Sylvester ch chng minh phn 2 ca nh l.
2. Bi ton Diophant tuyn tnh ca Frobenius khng nn
nhm ln vi bi ton tem th. Bi ton tem th t vn
tng t nhng c thm iu kin v s lng tem th:
Cho s nguyn dng m v tp V cc s nguyn dng,
86
88
T p c h
online ca
cng ng
nhng n g i
y u
T o n
Tm tt
K thi chn i tuyn quc gia Vit Nam (thng gi tt l
TST) nm 2015 chn ra 6 th sinh i d thi Olympic Ton
quc t ti Chiang Mai, Thi Lan vo u thng 7. Tham
gia k thi gm c 1 em ot gii Nht, 1 em t HCV trong
k thi IMO nm trc ti Nam Phi v 46 em ot gii
Nh trong k thi hc sinh gii Quc gia VMO hi u thng
01 nm 2015.
t gii Nh, cc em cn phi t t 21,5 n 32,5 im
(trn thang im 40) tc l t khong 4,5 bi n 6 bi
trong tng s 7 bi. Cc nh gi ca chng ti mt phn
l da trn kt qu ca cc em trn bi thi VMO 2015.
K thi din ra trong 2 ngy ti H S phm H Ni:
1. Ngy u tin l 25 thng 03 nm 2015.
2. Ngy th hai l 26 thng 03 nm 2015.
Thi gian thi theo truyn thng l 270 pht.
89
1. Thi
1.1. Ngy thi th nht
Bi ton 1. Gi l nghim dng ca phng trnh x2 + x =
5. Gi s n l s nguyn dng v cc s nguyn khng m
c0 , c1 , c2 , . . . , cn tha mn ng thc
c0 + c1 + c2 2 + . . . + cn n = 2015. ()
a) Chng minh rng c0 + c1 + c2 + . . . + cn 2 (mod 3).
b) Vi n no v c0 , c1 , c2 , . . . , cn nhng tha mn iu kin
() cho. Tm gi tr nh nht ca tng c0 +c1 +c2 +. . .+cn .
Bi ton 2. Cho ng trn (O) c dy cung BC c nh v
khng phi l ng knh. Xt im A di chuyn trn cung ln
BC sao cho tam gic ABC nhn v AB AC. Gi I, H ln lt l
trung im cnh BC v trc tm tam gic ABC. Tia IH ct li
ng trn (O) ti K, ng thng AH ct ng thng BC ti
D v ng thng KD ct li ng trn (O) ti M. T im M,
k ng thng vung gc vi ng thng BC ct AI ti im
N.
a) Chng minh rng im N lun thuc mt ng trn c
nh khi A thay i.
b) ng trn tip xc vi AK A v i qua N ct AB, AC ln
lt ti P, Q. Gi J l trung im ca PQ. Chng minh rng
ng thng AJ lun i qua mt im c nh.
2. Nhn xt chung
Cu trc thi Vit Nam TST nm nay gm c:
Bi 1: i s (a thc c h s nguyn v nghim v t)
Bi 2: Hnh hc phng
Bi 3: S hc
Bi 4: T hp
Bi 5: Hnh hc phng
Bi 6: Bt ng thc
Nh vy cu trc ca thi nm nay rt ging vi cu trc cc
thi IMO. Theo nh gi ch quan ca chng ti, kh ca
cc bi l nh sau:
Bi 1 v bi 4 c kh trung bnh (khong 50%-60% s
hc sinh s lm c trn vn).
Bi 2, bi 5a v bi 6 l cc bi tng i kh (khong
30%-50% s lm c).
Bi 3 v bi 5b l cc bi kh (khong 10%-20% s hc
sinh s t im dng).
Sau y chng ti c mt s nhn xt c th:
3. Gi gii
Bi 1.
a) Chng minh rng a thc
cn xn + cn1 xn1 + + c0 2015,
chia ht cho a thc x2 + x5.
b) u tin ta hy nhn xt rng nu c0 , c1 , . . . , cn l b tha
mn iu kin
c0 + c1 + c2 2 + + cn n = 2015,
v c0 + c1 + + cn nh nht th s c 0 ci 4. T , khai thc
ng thc sau y:
cn xn + cn1 xn1 + + c0 2015 = (x2 + x5)(an2 xn2 + + a1 x + a0 ).
Bi 2.
a) Ch cn chng minh B, C, H, N cng thuc mt ng trn.
thc hin iu ny, ta c th gi F l giao im ca trung
tuyn AM vi ng trn (O) v N, F i xng nhau qua trung
trc ca BC.
b. Gi (S) l ng trn i qua A, tip xc vi AK v i qua N.
Ta chng minh DP, DQ l cc tip tuyn ca ng trn (S), t
suy ra AJ, AH ng gic trong tam gic ABC hay AJ i qua O
c nh.
Bi 3.
a) C th gii d dng nu nhn xt rng s d khi chia
Sk (n) = 1k + 2k + + nk
theo 20 l tun hon.
b) Da vo kt qu cu a) ta d on k = 4 l s nguyn dng
nh nht tha mn yu cu bi ton. chng minh k = 4 tha
mn tnh cht T (2015), ta s dng nh l phn d Trung Hoa
quy v cc modulo ly tha nguyn t l 3, 2n v 5n.
Sau dng tng nng ly tha gii quyt.
Bi 4.
95
96
T p c h
online ca
cng ng
nhng n g i
y u
T o n
Tm tt
Trong k thi chn i tuyn Vit Nam nm 2015, c hai
bi ton hnh hc phng kh v cng kh th v. Di
y, chng ti s trnh by li gii chi tit, phn tch cc
vn lin quan cng cc m rng ca chng.
S
O
G
L
H
M
E
K
G
P
L
H
Q
M
B
S
G
E
O
Q
L
M
R
K
100
E
L
F
H
O
K
P
G
L
H
M
B
Q
K
103
F
G
N
O
H
P
B
M
D
A
A
D
I
C
A
K
S
107
A
Q
L
M
D
J
C
108
A
Q
Y
P
I
L
X
M
J
C
109
US
R V
I4
K
I1
I2
P T
Z
X
C
L
I3
nn
1
=I1 I3 I2 = 180 (90 =SPR) = 180 =I1 I4 I2 .
2
Vy I1 I2 I3 I4 ni tip, ta c iu phi chng minh.
Chng ta tip tc vi mt m rng th v sau cho bi ton 13.
Bi ton 17. Cho t gic ABCD ni tip ng trn (O). Cc
im E, F thuc cnh CB, AD sao cho EF k AB. DE ct CF ti
S. ng trn ngoi tip tam gic ASD v BSC ct nhau ti T
khc S. Dng im R ngoi t gic ABCD sao cho =RAB =
=ASF + =T DC v =RBA = =BSE + =T CD. Chng minh rng t
gic AT BR ngoi tip.
R
B
E
A
F
Q
S
O
T
114
T p c h
online ca
cng ng
nhng n g i
y u
T o n
CC VN
C IN V HIN I
Trn Nam Dng
i hc KHTN, TP. H Ch Minh
1. Phn A
Ta c th xy xa l i t Alencon n Blancon, sau n
Clancon, cui cng n Dlancon - Tr l th nht ni.
115
116
2. Phn B
Trong phn ny, chng ta mun chng minh rng mng li xa
l ngn nht thc s l m hnh ca nh ton hc xut.
Do ta s tm chiu di ca on EF t c mng li
ngn nht ny.
Nhc nh hnh hc: Nu A, B, C l ba nh ca mt tam gic th
AB + BC AC, du bng xy ra khi v ch khi B thuc on AC.
Chng ta cng bit rng, nu v mt ng cong bt k gia A
v B, chiu di ca ng cong s lun ln hn hay bng chiu
di on (ng thng l ng ngn nht).
Bi ton 1. Quay tr li vi mng li xa l ca chng ta.
Khng mt tnh tng qut ta c th gi s l mng li ca
chng ta c to thnh b hai ng con ni cc nh i
din (mt ni A vi C v mt ni B vi D), v hai ng cong
ny nm bn trong hnh vung cnh 100 km nh hnh v di
y.
119
120
T p c h
online ca
cng ng
nhng n g i
y u
T o n
BT NG THC SHAPIRO1
1. Bt ng thc Shapiro
Thng 10/1954, trong Tp ch American Mathematical Monthly
xut hin bi ton ca nh ton hc M Harold Shapiro: Vi cc
s dng x1 , x2 , . . . , xn , hy chng minh bt ng thc
x1
x2
xn1
xn
n
+
+ +
+
,
x2 + x3 x3 + x4
xn + x1 x1 + x2
2
(1)
x2
xn1
xn
x1
+
+ +
+
.
x2 + x3 x3 + x4
xn + x1 x1 + x2
121
n
.
2
()
5
.
12
a) Vi mi s nguyn dng n, tn ti s qn
1, sao cho
vi mi s thc x1 , x2 , . . . , xn thuc on q1n , qn bt
ng thc (1) ng.
b)
1
1
1
+
+ +
;
a1 (1 + an ) a2 (1 + an1 )
an (1 + a1 )
b) t:
$
&
bk =
1
ak an+1k
ak an+1k 1
2
, ak an+1k 1
?
ak an+1k + ak an+1k
2
xk
min
!n
2
n
)
,3
xk (xk+1 + xk+2 ).
k=1
b) Hy xc nh vi nhng gi tr khng m no ca
x1 , . . . , xn , bt ng thc Mordell tr thnh ng thc.
123
3.
2
xk
"
n 8
,
min
3 3
*
n
4. (x1 + x2 + + xn )2 4(x1 x2 + x2 x3 + + xn x1 ), @n 4.
n
xk
xk+1
5.
.
x
+ xk+2 k=1 xk + xk+1
k=1 k+1
6.
x2
xn1
xn
x1
+
+ +
+
2, @n 4.
xn + x2 x1 + x3
xn2 + xn xn1 + x1
7.
x1 + x2 x2 + x3
xn1 + xn xn + x1
+
+ +
+
4, @n 4.
x1 + x3 x2 + x4
xn1 + x1
xn + x2
8.
x2
xn1
xn
x1
+
+ +
+
3, n 6.
xn + x3 x1 + x4
xn2 + x1 xn1 + x2
9.
x2 + x3 x3 + x4
xn + x1
x1 + x2
+
+ +
+
6, @n 6.
x1 + x4 x2 + x5
xn1 + x2 xn + x3
10.
x1 + x2 x2 + x3
x2004 + x1
+
+ +
6.
x1 + x4 x2 + x5
x2004 + x3
x1
x2
xn
+
+ +
4, vi n 5, n chn.
xn + x4 x1 + x5
xn1 + x3
n
n+1
x2k
12.
.
x2 xk+1 xk+2 + x2k+2
2
k=1 k+1
11.
124
T p c h
online ca
cng ng
nhng n g i
y u
T o n
PHNG PHP
M RNG V SNG TO
CC NH L HNH HC C IN
o Thanh Oai (H Ni)
Tm tt
am m v mi trng nghin cu l hai yu t quan trng
gip cho s thnh cng ca mt nh Ton hc. am m
cng vi phng php nghin cu s to ra kt qu nghin
cu. Mi trng nghin cu gip cho kt qu nghin cu
c nh gi mt cch chnh xc nht bi gii chuyn
mn cng nh cng ng. Ngoi ra, mi trng nghin cu
cng l ni nh nghin cu hc hi trao i chia s cc
vn h ang quan tm. Khi thnh qu nghin cu c
cng ng cng nhn chnh l ngun ng lc mt nh
nghin cu duy tr nim am m ca mnh. Lm th no
c th to ra c cc vn Ton hc hay cc bi ton
mt cch nhanh chng, lm sao c th kim chng c
cc kt qu mt cch d dng nht l hai vn m
mt nh nghin cu nn quan tm.
Xut pht t kinh nghim nghin cu Ton hc trong vic
to ra cc vn hnh hc, tc gi vit bi bo ny nhm
chia s kinh nghim n cc bn hc sinh v sinh vin
v tt c nhng ai c nim am m Ton hc, c bit l
b mn hnh hc phng.
Trnh by phng php m rng v sng to cc vn
hnh hc c in v mt s vn lin quan t vic kim
tra tng ng hay sai, mi hay c, m rng tng v
cng b n n cng ng c minh ha thng qua nhiu
v d sinh ng.
Tc gi hi vng bi bo ny s gip cho cc bn tr c c
s gi m bt u sng to vn Ton hc ni chung.
125
1. Vai tr ca cc i tng c bn
i vi nghin cu Ton hc, iu trc tin ta cn tm hiu
l cc tnh cht vn c (hay cn gi l cc tnh cht t nhin
ca cc i tng), cc mi kt hp v mt i tng, lp cc
i tng thuc lnh vc ta ang mun nghin cu m c
ng o cng ng tha nhn. Tip theo l nghin cu ra cc
cu trc v tnh cht (vn ) mi.
Nu nh ta khng bit ci g l c bit n th ta cng
kh c th bit ci g l mi. Do vic hiu cc i tng, tnh
cht, khi nim, cu trc c bn c mt vai tr cn bn. Nu
khng nm bt hiu v cc i tng, tnh cht, khi nim, cu
trc c bn ca mt i tng, v cc cu trc c bn kt hp
gia cc i tng th chng ta khng tm c cch pht biu
cho vic a ra gi thit, khng th hnh thnh, cc tng.
V th, mun nghin cu bt c lnh vc g cng phi c cc
khi nim c bn ca lnh vc . Ni cch khc, lnh vc ta
quan tm c cc i tng no? Cc i tng c hiu th
no? Cc tnh cht ca cc i tng l g?
i vi lnh vc hnh hc c in phi bit cc i tng c bn
ca hnh hc l im, ng thng, tam gic, t gic, ng
trn,... Nghin cu v im phi bit cc tnh cht, khi nim
c bn lin quan n im v d:
Xc nh c mt ng thng qua hai im phn bit.
Ba im gi l thng hng nu im th ba nm trn
ng thng ni hai im th nht v th hai. Khi nghin
cu ng thng ta li cn bit cc khi nim v song
song, vung gc, gc ca hai ng thng, ng thng
giao nhau, ba ng thng ng quy, ...
Nghin cu gc th ta phi bit th no l gc nhn, gc
t, gc bt, lin hp ng gic, ...
Ba im khng thng hng th to thnh tam gic bng
cch k ng thng i qua cc im ny, hnh gii hn
(bao bi ba ng thng ny) c gi l tam gic. Khi
nghin cu v tam gic li phi bit cc tnh cht ca tam
gic, cc tam gic c bit nh tam gic vung, tam gic
cn v tam gic u, tam gic ng dng, ...
126
2. Nm bt xu hng nghin cu
Sau khi nm vng cc khi nim v cc i tng , tnh cht c
bn, ... Mi bt u chng ta s khng th bit chng ta cn
nghin cu ci g? Ci g ng c quan tm? Cch nhanh
nht c th i n vic pht hin c cc kt qu mi ng
ch l phi nm bt c xu hng nghin cu. Hay ni
cch khc l ha vo dng nghin cu ch o ca cc i
tng trong lnh vc ta ang mun nghin cu. Vic ny tht
s khng h n gin vi nhng ngi mi bt u. V khi mi
bt u chng ta cn rt m mt n cc khi nim tnh cht
cng cha nm bt ht lm sao c th hiu ht c dng xu
hng nghin cu?
Cu tr li l mun bit c xu hng c quan tm ca lnh
vc, cn phi ch n cc kt lun ni bt nht, ri ni bt
km hn mt cht, chnh l vic xem cc bi bo, cc bi vit v
cc thnh tu Ton hc ni bt m chng ta ang quan tm ...
T , ta hiu c cc vn ang c quan tm c ngha,
ci g cn thiu cn b sung v sau khi c kt qu ta cng d
truy tm vn c hay mi, ngha hay khng.
Hnh hc l mt lnh vc thu ht c s ch ca ti trong
thi gian qua, khi bt u quan tm n hnh hc, ti khng
bit ci g hay, ti hay theo di trang web Cut the Knot (http:
//www.cut-the-knot.org/ - mt trang ph bin Ton hc ca mt
Tin s ca M). Ngi qun l ca trang ny cng ng thi to
mt trang thng tin trn facebook nhm chia s, trao i vi mi
ngi v cc vn hnh hc.
Thi gian ban u khi ti theo di n, trang ny thng gi cc
kt qu v tam gic u khin ti ngh hnh hc ch c mi tam
127
135
Hnh 12.10: Vn 6
Tc gi tm c hai im na na tha mn tnh cht bn tm
ni tip nm trn mt ng trn. Hai vn ny c hiu
thng qua khi nim v t gic trung trc ca t gic ngoi
tip sau y.
Cho t gic li ABCD ngoi tip mt ng trn, bn ng trung
trc ca bn cnh t gic hp vi nhau thnh to thnh mt t
gic ngoi tip.
Tnh cht trn c bit n trong quyn sch ca Mike de
Villiers, chng minh a ra bi Jordan Tabov [16]. Nhng trc
c xut hin ti ti liu bn Nga [17]. Hin nay cha
thng nht c tn gi ring cho t gic trn nn chng ta s
tm gi t gic trn vi tn l t gic trung trc ca t gic
ngoi tip.
Vn 7: Gi O l tm ng trn ni tip t gic trung trc ca
t gic ngoi tip ABCD khi tm bn ng trn ni tip cc
tam gic OAB, OBC, OCD, ODA nm trn mt ng trn.
Vn 8: Gi L giao im ca hai ng cho ca t gic trung
trc ca t gic ngoi tip ABCD khi tm bn ng trn ni
tip cc tam gic LAB, LBC, LCD, LDA nm trn mt ng trn.
Cc nh l hnh hc lun c xu hng c m rng ra. Trong
mc tip theo, tc gi trnh by mt s v d v cc hng m
rng nh l Napoleon.
140
Hnh 12.12: Vn 7
Hnh 12.13: Vn 8
5. X l tng
Chng ta khng th lm c g tip theo nu tng chng
ta l sai ngay t u. Do sau khi c tng, vic u tin
cn phi lm l kim tra tng ng hay sai. Ta c th s ha
(nu c th) kim tra, l mt bc kim tra s b. Nu
chng ta c my tnh chng ta hy s dng cc cng c phn
mm c sn, v d phn mm geogebra hoc chng ta t lp
trnh kim tra ngay cc tng ca mnh ngay khi n va
c le ln. Hy nh ng tng le nn v ri vt tt.
Nu tng ca cc bn l ng tip theo cc bn phi bit
tng mi hay c? Nu nh tng c th cn phi bit
tm hiu xem n pht trin tng qut n u tip tc
nghin cu. Hoc cng qua , ta bit thm cc kin thc gip
cho vic hnh thnh cc tng v sau. N gip cho cng tc
146
6. Bi tp thc hnh
Bi ton 1. Cho tam gic ABC, F l im Fermat, ba ng
thng qua G v vung gc vi FA, FB, FC ct ba cnh tam gic
ti A0 , B0 , C0 ta thy A0 , B0 , C0 thng hng. Hy kim tra tnh
cht trn nu thay im trng tm G bi im Vecten, im
Napoleon v sau hy kim tra vi cc im nm trn qu
tch no th tha mn tnh cht ny, v i n kt lun tng
qut hn na.
Bi ton 2. Gi O l tm ng trn ngoi tip ca tam gic
ABC, khi ng thng Euler ca cc tam gic OBC, OCA, OAB
ng quy. Hy kim tra tnh cht ny nu ta thay im O bi
im tm ng trn ni tip, trc tm, v tm ng trn chn
im... Tm qu tch cc im tha mn tnh cht ny.
Bi ton 3. Cho tam gic ABC, mt ng thng L ct ba cnh
BC, CA, AB ca tam gic ln lt ti A0 , B0 , C0 . S l im bt
k trn ng thng L. Gi A1 , B1 , C1 l cc im i xng ca
A0 , B0 , C0 qua S th AA1 , BB1 , CC1 ng quy. Hy kim tra kt qu
bi ton ny nu ta thay S bi mt ng trn v php i xng
qua im bi php nghch o qua ng trn.
Bi ton 4. Cho hnh vung ABCD dng ra ngoi cnh AB v
BC hai tam gic u AMB, BNC khi tam gic DMN l mt
tam gic u. Hy kim tra tnh cht ny nu thay hnh vung
ABCD bi mt hnh bnh hnh ABCD.
Bi ton 5. Dng trn ba cnh ca tam gic ABC cng ra ngoi
(hoc vo trong) cc tam gic u BA0 C, CB0 A, AC0 B ta thy
AA0 , BB0 , CC0 ng quy, hy kim tra tnh cht ny nu thay ba
tam gic u bi ba tam gic cn ng dng.
149
152
T p c h
online ca
cng ng
nhng n g i
y u
T o n
INEQUALITIES
A JOURNEY INTO
FIBONACCI & LUCAS NUMBERS
Vandanjav Adiyasuren
National University of Mongolia
Bold Sanchir
Mongolian University of Life Sciences
n2
()
n2
Fk = Fn+2 1
k=1
153
(1)
Fk = Fn+2 F2 = Fn+2 1
k=1
Proposition 1.2.
n
a)
F2k1 = F2n
(2)
k=1
b)
F2k = F2k+1 1
k=1
b)
n
k=1
F2 k =
2n
k=1
Fk
F2k1
k=1
154
(3)
Proposition 1.3.
Fn1 Fn+1 F2n = (1)n
(4)
where n 1
Proof. (By PMI) Since F0 F2 F21 = 0 1 1 = 1 = (1)1 , the given
statement is clearly true when n = 1 Now we assume it is true
for an arbitrary positive integer n: Fn1 Fn+1 F2n = (1)n . Then
Fn Fn+2 F2n+1 = (Fn+1 Fn1 )(Fn + Fn+1 ) F2n+1
= Fn Fn+1 + F2n+1 Fn1 Fn Fn1 Fn+1 F2n+1
(by the IH:)
= Fn Fn+1 Fn1 Fn F2n (1)n
= Fn Fn+1 Fn (Fn1 + Fn ) + (1)n+1
= Fn Fn+1 Fn Fn+1 + (1)n+1 = (1)n+1 .
Thus the formula works for (n + 1). So, by PMI, the statement is
true for every integer n 1.
Proposition 1.4.
n
F2k = Fn Fn+1
(5)
k=1
F2k = F21 = 1
k=1
= 1 1 = F1 F2 = RHS
So the result is true when n = 1. Assume it is true for an arbin
k=1
F2k =
F2k + F2k+1
k=1
Lk = Ln+2 3
(6)
k=1
n
k=1
n
L2k1 = L2n 2
(7)
L2k = L2n+1 1
(8)
k=1
L2k = Ln Ln+1 2
(9)
(10)
k=1
,
Fn = ?
2
2
5
where n 1.
Proof. This can be established easily using PMI
? n
?
1+ 5
1+ 5
=
Fn + Fn1 , n 1
2
2
? n
?
1 5
1 5
=
Fn + Fn1 , n 1
2
2
h ? ? n i
1
?
Let Un = 5 1+2 5 12 5
, where n 1.
?
?
? 2
?
2
1
1+
5
5
1+
5
1
1
2
= 1 and U2 = ?5
12 5
=
Then U1 = ?5
2
2
1. Suppose n 3. Then
Un1 + Un2
? n1
? n1 !
1+ 5
1 5
+
2
2
? n2
? n2 !
1
1+ 5
1 5
+?
2
2
5
? n
? n !
1
1+ 5
1 5
= Un
=?
2
2
5
1
=?
5
156
This, Un satisfies the FRR() and the two initial conditions. This
gives us an explicit formula for Fn :
? n !
? n
1 5
1
1+ 5
Fn = Un = ?
2
2
5
H qu 1.1.
F2n+1 + F2n = F2n+1
(11)
(12)
(13)
Fn1 + Fn+1 = Ln
(14)
Fn+2 Fn2 = Ln
(15)
(16)
1
Fk Fk+2 = (Fn Fn+1 + F2n+2 1)
2
k=1
(17)
Proposition 1.7.
n
1
Fk Fk+2 = (Fn Fn+1 + F2n+2 1).
2
k=1
157
k=1
Fk Fk+2 =
k=1
1
= (Fn Fn+1 + F2n+2 1) + Fn+1 Fn+3
2
1
=
Fn+1 (Fn + Fn+1 ) + 2Fn+1 Fn+3 + (F2n+2 F2n+1 ) 1
2
1
= (Fn+1 Fn+2 + 2Fn+1 Fn+3 + Fn Fn+3 1)
2
1
= (Fn+1 Fn+2 + (2Fn+1 + Fn )Fn+3 1)
2
1
= (Fn+1 Fn+2 + F2n+3 1).
2
So the statement is true when (n + 1). Thus it is true for every
positive integer n.
Proposition 1.8.
n
n
Fk = F2n
k
k=1
Proof. Let gn =
k=1
n
k
n
Fk , and let hn =
k=0
n+1
(18)
n
k
Fk+1 . We have
n
n+1
n
Fk
gn+1 gn =
Fk
k
k
k=1
k=1
n
n+1
n
= Fn+1 +
Fk
k
k
k=1
n
n+1
n
n
= Fn+1 +
Fk =
Fk
k1
k1
k=1
k=1
n
n
=
Fk+1 = hn ,
k
k=0
158
and
hn+1 2hn = hn+1 hn hn
n
n
n
n
=
Fk+2
Fk+1
k
k
k=0
k=0
n
n
=
(Fk+2 Fk+1 )
k
k=0
n
n
=
Fk = gn .
k
k=0
From these results we get
gn+1 gn = hn
hn+1 2hn = gn
*
gn = 3gn1 gn2 .
Thus we have
Fn = Fn1 + Fn2 = (Fn2 + Fn3 ) + Fn2 = 2Fn2 + Fn3 ,
which implies, via Fn3 = Fn2 Fn4 , that Fn = 3Fn2 Fn4 . Since
g1 = 1 = F2 and g2 = 3 = F4 , the sequence tgn u has the same
initial conditions and satisfies the same recurrence relation as
n
n
the even Fibonacci numbers. Thus F2n = gn =
F .
k k
k=1
L2k
(Ln+2 3)2
F
Fn+2 1
k=1 k
a
L
L
k
? k Fk
(Ln+2 3)2 =
Lk
=
F
F
k
k=1
k=1
k=1 k
!
n
L2k
(Fn+2 1).
=
F
k
k=1
159
k=1
!
Fk
Here we used
Lk = Ln+2 3,
k=1
k=1
only iff n = 1.
Problem 2.2. Let n be a positive integer. Prove that
2
n
1
Fk
1 + Lk
Fn Fn+1
k=1
F2k
1 + Lk
k=1
!2
F3n F3n+1
!2
F2k (1 + Lk )
k=1
F2k =
k=1
Fn Fn+1 , we get
n
F2k
1 + Lk
k=1
!2
!
!2
2
n
n
Fk
Fk
2
Fk
Fk
=
1
+
L
1 + Lk
k
k=1
k=1
k=1
2
n
Fk
= Fn Fn+1
,
1 + Lk
k=1
n
and
F2n F2n+1
!2
a
F
? k
Fk 1 + Lk
=
1 + Lk
k=1
!
! k=1
n
n
F2k
2
Fk (1 + Lk ) .
1 + Lk
k=1
k=1
F2k
!2
.
n2 k=1 Fk
9Fn Fn+1
(Jose Luis Diaz-Barrero)
Proof. Note that
nTn+1
n(n + 1)(n + 2)
=
=
3
6
160
n
n+2
=
Tk .
3
k=1
Tk =
k=1
k=1
Tk
Fk
g
g
f n 2 f n
f Tk f
e
Fk e
F2k
Fk
k=1
k=1
which is equivalent to the desired inequality, after using following well known identity,
F21 + F22 + + F2n = Fn Fn+1 .
Fl2
Fn+1
+ +
Fln
Fn+1
1
1
1
1
+ l4 + + l4 .
2
Fn Fn+1 Fl4
Fn
F2
1
(F1 F2 Fn )2
n
1
n
cyc
(Jose Luis Diaz-Barrero)
161
Proof. First, we prove that, for all positive real numbers x1 , x2 , ..., xn
!n
n
n
1
1 xk + + n xk+n1
x1 x2 xn .
(1)
xk
n k=1
1
n
k=1
If Ak =
1 xk ++n xk+n1
1 ++n
n
1 2
1 ++n
Ak (x
.
k xk+1 xk+n1 )
1
1
=
.
Ak
xk
Ak
n
n
k=1
k=1
k=1
This proves the left-hand side inequality of (1).
To solve the given inequality, in (1) take xk = F2k and use the
n
identity
F2k = Fn Fn+1 .
k=1
F1 F3 F2 F4
Fn Fn+2
Fn Fn+1 + F2n+2 1
(P.G.Popescu)
Proof. Using following identity
n
Fk Fk+2 =
k=1
1
Fn Fn+1 + F2n+2 1
2
1
n2
2n2
=
.
n
2
F
F
F
F
+
F
1
k
k+2
n
n+1
n+2
k=1
Fk Fk+2
k=1
1
1
1
1
+
+ 2 1+
2
Fn+2 k=1 Fk Fk+1
F
k=1 k
(Miquel Grau-Sanchez)
162
Proof. Denote
L(n) =
1
Fn+2
R(n) = 1 +
k=1
1
1
+ 2 ,
2
Fk Fk+1
1
.
F
k=1 k
(n 1)
(x
+
y)
x2 + y2 =
=x+y
x+y
x+y
2 2
xy
?
=
0
2
(x + y)[x + xy + y2 + (x + y) x2 + y2 ]
where x =
1
,
Fn
y=
1
.
Fn+1
Fn+1
Fn
nx
= n exp
x
n
ln Fn+1 n + x ln Fn+1 ,
x 0.
Fi = Fn+2 1 and
i=1
i=1
Fi
F2i
Fn Fn+1
ln Fi ln
= ln
F
1
F
1
Fn+2 1
i=1 n+2
i=1 n+2
Thus,
(Fn 1)(Fn+1 1)
Fn Fn+1
1=
.
Fn+2 1
Fn+2 1
i=1
1
1
n
(Fk+2 Fj 1)2
Fn Fn+1 F3 F4 Fn
k=2 j=1
(Jose Luis Diaz-Barrero)
Proof. We first prove that
kFk Fk+1 (Fk+2 1)2
(k 1.)
(1)
1
,
(Fk+2 x 1)2
0 x Fk
(Fk+2 Fj 1)2
j=1
k
k1
2
(Fk+2 1)2
k
k1
2
k
.
Fk Fk+1
(1)
x y (xy)
x+y
2
x+y
2
x+y
.
(2)
.
2
From Fn Ln = F2n and Ln = Fn1 + Fn+1 and Fn + Ln = 2Fn+1 so
given inequality is proved.
Problem 2.12. Let n be a positive integer. Prove that
!
!
n
n
F2k
F3k
(Fn+2 1)5
L
L2
(Ln+2 3)2
k=1 k
k=1 k
where Fn , respectively Ln represent the nth Fibonacci number
respectively the nth Lucas number.
(Batinetu-Giurgiu)
Proof. Using the following well known identities L1 +L2 +...+Ln =
Ln+2 3 and F1 + F2 + ... + Fn = Fn+2 1 we have
!3
!
!
!
n
n
n
n
F2k
F3k
Lk
Fk
L
L2
k=1
k=1 k
k=1 k
k=1
165
!3/5
Lk
F2k
L
k=1 k
k=1
5
3/5 3
Lk
!3/5
k=1
1/5 !5
k=1
Fk
1/5
Lk
1/5
!1/5
k=1
3/5
2/5
1/5
Lk
F3k
L2
k=1 k
Lk
k=1
n
F2k
!1/5
Fk
!
=
2/5
Lk
F3k
L2k
1/5 !5
1/5
Fk
k=1
F
k
k
(Jose Luis Diaz-Barrero)
Proof. The Cauchy-Schwarz Inequality gives
!
!
n
n
1
n
Fk n2 .
n
k
F
k=1 k k
k=1
Using
n
n
Fk = F2n
k
k=1
k=1
1
n2
.
n
F2n
F
k k
F2n
n
.
L2k
L2k
Therefore, we obtain the inequality
2(1)
F2
k Lk
+ ( 1)L2k F2k 0.
k=1
1
F2n
1
+b
1
1
L2n
2
c
2
1 FFn+1
2n
(P.G.Popescu)
+
1
e
2
2
Fn
Ln
1 1
1
2
= 1
+
.
b 1
b 1
2
2 F2n L2n
1 +
1
1
F2
n
L2
n
2 F2n L2n
F22n
holds for n 2. Now if we use F2n = Fn Ln and 2Fn+1 = Fn + Ln
then last inequality is equivalent to
2F2n + 2L2n (Fn + Ln )2
which is AM-GM Inequality.
167
F2
a k
1 + F2k
k=1
! n1
(1 + F2n )
Fn Fn+1
k=1
k=1
lent to
n
F2
a k
1 + F2k
k=1
! n1
(1 +
F2n )
k=1
F2k .
k=1
! n1
!
! 1 + F2
n
n
n
k
k=1
F2k
F2
2
a k
a
(1 + Fn )
2
2
n
1
+
F
1
+
F
k
k
k=1
k=1
k=1
n
F2k .
k=1
"
Since both sequences
F2k
1+F2k
and
a
(
1 + F2k have the same
monotonicity.
Problem 2.17. Prove that
c
c
F2n + F2n+1
L2n + L2n+1
Fn+2
Ln+2
arctan
+ arctan
arctan
+ arctan
.
2
2
2
2
(D.M.Batinetu-Guirgiu, student)
Proof. Using Fn + Fn+1 = Fn+2 and AM-GM Inequality we get
Problem 2.18. Let n be a positive integer. Prove that
! a
!
a
a
a
3
3
?
F2n + 3 F2n+1
L2n + 3 L2n+1
3
a
a
4.
3
3
2
2
Fn+2
Ln+2
(Diana Alexandrescu)
168
?
Proof. Since the function f(x) = 3 x2 is concave for all x 0,
Jensens inequality yields
c
?
?
3
2
x2 + 3 y2
3 (x + y)
,
4
2
for x 0, y 0, x y.
Under the same conditions, this inequality can be equivalently
written as
a
?
a
3
x2 + 3 y2 3 2(x + y)2 .
For x = Fn and y = Fn+1 , we obtain
b
b
a
a
3
F2n + 3 F2n+1 3 2(Fn + Fn+1 ) = 3 2F2n+2 .
This implies
a
a
3
F2n + 3 F2n+1 ?
3
a
2.
3
2
Fn+3
(1)
(2)
"
#
n
n
1 2n 2
1
F +
Fk
n k=1 k
k=1
!2
(11/n)
Fk
k=1
k=1
written equivalently as
n
(n 1)
F2n
k
k=1
F2k
k=1
!(n1/n)
F2k
k=1
k=1
F2k ,
n
F2n =
Fk ,
k
k=0
n 2
2n
n
=
,
n
k
k=0
Fn Fn+1 =
F2k .
k=0
,
2
2
and so
c
?
x xy + y
170
x2 + y2
2
for any positive real numbers x and y. Thus, the left-hand side
of (1), LHS, is
F2 + F21
F21 + F22 F22 + F23
+
+ + n
2
2
2
n
=
F2k
LHS
k=1
= Fn Fn+1 .
L2k = Ln Ln+1
k=1
2.
Problem 2.22. Let tan un1 be a sequence of real numbers defined by a1 = 3, a2 = 5 and for all n 3, an+1 = 12 (a2n + 1). Prove
that
!2
n
Lk
Ln Ln+1
?
.
1+
2
1
+
a
k
k=1
(Jose Luis Diaz-Barrero)
Proof. Since
k=1
equivalent to
1+
!2
!2
L
? k
1 + ak
k=1
or
L
? k
1 + ak
k=1
n
1 2
L
1+
2 k=1 k
L2k
.
2
k=1
L
? k
1 + ak
k=1
!2
!
L2k
k=1
1
1
.
a +1
2
k=1 k
171
1
1 + ak
k=1
!
.
We have
1
1
an+1 = (a2n + 1) an+1 1 = (a2n 1)
2
2
1
an+1 1 = (an + 1)(an 1)
2
1
1
1
an+1 1
an 1 an + 1
1
1
1
.
an+1
an 1 an+1 1
Hence
n
n
1
1
1
1
1
1
=
1 + ak k=1 ak 1 ak+1 1
a1 1 an+1 1
2
k=1
and the problem is done.
Problem 2.23. Let Tk =
k(k+1)
2
F2m+2
3m (Fn Fn + 1)m+1
m
Tkm
nm Tn+1
k=1
for any positive integer n 1 and for any positive real number
m.
(D.M. Batinetu-Giuriu)
Proof. Let S = Sn =
F2k , and U = Un =
k=1
Tk . It is well-known
k=1
nTn+1
n(n + 1)(n + 2)
=
.
6
3
Fk
m+1
m
2
S
U
Fk
(1)
Tk
k=1
Now Holders Inequality for sums states that for any two nonnegative sequences tak uk1 and tbk uk1 , we have for all n 1,
and for all p 1 and q 1 such that p1 + q1 = 1 :
n
k=1
ak bk
!1/p
apk
k=1
k=1
172
!1/q
bqk
(2)
In particular, take
m
1
, 1 = m+1
, where m is
m+1 q
1/p
1/p
ak = Tk , bk = F2k /Tk . Then
1
p
any positive
Holders In-
k=1
F2k
!m/(m+1)
F2m+2
k
Tkm
k=1
Tk
k=1
!1/(m+1)
or
S Um/(m+1)
F2k
k=1
F2k
Tk
m !1/(m+1)
(Ovidiu Furdui)
Fk = Fn+2 1,
k=1
Lk = Ln+2 3,
k=1
F2k = F2n+1 1.
k=1
In addition, F2k = Fk Lk follows immediately from Binets formulas. Finally, recall that Chebyshev inequality asserts that
!
!
n
n
n
1
ak bk
ak
bk
n k=1
k=1
k=1
for all nondecreasing positive sequences tak u and tbk u. Combining these results, we find
n
F2n+1 1
F2n+1 1
=
= n
for all n 1.
173
Fk Lk
n
k=1
Fk
k=1
Lk
1
n
Fm+1
Fp+1
(Fn+2 1)m+p+2
k
Lm
Lpk
(Ln+2 3)m+p
k
k=1
k=1
for any positive integer n.
(D.M. Batinetu-Giurgiu)
Proof. Using a special case of Holders inequality, for two sequences tak u and tbk u we have
!1/u
!1/v
n
n
n
(1)
ak b k
au
bvk
k
k=1
k=1
k=1
k=1
ak b k =
Fk
;
(Lk )m/m+1
and
Fk = (Fn+2 1)
(2)
k=1
Fm+1
k
Lk
Lm
k
k=1
k=1
Raising (2) and (3) to the (m+1) power and further noting
Ln+2 3 we get
!
n
m+1
F
k
(Fn+2 1)m+1 (Ln+2 3)m
m
L
k
k=1
(3)
n
k=1
But now , for another value, say o, we also get the relation
!
n
p+1
F
k
(Fn+2 1)p+1 (Ln+2 3)p
p
L
k
k=1
Lk =
(4)
(5)
F
?k
Fk F2k
F3n F3n+1
Lk
k=1
k=1
(Jose Luis Diaz-Barrero )
174
ak b k
k=1
!1/p
(ak )p
k=1
!1/q
(bk )q
(1)
k=1
(Fk )2
!1/3
(Fk )2 Lk
k=1
!2/3
(Fk )2 (Lk )1/2
k=1
(Fk )2
Fk F2k
(Fk )2 (Lk )1/2
(2)
k=1
k=1
(Fk )2 = Fn Fn+1
(3)
k=1
Substituting the result of (3) into (2) yields the desired inequality.
Problem 2.27. Let n be a positive integer, Prove that
g
g
g
f n
f n
f n
f
f
1 f
e
e
(Fk + (n2 1)Lk )2 + e
((n2 1)Fk + Lk )2
F2k+1
2n
k=1
k=1
k=1
(Jose Luis Diaz-Barrero)
Proof. Starting with Minkowskis inequality
n
! p1
(ak + bk )p
k=1
k=1
! p1
apk
! p1
bpk
k=1
let
ak = Fk + (nm 1)Lk ,
bk = (nm 1)Fk + Lk .
175
! p1
Fpk+1
k=1
1
2nm
! p1
[Fk + (nm 1)Lk ]p
! p1
[(nm 1)Fk + Lk ]p
k=1
k=1
F2n F2n+1
n+1
n+1
n+1
F21 + F22 + + F2n
n 1
2
n
for all integers n 1.
(Ovidiu Furdui)
2n
F21
n+1
+ F22
n+1
n+1
+ + F2n
n
or equivalently
n
F2n F2n+1
2n+1
2n+1
2n+1
F
+
F
+
+
F
.
n
1
2
n
n2 1
We are done.
Problem 2.29. Let n be a nonnegative integer. Prove that
1
n+1
!2
ln(1 + Fk )
Fn Fn+1
k=0
(Miquel Geau-Sanchez)
176
Fk
k=0
and so
n
!2
Fk
k=0
n
Since
ln(1 + Fk ),
k=0
!2
ln(1 + Fk )
k=0
k=0
(n+1)(Fn Fn+1 ) =
k=0
!
F2k
!2
Fk
k=0
!2
ln(1 + Fk )
k=0
k=0
It follows that
1
n+1
!2
ln(1 + Fk )
Fn Fn+1 .
k=0
logFl+k x.
k=1
n a
1
ln Fl+k ?
ln Fl+k
k=1
!2
!
ln Fl+k
k=1
1
ln Fl+k
k=1
!
.
n2 ln x
ln x
,
ln Fl+1 Fl+2 Fl+n k=1 ln Fl+k
L2
a k
1 + L2k
k=1
1
! 2n
(1 + L2k )
Ln Ln+1 2.
k=1
(Sergio Falcon)
Proof. Using AM-GM Inequality, we can see that
n
n
a
L2k
1
!
! 2n
2
? 2
1 + Lk
n
n
1+Lk
L2k
k=1
k=1
2
a
.
(1 + Lk )
2
n
1
+
L
k
k=1
k=1
"
? Lk
Since
and
1+L2k
a
(
1 + L2k are non-decreasing sequences,we
conclude that
k=1
L2k
1+L2k
n a
1 + L2k
k=1
n
Since
n
L2
a k
1 + L2k
k=1
b
n
2
L2k .
1 + Lk =
k=1
k=1
? a
F2n + F2n+1 + 5F2n+2 4 6 Fn Fn+1 Fn+2 ,
? a
L2n + L2n+1 + 5L2n+2 4 6 Ln Ln+1 Ln+2
(D.M. Batinetu-Giurgiu)
Proof. a) From
F2n+4 = (Fn+2 +Fn+3 )2 = (2Fn +3Fn+1 )2 = ((2Fn )2 +(3Fn+1 )2 )+12Fn Fn+1
and the inequality of arithmetic and geometric means we have
that
F2n+4 12Fn Fn+1 + 12Fn Fn+1 = 24Fn Fn+1
178
?
That is, 2 6Fn Fn+1 Fn+4 . Therefore,
? a
4 6 Fn Fn+1 Fn+2 2Fn+4 Fn+2 = 2(2Fn+2 +Fn+1 )Fn+2 = 4F2n+2 +2Fn+1 Fn+2 .
This and the inequality of arithmetic and geometric mean imply
2Fn+1 Fn+2 F2n + F2n+1 .
So,
? a
4 6 Fn Fn+1 Fn+2 4F2n+2 + 2Fn+1 Fn+2 5F2n+2 + F2n + F2n+1 .
b) The proof of
? a
4 6 Ln Ln+1 Ln+2 5L2n+2 + L2n + L2n+1
is similar to the previous proof. It is enough to replace Fn with
Ln .
Problem 2.33. Let n be a positive integer. Prove that
n+1
n+1 !
n
n
n
n
n+1
F
n
k+1
k+1
Fk+2
.
(n + 1)n k=1 Lk+1 Fk+1
k=1
(Jose Luis Diaz-Barrero)
Proof. Direct computation shows that equality holds with n =
1. Now, suppose that n 2. If a and b are real numbers such
that b a 0, then, by Holders Inequality,
b
n1 b n1
b
n
1
n
t dt
t dt
dt
a
or, equivalently,
n+1
n
b n a
n+1
ba
n+1
n
a+b
2
n1
.
Lk+1
Fk+1
nn
.
Fk+2
(n + 1)n k=1 Lk+1 Fk+1
k=1
After AM-GM Inequality our problem will be solved.
179
Fn+2
n+2
n+1
n
FFnn+1 + FFn+1
+ FFn+2
FFnn + FFn+1
+ Fn+2
b)
Fn+1 Fn+2
Fn+1 Fn+2 Fn
Fn
Fn+1 Fn+2 FFnn Fn+1
Fn+2
hold.
In fact, we consider the integral
F
n+1
Fxn+1 ln Fn+1 Fxn ln Fn dx.
I1 =
Fn
I1 =
F
Fxn+1 ln Fn+1 Fxn ln Fn dx = Fxn+1 Fxn Fnn+1
Fn
n+1
n
= FFnn + FFn+1
FFnn+1 + FFn+1
Fxn+1 ln Fn+1 Fxn+1 ln Fn+1 dx.
I2 =
Fn
180
(2)
I2 =
F
Fxn+2 ln Fn+2 Fxn+1 ln Fn+1 dx = Fxn+2 Fxn+1 Fnn+2
n
Fn+2
Fn+2
Fn
Fn
= Fn+2 Fn+2 Fn+1 Fn+1 .
This completes the proof of first part.
Now we will prove second part of our statement. The proof will
be done in two steps. First, we will prove that
n+2 Fn
FFnn+1 FFn+1
Fn+2
Fn + Fn+1 + Fn+2
3
Fn + Fn+1 + Fn+2
3
or, equivalently,
(Fn + Fn+1 + Fn+2 )2 3(Fn Fn+1 + Fn+1 Fn+2 + Fn+2 Fn )
which is AM-GM Inequality.
Finally, we will prove that
Fn + Fn+1 + Fn+2
3
n+1 Fn+2
Fn+2
FFnn FFn+1
References
[1] P.G. Popescu , J.L. Diaz-Barrero, Certain Inequalities for
Convex Functions. Journal of Inequalities in Pure and Applied
Mathematics, Vol 7, Issue 2, Article 41, 2006.
[2] The Fibonacci Quarterly, some problems around 2000-2015.
[3] mathproblems-ks.com, Vol 4, Issue I, 2014, page 239-241.
182
T p c h
online ca
cng ng
nhng n g i
y u
T o n
TON HC TRONG MT AI
Nguyn Quc Khnh (H Ni)
cc bn c mt ci s cm th no , m bt ngun l
t chuyn chia s nhiu hn v th gii quan ton hc ca mi
ngi vy ,.
Nhng ni nh th th mc ch ca ti c v hi b nhiu v
tru tng qu, chi bng la chn ly mt mc ch r rng
hn, c th v trc din hn, chng hn nh l lm th no
mi ngi u c th tr nn thch c sch? Tt nhin, y
l mt cu hi kh lm, ton b c ngnh xut bn vn cn
ang au u cng nhau i tm cu tr li m vn cha ra.
Rt may, NXB Kim ng nhn thc
c tm quan trng ca cu hi ny,
nn gn y h mi xut bn mt cun
sch c ci ta rt l, l B kp
khin bn thch c sch. Cun sch
ny dnh cho ngay c vi nhng bn
khng thch sch. C l vi ci ta
d thng nh th, th cun sch ny,
cng vi nhn vt chnh ca n l
Mt sch, cng rt hp vi cc bn
c gi ca Epsilon, m Ban bin tp
vn t xc nh, l nhng ngi yu
ton, tc l Mt ton, hoc sp yu
ton, v c nhng ngi yu nhng
ngi yu ton vy. Ti rt hi vng rng,
ch trong tng lai rt gn thi, s c mt cun sch no , m
nhn vt chnh ca n s c t tn l Mt ton, v ch
ca cun sch y, c l s l B kp khin bn khng h cn
ght hay l s ton.
Cc bn c gi hy thng cm cho ci tt n ni di dng ca
ti. Ti buc phi lm nh th ngay sau y cc bn s bt
s ch trch ti hn, khi m ti li la chn mt cun sch
m c l trong s cc bn ai cng u c, v cng c
qua. Cun sch ny thc s lp mt k lc trong lng sch
Vit Nam, khi m ch mi in ra ln u c c my nm, ti nay
cun sch c in i in li ti gn c chc ln. Vi hng vn
bn c bn ht veo ch trong my nm, cun tiu thuyt
ton-hip made-in-Vietnam u tin c tn l Ai v Ky x
s nhng con s tng hnh thc s l mt best-seller ng
ngng m.
184
185
187
194
197