You are on page 1of 34

Chuyn s nguyn t

Ngi thc hin : L Huy Ton


Hc sinh chuyn ton kho 09-12 THPT Chuyn
Thi Bnh
__________________________________________________________________________
__________
T trc Cng Nguyn, clt khng nh s nguyn t v s nguyn
l 2 phm tr c bn ca S hc. Thc t chng minh, Ton hc d pht
trin n u th vai tr ca s nguyn t cng khng h thay i.
N vn l 1 vng t k l du bao nm qua c nhiu ngi thm him.
S nguyn t- 3 ting thi thc trong ti t khi c c nh l
le-Gnbach v ri c ng mnh gii c bi ton m cha nha bc hc
no gii c. Bi v khi ti chi bit n tp s t nhin m khng
bit con nhiu tp s khc na. Vit chuyn v s hc, li mi ch l
1 hc sinhtrung bnh trong i tuyn, ti suy ngh rt nhiu v vic
la chn ti. V hnh nh nh l ngy no li hin v trong ti. V
ti quyt nh chn s nguyn t lm ti. Vi rt t ti liu trong
tay, cng vi tm hiu bit t, nhng mong rng chuyn ny s khng
nhm chn ch l nhng kin thc m chng ta c hc m n cn
c th hu ch 1 phn nh cho mi ngi.
..................................................................................
............

Mc lc:

1. nh ngha
............................................................................................. 2
2. Lch s xuyn sut thin nin k v mt vi nh l
............................ 3
3. Mt s dng s nguyn t
..................................................................... 7
4. Cc cp s nguyn t
..............................................................................12
5. Cc dng bi tp c bn
...................................................................... 14
6. ng dng s nguyn t trong i
sng ................................................. 30
1

I/ nh ngha :
Bn c th d dng chia u 15 vin bi cho 3 em nh, nhng nu bn c 17 vin bi th bn
lm sao chia u cho chng c. Trng hp th nht d dng v 15 chia ng cho 3.
Trng hp sau kh khn v 17 khng chia ng cho 3 m ch chia ng cho 1 v 17 hay 17
ch c 2 c s l 1 v 17, v c gi l mt s nguyn t.
T xa, s nguyn t lm say m nhiu nh ton hc chuyn nghip cng nh ti t.
Trong ton hc, s nguyn t c nh ngha l mt s ln hn 1 ch c 2 c s l 1
v chnh n.
C th thy 1 iu nh ngha rt d hiu. Nhng vn nm ch
lm sao ta c th da vo nh ngha m xc nh 1 s c phi s
nguyn t hay khng?
T xa c sng lc nhng s nguyn t gi l sng Eratosthenes . Nhng vi nhng s ln th vic s dng sng ny khng hiu qu. Da vo
nh ngha ta c th thy cch chng minh n gin nht l chia s
cho cc s nguyn t nh hn n... nhng vic ny tn khng t thi
gian nh vic s dng sng Eratosthenes . Do n ngy nay cha tm c
cng thc ca s nguyn t nn ta ch c th hn ch vic th ch khng
c phng php no hu hiu nu khng s dng my vi tnh.
Ta s chng minh 1 bi ton nh :
n N*
n khng chia ht cho mi s nguyn t nh hn hoc bng
CM: n l s nguyn t
Gii:
Gia s s n la 1 hp s thi
Mt khac

vi

nn

iu nay trai vi gia thit nn ta co iu phai chng minh


Ta cng c nhng nhn xt c bn sau y:
Vi nhng s nh, th d s N, phng php thng dng l th tnh chia ng ca s
ln lt vi cc s nguyn t t nh n ln v nh hn N/2, vi nhng nhn xt sau y:
2

Loi nhng s chn, tr 2 (chia ng cho 2).


Loi nhng s tn cng bng 5, tr 5 (chia ng cho 5).

Loi nhng s c tng s cc con s chia ng cho 3, tr 3 (chia ng cho 3).

Loi nhng s chia ng cho 7, tr 7.

Loi nhng s c tng s cc con s hng chn v hng l bng nhau, tr 11


(chia ng cho 11).

C th tip tc n ht nhng s nguyn t nh hn N/2.

Nu tt c cc php chia u khng ng th N l s nguyn t.

Tu thuc vo kinh nghim , khi nhn 1 s chng ta s co th on


l s nguyn t hay khng ma ch cn vi php th. Do trong cc
thi t khi ngi ta ra nhng con s khng l nn vic ny coi nh khng
ng ngi.

II/ Lch s xuyn sut thin nin k v mt


vi nh l:
Vi phn ny ta s n vi cc nh l nhng khng phi bng cch
thng thng. Ta s dc theo dng lch s khng ch bit v Ton m
cn bit ngun gc ci ta ang nghin cu.
S nguyn t c qu hng vng Hi Lp c i . Ngi c cng gy
dng v chng minh 1 nh l c bn ca s nguyn t l clit. ng
chng minh tp hp s nguyn t l v hn. y l nh l u tin v
rt d chng ta c th chng minh. Cng biu din s nguyn t
thuc v Eratosthenes vi sng s nguyn t.
S nguyn t thc s c bc pht trin vt bc khi vo nm 18/10/1640 ,
Fermat gi cho bn ng 1 bc th . Trong c nh l Fermat nh .
Nguyn vn bc th nh sau:
Et cette proposition est gnralement vraie en toutes progressions et en tous nombres
premiers; de quoi je vous envoierois la dmonstration, si je n'apprhendois d'tre trop long.
Nh mt thi quen l k ca nha Ton hc ny. ng khng chng minh
nh l ng a ra. V n tn nm 1736 , Euler mi cng b cng trnh
chng minh ca mnh . Nhng theo 1 ti liu mt , Leibniz c bn tho
chng minh vi tng tng t trc nm 1683. L k l 1 cch c lp cc
nh ton hc Trung Quc trc a ra gi thit rng p l mt s nguyn t
nu v ch nu
. ng l nu p l s nguyn t , th
.
y l trng hp c bit ca nh l nh ca Fermat. Tuy th, iu ngc li (nu
th p l s nguyn t) l sai.
3

nh l nh Fermat c pht biu nh sau:


p chia ht
khi p l nguyn t v a l s nguyn t cng nhau vi p. p chia ht
khi p l nguyn t v a l s nguyn t cng nhau vi p.
Mt cch tng qut hn :
Nu p l s nguyn t v m v n l cc s nguyn dng tha mn
, th
.
Bn cnh , Euler khi nghin cu cng da vo nh l trn
xy dng 1 nh l mi :
vi modulo n bt k v s nguyn a bt k l s nguyn t cng nhau v n, ta c

trong (n) l k hiu ca phi hm Euler m s cc s nguyn gia 1 v n nguyn t cng


nhau vi n y l tng qut ha ca nh l nh Fermat v nu n = p l s nguyn t th
(p) = p 1.

y (n) = n. 1

1
1
1
i
. 1 .......... 1 vi n= pi
p1
p2
pk
i =1

By gi ta s chng minh nh l Fermat nh theo nhiu cch khc


nhau:
C1: Quy np theo a.
Nu a=1 th iu cn chng minh l ng. Gi s mnh ng vi a=k>0, ta
c

Dng gi thit quy np v

ta c

chia ht cho .

C2: Cn mt cch chng minh na cho nh l Fermat b l dng t hp nh sau:


Ta gii bi ton sau: Mt ng trn c chia thnh p cung bng nhau. Hi c bao nhiu
cch t mu cc cung bng a mu? Hai cch t thu c qua mt php quay c coi l
ging nhau.
Li gii: Ta nh s cc cung t 1 n p. Nu khng tnh n php quay th c cch t cc
cung. Nu tnh n php quay th mi mt cch t c 2 mu tr ln s nm trong 1 lp vi p
cch t khc. C a cch t ch dng 1 mu. V th s cch t s l
V s cch t phi l mt s nguyn nn ta c iu phi chng minh.
4

Cch chng minh l. Phi khng cc bn?


Cn 1 cch kinh in khc l xt h thng d y m-un p. Nu (a, p) = 1 th ax s chy
qua h thng d y mod p khi x chy qua h thng d y mod p. cng l cch
chng minh nh l Euler (thay h thng d y bng h thng d thu gn).
C th cn rt nhiu cch khc. Mong mi ngi b sung thm
ng trc 1 nh l ta thng t cu hi nh l a ra lm
g. y cng vy. L 1 nh l ni ting, nh l Fermat nh c
nhng ng dng nh th no va nh l tng qut ca n ra sao. Ta cng
xt 1 vi v d v nh l Fermat

Ta xt 1 bi thi trong thi HSG lp 12 tnh Bnh nh nm va ri :


VD2: Cho n l s nguyn dng sao cho
Gii: Xt

. CMR:

. Theo nh l Fermat, ta c

nn ta c:
D thy

chia ht cho

=>
v

ln hn

hoc

(vi a N * ).

, nn ta c iu phi chng minh.

Ta tip tc vi bi ton tip theo:


VD3: CMR vi p l s nguyn t ta c [(p - 1)! + 1] chia ht cho p
* Hin nhin trng hp p = 2 l ng(Bng cch kim chng)
*Ta s chng minh cho trng hp p > 2. Khi p l s l.
Ta p dng nh l Fecma nh : vi p nguyn t a l s nguyn dng sao cho
(a,p) = 1. Khi a p 1 1 (mod p)
V p nguyn t nn (1,p) = 1; (2,p) = 1; ....(p-1,p) = 1;
p dng nh l Fecma nh ta c :
(p-1) p1 1(mod p )
p1
(p-2) 1(mod p)
....
2 p1 1 (mod p);
v
1 p1 -(p-1) (Mod p);
Nhn theo v c :
[(p-1)!] p1 -(p-1)(mod p)
5

Rt gn theo v ta c:
[(p-1)!] p2 ][(p-2)!] p1 ] -1(mod p)
Li theo L Fecma nh th
((p-2)!,p) = 1
=> [(p-2)!] p1 1(mod p) nn ta c :
[(p-1)!] p2 -1(mod p);
Do p l nn (p-2) cng l => (p-1)! = -1(mod p)
Ni cch khc th (p-1)! + 1 chia ht p
l iu phi chng minh.
Tip theo thnh cng ca nh l Fermat , c thm hng lot nh l
khc ra i . Trong k n nh l
Wilson, Trbsep, ...
* nh l Wilson: c cng b vo nm 1773 bi John Wilson .
Cho p l s t nhin ln hn 1, khi p l s nguyn t, khi v ch khi (p-1)!+1 chia ht
cho p.
* nh l Trbsep:
Cho mi s Nguyn n > 3, lun Tn ti mt s Nguyn t nm gia n v 2n - 2
.V d n = 5 => 2n - 2 = 8 => P = 7 [Nguyn t]
.Cho mi s Nguyn n > 1, lun Tn ti mt s Nguyn t giua n v 2n
.V d n = 8 => 2n = 16 => P = 11 v P = 13 [Nguyn t]
* nh l Sylvester:
Nu n > k, th trong cc S n, n+1, . . . , n+[k-1], c mt S l 'Bi s' ca mt S Nguyn
t P [P > k]
.V d n = 7 || k = 4 || P = 5
.
A = 7 + 3 = 10 = 2.5 [A l Bi s ca P = 5]
* nh l Chen : mi s chn ln u c th c vit di dng tng ca hai s
nguyn t hoc ca mt s nguyn t v mt s na nguyn t (tch ca hai s nguyn t).
nh l Chen l 1 phn nh ca 1 gi thit m n ngy nay cha 1 nh
ton hc no c th chng minh hon ton . l gi thuyt Euler
Goldbach . Nm 1742, nh ton hc c Goldbach vit th cho Euler bit rng ng mo
him a ra bi ton: Mi s t nhin ln hn 5 u biu din c di dng tng ca 3 s
nguyn t. Euler tr li rng theo ng, mi s chn ln hn 2 u biu din c di dng
tng ca 2 s nguyn t. Nu chng minh c mt trong hai mnh th s chng minh
c mnh cn li. 200 nm sau, n nm 1937, nh ton hc Lin X Vinogradov
gii quyt gn trn vn bi ton bng cch chng minh rng mi s l ln u c th
biu din c di dng tng ca 3 s nguyn t. Nu mnh ca Euler l ng, hy
chng minh mnh Goldbach.
Gii: Cho s t nhin n>5, ta s chng minh rng n vit c di dng tng ca 3 s
nguyn t. Xt:
6

1. Trng hp 1: Nu n chn th n=2+m vi m chn, m>3. v s chn >2 k tip l 4 nn


d l m>3 th m vn vit c di dnng tng 2 s nguyn t.
2. Trng hp 2: nu n l th n=3+m vi m chn, m>2. Theo mnh Euler, m chn,
m>2 nn m vit c di dng tng hai s nguyn t. Do n vit c di dng
tng ca 3 s nguyn t.
*Gi thuyt Gilbrait
Nu bn vit dy cc s nguyn t theo th t t b n ln (thm c s 1 vo u ) .u tin
hng th nht ,bn ly gi tr tuyt i ca hiu 2 s nguyn t lin tip .Tip theo ,ly gi
tr tuyt i ca hiu hai s lin tip hng th nht ,...Sau hu hn ln nh vy , hng cui
cng bn s nhn c l s 1 .
y l 1 gi thuyt mi . Rt kh hiu. Ta cng xem biu din gi thuyt
qua hnh hc

Ta cng n vi 1 s bi tp s dng cc nh l trn.

2. Chng minh tn ti v s cc cp 2 s chnh phng m c t nht 1000 s nguyn


t gia.
Bi ny dng nh l: Cho s t nhin n th trong on [n;2n] lun tn ti t nht 1 s
nguyn t
Xt 1000 on [n;2n];[2n;4n];[
]
chn n l s chnh phng th ta c n v 21000 .n l s chnh phng .
3.CMR: Nu s Fermat
l s nguyn t th n phi l c ca
7

Ta c F khng c dng
chnh phng theo (mod F).
Vy
Suy ra
o li gi s
Suy ra
Gi h l cp ca 3 theo mod F
Suy ra h|F-1 hay
=>
(vi
Nu

hoc

nn nu F l s nguyn t th 3 phi khng

th h|
Do ta c
(mu thun)
V h|

Vy
Suy ra F-1|
=> F-1=
suy ra F l s nguyn t
4.
l s nguyn t th . Gi s vi no :
. Chng
minh rng :
T
=> 2 Pn + 2 P1 + P2 + ..... + Pn + 1 .
p dng nh l Trbsep : Cho mi s Nguyn n > 3, lun Tn ti mt s Nguyn t
nm gia n v 2n-2
=> 2 Pn + 2 Pn +1 => pcm

III/ Mt s dng s nguyn t :


1. S nguyn t Fermat: - S nguyn t Fecma c dng 2 2 + 1 (n N)
n

Trong 1 thi gian di, ngi ta lm tng Fermat tm ra cng thc


cho s nguyn t . Th nhng chnh nh ton hc Euler chng minh vi
n=5 th s Fermat khng cn l s nguyn t na . Nhng iu
khng c ngha s nguyn t dng Fermat khng cn gi tr . ta cng xt
bi ton :
Tm k sao cho : k. 2n + 1 l hp s n N *
t Fm = 22 + 1 th F0 , F1 , F2 , F3 , F4 P
v F 5 =641.p ( p P ) , p > F 4
Xt :
x 1mod(232 1).641 v x 1(mod p) => x = k tho mn
ta s chng minh vi k > p tho mn bi ton
t n = 2m.(2t + 1)m, t N
+) Nu m { 0,1, 2,3, 4} th k. 2n + 1 22 .(2t +1) + 1(mod 232 1)
D thy 232 1MFmm = 0,1, 2,3, 4
v 22 .(2t +1) + 1M22 + 1m = 0,1, 2,3, 4
nn k.2 n +1 MFm
li c k.2 n +1 >k> F4
=> k.2 n +1 l hp s
m

+)Nu m=5 : tng t k.2 n +1 M641 , k.2 n +1 >641


+)Nu m 6 : tng t k.2 n +1 Mp , k.2 n +1 >p
ta c pcm
2. S nguyn t Mersenne : mt s Mersenne (s c dng ly tha ca 2 tr 1: 2n 1,
mt s nh ngha yu cu ly tha (n) phi l s nguyn t) v l mt s nguyn t
iu kin cn Mn l s nguyn t l n l s nguyn t, 24 -1 = 15 l hp s v 4 khng l
nguyn t, nhng ngc li khng ng: v d s Mersenne 2047 = 211 1 khng l nguyn
t v n chia ht cho 89 v 23, mc d s 11 l s nguyn t.
Hin nay, cc s nguyn t ln nht c tm thy thng l s nguyn t Mersenne.
Cc s nguyn t Mersenne c quan h cht ch vi cc s hon thin, ngha l cc s bng
tng cc c chn chnh ca n. Trong lch s, vic nghin cu cc s nguyn t Mersenne
tng b thay i do cc lin quan ny; vo th k 4 TCN, Euclid pht biu rng nu M l
s nguyn t Mersenne th M(M+1)/2 l s hon thin. Vo th k 18, Leonhard Euler chng
minh rng tt c cc s hon thin chn u c dng ny. Khng mt s hon thin l no
c bit, v ngi ta nghi ng rng chng khng tn ti.
*) Tm s nguyn t Mersenne :
ng thc

cho bit rng Mn c th l s nguyn t ch nu chnh n l s nguyn t, iu lm gin


lc bt vic tm cc s nguyn t Mersenne. Mnh o, ni rng Mn l s nguyn t
nu n l s nguyn t l sai. S nh nht cho v d ny l 2-1 = 2389, l hp s.
c cc thut ton nhanh tm s nguyn t Mersenne, do hin nay bit cc s
nguyn t Mersenne rt ln.
Bn s nguyn t Mersenne u tin M2 = 3, M3 = 7, M5 = 31 v M7 = 127 c bit
t c xa. S th nm, M13 = 8191, c tm thy vo trc nm 1461; hai s tip theo
(M17 v M19) tm thy bi Cataldi vo nm 1588. Sau hn mt th k M31 c kim tra
bi Euler vo nm 1750. S tip theo (trong lch s, khng theo th t s) l M127,
do Lucas tm thy vo nm 1876, sau M61 do Pervushin tm vo nm 1883. Hai s na
(M89 v M107) c tm thy vo th k 20, bi Powers vo nm 1911 v 1914.
T th k 17, cc s ny c mang tn nh ton hc Php Marin Mersenne, ngi
chng minh mt lot cc s nguyn t Mersenne vi s m ln ti 257. Danh sch ca
ng mc mt s sai lm, nh bao gm c M67, M257, v b qun M61, M89 v M107.
Phng php tt nht kim tra tnh nguyn t ca cc s Mersenne c da vo s
tnh ton mt dy tun hon, c pht biu u tin bi Lucas nm 1878 v chng
minh bi Lehmer vo nhng nm 1930. Hin nay n c gi l kim tra Lucas-Lehmer
vi s nguyn t Mersenne. c bit, ta c th chng minh rng (vi n > 2) Mn = 2n
1 l s nguyn t nu v ch nu Mn chia ht cho Sn-2, trong S0 = 4 v vi k >
0,
.
9

th biu din s cc ch s ca s nguyn t Mersenne ln nht bit theo tng


nm ca k nguyn in t. Ch rng trc tung c logarithm ha.
Vic tm cc s nguyn t Mersenne thc s c cch mng bi cc my tnh in t
s. Thnh cng u tin ca t tng ny thuc v s nguyn t Mersenne, M521, nh n
lc kho lo vo lc 10:00 P.M. ngy30-1, 1952 khi s dng my tnh t ng Western
U.S. National Bureau of Standards (SWAC) ti Institute for Numerical
Analysis thuc i hc California ti Los Angeles, di s iu khin trc tip
ca Lehmer, s dng chng trnh vit v chy bi GS R.M. Robinson. N l s nguyn
t Mersenne u tin tm thy sau 38 nm; s tip theo, M607, c tm thy do
computer ny sau gn hai gi chy my. Ba s tip theo M1279,M2203, M2281 c
tm thy vi cng chng trnh trn sau nhiu thng na. M4253 l s nguyn t Mersenne
u tin l s nguyn t siu ln (trn 1000 ch s thp phn-titanic), v M44497 l s
nguyn t u tin c trn 10.000 ch s thp phn (gigantic).
n thng 9 nm 2008, ch mi bit 46 s nguyn t Mersenne; s ln nht bit l s
(243 112 609 1). Cng nh nhiu s nguyn t Mersenne trc , n c tm ra nh d
n tnh ton phn tn trn Internet, c bit vi tn gi Tm kim s nguyn t
Mersenne khng l trn Internet (Great Internet Mersenne Prime Search - GIMPS).
*) Cc nh l :

+) Nu n l s nguyn dng, theo nh l nh thc ta c th vit:

,
hay

nh t c = 2a, d = 1, v n = b
chng minh

10

= an - bn
+) Nu 2n - 1 l s nguyn t, th n l s nguyn t.
Chng minh
Do
Nu n khng l nguyn t, hoc n = ab trong 1 < a,b < n. Do , 2a 1 l c ca 2n 1,
hoc 2n 1 khng l nguyn t.
3) S NGUYN T GAUSS
Mt s Nguyn Gauss l mt s Phc vi phn Thc v phn o u l cc s Nguyn.
Tp cc s Nguyn Gauss l mt Min nguyn, thung uc K hiu l Z[i].
Cc Phn t Nguyn t ca Z[i] cng uc gi l cc s Nguyn t Gauss. Mt vi s
Nguyn t thng thung (i khi phn bit, chng uc gi l cc "s Nguyn t
Hu t") khng phi l cc s Nguyn t Gauss.
Chng hn 2 = (1 + i)(1 - i) v 5 = (2 + i)(2 - i).
Cc s Nguyn t Hu t ng du vi 3 (mod 4) l s Nguyn t Gauss. Cn cc s Nguyn
t Hu t ng du 1 (mod 4) th khng.
l v s Nguyn t dng 4k + 1 lun c th vit dui dng Tng ca hai s Bnh
phung(nh l Fermat), do ta c
p = a2 + b2 = (a + bi)(a - bi).
Nu Chun ca s Nguyn Gauss z l mt s Nguyn t, th z cng l s Nguyn t Gauss, v
mi Uc khng Tm thung ca z cng l Uc khng Tm thung ca Chun.
Chng hn 2 + 3i l mt s Nguyn t Gauss v Chun ca n l 4 + 9 = 13.
4) S NGUYN T CHEN
S Nguyn t p uc gi l s Nguyn t Chen (Trn) nu p + 2 cng l s Nguyn t
hoc l Tch ca hai s Nguyn t.
Vo nm 1966, Trn Cnh Nhun (Chen Jingrun) Chng minh rng c V hn s
Nguyn t nhu vy.
Mt s S nguyn t Chen u tin l
11

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 47, 53, 59, 67, 71, 83, 89, 101 (sequence
A109611 in OEIS)
Rudolf Ondrejka (1928-2001) tm uc mt Hnh vung K o 3x3 ca 9 s Chen
Vo thng 10-2005 Micha Fleuren v nhm PrimeForm tm thy s Nguyn t Chen
ln nht hin nay,
(1284991359 298305 + 1)(96060285 2135170 + 1) 2 vi 70301 ch s.
S nh hn trong mt Cp s Nguyn t Snh i l s Nguyn t Chen (theo nh
ngha).
n nm 2006, cc S Nguyn t Snh i ln nht tm thy l 100314512544015
2171960 1;
N uc tm thy bi cc nh Ton hc Hungarians Zoltn Jrai, Gabor Farkas,
Timea Csajbok, Janos Kasza and Antal Jrai.
N c 51780 ch s.
Terence Tao v Ben Green vo nm 2005 Chng minh rng c nhiu V hn cc
Cp s Cng three-term ca cc S Nguyn t Chen.
5) S NGUYN T RAMANUJAN
Nm 1919, Ramanujan Cng b mt cch Chng minh nh Bertrand V khc cui Bi
nghin cu ny, Ramanujan rt ra thm mt Kt lun
(x) (x / 2) 1, 2, 3, 4, 5, ... nu x 2, 11, 17, 29, 41, ...
trong Hm (x) l s cc S Nguyn t x.
Kt qu ny, khi c nguc li, tr thnh nh ngha ca S Nguyn t Ramanujan, v
cc s 2, 11, 17, 29, 41 l nhng con s u trong cc S Nguyn t Ramanujan.
Ni cch khc: S Nguyn t Ramanujan l cc s Rn sao cho Rn l snh nht Tha mn
iu kin (x) (x / 2) n, cho mi x Rn
"S Nguyn t Ramanujan l cc s Nguyn Rn sao cho Rn l s Nh nht c th bo m
c n s Nguyn t gia x v x/2 cho mi x Rn
V Rn l s Nguyn nh nht Tha mn iu kin trn, nn Rn phi l s Nguyn t"
6) S NGUYN T GIAI THA
S Nguyn t Giai tha (factorial prime) l mt s Nguyn t nh hn hoc ln hn mt so
vi mt Giai tha hoc Chnh n l mt Giai tha.
Mt vi s Nguyn t Giai tha l
12

2, 3, 5, 7, 23, 719, 5039, 39916801, 479001599, 87178291199, ... (OEIS|id=A088054)


y 2=2!; 3=2!+1; 5= 3! -1; 7 = 3!+1; 23=4! -1; 719=6! -1;5039=7! -1 39916801 = 11!+1;
479001599= 12!+1; 87178291199 = 14!+1, ...
S Nguyn t Giai tha duy nht ng l Giai tha ch l s 2=2!.
Cc s Nguyn t Giai tha uc quan tm trong L thuyt s v chng vng mt trong
Dy lin tip cc Hp s.
Chng hn s Nguyn t tip theo 6227020777 l 6227020867.
Cc s Nguyn t Giai tha c vai tr trong Lun c rng 1 khng l s Nguyn t.
"Nu n l mt s T nhin v p l mt s Nguyn t,
n! + p khng th l Nguyn t vi p < n, v n s l mt Bi ca p, cng nhu chnh n! .
Nhung n! + 1, ch chc chn l Bi ca 1, vn c th l s Nguyn t." (iu cng
ng vi n! - p v n! - 1).

IV) Cc cp s nguyn t:
1) CP S NGUYN T
Hai s Nguyn t p v q uc gi l CSNT nu |p q| = 2.
Chua bit Tp hp cc CSNT l Hu hn hay V hn.
Cng vi cc CSNT nh d nhn ra nhu: 3 v 5, 5 v 7, 11 v 13... ta cng bit cc CSNT
kh ln nhu 10016957 v 10016959
2) S NGUYN T H HNG
Cp S Nguyn t H hng (cousin prime) l mt Cp s Nguyn t lch nhau bn n v
Cc s Nguyn t H hng dui 1000 theo A023200 v A046132 (trong OEIS)
(3, 7), (7, 11), (13, 17), (19, 23), (37, 41), (43, 47), (67, 71), (79, 83), (97, 101), (103, 107),
(109, 113), (127, 131), (163, 167), (193, 197), (223, 227), (229, 233), (277, 281), (307, 311),
(313, 317), (349, 353), (379, 383), (397, 401), (439, 441), (457, 461), (487, 491), (499, 503),
(613, 617), (643, 647), (673, 677), (739, 743), (757, 761), (769, 773), (823, 827), (853, 857),
(859, 863), (877, 881), (883, 887), (907, 911), (937, 941), (967, 971)
n thng 11-2005 s nguyn t h hng ln bit uc l (p, p+4) vi
p = (9771919142 ((53238 7879#)2 - 1) + 2310) 53238 7879#/385 + 1
N c 10154 ch s v uc tm thy bi Torbjrn Alm, Micha Fleuren v Jens Kruse
Andersen (7879# l k hiu ca primorial ca 7879).
13

Ti thng 1-2006 s nguyn t h hng ln nht bit uc l (630062 237555 + 3,


630062 237555 + 7). N c 11311 ch s v do Donovan Johnson tm thy 2004. Cn
chua c mt thut ton thun li kim cc s ny c l nguyn t khng?
C gi thit Hardy-Littlewood rng cc s nguyn t h hng c mt tim cn ging
nhu cc s nguyn t snh i.
Mt hng s tung t hng s Brun cho cc s nguyn t snh i cho cc s nguyn t h
hng, bt du vi (3, 7):

*
Khi dng cc s nguyn t h hng ti 242, c gi tr ca B4 uc tnh bi Marek Wolf nm
1996 l B4 1.1970449
Khng nn ln hng s ny vi hng s Brun's cho cc s nguyn t b bn, cng uc k
hiu l B4.
3) S NGUYN T SEXY
Cp s Nguyn t Sexy l Cp hai s Nguyn t c hiu bng su.
So vi cc Cp s Nguyn t Snh i, l cc Cp s Nguyn t c hiu bng 2, v Cp s
Nguyn t H hng, l Cp s Nguyn t c hiu l 4.
Tn "S Nguyn t Sexy" xut pht t ting Latin "Sex" l s su (6).
Cc S Nguyn t Sexy (sequences A023201 v A046117 trong OEIS)
(5,11), (7,13), (11,17), (13,19), (17,23), (23,29), (31,37), (37,43), (41,47), (47,53), (53,59),
(61,67), (67,73), (73,79), (83,89), (97,103), (101,107), (103,109), (107,113), (131,137),
(151,157), (157,163), (167,173), (173,179), (191,197), (193,199), (223,229), (227,233),
(233,239), (251,257), (263,269), (271,277), (277,283), (307,313), (311,317), (331,337),
(347,353), (353,359), (367,373), (373,379), (383,389), (433,439), (443,449), (457,463),
(461,467)
Cng nhu cc s Nguyn t Snh i, cc s Nguyn t sexy c th m rng thnh cc
B ba s Nguyn t sexy (p, p + 6, p + 12)
sao cho p + 18 l Hp s
Cc B ba s Nguyn t sexy A046118, A046119 and A046120 in OEIS) dui 1000 l
(7,13,19), (17,23,29), (31,37,43), (47,53,59), (67,73,79), (97,103,109), (151,157,163),
(167,173,179), (227,233,239), (257,263,269), (271,277,283), (347,353,359), (367,373,379),
(557,563,569), (587,593,599), (607,613,619), (647,653,659), (727,733,739), (941,947,953),
(971,977,983)
Tnh n thng 3-2006 B ba s Nguyn t sexy ln nht uc tm thy bi Ken Davis
v c 5132 ch s
p = (84055657369 205881 4001# (205881 4001# + 1) + 210) (205881 4001# - 1) / 35
+1
Cc B bn s Nguyn t sexy (sequences A046121, A046122, A046123 and A046124 in
OEIS) nh hn 1000
(5,11,17,23), (11,17,23,29), (41,47,53,59), (61,67,73,79), (251,257,263,269),
(601,607,613,619), (641,647,653,659)
14

n thng 11-2005 B bn s Nguyn t sexy uc bit ln nht l (p, p+6, p+12, p+18)
do J K Andersen tm thy c 1002 ch s
p = 411784973 2347 + 3301
V mi s th nm ca B 5 c dng 6n 1 chia ht cho 5, ch c mt B nm s Nguyn t
sexy tn ti l (5,11,17,23,29), v khng c B nm s Nguyen to Sexy nao lon hon.

V/ Cc dng bi tp c bn :
Cc nh l c s :
1. nh l 1: Tp hp cc s nguyn t l v hn

2. nh l 2: c s nh nht khc 1 ca mt hp s l mt s nguyn t khng ln hn cn


bc hai c s
3. nh l 3: Cho mt s t nhin a v mt s nguyn t p. Khi hoc p/a hoc (a,p) = 1
n

4. nh l 4: Cho p l s nguyn t v a 1; a2; a3; ......; an l cc s t nhin Khi nu p/

i=1

ai th p/ai

(i =1, n )

5. nh l c bn ca s hc
Mi s t nhin ln hn n v (ln hn 1) ch c th phn tch thnh tha s nguyn
t mt cch duy nht (nu khng k n th t cc tha s)

Cc dng ton :

Dng 1: CHNG MINH MT S, MT BIU THC L S NGUYN T, L


HP S.
+)Loi 1: Chng minh mt s, mt biu thc l s nguyn t.
Thng thng chng minh mt s, mt biu thc l s nguyn t ngi ta
dng phng php chng minh bng phn chng.
Bi ton 1: Cho 2m 1 l s nguyn t. Chng minh rng m l s nguyn t.
Chng minh: Gi s m l mt hp s m = p.q ( p, q > 1, p; q N)
Ta c: 2m 1 = 2pq 1 = 2(p)q - 1 = (2p - 1) [2p(q - 1) + 2p(q - 2) + ... + 1]
V p > 1 2p -1 > 1 v 2p(q - 1) + 2p(q - 2) + ... + 1 > 1 2m -1 l hp s. iu ny
tri vi gi thit.
Nu m = 1 2m 1 = 1 khng phi l s nguyn t.
Vy m phi l mt s nguyn t.
Hay 2m 1 l s nguyn t m l s nguyn t.
Bi ton 2: Chng minh rng nu p chia ht (p 1)! + 1 th p nguyn t.
Gii: Gi s p l hp s. Ta c: p/(p 1)!
15

Mt khc theo gi thit p/(p 1)! + 1 p/1 ( v l)


Vy p phi l s nguyn t.
Bi ton 3: Chng minh rng nu: 1 + 2n + 4n ( n Z+) l s nguyn t th
n = 3k vi k N.
Gii: t n = 3k.a ( n khng c dng 3k) a 1 (a,3) = 1
k
m = 2 3 ( m 2; m N)

Gi s a > 1 ta xt 2 trng hp sau: a = 3b + 1 v a = 3b + 2


* Nu a = 3b + 1 (b N) ta c: 1 + 2n + 4n = (1 + m + m2) + (m3b+1 - m) + m2( m6b - 2)
M1

+ m +m2 v m6b m2

M(1

+ m +m2 ) M(m3b -1) M(m3 -1) M(1 + m +m2 ) Mt

khc ta li c: 1+ ma + m2a >1 + m +m2


Nn : 1 + 2n + 4n l hp s (v l)
* Nu a = 2b + 2 (b
tc n = 3k (k N)

N) hon ton tng t ta c 1 + 2n + 4n l hp s (v l). Vy a = 1

Bi ton 4: Chng minh rng nu p v 8p 2 + 1 l hai s nguyn t th 8p 2 - 1 l s nguyn


t.
Gii: Gi s p l s nguyn t ln hn 3 th th p c dng 3k 1 (k N)
p2 = (3k + 1)2 = 3(3k2 2k) + 1 = 3t + 1
8p2 +1 = 8( 3t + 1) + 1 = 24t + 9 M
3 8p2 + 1 l hp s (tri gi thit)

Vy p = 3k, p nguyn t p = 3
8p2 + 1 = 8.32 + 1 = 73 ( nguyn t)
8p2 1 = 8.32 1 = 71 ( nguyn t)
Vy p v 8p2 + 1 l hai s nguyn t th 8p2 - 1 l s nguyn t.
Bi tp vn dng:
1. Chng minh rng cc s nguyn t ln hn 2 c dng 3k 1
2. Chng minh rng m2 n2 l s nguyn t th m, n l 2 s t nhin lin tip.
3. S a4 + a2 + 1 c th l mt s nguyn t khng?
4. Cho

l ly tha ca 1 s nguyn t vi

nguyn dng. Chng minh

t
5. Cho
l s nguyn t.
cmr:
cng l s nguyn t
+) Loi 2: Chng minh mt s, mt biu thc l hp s
Bi ton 1: Cho n N Chng minh rng A = n4 + 4n l hp s.
16

nguyn

Gii: *) n chn A M
2 A l hp s.

*) n l t n = 2k + 1

A = n4 + 4n = n4 + 42k+1 = (n2 + 22k+1)2 2.n2.22k+1

A = (n2 + 22k+1)2 (n.2k+1 )2 = n2 + 22k+1 n.2k+1)(n2 + 22k+1 + n.2k+1)


A = [(n 2k)2 + 22k][(n + 2k)2 + 22k] l hp s.
Bi ton 2: Cho a;b;c N* tha mn ab = cd . Chng minh rng
A= an + bn + cn + dn l hp s vi mi n

N*

Gii: Gi s (a;c) = t khi ta c a = ta 1 , c = tc1 vi ( a1,c1) = 1. T ab = cd a1b = c1d m


( a1,c1) = 1 nn b M
c1 t b = kc1 c1d = a1kc1 c1d = ka1
n
n
n
n
n
n
Khi : A = an + bn + cn + dn = tna 1 + knc 1 + tnc 1 + kna 1 A = (tn + kn)( a 1 + c 1 )

V k; t; a1; c1 N A l hp s

N*, Chng minh rng:

Bi ton 3: Cho n

4 n+1

10 n+1

+ 19 v 2 3

22

+ 32

4 n+1

+ 5 l nhng hp s.

Gii:
10 n+1

a.Ta chng minh 2 2

+ 19 M23 vi mi n 1

Ta c: 210 1 (mod 11) 210n 1 (mod 11) 2.210n 2 (mod 22)


210n +1 = 22.k + 2 ( k

N)

10 n+1
Theo Fecma: 222 1 (mod 23) 2 2
= 222k+2 4 (mod 23)

10 n+1

222k+2 + 19 M 23 (1)

22

+ 19 > 23 (2)

10 n+1
T (1) v (2) 2 2
+ 19 l hp s

4 n+1

b. Ta chng minh 2 3

+ 32

4 n+1

+ 5 M 11 vi mi n 1

Ta c: 34 1 (mod 10) 34n +1 3 (mod 10)


34n +1 = 10k + 3
4 n+1
Theo Fecma: 210 1 (mod 11) 2 3
= 210k + 3 8 (mod 11)

24 1 (mod 5) 24n + 1 2 (mod 10)


24n + 1 = 10l + 2
4 n+1
Theo Fecma: 310 1 (mod 11) 3 2
= 310l + 2 9 (mod 11)

4 n+1

23
4 n+1

23

+ 32

+ 32

4 n+1

4 n+1

4 n+1

+ 5 0 (mod 11) hay 2 3

4 n+1

Mt khc: 2 3

+ 5 8 + 9 + 5 (mod 11)

+ 32

4 n+1

+ 32

4 n+1

+ 5 M 11

4 n+1
4 n+1
+ 5 > 11 2 3
+ 32
+ 5 l hp s

17

Bi ton 4: Chng minh rng nu n l hp s th 2n 1 cng l hp s.


Gii: n hp s suy ra n = p.q (p; q > 1, p, q N )
2n 1 = ( 2p )q 1 = ( 2p 1)( 2p(q 1) + 2p(q 2) + ... + 1)
M 2p 1 >1 v 2p(q 1) + 2p(q 2) + ... + 1 > 1 nn 2n - 1 l hp s.
Bi tp vn dng:
1. Chng minh rng vi n

N , n > 1 th cc s sau l hp s

a. n4 + 4

b. n4 + 4n

c. m4 + m2 + 1

2. Cho p v 2p + 1 l hai s nguyn t vi p > 3. Chng minh 4p + 1 l hp s.


3. Cho n

N . Chng minh cc s sau l hp s:

a. A = 2 2
4.(IMO

2 n+1

+3

2001)Cho

b. B = 2 2
a,b,c,d

4 n+1

c. C = 2 2

+7

cc

nguyn

6 n+ 3

dng

+ 13
tha

mn:

v
(k N * )
Cm:

khng l s nguyn t.

5. Chng minh rng tn ti k sao cho

l hp s vi mi n nguyn dng.

Dng 2: TM S NGUYN T KHI BIT MT S IU KIN


+) Loi 1: Tm s nguyn t p bit iu kin mt s, mt biu thc
Bi ton 1: Tm cc s nguyn t p :
a. p + 10 ; p + 14 cng l cc s nguyn t
b. p + 2; p + 6; p + 8; p + 12; p + 14 cng l cc s nguyn t.
Gii: a. vi p = 3 ta c p + 10 = 13 l s nguyn t
p + 14 = 17 l s nguyn t.
Vi p > 3 p c dng p = 6k 1
* Nu p = 6k + 1 th th p + 14 = 6k + 15 chia ht cho 3 hay p + 14 khng l nguyn
t. Vy p = 6k +1 khng tha mn
* Nu p = 6k 1 ta c p + 10 = 6k + 9 chia ht cho 3 hay p+ 140 khng l s nguyn
t. Vy p = 6k 1 khng tha mn.
Vy p = 3 tha mn iu kin bi ton.
b. Vi p = 5 ta thy cc s trn du l s nguyn t.
18

Vi p 5 th p = 5k 1 ; 5k 2
* Nu p = 5k + 1 th p + 14 = 5k + 15 M
5 p + 14 khng nguyn t.
* Nu p = 5k 1 th p + 6 = 5k + 5 M
5 p + 6 khng l nguyn t.
* Nu p = 5k + 2 th p + 8 = 5k + 10 M
5 p + 8 khng l nguyn t.
* Nu p = 5k - 2 th p + 2 = 5k M
5 p + 2 khng l nguyn t.
Vy ch c p = 5 tha mn yu cu bi ton.
Bi ton 2: Tm 3 s nguyn t p; q; r sao cho p2 + q2 = r.
Gii: Gi s c 3 s nguyn t p; q; r sao cho pq + qp = r. khi r >3
r l. Vy p; q khng cng tnh chn, l nn phi c mt s nguyn t chn l 2.

Gi s p = 2 khi 2q + q2 = r
+) Nu q khng chia ht cho 3 q2 1 ( mod 3)
Mt khc q l 2q -1 ( mod 3) 2q + q2 M
3 ( khng nguyn t).
Vy q M
3 , q nguyn t q = 3 Khi r = 23 + 32 = 17
Do p, q c vai tr nh nhau nn c th p = 3 ; q = 2
Vy c 2 b s c tm l (2; 3; 17) v ( 3; 2; 17)
Bi ton 3: Tm s t nhin ( x; y) sao cho:
1
1
1

= ( p l s nguyn t).
y
p
x

Gii: Do x; y N

1
1
1
(x p)(y p) = p2

=
y
p
x

p nguyn t x > p, y > p nn ta c cc kh nng sau


*

x p =1
y p =p 2

x p =p

y p=p

x p = p2
y p =1

x =p +1
y =p 2 +p

x =2 p
y =2 p

x = p2 + p
y = p +1

Bi ton 4: Tm s nguyn t p sao cho:


2p + 1 l lp phng ca mt s t nhin.
Gii: 2p + 1 = n3 ( n N ) 2p = n3 1 = (n 1)(n2 + n + 1)
p = 2 2p + 1 =5 Khng tn ti n tha mn.
19

p > 2, p nguyn t nn ( p; 2) = 1

Mt khc: n 1 < n2 + n + 1 n 1 = 2 n = 3
p = n2 + n + 1 ( nguyn t) . Vy p = 13 tha mn yu cu bi ton.
Bi ton 5: Tm s nguyn t abcd sao cho ab v ac l s nguyn t v b2 = cd + b
c.
Gii: v abcd , ab v ac l cc s nguyn t b, c, d l cc s l khc 5. b 2 = cd + b
c b( b 1) = cd - c = 10c + d c = 9c + d
Do 9c + d 10 nn b( b 1) 10 b 4. Vy b = 7 hoc b = 9.
*) Nu b = 7 ta c: 9c + d = 42 M
3dM
3 d = 3 hoc d = 9.
Nu d = 3 9c = 39 khng tn ti c thuc N
Nu d = 9 9c + d M9 cn 42 khng M
9 (lai)
*) Nu b = 9 ta c: 9c + d = 72 M9 d M
9 vy d = 9
9c + 9 = 72 c = 7

ab = a9 l s nguyn t a 3; 6; 9; 4
ac = a7 l s nguyn t a 2; 5; 7; 8
Mt khc a 0 a = 1
Vy s cn tm l 1979 ( V 1979 l s nguyn t)
Bi ton 6: Tm 7 s nguyn t lin tip (

)tha mn:

CM Tng qut vi s m n.
C1: Gi s
D thy
Vi
ta c
Vi
ta c
Vi
th lun chia d
tha mn bi
C2: Ta c
(Fermat nh )

cn

khng CP
khng CP
nn khng tn ti cc s nguyn t

Vy ko c s no tha mn
Bi tp vn dng:
1. Tm tt c cc s nguyn t p p va l tng, va l hiu ca hai s nguyn t
20

2. Tm s nguyn t p sao cho 13p + 1 l lp phng ca mt s t nhin.


3. Tm p p + 1 ; p + 3 ; p + 5 ; p + 9 ; p + 11 ; p + 15 l nhng s nguyn t.
4.Tm

tn ti cc s nguyn dng

tha mn:

5. Tm tt c cc s nguyn t v sao cho:


l mt s chnh phng.
6. Tm 3 s nguyn t a,b,c sao cho
(
*xt
=>
(loi)
*xt c khc 2 => c l => v c 1 s chn 1 s l => trong a,b c 1 s chn
gi s l a => a=2 thay vo ta c
nu
thay vo => c=17
nu 3 => b c dng
hoc
vi k t nhin ln hn hoc bng 1
thay vo 2 trng hp thy VT chia ht cho 3 => v l )
7. (ARML 1988) : Tm 3 s nguyn t p; q; r sao cho p 2 q 2 = r
__________________

Loi 2: Tm s t nhin n mt s - mt biu thc l s nguyn t.


Bi ton tng qut: Tm s t nhin n biu thc P(n) l s nguyn t.
Thut ton: Khi gp dng ton ny ta phn tch P (n) thnh nhn t P(n) = P1(n) .P2(n) . khi
v P(n) l s nguyn t nn P1(n) =1 hoc P2(n) = 1
Thng thng ta xt biu thc min(P 1(n); P2(n)) = 1 gii phng trnh ny ta c gi tr n cn
tm.
Bi ton 1: Tm tt c cc s nguyn n sao cho:
a. n4 + 4 l s nguyn t.
b. n1997 + n1996 + 1 l s nguyn t.
Gii:
a. n4 + 4 = ( n2 + 2)2 4n2 = (n2 + 2 - 2n)( n2 + 2 + 2n)
Ta c n2 + 2 2n < n 2 + 2 + 2n nn n4 + 4 l s nguyn t th n 2 + 2 2n = 1 (n
1)2 = 0 n = 1.
Khi n4 + 4 = 5 l s nguyn t. Vy n = 1 tha mn bi ton.
b. n1997 + n1996 + 1 = (n1997 - n2) + (n1996 - n) + ( n2 + n +1) = n2(n1995 - 1) + n(n1995 - 1) + (n2 + n +1)
= ( n2 + n)(n1995 - 1) + (n2 + n +1)

Ta c: n1995 - 1 = (n3)665 - 1 = ( n3 - 1) [(n3)664 + (n3)663 +.......+ n2 + 1]


= ( n - 1)( n2 + n +1) [(n3)664 + (n3)663 +.......+ n2 + 1] M
( n2 + n +1)
21

Do n > 0 n2 + n +1 > 1. V vy n1997 + n1996 + 1 l s nguyn t th n1997 + n1996 + 1 = n2 +


n +1 n = 1
2
Bi ton 2: Tm cc s t nhin m; n : A = 3 3 m +6 n 61 + 4 l s nguyn t.

Gii: Ta c 3m2 + 6n 61 chia 3 d 2. ta t 3m2 + 6n - 61 = 3k + 2 (k N)


A =33k + 2 +4 = 9.27k +4

D thy rng 9.27k 9 (mod 13) 9.27k +4 M


13.
A nguyn t th A = 13 33k + 2 = 9 k = 0
3m2 + 6n - 61 = 3k + 2 = 2 (v k = 0) 3m2 + 6n - 63 = 0 m2 + 2n - 21 = 0
n < 11 . Do 2n chn m2 phi l s l m2 = 1, m2 = 9

*) Nu m2 = 1 m = 1 , n =10.
*) Nu m2 = 9 m = 3 ; n = 6 . Vy cc gi tr cn tm l (1;10 ) ; (3; 6 )
Bi ton 3: (olympic bungari 1996)
Tm tt c cc s nguyn t
sao cho
Khng mt tnh tng qut gi s
D thy :
l s l nn
khc
Nu
th k=3
Ta s c/m mt trong s
tn ti t nht s bng .
Gi s phn chng
Do :
hay
(mod p)
Tip theo ta c nhn xt rng :
Nu
v
(mod m),)
(mod m) th :
(mod m)
Mt khc theo nh l Fermat th :
(mod p).
Khi p dng nhn xt ta c :
R rng :
. Do :
, mu thun.
Vy
.
Nu
th
v v th
Cn nu
d dng kim tra thy tha mn.
Vy tt c cc b
l
Bi tp vn dng:
1. Tm tt c cc s n sao cho:
a. n4 + n2 + 1 l s nguyn t.

c. n1998 + n1997 + 1 l s nguyn t.

b. n3 - n2 +n - 1 l s nguyn t.

d. n1997 + n1995 + 1 l s nguyn t.

2. Bi ton m rng:
Tm a N s a3n + 2 + a3m + 1 + 1 l s nguyn t. bit rng m, n N v m2 + n2 0

22

3 Tm s nguyn t (ko nht thit khc nhau) bit rng ln tch ca cc s y tr i tng
cc bnh phng ca chng th bng
.
Dng 3: p dng gii phng trnh nghim nguyn , chia ht :
Bi ton 1:Chng minh vi mi s nguyn t p>2, th t s m ca phn s ti gin

chia ht cho p
C1: Ta thy t s ca phn s chnh l
Cn chng minh biu thc chia ht cho p.
Ta thy c tt c p-1 s hng, ta s chia chng thnh tng cp c tng chia ht cho p nh sau:

Tng cn li r rng l s nguyn nn biu thc trn chia ht cho p. Ta c pcm.


C2:
Do p l s nguyn t ln hn 2 nn (p-1) l s chn do ta c th chia cc s hng ca tng
thnh
nhm.
Ta c:
Do p l s nguyn t m cc tha s mu th nh hn p nn sau khi gin c t s vn
cn tha s p.
Ta c pcm
Bi ton 2: Tm tt c cc s nguyn dng x, y, z tha mn phng trnh:
Theo bt ng thc
Suy ra

, ta c:

Gi l mt c nguyn t bt k ca . Khi
Gi s
. Khng mt tnh tng qut, gi s

Nu
, ta c
Mt khc,
Vy

. t

. Ta c:

.
, ta suy ra iu v l.

. Vy
. Ta c
. Suy ra

. Thay vo, ta c:
. Do
nn
.
Bi ton 3: Cho s nguyn dng N c ng 12 c s dng khc nhau k c chnh n
v 1, nhng ch c c nguyn t khc nhau. Gi s tng cc c nguyn t l 20. Tnh gi
tr nh nht c th c ca N
23

Do N c ti a l 12 c nn ta c
t
(a,b,c,d>0)
v (a+1)(b+1)(c+1)(d+1)=12=1.2.2.3 (1)
Do m v a,b,c,d>0 (2)
t (1),(2)=> v l
Vy
ta i tm N nh nht c th
li c
(a+1)(b+1)(c+1)=12=2.2.3
=> 2 trong 3 s a,b,c =1 s cn li =2
v
=>c 1 s =2
gi s
(do
khng th chia ht cho 3=>
>=5 ) l cc s nguyn t d
chng minh c
l cc s tha mn bi v N min
Vy
Bi ton 4: (Thi chn i tuyn 30/4 L Qu ng Nng vng 2)
Cho
l cc s nguyn l s nguyn t l .CMR nu l c ca
v
th cng l c ca
Gii:
Bi ton 5: Tm cc s nguyn t
tha:
TH1.
Thay vo phng trnh cho ta c
TH2.
T
, ta c
. Suy ra
T y, ta c hai trng hp cn xt

hoc

Hai trng hp ny ta d dng tm c


Bi ton 6: Chng minh rng nu
cho
Trc ht, ta c:

l s nguyn t l th

Ta c nhn xt:
T , ta c:

24

chia ht

Do
Ta li c

Vy
Bi ton 7:(Vit NAm TST 2003) CHo n l 1 s nguyn dng .Chng minh rng
ko c c nguyn t dng
vi k nguyn dng
Xt l mt c nguyn t no ca
-Nu chn, t
suy ra
l thng d bc 2 ca
ch
c th c dng
(1)
-Nu l, t
suy ra
l thng d bc 2 ca
ch
c th c dng
hoc
(2)
T (1) v (2) suy ra pcm.
Bi ton 8: Cho n l mt s nguyn c khng qu 3 c s nguyn t
CMR : nu n-1 chia ht cho (n) th n l mt s nguyn t
Xt c 1 c nguyn t d thy ng
Xt c 2 c nguyn t
Theo gi thit :
t
Vi
Vi

th
min bn
ta c

loi
25

Vy trng hp ny v l
Xt

Gii ra nghim ko l cc s nguyn t => loi


Bi ton 9:( IMO Shortlist 2002. )
Cho n l s nguyn dng;
l cc s nguyn t phn bit ln hn 3. Chng
minh rng:
c t nht c.
vi
th
c no l
khng mt tnh tng qut gi s
t a n =
khi
.
cm
v
Bi tp vn dng :
1. Tm cc s nguyn t p,q sao cho:
2. (Iran 2008)
Chng minh rng tn ti v hn s nguyn t tha mn
Dng 4: p dng mt s b ca s nguyn t
*) B 1:

Gis
ls nguyn t l vi t, k l cc s t nhin, k l s t nhin l.
Khi , nu cc s t nhin x,y sao cho
th x v y ng thi chia ht cho p.
Chng minh b : Ta s dng php chng minh bng phn chng. Gi s x khng chia ht
cho p, t gi thit suy ra y cng khng chia ht cho p. Theo nh l nh Fec-ma ta c:
Hay:
Suy ra:
M theo gi thit
nn
(Do k l)
Vy iu gi s trn ca ta l sai. Tm li ta c pcm.
Ch rng

v p l s nguyn t l. Khi t=1 v t=2 ta c cc h qu sau.

Bi tp1: Cho s nguyn t dng p=4k+3 .


CMR: Nu cc s t nhin x,y tha mn

th x v y u chia ht cho p.
26

Bi tp2: Cho s nguyn t dng p=4k+1, k l s t nhin l.


CMR: Nu cc s t nhin x,y tha mn
th x v y u chi ht cho p.
Bi tp 3: Gi s a,b l hai s t nhin khc 0 nguyn t cng nhau. Khi cc c s
nguyn t l ca
ch c dng 4m+1 vi m l s t nhin.
Cc bi tp nng cao (S dng nh l v cc h qu trn gii quyt):
Bi 1*: Gii phng trnh nghim nguyn:
Bi 2*: Tm tt c cc cp s nguyn dng (x,y) sao cho

l s nguyn v l c ca 1995 (Thi HSG Bungary 1995)


Bi 3*: Gi s a,b l cc s nguyn dng sao cho 15a+16b v 16a-15b u l cc s chnh
phng. Tm gi tr nh nht ca s nh nht trong hai s chnh phng y.
(IMO ln th 37)
Bi 4*: Tm cc nghim nguyn dng ca cc phng trnh:
a)
b)
c)
Bi 5*: Tm nghim nguyn dng ca h phng trnh:
Bi 6*: Cho x v y l cc s nguyn khc 0 sao cho

l s nguyn v l c ca 1978. Chng minh rng x=y. (Chn i tuyn QG CHLB c


1979)
*) B 2: Gi s (a,b)=1 th mi c nguyn t l ca a 2 + b2 ch c dng
4m+1 . m N *
Chng minh: Xt c nguyn t p= 4m+3 = 2(2m+1)+1
theo b 1 => p = 1 => mu thun
=> pcm
Bi ton 1: Gpt nghim nguyn
x2 y3 = 7

(1)

pt (1)
27

x 2 + 1 = y 3 + 23
x 2 + 1 = ( y + 2)( y 2 2 y + 4)

(2)

Nu y chn th v phi ca (2) chia ht cho 4 nn x l


t x = 2t+1 =>

x 2 + 1 = 4t 2 + 4t + 2

khng chia ht cho 4 ( loi)

Vy y l , y = 2k+1 => y 2 2 y + 4 = 4k 2 + 3 nn n phi c c nguyn t l dng


4m +3
=> x 2 + 1 c c nguyn t dng 4m+3 , tri vi b
Vy pt khng c nghim nguyn
x2 + y 2
N * v l c
Bi ton 2 : Tm tt c cc cp s ( x,y) N * sao cho
x y

ca 1995
x2 + y2
Gi s
= k nguyn dng v k la c s ca 1995 = 5.3.7.19 = 5n vi
x y

n=3.7.19
Cc s nguyn t c dng 2(2m+1)+1= 4m+3
Gi CLN ca x v y l d= (x,y) th x=du v y = dv vi (u,v)=1
T gi thit => d( u 2 + v 2 )= k(u-v) (1)
Xt 2 Trng hp :
1) nMk th k c c nguyn t dng 4m+3
p dng b vo (1) => u 2 + v 2 khng cha cc c nguyn t ca k
nn k l c s ca d => d= kt
t.( u 2 + v 2 ) = u-v => u 2 + v 2 < u- v => (1) v
nghim
2) k=5m vi m l c ca n
Lc (1) tr thnh d( u 2 + v 2 ) = 5m(u-v) => d = mt ( tng t nh trn)
t( u 2 + v 2 ) = 5( u v)

(2)

T (2) c u 2 + v 2 5( u-v) => A= u 2 + v 2 - 5(u-v) 0 (3)


Mt khc
4A= 4u 2 20u + 25 + 4v 2 + 20v + 25 50
= (2u 5) 2 + (2v + 5) 2 -50 12 + 7 2 50 0
=> A 0 => A = 0
D dng gii tip
Bi ton 3: Tm s nh nht trong tp hp cc s chnh phng c dng
15a+16b v 16a-15b a, b N *
Gi s 15a+ 16b = m 2 v 16a- 15b = n 2 (1) m, n N *
=> m 4 + n 4 = (15a + 16b) 2 + (16a 15b) 2
28

= 481( a 2 + b 2 )=13.37. ( a 2 + b 2 )
Thy 13 v 37 l s nguyn t c dng p = 22 k + 1 vi k l
Gi s (m,n) = d => m = du , n=dv vi (u,v) = 1 th (2) tr thnh
d 4 (u 4 + v 4 ) = 481(a 2 + b 2 ) (3)
V (u,v) = 1 nn u 4 + v 4 khng cha c nguyn t 13 v 37 do 481 l c ca d => d = 481t .
m,n nh nht ta ly t = 1
Lc (3) tr thnh 481 3 ( u 4 + v 4 )= a 2 + b 2 (4)
T (1) c : m 2 n 2 = 31b a hay 481 2 ( u 2 + v 2 ) = 31b a
Chn u = v =1 m , n nh nht => m=n= 481
Bi tp p dng :
1. Tm nghim nguyn dng ca pt :
a, x 2 + y 2 = 585
b, x 2 + y 2 = 1210
c, 4xy x y = z 2
d, x 2 + y 2 = 3z 2
2. Tm nghim nguyn dng ca h phng trnh :
x 2 +13 y 2 = z 2
2 2
2
13 x + y = t

3.( Chn i tuyn quc gia c )


x2 + y2
Gi s x v y l cc s nguyn khc 0 sao cho
l s nguyn v l x+ y

c ca 1978. CMR : x=y


Dng 5 : Cc dng khc
Bi ton 1: Tm 3 s nguyn t sao cho tch ca chng gp 5 ln tng ca chng.
Gii: Gi 3 s nguyn t l a, b, c lc ta c:
a.b.c = 5( a + b + c ) 5 M
abc . m a, b, c nguyn t nn mt trong 3 s phi bng 5
Gi s a = 5 b.c = 5 + b + c ( b 1)(c 1) = 6

{
{

b 1=1
c 1=6

b 1=2
c 1=3

b =2
c =7
Trng hp ny loi v b = 4 khng nguyn t.

Vy b 3 s nguyn t cn tm l (2; 5; 7)
Bi ton 2: Tm tt c cc s nguyn t c dng
29

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

Gii:

n( n +1)
(n 1)( n + 2)
-1=
=p
2
2

*) n = 2 p = 2, n = 3 p = 5 tha mn.
*) n > 3 th th hoc n- 1 chn hoc n + 2 chn nn p l hp s. Gi tr p cn tm l p = 2
hoc p = 5.
Bi ton 3: Tm tt c cc s nguyn dng a , b phn bit sao cho :
v
l mt ly tha ca mt s nguyn t.
T gi thit ta c
vi
Suy ra ta c 2 trng hp
*TH1:
Do
(g/t)
(v l v
*TH2:p^k|ab-1
+)Nu
+)Nu
+)Nu

th a=b=1(t/m)
th d dng suy ra v l
v
th ta c
(do

Mt khc t
ta c
(Do
vy
suy ra p=3
(loi)
Vy a=b=1
Bi ton4: Tm cc s nguyn p sao cho cc s p+2, p+6, p+8, p+14 cng l nguyn t.
t: p = 5k+r (0 r < 5)
* nu r = 1 => p+14 = 5k+15 chia ht cho 5
* nu r = 2 => p+8 = 5k + 10 chia ht cho 5
* nu r = 3 => p+2 = 5k+5 chia ht cho 5
* nu r = 4 => p+6 = 5k+10 chia ht cho 5
* nu r = 0 => p = 5k l nguyn t khi k = 1
p = 5, cc s kia l: 7,11,13,19 l cc s nguyn t nn tho mn iu kin bi.
Vy p = 5 l gi tr cn tm
Bi ton 5: Cho p,q l 2 s nguyn t khc nhau.
CM:
+
1 (mod p.q)
Ta c p,q l 2 s nguyn t nn

30

Tng t ta c
Do
nn suy ra pcm
Bi ton 6: cm: nu
l mt s nguyn t th
Ta c
m
kt hp vi
l s nguyn t
ta c
Nn
Bi tp vn dng:
1. Chng minh rng ch c mt cp s nguyn dng (a, b) a4 + 4b4 l s nguyn t.
2. Tm s nguyn t p c dng

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

3. Chng minh rng 1 + 2n + 4n (n N*) l s nguyn t th n = 3k (k N)


4. Cho p l s nguyn t. Chng minh

khng l s chnh phng.

5. Tm s nguyn t p p2-p+1 l lp phng mt s t nhin


6.a, tm tt c cc s t nhin n :
b, tm tt c cc s t nhin a,b :

l s nguyn t.
l s nguyn t.

VI/ ng dng s nguyn t trong i sng :


Ton hc khng ch l l thuyt . N c vai tr rt ln trong khoa hc
ngy nay. Trc khi kt thc chuyn ta cng th gin mt cht v cng
hiu t u n gi ta hc s nguyn t lam g .
u tin l trong ngnh bo mt . Chc hn rt nhiu ngi tng nghe qua
vic dng ton hc trong mt m ha, tuy vy c th qun, ch ny c to vi mc
ch gii thiu v ng dng ca ton hc trong mt m ha, v trnh c hn
Nhng khi nim ton hc cn thit.
- Hm s Eurler (k hiu l ): cho n t nhin, khi (n) = s cc s t nhin nh hn n v
nguyn t cng nhau vi n. Vit di dng tp hp:
A = { u| 0 (n) = card(A).
- Cn nguyn thy: cho n t nhin, khi a c gi l cn nguyn thy ca n nu:
(i) 1<A<N< p> (ii) (a,n)=1
(iii) a^d != 1 (mod n) vi mi 0 <D p < (n)>- nh l: cho p nguyn t, a l mt cn nguyn
thy ca p, khi hm s f:
f : Z/pZ --> Z/pZ
x --> a^x l 1 song nh.
y ta c: Z/pZ l tp hp p lp tng ng xy dng bi quan h ng d mod p. Ni
nm na, l tp hp ca p tp hp, trong tp hp th i = {n| n = i (mod p)}. Mt hm s
f xy dng nh vy c gi l hm m ng d. Trong trng hp tng qut, f c nh
ngha nh sau:
f : Z/nZ --> Z/nZ
x --> a^x (mod n)
Cho trc x, a, vic xc nh s d ca a^x mod n, tc l tnh f(x) l n gin v c kh
nng. Tuy vy, vic xc nh hm s ngc ca f, ngha l cho trc a, n v s d ca a^x
31

khi chia cho n, xc nh s d ca x khi chia cho n khng phi bao gi cng lm c. iu
ny ch c th lm c nu f l 1 song nh, cng chnh l ngha ca nh l ny.
Nh vy, vic tm tt c cc cn nguyn thy ca 1 s cho trc s rt c ngha. nh l
sau y gip chng ta.
- nh l : Nu p nguyn t, a l mt cn nguyn thy ca p, khi vi mi b thuc Z/pZ c
th vit c di dng b = a^i trong 0 < i < p-2
T nh l ny suy ra:
* b l 1 cn nguyn thy khi v ch khi (p-1,i)= 1, hay ni cch khc, tp hp cc cn nguyn
thy ca p = {a^i (mod p), (p-1,i)=1}
* S cn nguyn thy ca p = (p-1)
* Nu ta bit 1 cn nguyn thy ca p, khi chng ta s bit tt c cc cn nguyn thy ca
p.
Nh vy, di mt s iu kin, hm s m ng d x --> a^x (mod n) trong Z/nZ l mt
song nh. Cn nhn mnh rng vic tnh hm s ngc ca n th phc tp hn rt nhiu,
ngay c khi chng ta bit gi tr ca a.
Hm s ny l mt v d tt cho mt lp cc hm s m chng ta gi l hm s "hng duy
nht":
- n gin tnh
- phc tp tnh ngc li.
Tuy vy, hm s m ng d c mt li th khc, l: Chng ta c th tnh hm s ngc
ca n mt cch d dng nu chng ta bit mt s thng tin d dng trong vic gi b mt.
V chnh nhng hm s ny c mt ngha quan trng trong vic mt m ha<O:p></O:p>
<O:p> </O:p>
By gi chng ta s cng tm hiu mt s phng php m ha:
ffice:smarttags" /><ST1:place w:st="on">I.</ST1:place> Chia s cha kha:
A v B mun c chung 1 cha kha, h s chn:
- p nguyn t v cng khai.
- a cn nguyn thy ca p, a cng khai
- Mi ngui mt s b mt Xa v Xb vi 1 < Xa, Xb < p-1
A s gi cho B a^Xa (mod p)
B s gi cho A a^Xb (mod p)
Khi , A v B s cng c chung 1 cha kha K = a^(Xa.Xb) (mod p)
II. M ha "khng cha kha":
Cho 1 thng tin (di dng s) M < p, A cn gi M cho B
1. A chn a < p, (a,p-1)=1 (a b mt)
B chn b < p, (b,p-1)=1 (b b mt)
2. A gi cho B s C = M^a(mod p)
3. B gi li cho A s D = C^b (mod p)
4. A tnh a' sao cho 0 < a' < p v a.a' = 1 (mod p-1) (a' c gi l nghch o (mod p-1) ca
a), sau gi cho B s E = D^a' = C^(b.a') = M^(a.b.a')
5. B tnh nghch o b' ca b, sau tnh E^b' = M^(aba'b') = M (mod p) v aa' = bb' = 1
(mod p-1) v theo nh l nh Fermat, M^(p-1) = 1 (mod p)
III. M ha vi cha kha cng khai
32

p nguyn t, p cng khai


N ngi mun chia s thng tin mt cch b mt, h s chn:
a cn nguyn thy ca p (nh th hm s m ng d ca a s l song nh)
mi ngi 1 s b mt Xn, vi 1 < Xn < p-1
H cng khai Yn = a^Xn (mod p)
IV. H thng RSA
y l h thng m ha kh thng dng hin nay, ly tn t thut ton RSA, do Rivest,
Shamir, Adelman tm ra vo nm 1977.
Ngi s dng mun trao i thng tin:
- Chn 2 s nguyn t p v q
- Tnh n = pq
- Chn d (ln) v nguyn t cng nhau vi (n) = (p-1)(q-1)
- Tnh e nghch o ca d mod (p-1)(q-1)
Cng khai e v n.
A mun gi thng tin M cho B, A s gi C = M^e (mod n)
B mun tm li M s tnh C^d = M^(ed) = M (mod n)
Ch rng thng tin b che giu y l hai s p v q, nh chng ta u bit, cho trc 1 s
t nhin, vic phn tch thnh tha s nguyn t i hi 1 khong thi gian rt ln (vi
nhng thut ton hin
S nguyn t cn l ti vn chng. iu ny cho thy ton hc khng
h kh khan cht no . Mt cm nhn c nhn v tiu thuyt : Ni c
n ca cc s nguyn t
Trc khi bc sang tui 30, bn s cn c nhiu c hi nhn v tui th v bt u c v
th m t li i sng trng thnh ca mnh trc .
Cun tiu thuyt ny ni v s c n ca tui th v s ln ln ca ni c n .
Rng, khi ta cn b, mt li lm nh cng tr thnh mt bi kch ln, v ta s b n lm c
n cht cht. Nhng nu ng l mt bi kch ln th ni c n c th l mt gnh nng
trong sut ng i.
Rng, ngay c khi trng thnh, ni c n vn cn . V d nh:
- Nu ta v trong nim tin, trong mt mi quan h th khong trng thm kht c mt ci
nm tay khng cn , mt ci m v hnh, mt li th thm an i vn cn nguyn .
Nu ci ti ca ta l mt s nguyn t, ch chia ht cho 1 v chnh bn thn n th...
tm m hnh ha nh sau:
Ci ti = p
Ni c n = n
ta c cng thc ca cp s nguyn t sinh i (twin prime) nh sau (p, n+p) => (3, 5), (5, 7),
(11, 13), (17, 19), (29, 31), (41, 43), (59, 61), (71, 73), (101, 103), (107, 109), (137, 139),
(149, 151), (179, 181), (191, 193), (197, 199), (227, 229), (239, 241), (269, 271), (281, 283),
(311, 313), (347, 349), (419, 421), (431, 433), (461, 463)...
Thc ra trong ton hc c nhiu hn cp s nguyn t sinh i, rng n = cc con s khc
chen vo gia v khi dy s cng i xa, n cng ln.
Cng ging nh khi ta ln ln, s c n cng ln y khong cch gia cc s nguyn t
cng xa hn
V ta
c nhiu hoi nghi hn
c nhiu ni s hn
33

c nhiu s dn vt hn
c nhiu s khn ngoan hn
c nhiu s thng thi hn
c nhiu li khuyn hn
Nhng ci ti! C l do g hn ta khng bc n tht gn nhau?
Kt : Vy y! Nhng con s kh khan cung nhng biu thc kh hiu
phi chng l tt c ca ton hc? Mt nh vn c th tm ra v p m
sao ta khng tm ra? S nguyn t ni ring hay s hc ni chung u
c nhng nt th v ring, c o ring . Tp chuyn ny hay mun
ngn tp chuyn khc s khng c gi tr nu nh bn thn mi ngi
khng tm c 1 cht v p t ci mnh ang nghin cu.....
Thi Bnh ,ngy 4 thng 8
nm 2010

L Huy Ton

34

You might also like