1

NG D
1. nh ngha.
Cho a, b, m l cc s nguyn, m = 0.
Nu a b chia ht cho m th a c gi l ng d vi b modulo m, k hiu a b mod m.

2. Tnh cht
Cho a, b, c, d l cc s nguyn
2.1. Nu a b mod m th b a mod m
2.2. Nu a b mod m v b c mod m th a c mod m
2.3. Nu a b mod m v c d mod m th a + c b + d mod m
2.4. Nu a b mod m v c d mod m th ac bd mod m
2.5. Nu a b mod m, k nguyn dng th a
k
b
k
mod m
2.6. Nu a b mod m v d| m th a b mod d
2.7. Nu a b mod m th ac bc mod cm vi mi c khc 0.
2.8. Nu ab ac mod m v (a,m) = 1 th b c mod m
2.9. a b mod m
i
( i =1,2,,n) a b mod [m
1
,m
2
,,m
n
]

3. nh l Fermat nh
Gi s p nguyn t, (a, p) = 1. Khi a
p1
1 mod p

Chng minh.
Xt p 1 s a, 2a, 3a, , (p 1)a. Ta chng minh rng khng tn ti 2 s ng d trong
php chi a cho p.
Gi s ka la mod p vi k, l e{1,2,,p 1} v k = l a(k l) p k l p k = l
(mu thun)
Vy khi chia p 1 s trn cho p ta nhn c p 1 s d khc nhau t 1, 2,, p 1
Suy ra a. 2a. (p 1)a 1.2.(p 1) mod p (p 1)!. a
p1
(p 1)! mod p
V ((p 1)!,p) = 1 nn a
p1
1 mod p.

T nh l ta c a
p
a mod p (vi p nguyn t, (a,p) =1)

4. H thng d y .

4.1. Tp hp x
1
, x
2
, , x
n
gi l mt h thng d y modulo m nu vi mi s
nguyn y tn ti duy nht mt x
i
sao cho y x
i
mod m.

4.2. Tp {1,2,, m 1, m} l mt h thng d y modulo m

4.3. Mi h thng d y modulo m u c ng m phn t

4.4. Mt tp gm m phn t l mt h thng d y modulo m nu v ch nu hai
phn t khc nhau bt k ca n khng ng d vi nhau modulo m.

4.5. Cho s nguyn a v m > 0. Tp hp tt c cc s nguyn x tha mn x a mod m
c gi l mt lp ng d modulo m, k hiu { } a a mt / t Z = + e . C m lp ng
d phn bit modulo m, thu c bng cch ly ln lt a = 1,2,,m.
2
4.6. Mt tp hp {r
1
,r
2
,,r
n
} c gi l mt h thng d thu gn modulo m nu (r
i
,m) =
1, r
i
= r
j
i = j, 1 s i, j s n v vi mi s nguyn x nguyn t cng nhau vi m th tn
ti r
i
sao cho r
i
x mod m.

4.7. S cc phn t ca h thng d thu gn modulo m c xc nh bi hm Euler
(m) l s cc s nguyn dng khng vt qu m v nguyn t cng nhau vi m.

4.8. Hm c cc tnh cht sau
4.8.1. (mn) (m) (n) = vi (m,n) = 1
4.8.2. Nu p nguyn t,
n n n 1
(p) p 1, (p ) p p (n 1)

= = > ,
4.8.3. Nu
1 2 k
1 2 k
m p p ...p
o o o
= , p
i
l cc s nguyn t th

1 2 k
1 1 1
(m) m 1 1 ... 1
p p p
| || | | |
=
| | |
\ .\ . \ .

4.8.4. V d : (2) 1 = , (3) 2 = ,
2
(4) 2 2 2 = = ,
1 1
(20) 20(1 )(1 ) 8
2 5
= =
4.9. nh l.
Cho (a,m) = 1 v r
1
, r
2
,., r
n
l mt h thng d thu gn (y ) modulo m. Khi ar
1
,
ar
2
, , ar
n
cng l mt h thng d thu gn (y ) modulo m.

Chng minh.
V (a,m) = 1 nn nu (r
i
,m) = 1 th (ar
i
, m) = 1. Ta chng minh cc phn t ca tp
{ar
1
,ar
2
,,ar
n
} i mt phn bit modulo m. Tht vy, nu ar
i
= ar
j
mod m th do (a,m) = 1
nn r
i
r
j
mod m (v l). Theo 4.4 ta c pcm.

4.10. nh l Euler.
Gi s m l s nguyn dng v (a,m) = 1. Khi
(m)
a 1

mod m.

Chng minh.
Gi s r
1
, r
2
, ,
(m)
r

l h thng d thu gn gm cc s nguyn dng khng vt qu m

v nguyn t cng nhau vi m. Theo nh l trn ta suy ra ar
1
, ar
2
, ,
(m)
ar

l mt h thng
d thu gn modulo m. Nh vy cc ng d dng b nht ca ar
1
, ar
2
,..,
(m)
ar

phi l cc
s r
1
, r
2
, ,
(m)
r

xp theo mt th t no . V th ta c
1 2 (m) 1 2 (m)
ar .ar ....ar r r ...r modm


hay
(m)
1 2 (m) 1 2 (m)
a r r ...r r r ...r modm

V
1 2 (m)
(r r ...r , m) 1

= nn
(m)
a 1modm

4.10.1. V d. Tm d khi chia s 11
2010
cho s 24.
Gii
Ta c (11,24) = 1
(24)
11 1mod24

8
11 1mod24
2010 8.251 2 2
11 11 11 1
+
= mod 24.

5. Phng trnh ng d tuyn tnh
Phng trnh dng ax b mod m c gi l phng trnh ng d tuyn tnh vi a, b, m l
cc s bit.
x
0
l mt nghim ca phng trnh khi v ch khi ax
0
b mod m.
3
Nu x
0
l nghim th cc phn t thuc lp
0
x cng l nghim.
5.1. nh ngha.
Gi s a, m l cc s nguyn, m > 1. Nghim ca phng trnh ax 1 mod m c gi l
nghch o ca a modulo m.

5.2. nh l.
Nghch o ca a modulo m l duy nht (a,m) = 1

Chng minh.
Gi a l nghch o ca a modulo m aa 1 mod m aa + mb = 1 (a,m) = 1
o li nu (a,m) = 1 tn ti a, m sao cho aa + mm = 1 aa 1 mod m a l
nghch o ca a modulo m. a l duy nht bi v nu c a sao cho aa 1 mod m th aa
aa mod m , m (a,m) = 1 a a mod m

5.3. H qu.
Nu p nguyn t th mi phn t ca tp hp {1,2, , p 1} u c nghch o duy
nht modulo p.

6. nh l.
Nu (a,m) = 1 th phng trnh ax b mod m c nghim duy nht theo modulo m.

Chng minh.
Ta c {1,2,,m} l mt h thng d y modulo m v (a,m) =1 nn {a,2a, ,ma} cng
l mt h thng d y modulo m c ng mt phn t ca h ny ng d vi b
mod m . Suy ra pcm.

6.1. nh l tn ti nghim phng trnh ng d tuyn tnh.
Gi s (a,m) = d. Khi phng trnh ax b mod m (1) c nghim khi v ch khi d| b
Hn na, khi d | b th (1) c d nghim phn bit modulo m, l
m m m
t, t , t 2 ,..., t (d 1)
d d d
+ + + (2)
trong t l nghim duy nht ca phng trnh
a b m
x mod
d d d
(3)

Chng minh.
Nu phng trnh c nghim l x
0
ax
0
= b + mt d| b
o li, nu d | b th phng trnh
a b m a m
x mod do ( , ) 1
d d d d d
= c nghim t duy nht
phng trnh ax b mod m cng c nghim t .
Mi nghim ca (3) l nghim ca (1) v ngc li.
D thy rng (2) l d nghim ca (3) nn (2) cng l d nghim ca (1). Ngoi ra hai nghim
ca (2) l phn bit theo modulo m. Tht vy nu
m m
t r t s mod m (1 r,s d 1)
d d
+ + s s

m m
r s mod m r s mod d
d d
r s d r = s
Tip tc, ta chng minh (1) khng cn nghim no khc ngoi (2).
4
Gi s y l nghim ca (1) ay b mod m ay at mod m y t mod m y t mod
m/d y = t + km/d . Ta c k r mod d vi 0 s r < d. Do
m m
k. r. mod m
d d
y t +
rm/d mod m y thuc (2).

6.2. V d. Gii phng trnh 12x 7 mod 23
Gii
Do (12,23) = 1 nn phng trnh lun c nghim duy nht.
Ta tm mt s nguyn k sao cho 7 + 23k chia ht cho 12. Chn k = 7
12x 7.24 mod 23 x 14 mod 23

6.3. Mnh .
Gi s p l s nguyn t. S nguyn a l nghch o modulo p ca chnh n khi v ch khi a
1 mod p hoc a 1 mod p

Chng minh.
Nu a 1 mod p hoc a 1 mod p th a
2
1 mod p nn a l nghch o modulo p ca
chnh n.
Ngc li, gi s a l nghch o modulo ca chnh n, tc l a
2
1 mod p a
2
1 p
a + 1 p hoc a 1 p hay a 1 mod p hoc a 1 mod p.

6.4. nh l Wilson.
Vi s nguyn t p, ta c (p 1)! 1 mod p

Chng minh.
Khi p = 2, ta c (p 1)! = 1 1 mod 2
Gi s p l s nguyn t ln hn 2, khi mi s nguyn a vi 1 s a s p 1 tn ti nghch
o a vi 1 s a s p 1 sao cho aa 1 mod p. Theo mnh trn ch c 2 s 1 v p 1 l
nghch o modulo p ca chnh n. Nh vy, ta c th nhm cc s 2, 3,, p 2 thnh (p
3)/2 cp m tch ca chng ng d 1 modulo p.
2.3. (p 3)(p 2) 1 mod p
(p 1)! 1(p 1) 1 mod p.

Mnh o ca nh l Wilson cng ng.
6.5. nh l.
Gi s p l s nguyn dng sao cho ( p 1)! 1 mod p th p l s nguyn t.

7. nh l ng d Trung Hoa.
Gi s m
1,
m
2
, , m
r
l cc s nguyn t cng nhau i mt. Khi h phng trnh
ng d tuyn tnh
x a
1
mod m
1

x a
2
mod m
2

.
x a
r
mod m
r

c nghim duy nht modulo m = m
1
m
2
m
r
.

8. V d. Gii h phng trnh x 2 mod 5, x 3 mod 7, x 5 mod 3
5
Gii
x 2 mod 5 x 17 mod 5
x 3 mod 7 x 17 mod 7
x 17 mod 35
x 5 mod 3 x 5 + 3.4 mod 3 x 17 mod 3
x 17 mod 105

Bi tp
1. Chng minh rng nu a l s nguyn chn th a
2
0 mod 4, nu a l s nguyn l th
a
2
1 mod 4
2. Chng minh rng nu a l th a
2
1 mod 8
3. Chng minh rng n
7
n 42 vi n nguyn dng
4. Chng minh rng nu a + b + c 30 th a
5
+ b
5
+ c
5
30 (a,b,c e Z)
5. Chng minh rng
n
3
5 7 12 + vi n nguyn dng
6. Gi s n l s t nhin khng chia ht cho 17. Chng minh rng hoc n
8
1 17
hoc n
8
+ 1 chia ht 17
7. Tm tt c cc s nguyn n sao cho n.2
n
+ 1 chia ht cho 3.
8. Vi s nguyn n no ta c 1
2
+ 2
2
+ + (n 1)
2
0 mod n
9. Tm d trong php chia
a.
19
34
23 :17 b.
2345
46 : 37 c.
54
237
239 :135 d.
1000000 10
2 : 3
10. Gii h
a. x 1 mod 2, x 2 mod 3, x 3 mod 5
b. x 2 mod 11, x 3 mod 12, x 4 mod 13, x 5 mod 17, x 6 mod 19
c. x 5 mod 6, x 3 mod 10, x 8 mod 15
11. Chng minh nh l o ca nh l Wilson
12. Chng minh rng nu p, q l cc s nguyn t khc nhau th
q 1 p 1
p q

+ 1 mod pq
13. Chng minh nu p nguyn t v a
p
b
p
mod p th a
p
b
p
mod p
2

14. Chng minh rng nu p l s nguyn t l th 1
2
.3
2
(p 4)
2
(p 2)
2
(1)
(p+1)/2
mod p
15. Chng minh rng nu p nguyn t th (p 2)! 1 p nhng nu p > 5 th (p 2)! 1
khng phi l mt ly tha ca p
16. Gi s hm s f: N* N* tha mn iu kin f(mf(n)) = n
2
f(m) m,n eN*
a. Chng minh rng f(2009) hoc l s nguyn t hoc l bnh phng ca mt
s nguyn t
b. Hy xy dng mt hm f tha mn iu kin trn.