I HC QUC GIA TP H CH MINH

I HC KHOA HC T NHIN

KHOA TON-TIN HC

BO CO TIU LUN
MN HC: S HC V LOGIC

TI:

NG D V CC NH L NG D

H v tn sinh vin:
Th Thu Hin

1311106

Bi Th Yn Duyn 1311046
Trn Th Ngc Cm 1311026
L Th Hin Diu 1311038

Kha hc: 2015-2016

Ging vin ph trch: Trn Nam Dng

THNH PH H CH MINH-NM 2015

1

I. C S KHOA HC
1. C s l lun.
L thuyt ng d c xy dng trn nn tng l php chia trn vnh s nguyn. L mt
ni dung c suy lun mt cch lgic, cht ch.
2. C s thc tin
L thuyt ng d s cho ta phng php ng d, l mt ng tc c tnh cht k
thut gip chng ta b sung gii quyt vn chia ht trong vnh s nguyn.
II. NI DUNG
1. ng d
1.1. nh ngha v tnh cht
1.1.1 nh ngha
Cho m , m >1 ta ni a v b ng d theo mun m v vit a b (mod m) nu a v b
c cng s d khi chia cho m hay ni cch khc a b m
Ta c : a b (mod m) a b m
V d: 19 3 (mod 8);

-25 3 (mod 4)

Chng minh: Gi s chia a v b cho n v thu c cc thng nguyn v phn d. Cc

phn d nm gia 0 v n 1, ngha l a q1n r1 v b q 2 n r2 . Trong 0 r1 n 1 v
0 r2 n 1 .

a b mod n

Khi c th d dng thy rng a b mod n khi v ch khi r1 r2 . Nh vy:

khi v ch khi a mod n b mod n .

1.1.2 Tnh cht c bn ca ng d

Tnh cht 1:
a b (mod m)
c d (mod m)
2

Th a+c b+d (mod m)

a.c b.d (mod m)

Chng minh: + T gi thuyt ta c a = mt + b v c= d+ ms, suy ra a+c = b+d + (t+s).m

iu ny c ngha l a+c b+d (mod m)
+ T gi thuyt ta c a = mt + b v c= d+ ms, suy ra a.c = b.d +
(bs+td+mts). n iu ny c ngha l a.c b.d (mod m)
Tnh cht 2:
a. c b. d
(a, m) = 1
Th b c (mod m)
Tnh cht 3:
Xt v quan h trn , l mt quan h tng ng
i.

Phn x : a a (mod m)

ii.

i xng a b => b a

iii.

Bc cu a b, b c => a c

2. H thng d y
Mt h gm m i din ly t m lp thng d c gi l mt h thng d y module
m
2.1 nh ngha :

, !

l h thng d y mod m

{1,2, ,

},

(mod m)

V d: {-4, 5, 10, 15} l mt h thng d y theo modul 4.

V d: {0, 1, 2, 3, 4} l mt h thng d y khng m b nht modul 5.
3

Ta c nhn xt: Mt tp hp m s (m > 1) i mt khng ng d theo modul m lp thnh

mt h thng d y theo modul m.

2.2 Tiu chun : h thng d y

2.3 Tnh cht

Nu { ,
+{

+ ,

, ,

} l HTD module m th

+ , ,

+ } l mt h thng d y m-un m vi mi s

nguyn b
+ (a,m)=1
{

, ,

l mt h thng d y m-un m vi mi s

nguyn a nguyn t cng nhau

3. Cc nh l ng d
3.1 nh l Wilson
Vi p , p>1, p l s nguyn t (p-1) ! +1 p
(p l hp s th (p-1) ! +1 khng chia ht cho p)
V d:
p = 17
1 1 (mod 17)
16 -1 (mod 17)
2.9 1 (mod 17)
4

3.6 1 (mod 17)

4.13 1 (mod 17)
5.7 1 (mod 17)
8.15 1 (mod 17)
10.12 1 (mod 17)
11.14 1 (mod 17)
Ta c 16 ! (- 1).17
16 ! + 1 17
3.2 nh l Fermat
- nh l Fermat 1
Cho p l mt s t nhin khc v a l mt s nguyn khng chia ht cho m.
Khi y ta c:
ap - 1 1 (mod p)
- nh l Fermat 2
Cho p l mt s nguyn t, a l mt s nguyn bt k.
Khi y ta c:
ap - 1 a (mod p)
-nh l fermat nh:
p
a
a p a p
5

(a,p) =1
ap-1 1 (mod p)
B :

!
!(

)!

vi 1

V d 1: Tm 32012 mod 7
Gii: ly 2012 chia cho 6, ta c: 2012=6.335+2 vy th
32012 = 36.335 + 2 = (36)335.32 =
V d 2: Chng minh rng nu a1 + a2 + a3 + a4 + a5 0 (mod 5) th a15 + ... + a55 0
(mod 5)
Gii: 5 l s nguyn t theo nh l Fermat nh:

V d 3: Chng minh rng

Gii: Vi mi
1(

11)

=1

+2

5); = 1,5

5) 0 (

+ + 11

5)

khng chia ht cho 11

= 1,2, ,10 ( , 10) = 1. Do theo nh l Fermat nh th

1(

11) vi mi

= 1,2, ,10 11

0(

11). Nh

vy
1 + 1 + + 1 + 0 (

11)

10 s 1
10 (

11)

11

3.3 nh l Euler
Cho m l mt s t nhin khc 0 v a l mt s nguyn t vi m.
Khi y ta c:

( )

1 (mod m)
6

V d 1: Tm s d trong php chia 109345 chia cho 14

Gii:
Ta c: 109 -3 (mod 14)
=> 109345 (-3)345 (mod 14)
Ta li c: ( -3; 14 ) = 1
1
2

1
7

Hn na: (14) = 14.(1 )(1 ) 6

Nn: (-3)6 1 (mod 14) (theo nh l le)
=> (-3)345 (-3)3 (mod 14)
Mt khc: (-3)3 = -27 1 (mod 14)
Vy s d trong php chia 109345 chia cho 14 l 1
V d 2: Chng minh 2

34 n 1

311 vi n l s t nhin
1
2

1
5

Gii: Ta c: (11) = 10; (10) = 10(1 )(1 ) = 4.

p dng L Eucler ta c: (3; 10) = 1 => 3(10) 1 (mod 10)
<=> 34 1 (mod 10) => 34n + 1 3 (mod 10)
t 34n + 1 = 10.k + 3 vi k N.
Khi ta c: 2

34 n 1

3 210.k 1 3

p dng nh l Eucler ta c: (2; 11) = 1

Nn 2(11) 1 (mod 11)
<=> 210 1 (mod 11) => 210.k +3 23 (mod 11)
7

=> 210.k +3 + 3 23 +3 (mod 11) <=> 2

Vy 2

34 n 1

34 n 1

3 0 (mod 11)

311

V d 3: Tm 2 ch s tn cng ca 20092010
Gii: Ta c: 20092010 92010 (mod 100)
p dng nh l Eucler ta c: (9; 100) =1
1
1
(100)
1 (mod 100). M (100) = 100.(1 )(1 ) 40
Nn: 9
2

Hay: 940 1 (mod 100) => 92010 910 (mod 100)

M 910 = 3486784401 1 (mod 100).

3.4 nh l Trung hoa v s d

Cho n s nguyn dng m1 , m2 ,..., mn s nguyn dng i mt nguyn t cng nhau.
Khi h ng d tuyn tnh
x ai (mod mi )

i 1, n

c nghim duy nht moun M m1m2 ...mn .

4. ng dng
4.1. Tm s d trong php chia
V d1 : Tm s d trong php chia:

29455 3 chia cho 9

Gii: Ta c: 2945 2 (mod 9)

=> 29455 3 25 3 (mod 9)
8

M 25 3 2 (mod 9)
Vy s d ca 29455 3 chia cho 9 l 2
V d 2:Tm s d trong php chia: (19971998 + 19981999 +19992000 )10 chia cho 111
Gii: Ta c: 1998 0 (mod 111)
=> 1997 -1 (mod 111) v 1999 1 (mod 111)
Nn ta c: 19971998 + 19981999 +19992000 2 (mod 111)
(19971998 + 19981999 +19992000 )10 210 (mod 111)
Mt khc ta c: 210 = 1024 25 (mod 111)
Vy (19971998 + 19981999 +19992000 )10 chia cho 111 c s d l 25
V d 3: Chng minh 62n + 1 + 5n + 2 chia ht cho 31 vi mi n l s t nhin
Gii:
Ta c: 62 5 (mod 31) => 62n 5n (mod 31)
Mt khc: 6 - 52 (mod 31)
Nn: 62n + 1 -5n + 2 (mod 31)
Vy 62n + 1 + 5n + 2 chia ht cho 31.
4.2. Chng minh chia ht
V d 1: Chng minh: 3100 3 chia ht cho 13
Gii.
Ta c: 33 = 27 1 (mod 13)
=> 3100 = 3.399 3.1 (mod 13)
=> 3100- 3 0 (mod 13). Vy 3100-3 chia ht cho 13
9

4.3. Tm ch s tn cng
V d 1: tm 2 ch s tn cng ca 19 2015
Ta c 19 19 (mod 100)
19 2 61 (mod 100)
193 21 (mod 100)

1920 01 (mod 100)

192015 =(1920)100. 1915 = 1915 (mod 100)
Vy 2 ch s tn cng l 99
5. Mt s bi tp
5.1. Tm s d trong cc php chia:
a) 6635 chia cho 11
b) 171999 chia cho 6
c) 270 + 370 chia cho 13.
d) 53999 chia cho 17.
5.2. Tm 2 ch s tn cng bn phi ca cc s sau trong h thp phn:
a) 21999
b) 999
c) 262000
d) 72003
5.3 (IMO 1989) : Chng minh rng vi mi s nguyn dng n bt k, lun tn ti n s
nguyn dng lin tip m trong khng c s no l ly tha ca mt s nguyn t.
10

5.4. Cho m, n l 2 s t nhin ln hn 1 v (m,n) = 1.

Chng minh: mj(n) + nj(m) 1 (mod mn)
5.5. Chng minh: 12000 + 22000 + 32000 + ... + 102000 -1 (mod 11)
5.6. Cho (a,m) = 1 v a, b l 2 s t nhin sao cho a b (mod j(m)) vi j(m): hm
Euler. Chng minh: aa ab (mod m).
5.7. Cho p nguyn t. Chng minh: [(p!)2 - p2] p3.
5.8. Cho

5. Chng minh rng nu n+2 nguyn t th (n!-1) l hp s.

5.9. Tm cc s nguyn t p, q tha mn (7p5p)(7q5q) chia ht cho pq.

5.10. Tm cc s nguyn t p, q tha mn 2p+2q chia ht cho pq.
5.11. Tm s nguyn dng n tha mn: Vi mi cp s nguyn a, b tha
mn a2b+1 chia ht cho n ta lun c a2+b chia ht cho n
5.12. Cho s nguyn t l p v cc s nguyn dng a, b, n tha mn (a, p)=1 v ap bp
(mod pn+1) Chng minh rng: a b (mod pn)
Bi tp v nh l s d Trung hoa
1.Chng minh rng tn ti s nguyn k sao cho 2 n k 1 l hp s vi mi s nguyn
dng n.
2. Cho hai s nguyn dng p, q nguyn t cng nhau. Chng minh rng tn ti s
nguyn k sao cho ( pq 1) n k 1 l hp s vi mi s nguyn dng n.
3. Cho s nguyn dng n p1 p2 ... pk , trong p1 , p2 ,..., pk l cc s nguyn t i
1

mt khc nhau. Tm s nghim ca phng trnh ng d x 2 x 0(mod n) .

4. Tm s nguyn dng n l sao cho vi mi h thng d thu gn moun n

a , a ,..., a ta c a a ...a
1

(n)

1 2

( n)

1(mod n) .

5. . Chng minh rng vi mi s t nhin n, lun tn ti n s t nhin lin tip sao cho
bt k s no trong cc s cng u l hp s.

11

6. Chng minh rng vi mi s t nhin n, lun tn ti n s t nhin lin tip sao cho
bt k s no trong cc s cng u khng phi l lu tha (vi s m nguyn ln
hn 1) ca mt s nguyn t.
7. . Chng minh rng vi mi s t nhin n, tn ti mt cp s cng gm n s hng
sao cho mi s hng ca n u l lu tha ca mt s t nhin vi s m ln hn 1.
8. Cho A l tp con khc rng ca N. Chng minh rng tn ti s nguyn dng n sao
cho nA {nx | x A} l tp hp l lu tha ca mt s t nhin vi s m ln hn 1.
Ti liu tham kho
[tl1]: Chu Hong Lm 2015 l thuyt ng d v mt s ng dng
http://violet.vn/chauhoanglam2012/present/same/entry_id/7634554
[tl2]: L Vn Ngc 2015 l thuyt ng d v mt s ng dng
http://www.slideshare.net/thuvienso24h/l-thuyt-ng-d-v-ng-dng
[tl3]: ng d thc 2015 http://documents.tips/documents/dong-du-thuc.html
[tl4] 2015 http://websrv1.ctu.edu.vn/coursewares/supham/sohoc/sohoc_6-2.htm

12