các chuyên đề số học

Nguyn Vn Tho Chuyn S Hc - Phn I
1
Li ni u
S hc l mt phn rt quan trng trong chng trnh Ton ph thng. Trong hu
ht cc thi hc sinh gii th bi S hc thng xuyn xut hin v lun l mt thch
thc ln i vi hc sinh.
Hin nay, khng cn h chuyn cp Trung hc c s nn cc em hc sinh chuyn
Ton cng khng c hc nhiu v phn ny nn thng gp rt nhiu kh khn khi gii
cc bi ton . V vy, ti bin son ti liu ny nhm gii quyt phn no nhng kh
khn cho cc em hc sinh chuyn Ton.
Chuyn gm ba chng:
-Chng I. Cc bi ton chia ht
-Chng II. Cc bi ton ng d
-Chng III. Cc bi ton khc.
mi bi u c trnh by ba phn: H thng l thuyt; h thng cc v d v
cui cng l h thng cc bi tp t gii. Cc v d v bi tp lun c sp xp vi
kh tng dn - theo quan im ca tc gi.
Tuy nhin, do trnh c hn nn khng th trnh khi nhiu thiu st, rt mong
c cc thy c ng gp hon thin hn. Xin chn thnh cm n!

NGUYN VN THO

2
Chng I
CC BI TON V CHIA HT
I.1 Chia ht
I.1.1 L thuyt
I.1.1.1 nh ngha
Cho m v n l hai s nguyn , n 0. Ta ni rng m chia ht cho n (hay n chia ht
m) nu tn ti mt s nguyn k sao cho m = kn.
K hiu: m n, (c l m chia ht cho n) hay n | m, (c l n chia ht m).
I.1.1.2 Cc tnh cht c bn
Cho cc s nguyn x, y, z. Ta c:
a) x x, x 0.
b) Nu x y v x 0 th |x| |y|.
c) Nu x z, y z th ax + by z vi mi s nguyn a, b.
d) Nu x z v x y z th y z
e) Nu x y v y x th |x| = |y|.
f) Nu x y v y z th x z.
g) Nu x | y v y 0 th |
y
y
x
.
Chng minh
a) x = 1.x nn x x vi mi x 0.
b) Nu x y , x 0 th tn ti k Z sao cho x = ky, k 0
|x| = |k||y| |y| do |k| 1.
Cc phn cn li cng kh n gin, vic chng minh xin nhng li cho bn c.
I.1.2 Cc v d
V d 1. Cho n l mt s t nhin ln hn 1. Chng minh rng
a) 2
n
l tng ca hai s l lin tip.
b) 3
n
l tng ca ba s t nhin lin tip.
Li gii
a) Ta c 2
n
= (2
n-1
- 1) + (2
n-1
+1) suy ra pcm.
b) Ta c 3
n
= (3
n-1
- 1) + (3
n-1
) + (3
n-1
+ 1) suy ra pcm.
V d 2. Chng minh rng:
3
a) nu m n chia ht mp + nq th m n cng chia ht mq + np.
b) nu m n chia ht mp th m n cng chia ht np.
Li gii
Nhn xt: Hai biu thc (mp + nq) v (mq + np) l hai biu thc c hnh thc ging nh
i xng loi hai v vy khi xt cc biu thc loi ny thng ngi ta kim tra hiu
ca chng.
a) Ta c (mp + nq) (mq + np) = (m - n)(p - q) (m - n)
Nn nu (mp + nq) (m - n) th hin nhin (mq + np) (m - n).
b) Chng minh tng t.
V d 3. Chng minh rng nu a
3
+ b
3
+ c
3
chia ht cho 9 th mt trong ba s a, b, c
phi chia ht cho 3.
Li gii
Nhn xt: Vi nhng bi ton chng minh a chia ht cho mt s c th lun kh n
gin! Ta c th xt ht cc trng hp xy ra ca s d khi a chia cho s . ( Cng vic
chnh l xt v h thng d y - y l tp hu hn nn c th th trc tip)
Gi s khng c s no trong ba s a, b, c chia ht cho 3. Khi
a = 3m 1; b = 3n 1; c = 3p 1
Do a
3
+ b
3
+ c
3
= (3m 1)
3
+ (3n 1)
3
+ (3p 1)
3

=
9 3
9 1
9 3
9 1
A
a
a
A
+
khng th chia ht cho 9.

T suy ra pcm.

V d 4.
Chng minh rng nu a
2
+ b
2
chia ht cho 3 th c a v b u chia ht cho 3.
Li gii
TH1: c 1 s khng chia ht cho 3, gi s l a
Khi a = 3k 1; b = 3q suy ra a
2
+ b
2
= (3k 1)
2
+ (3q)
2

= 3(3k
2
2k + 3q
2
) + 1 khng chia ht cho 3.
TH2: c hai s khng chia ht cho 3.
Khi a = 3k 1; b = 3q 1 suy ra a
2
+ b
2
= 3A +2
Do c a v b phi chia ht cho 3.
V d 5. Chng minh rng vi mi s t nhin chn n v mi s t nhin l k th
4
S = 1
k
+ 2
k
+ + n
k
lun chia ht cho n + 1.
Li gii
Ta c 2S = (1
k
+ n
k
) + (2
k
+ (n - 1)
k
) + n + 1
M n chn nn n + 1 l nn (2, n+ 1) = 1
Do S n + 1.
V d 6. Cho p l s nguyn t, p > 3 v
3
1 2
2
=
p
n .Chng minh rng
n 2 2
n
.
Li gii
V p l s nguyn t v p>3 ) 3 (mod 1 2
1
p

Mt khc (2, p) = 1 nn theo nh l Fermat ta c
) (mod 1 2
1
p
p

Do p
p
3 1 2
1

Ta c

n. 2 2 n 1 2 n 1 2
3
1 2
n Vi
1 2 1 2 2p 1 - n ra suy
3
) 1 2 )( 1 2 ( 4
3
4 4
1
3
1 2
1
n 1 - n 2p
2p
2p 1 - n
1 1 2

=

+
=
=
p p p p
n

T suy ra iu phi chng minh.
V d 7. Cho x, y l hai s nguyn khc -1 sao cho

1
1
1
1
3 3
+
+
+
+
+
x
y
y
x
l mt s nguyn
Chng minh rng 1
2004
x chia ht cho y+1.
Li gii
Trc ht ta t
d
c
x b
a
y
x
=
+
+
=
+
+
1
1 y
;
1
1
3 3

vi a, b, c, d nguyn v b > 0, d > 0, (a,b) = 1, (c,d) = 1.
Ta c

bd
bc ad
d
c
b
a +
= + nguyn
Do
5
b d b ad b bc ad bd + + bc ad v (a,b)=1 (1)

Mt khc
(2) d a d ac bd ac
) 1 )( 1 (
1
1
.
1
1
.
2 2
3 3

+ + =
+
+
+
+
= Z y y x x
x
y
y
x
d
c
b
a

V (c,d)=1 nn t (1) v (2) suy ra
a b suy ra b = 1 v (a,b) = 1
V
(3) 1 y 1 x ) 1 ( 1 x
1
1
3 3
3
+ + + = + =
+
+
y a
b
a
y
x

M 1 x 1 - ) (x 1
3 664 3 2004
+ = x
Kt hp vi (3) suy ra iu phi chng minh.
V d 8. Cho n 5 l s t nhin .Chng minh rng

(

n
n )! 1 (
n-1 .
Li gii
a) Trng hp 1. n l s nguyn t
Theo nh l Winson (n-1)! -1(mod n) suy ra ((n-1)!+1 n
Ta c
1
1 )! 1 ( 1 1 )! 1 ( )! 1 (
+
=
(

+
=
(

n
n
n n
n
n
n
(v 1
1
0 < <
n
)
= 1) - (n
) 1 ( )! 1 (
n
n n
v (n, n - 1) = 1
b) Trng hp 2. n l hp s
+) n khng l bnh phng ca mt s nguyn t.
Khi n = rs vi 1< r < s < n.
Do (n,n-1)=1 suy ra s < n-1 (n-1)! = kn(n-1)
suy ra
) 1 ( ) 1 (
)! 1 (
=
(

n n k
n
n
.
+) n = p
2
vi p l mt s nguyn t.
6
Do p =
2
n, n 5 suy ra p 1 2 3 p 3
2
+ > p p
1 2
2
< p p hay 2p < n-1.
Nn 1 < p < 2p < n-1
Suy ra (n-1)! p.2p.(n-1) = 2n(n-1).
T o suy ra 1) - (n
)! 1 (

n
n
.
Vy ta c iu phi chng minh.
V d 9
Tn ti hay khng mt s nguyn x sao cho 2003 1
2
+ + x x ?
Li gii
Ta c 2003 l s nguyn t c dng 3k + 2.
Gi s tn ti x nguyn tha mn x
2
+ x + 1 2003
T suy ra tn ti { } 2002 ,...., 2 , 1 a tha mn + + a a
2
1 2003 ( )
Ta c
2003 ) 1 )( 1 ( 1
2 3
+ + = a a a a
) ( hay a a 2003 mod 1 2003 1
2001 2001

) a ( a 2003 mod
2002
(1)
Theo nh l Fermat ta c
2003) (mod 1
2002
a (2)
T (1) v (2) ta c 2003) (mod 1 a suy ra a = 1 (v l)
Vy khng tn ti x nguyn sao tha mn u bi.
V d 10. (30 - 4 - 2006) Chng minh rng vi mi m, tng ti mt s nguyn n sao cho
n
3
- 11n
2
- 87n + m
Chia ht cho 191.
Li gii
t P(x) = x
3
- 11x
2
- 87x + m.
Ta chng, tn ti a, b nguyn P(x) (x +a)
3
+ b (mod 191)
x
3
+ 3ax
2
+ 3a
2
x + a
3
+ b x
3
- 11x
2
- 87x + m (mod 191)
Chn a nguyn sao cho 3a -11 (mod 191)
3a 180 (mod 191)
a 60 (mod 191), do (3, 191) = 1,
7
3a
2
3.60
2
(mod 191) -87 (mod 191)
Vy vi mi m, ch cn chon b m - a
3
(mod 191)
l c P(x) (x + a)
3
+ b (mod 191).
Ta c, vi mi i, j nguyn th P(i) P(j) (mod 191)
(i + a)
3
(j + a)
3
(mod 191)
(i + a)
3.63
(j + a)
2
(j + a)
3.63 + 2
(mod 191)
(j + a) (mod 191)
(j + a)
2
(i + a)
189
(j + a)
3
(mod 191)
(i + a)
192
(mod 191)
(i + a)
2
(mod 191)
(i + a)
3.63
(j + a)
2
(i + a)
189
.(i + a)
2
(mod 191)
i + a (mod 191)
T suy ra
P(i) P(j) (mod 191) i = j (mod 191)
T suy ra tp {P(1), P(2), ..., P(191)} c 191 s d khc nhau khi chia cho 191
Do phi tn ti mt s nguyn n {1, 2, ..., n} sao cho P(n) 191

8
I.1.3 Bi tp
Bi 1. Chng minh rng vi mi s nguyn m, n ta c:
1) n
3
+ 11n 6
2) mn(m
2
n
2
) 3
3) n(n + 1)(2n + 1) 6.
4) n
3
+ (n + 1)
3
+ (n + 2)
3
9.
5) n
2
(n
2
- 12) 12
6) mn(m
4
n
4
) 30
7) n
5
n 30
8) n
4
+ 6n
3
+ 11n
2
+ 6n 24
9) n
4
4n
3
4n
2
+ 16n 384 ( n chn v n > 4)
10) n
2
+ 4n + 3 8
11) n
3
+ 3n
2
n 3 48
12) n
12
n
8
n
4
+ 1 512
13) n
8
n
6
n
4
+ n
2
1152.
14) n
3
4n 48 ( n chn)
15) n
2
3n + 5 khng chia ht cho 121.
16) (n + 1)(n + 2)(2n) 2n
17) n
6
n
4
n
2
+ 1 128 ( n l)
Bi 2. Chng minh rng tch ca n s nguyn lien tip lun chia ht cho n!
Bi 3. Cho p l s nguyn t l. Chng minh rng vi mi k N, ta lun c
S = 1
2k + 1
+ 2
2k + 1
+ + (p - 1)
2k + 1
chia ht cho p.
Bi 4. Chng minh rng nu a
3
+ b
3
+ c
3
chia ht cho 9 th mt trong ba s a, b, c phi
chia ht cho 9.
Bi 5. Cho a, b nguyn. Chng minh rng nu a
n
b
n
th a b.
Bi 6. Tm s nguyn dng n sao cho n chia ht cho mi s nguyn dng khng vt
qu n .
Bi 7. Chng minh rng a
2
+ b
2
+ c
2
khng th ng d vi 7 modulo 8.
Bi 8. Tng n s nguyn lin tip c chia ht cho n hay khng? ti sao?
Bi 9. Chng minh rng khng tn ti cp s nguyn (x, y) no tha mn mt trong
nhng ng thc sau:
a) x
2
+1 = 3y
9
b) x
2
+ 2 = 5y.
Bi 10. Chng minh rng vi n 1 th
(n + 1)(n + 2) ... (n + n)
chia ht cho 2
n
.
Bi 11. Tm ch s tn cng ca s Fermat F
n
= 1 2
2
+
n
, n 2.
Bi 12. Tm cc s nguyn dng p, q, r sao cho
pqr - 1 (p - 1)(q - 1)(r - 1).
Bi 13. Chng minh rng tn ti mt s t nhin c 1997 ch s gm ton ch s 1 v 2
sao cho s chia ht cho 2
1997
.
Bi 14. Cho a l mt s nguyn dng v a > 2. Chng minh rng tn ti v s s
nguyn dng n tha mn
a
n
- 1 n.
Bi 15. Chng minh rng tn ti v s s nguyn dng n sao cho
2
n
+ 1 n.
Bi 16. Chng minh rng trong 12 s nguyn t phn bit bt k lun chon ra c 6 s
a
1
, a
2
, ..., a
6
sao cho
(a
1
- a
2
)(a
3
- a
4
)(a
5
+ a
6
) 1800.
Bi 17. Cho a, b, c, d nguyn bt k. Chng minh rng
(a - b)(a - c)(a - d)(b - c)(b - d)(c - d) 12.
Bi 18. Tm s t nhin n sao cho 2
n
- 1 chia ht cho 7. Chng minh rng vi mi s t
nhin n th 2
n
+ 1 khng th chia ht cho 7.
Bi 19. Tm s t nhin n sao cho n
5
- n chia ht cho 120.
Bai 20. Tm tt c cc cp s nguyn x > 1, y > 1 sao cho
+
+
. 1 3
1 3
x y
y x

Bi 21. Cho x
1
, x
2
l hai nghim ca phng trnh x
2
- mx + 1 = 0 vi m l s nguyn ln
hn 3. Chng minh rng vi mi s nguyn dng n th S
n
=
n n
x x
2 1
+ l mt s nguyn v
khng chia ht cho m - 1.
Bi 22. Tm tt c cc cp s nguyn dng a, b sao cho
2
2
2
+
ab
a

l mt s nguyn.
Bi 23. (30.4.2003) Tm ba s nguyn dng i mt phn bit sao cho tch ca hai s
bt k u chia ht cho s th 3.
10
B i 24. Chng minh rng vi mi s t nhin n th gia n
2
v (n + 1)
2
lun tn ti ba s
t nhin phn bit a, b, c sao cho a
2
+ b
2
c
2
.
Bi 25. Cho s t nhin A
n
= 19981998...1998 (gm n s 1998 vit lin nhau)
a) Chng minh rng tn ti s nguyn dng n < 1998 sao cho A
n
1999.
b) Gi k l s nguyn dng nh nht sao cho A
k
1999. Chng minh rng
1998 2k.
Bi 26. Cho hai s nguyn dng m v n sao cho n + 2 m. Hy tnh s cc b ba s
nguyn dng (x, y, z) sao cho x + y + z m trong mi s x, y, z u khng ln hn n.
Bi 27. (APMO 98) Tm s nguyn dng n ln nht sao cho n chia ht cho mi s
nguyn dng nh hn
3
n .
Bi 28. Tm tt c cc s nguyn dng m, n sao cho n
3
+ 1 chia ht cho mn - 1.
1
2
2
+
ab
b a

l mt s nguyn.
Bi 30. Tm tt c cc cp s nguyn dng sao cho
7
2
2
+ +
+ +
b ab
b a b a

l mt s nguyn.
Bi 31. Cho n l s nguyn dng ln hn 1. p l mt c nguyn t ca s Fermat F
n
.
Chng minh rng p - 1 chia ht cho 2
n+2
.
Bi 32. Cho x, y , p l cc s nguyn v p > 1 sao cho x
2002
v y
2002
u chia ht cho p.
Chng minh rng 1 + x + y khng chia ht cho p.
Bi 33. (USA - 98) Chng minh rng vi mi s nguyn dng n 2, tn ti mt tp hp
n s nguyn sao cho vi hai s a, b bt k (a b) thuc tp th (a - b)
2
chia ht ab.
Bi 34. Gi s tp S = {1, 2, 3, ..., 1998} c phn thnh cc cp ri nhau
{a
i
, b
i
| 1 i 1998} sao cho |a
i
- b
i
| bng 1 hoc bng 6. Chng minh rng
=

999
1
| |
i
i i
b a = 10k + 9.
2
2
2
+
ab
a

l mt s nguyn.
Bi 36. Chng minh rng vi mi n N
*
lun tn ti s t nhin a sao cho
11
64a
2
+ 21a + 7 2
n
.
Bi 37. (Nga - 1999) Cho tp A l tp con ca tp cc s t nhin n sao cho trong 1999 s
t nhin lin tip bt k lun c t nht mt s thuc A.
Chng minh rng tn ti hai s m, n thuc A sao cho m n.
Bi 38. Tm x, y, z nguyn dng v x < y < z sao cho
2
x
+ 2
y
+ 2
z
= 2336.
Bi 39. Cho x, y, z l cc s nguyn dng tha mn
(x - y)(y - z)(z - x) = x + y + z.
Chng minh rng x + y + z chia ht cho 27.
Bi 40. Cho m, n l cc s nguyn dng sao cho
4
2
n
m v mi c s nguyn t ca m
u nh hn hoc bng n. Chng minh rng
n! m.
b a
a b
a b
b a
+
2
2
2
2
;
l cc s nguyn.
Bi 42. Cho x, y l hai s nguyn dng sao cho x
2
+ y
2
+ 1 chia ht cho xy.
Chng minh rng
. 3
1
2 2
=
+ +
xy
y x

Bi 43. Cho hm s f(x) = x
3
+ 17. Chng minh rng mi s nguyn dng n lun tn ti
mt s nguyn dng x sao cho f(x) chia ht cho 3
n
nhng khng chia ht cho 3
n + 1
.
Bi 44. Cho p l s nguyn t ln hn 2 v p - 2 chia ht cho 3. Chng minh rng trong
tp hp cc s c dng x
3
- y
2
+ 1, vi x, y l cc s nguyn khng m nh hn p c nhiu
nht p - 1 s chia ht cho p.
Bi 45. Chng minh rng vi mi n nguyn dng lun tn ti mt s t nhin c n ch
s chia ht cho 2
n
v s ny ch gm cc ch s 1 v 2.
Bi 46. Cho s nguyn dng n > 1, tha mn 3
n
- 1 chia ht cho n. Chng minh rng n
l s chn.

12
I.2 c s chung ln nht - Bi s chung nh nht
I.2.1. L thuyt
I.2.1.1. c s chung ln nht
I.2.1.1.1 nh ngha 1
Cho a, b l hai s nguyn. S nguyn dng d ln nht chia ht c a v b c gi
l c chung ln nht ca a v b.
K hiu: d = (a, b) hoc d = gcd(a, b)
Nu d = 1 th ta ni a v b l hai s nguyn t cng nhau.
I.2.1.1.2. Cc tnh cht ca c chung ln nht
a) Nu p l mt s nguyn t th (p,m) = p hoc (p, m) = 1.
b) Nu (a, b) = d th a = dm, b = dn v (m, n) = 1.
c) Nu (a, b) = d, a = dm, b = dn v (m, n) = 1 th d = d.
d) Nu m l mt c chung ca a v b th m | (a,b).
e) Nu p
x
|| m v p
y
|| n th p
min(x,y)
|| (m, n).
f) Nu a = bq + r th (a, b) = (r, b).
g) Nu c | ab v (a,c) = 1 th c | b.
h) Nu (a, c) = 1 th (ab, c) = (b, c).

I.2.1.2 Bi s chung nh nht.
I.2.1.2.1 nh ngha.
Cho a, b l hai s nguyn. S nguyn dng nh nht chia ht cho c a v b c
gi l bi s chung nh nht ca a v b.
K hiu: [a,b] hay lcm(a,b).

I.2.1.2.2. Cc tnh cht ca bi chung nh nht.
a) Nu [a, b] = m v m = a.a = b.b th (a, b) = 1.
b) Nu m = a.a = b.b v (a, b) = 1 th [a, b] = m.
c) Nu m = [a, b] v m l mt bi chung ca a v b th m | m.
d) Nu a | m v b | m th [a, b] | m.
e) Cho n l mt s nguyn dng, ta lun c n[a, b] = [na, nb].
f) Nu a =
1 2 1 2
1 2 1 2
. ... ; . ...
k k
n m n n m m
k k
p p p b p p p =
13
Th [a, b] =
min( , )
1
i i
k
n m
i
i
p
=
.
I.2.1.3 nh l Bzout
Phng trnh mx + ny = (m,n) lun c v s nghim nguyn.
Nhn xt: Phng trnh ax + by = c c nghim nguyn khi v ch khi c l
bi ca (a, b).
Phng trnh ax + by = 1 c nghim nguyn khi v ch khi
(a, b) = 1.
I.2.1.4 Mi quan h gia c s chung ln nht v bi s chung
nh nht
Cho a v b l cc s nguyn khc 0, ta c
[a,b]
( , )
ab
a b
=
I.2.2 Cc v d
V d 1. Chng minh rng vi mi s nguyn a, b ta lun c
(3a + 5b, 8a + 13b) = (a, b).
Li gii
Ta c (3a + 5b, 8a + 13b) = (3a + 5b, 8a + 13b 2(3a + 5b))
= (3a + 5b, 2a + 3b) = (a + 2b, 2a + 3b)
= (a + 2b, b) = (a, b).
pcm.
V d 2. Nu (a, b) = d th (a +b, a - b) c th nhn nhng gi tr no?
Li gii
Ta c m = (a + b, a - b) = (a + b, 2a) = (a + b, 2b).
Do m l c chung ca 2a v 2b v a + b.
Nu a + b l th (a + b, a - b) = d
Nu a + b chn th (a + b, a - b) = 2d.
V d 3. Chng minh rng phn s sau ti gin
21 4
14 3
n
n
+
+

Li gii
Ta c (21n + 4, 14n + 3) = (7n + 1, 14n + 3)
14
= (7n + 1, 14n + 3 2(7n + 1))
= (7n +1, 1) = 1
V d 4. Cho a, b l cc s nguyn dng phn bit sao cho ab(a + b) chia ht cho a
2
+
ab + b
2
. Chng minh rng
3
| | a b ab >
Li gi
t g = (a, b) a = xg v b = yg vi (x, y) = 1.
Khi
2 2 2 2
( ) ( ) ab a b gxy x y
a ab b x xy y
+ +
=
+ + + +

l mt s nguyn.
Ta c (x
2
+ xy + y
2
, x) = (y
2
, x) = 1
(x
2
+ xy + y
2
, y) = 1.
V (x + y, y) = 1 nn ta c
(x
2
+ xy + y
2
, x + y) = (y
2
, x + y) = 1
Do x
2
+ xy + y
2
| g
Suy ra g x
2
+ xy + y
2

Mt khc |a - b|
3
= g
3
|x - y|
3

= g
2
|x - y|
3
g
g
2
.1. (x
2
+ xy + y
2
) = ab.
T ta c iu phi chng minh.
V d 5. Cho n l mt s nguyn dng, d = (2n + 3, n + 7).
Tm gi tr ln nht ca d.
Li gii
Ta c
(2n + 3, n + 7) = (2(n + 7) 2n -3, n + 7)
= (11, n + 7) 11.
Mt khc khi n = 11k + 4 th n + 7 = 11(k + 1)
(11, n + 4) = 11.
Do gi tr ln nht ca d l 11.

15
V d 6. (India 1998) Tm tt c cc b (x, y, n) nguyn dng sao cho
(x, n+1) = 1 (1)
v x
n
+ 1 = y
n+1
. (2)
Li gii
T (2) ta c
x
n
= y
n+1
1
= (y - 1)(y
n
+ y
n-1
+ + 1) (*)
t m = y
n
+ y
n-1
+ + 1
Suy ra x
n
m
M (x, n+1) = 1 nn ta phi c (m, n +1) = 1
Ta li c
m = y
n
y
n-1
+ 2(y
n-1
y
n-2
) + + n(y - 1) +n + 1
= (y 1)(y
n-1
+ 2y
n-2
+ + n) + n + 1
n + 1 (m, y - 1)
M (m, n + 1) = 1 (m, y - 1) = 1 (**)
T (*) v (**) suy ra m phi l lu tha n ca mt s nguyn dng.
Tc l m = q
n
vi q l mt s nguyn dng no
V y > 0 nn ta c y
n
< y
n
+ y
n-1
+ + 1 < y
n
+
1 1
...
n n
n n
C y C
+ + vi mi n > 1
hay y
n
< q
n
< (y + 1)
n
vi mi n > 1 (v l)
Vy n = 1 x = y
2
1
V (x, n +1) = (x, 2) = 1 nn x = 2k + 1 y chn
Do (x, y, n ) = (4a
2
- 1, 2a, 1) vi a nguyn dng.
V d 7. Chng minh rng nu mt s nguyn dng c s c s l l th phi l s
chnh phng.
Li gii
Gi n l s t nhin nh vy.
Nhn thy, nu d l mt c s ca n th
n
d
cng l mt c s ca n.
Do vy nu vi mi d m d
n
d
th s c ca n phi l chn.
Nn tn ti d l c ca n sao cho d =
n
d
n = d
2
(pcm).
16
V d 8. (APMO - 1999) Tm s nguyn dng n ln nht sao cho n chia ht cho mi s
t nhin nh hn
3
n .
Li gii
Cu tr li l 420.
Tht vy, ta c
[1, 2, 3, 4, 5, 6, 7] = 420. 7 < . 8 420
3
<
Gi s n > 420 v tha mn iu kin u bi 7
3
> n n 420.
Do n 2.420 = 480 9
3
n .
Ta c
[1, 2, ..., 9] = 2520 n 2520 13
3
> n .
Gi m l s nguyn dng ln nht nh hn
3
n n 13 v m
3
< n (m +1)
3
.
Do n [1, 2, ..., m] n [m - 3, m - 2, m - 1, m]
Mt khc
6
) 3 )( 2 )( 1 (
] , 1 , 2 , 3 [

m m m m
m m m m
nn
3
) 1 (
6
) 3 )( 2 )( 1 (
+

m n
m m m m

suy ra
) 3 )( 2 )( 1 (
) 1 ( 6
3

+
m m m
m
m
)
3
4
1 )(
2
3
1 )(
1
2
1 ( 6
+
m m m
m
)
3
4
1 )(
2
3
1 )(
1
2
1 ( 6 ) (
+ =
m m m
m m f 0
M rng tp xc nh ca m trn tp s thc ta d dng chng minh c f(m) l hm s
ng bin trn tp [13; +)
Do vi mi m 13 th f(m) f(13) > 0 (v li)
nn iu gi s l sai.T suy ra iu phi chng minh.

17
I.2.3 Bi tp

Bi 1. Cho m, n l hai s nguyn dng phn bit v (m, n) = d.
Tnh (2006
m
+ 1, 2006
n
+ 1).
Bi 2. Chng minh rng nu cc s a, b, c i mt nguyn t cng nhau th
(ab + bc + ca, abc) = 1.
Bi 3. Tm
a) (21n + 4, 14n + 3)
b) (m
3
+ 2m, m
4
+ 3m
2
+ 1)
c) [2
n
- 1, 2
n
+ 1].
Bi 4. Chng minh rng (2
p
- 1, 2
q
- 1) = 2
(p, q)
- 1.
Bi 5. Cho a, m, n l cc s nguyn dng, a > 1 v (m, n) = 1. Chng minh rng
(a - 1)(a
mn
- 1) (a
m
- 1)(a
n
- 1).
Bi 6. Chng minh rng
[1, 2, ..., 2n] = (n +1, n + 2, ..., 2n)
Bi 6. Chng minh rng vi mi s nguyn dng m >n ta c
| | | |
n m
mn
n m n m
> + + +
2
1 , 1 , .
Bi 7. Chng minh rng dy 1, 11, 111, ... cha v hn cp (x
n
, x
m
) nguyn t cng nhau.
Bi 8. Cho n l mt s nguyn dng, a v b nguyn dng v nguyn t cng nhau.
Chng minh rng ) , ( b a
b a
b a
n n
bng 1 hoc n.
Bi 9. Cho m, n l cc s nguyn dng, a l mt s nguyn dng ln hn 1.
Chng minh rng
. 1 ) 1 , 1 (
) , (
=
n m n m
a a a
Bi 10. (Hn Quc 1998) Tm tt c cc s nguyn dng l, m, n i mt nguyn t cng
nhau sao cho
)
1 1 1
)( (
n m l
n m l + + + +
l mt s nguyn.
Bi 11. (Canada - 97)Tm s cc cp s nguyn a, b (a
b) tho mn
18
| |
=
=
! 50 ,
! 5 ) , (
b a
b a

Bi 12. (Hungari - 1998) Tm n nguyn dng sao cho tn ti cc cp s nguyn a, b tha
mn
(a, b) = 1998 v [a, b] = n!
Bi 13. (Nga - 2000) Cho 100 s nguyn dng nguyn t cng nhau xp trn mt vng
trn. Xt php bin i nh sau: Vi mi s nguyn trn vng trn ta c th cng thm
c chung ln nht ca hai s k bn n. Chng minh rng sau mt s hu hn php bin
i , ta c th thu c cc s mi i mt nguyn t cng nhau.
Bi 14. (Hungari - 1997) Cho tp A gm 1997 s nguyn phn bit sao cho bt k 10 s
no trong A cng c bi chung nh nht nh nhau. Tm s ln nht cc s i mt nguyn
t cng nhau c th c trong A.
Bi 15. Cho s v t l cc s nguyn dng khc 0. Vi cp (x, y) bt k, gi T l php bin
i (x, y) thnh cp (x - t, y - s). Cp (x, y) c gi l Tt nu sau hu hn php bin
i T ta thu c cp mi nguyn t cng nhau.
a) Tm (s, t) sao cho (s, t) l mt cp Tt
b) Chng minh rng vi mi s, t th lun tn ti cp (x, y) khng Tt.
Bi 16. Tn ti hay khng cc cp s nguyn dng a, b sao cho
(30a + b)(30b + a) = 4
2001
?

19
I.3. S nguyn T
I.3.1. L thuyt
I.3.1.1 nh ngha
Mt s nguyn dng p c gi l s nguyn t, nu n ch c hai c s dng
l 1 v chnh n.
Nu p khng phi s nguyn t th p c gi l hp s.
Nhn xt: 2 l s nguyn t chn duy nht.
I.3.1.2 nh l 1 ( nh l c bn ca s hc)
Mi s t nhin ln hn 1 u c th phn tch mt cch duy nht thnh tch cc
tha s nguyn t.
I.3.1.3. nh l 2
Tp hp cc s nguyn t l v hn.
I.3.1.3. nh l 3
Cho p l mt s nguyn t. Nu p | ab th p | a hoc p | b.
(Vic chng minh cc nh l trn kh n gin v ta c th tm c trong bt k mt
quyn sch s hc no, v vy s khng c trnh by ti y)

20
I.3.2 Cc v d

V d 1. Tm tt c cc s nguyn dng n sao cho cc s 3n 4, 4n 5, 5n 3 u l cc
s nguyn t.
Li gii
Ta c (3n - 4) + (5n - 3) = 8n 7 l s l
Do trong hai s trn phi c mt s chn v mt s l.
Nu 3n 4 chn th 3n 4 = 2 n = 2 4n 5 = 3 v 5n 3 = 7 u l cc s nguyn
t.
Nu 5n 4 chn th 5n 3 = 2 n = 1 3n 4 = -1 (loi)
Vy n = 2.
V d 2. Tm s nguyn t p sao cho 8p
2
+ 1 v 8p
2
1 cng l nhng s nguyn t.
Li gii
Nu p = 2 th 8p
2
+ 1 = 33 3 nn khng tha mn.
Nu p = 3 th 8p
2
+ 1 = 73 v 8p
2
1 = 71 u l s nguyn t nn p = 3 tha mn
Nu p > 3 v p nguyn t nn p khng chia ht cho 3.
Do p = 3k + 1 hoc p = 3k 1
+) p = 3k + 1 8p
2
+ 1 = 8(3k + 1)
2
+ 1
= 72k
2
+ 48k + 9 3
V hin nhin 8p
2
+ 1 > 3 nn 8p
2
+ 1 l hp s.
+) p = 3k 1 8p
2
+ 1 3 v 8p
2
1 > 3 nn khng tha mn.
Vy p = 3.
V d 3. Cho p 5 tha mn p v 2p + 1l s nguyn t. Chng minh rng 4p + 1 l hp
s.
Li gii.
+) p = 3k + 2 4p + 1 = 4(3k + 2) + 1 = 12k + 9 53 4p + 1 l hp s.
+ p = 3k + 1 2p + 1 = 2(3k + 1) + 1 = 6k + 3 3 (v l v 2p + 1 l s nguyn t ln hn
11.)
V d 4. Tm s nguyn t p sao cho 2p + 1 l lp phng ca mt s t nhin.
Li gii
Ta c 2p + 1 = n
3
2p = n
3
1 = (n - 1)(n
2
+ n + 1) (*)
Do vi mi s t nhin n th n
2
+ n + 1 > n 1 v mi s nguyn t p th p 2
21
Nn t (*) ta c
2
1 2
1
n
n n p
=
+ + =

T tm c p = 13.
V d 5. Chng minh rng vi mi s nguyn dng a > 2, tn ti v s s nguyn dng
n sao cho: a
n
1 n.
Li gii
Xt dy s x
0
= 1, x
n+1
= 1
n
x
a
Ta s chng minh vi mi k N th 1
k
x
a k (*)
+) n = 0, hin nhin (*)ng.
+) Gi s (*)ng ti n k, ta c

1
( 1)
1
1 . 1 1 1
( ) 1 1
x
k
k x k
k k
x x mx a
k
x x m
k
a m x a a a
a a x
+

+
= = =
= =

T suy ra (*)c chng minh.
Do a > 2 nn (x
n
) l dy s tng suy ra (x
n
) l dy s v hn.
pcm.
V d 6. Cho p, q l hai s nguyn t phn bit. Chng minh rng
1 1
1
q p
p q pq

+ .
Li gii
Do p v q l hai s nguyn t phn bit nn (p, q) = 1
Theo nh l Fermat nh ta c p
q 1
1 q p
q-1
+ q
p-1
1 q.
Tng t ta cng c p
q-1
+ q
p-1
1 q
Do ta c iu phi chng minh.
V d 7. Bit rng 2
n
1 l mt s nguyn t. Chng minh rng n l s nguyn t.
Li gii
Do 2
n
1 l s nguyn t nn n > 1.
Gii s n l hp s
Khi n = pq trong p v q u ln hn 1 2
n
1 = 2
pq
1 2
p
1 v 2
q
1
M 2
p
1 v 2
q
1 u ln hn 1 nn 2
n
1 khng phi s nguyn t (mu thun)
V d 8. Chng minh rng a
n
+ 1 (a v n nguyn dng) l s nguyn t th n =2
k
.
Li gii
22
Gi s n 2
k
th n = 2
m
.q trong q l mt s nguyn dng l .
Khi a
n
+ 1 =
2 2 2 2 ( 1)
1 ( ) 1 ( 1)( ... 1)
m m m m
q q q
a a a a

+ = + = + + +
Suy ra a
n
+ 1 khng th l s nguyn t (Mu thun)
V d 9. Tm tt c cc s nguyn t p v q sao cho p + q = (p - q)
3
.
Li gii
V (p - q)
3
= p + q 0 nn p v q phn bit v (p, q) = 1.
Mt khc ta li c p q 2p (mod p + q)
Suy ra 8p
3
chia ht cho p + q
Li c 1 = (p, q) = (p + q, p) do p
3
v p + q cng nguyn t cng nhau
Nn 8 p+q
2
4
8
, 8.
p q
p q
p q
p q
+ =
+ =
+ =
<

Th trc tip c p = 5, q = 3.
V d 10. (Baltic 2001). Cho a l s nguyn dng l, m v n l hai s nguyn dng
phn bit. Chng minh rng:
2 2 2 2
( 2 , 2 ) 1
n n m m
a a + + = .
Li gii
Gi s m > n > 0.
Gi p l mt c nguyn t ca
2 2 2 2
2 2 (mod )
n n n n
a a p + (*)
Bnh phng hai v ca (*) m n ln ta c:
2 2
2 (mod )
m m
a p
Do
2 2 2
2 2.2 (mod )
m m m
a p + nn p khng th l c ca
2 2
2
m m
a + .
V d 11. (Nga - 2001) Tm s nguyn dng l n > 1 sao cho a v b l hai c nguyn
t cng nhau bt k ca n th a + b 1 cng l c ca n.
Li gii
TH1: n = p
k
trong p l mt s nguyn t th n tha mn yu cu.
TH2: n khng l lu tha ca mt s nguyn t.
Gi p l mt c nguyn t nh nht ca n. Khi n = p
k
.s v (p,s) = 1.
p + s 1 | n
23
Gi q l mt c nguyn t ca s th q > p.
D thy s < s + p 1 < s + q s + p 1 khng th chia ht cho q
T suy ra (s, s + p - 1) = 1. Do s + p 1 ch c c nguyn t l p
s + p 1 = p
c
s = p
c
p + 1
Do p
c
| n v (p
c
, s) = 1 nn p
c
+ s 1 l c ca n
2p
c
p | n
V (2.p
c
1, p) = 1 nn 2p
c
1 l c ca s.
Mt khc ta d dng chng minh c
1 1 1
2 2 1 2
c
c
p p p p
p
+ +
< <

Hay
1 1
2 2 1 2
c
p s p
p
+
< <
=
1
1
2
p
+
Suy ra s khng th chia ht cho 2p
c
1.
(mu thun vi gi thit)
Vy n = p
k
vi p l s nguyn t.

24
I.3.3 Bi tp

Bi 1. Cho a N
*
. Chng minh rng nu a
m
+ 1 l s nguyn t th m = 2
n
. iu ngc
li c ng khng?
Bi 2. Gi s phng trnh x
2
+ ax + b + 1 = 0 (a, b
Z) c nghim nguyn. Chng minh

rng a
2
+ b
2
l hp s.
Bi 3. Cho a, b, c l cc s nguyn khc 0 v a c tha mn
2 2
2 2
b c
b a
c
a
+
+
=
Chng minh rng a
2
+ b
2
+ c
2
khng phi l s nguyn t.
Bi 4. Tm n sao cho n
4
+ 4
n
l mt s nguyn t.
Bi 5. Cho p l s nguyn t. Chng minh rng s

p p
p
9 ... 99 ... 2 ... 22 1 ... 11 - 123456789
chia ht cho p.
Bi 6. Tm s t nhin n sao cho
A = n
2005
+ n
2006
+ n
2
+ n + 2
l mt s nguyn t.
Bi 7. Tm n nguyn dng mi s sau y l s nguyn t:
a) n
4
+ 4
b) n
4
+ n
2
+1.
Bi 8. Chng minh rng nu p l mt s nguyn t ln hn 3 th
p
2
- 1 24.
Bi 9. Cho 2
m
- 1 l mt s nguyn t. Chng minh rng m l mt s nguyn t.
Bi 10. Tm s nguyn t p sao cho 2p + 1 = a
3
, vi a nguyn dng.
Bi 11. Tm s nguyn t p sao cho p + 4 v p + 8 cng l s nguyn t.
Bi 12. Tm s nguyn t p sao cho 8p
2
+ 1 v 8p
2
- 1 l nhng s nguyn t.
Bi 13. Cho p l mt s nguyn t v p = 30k + r. Chng minh rng
r = 1 hoc r l mt s nguyn t.
Bi 14. Cho a
N*
, a > 1. Chng minh rng a
n
+ 1 l mt s nguyn t th n = 2
k
.
Bi 15. (Iran 1998) Cho a, b, x l cc s nguyn dng tham mn
x
a + b
= a
b
b.
Chng minh rng x = a v b = x
x
.
25
Bi 16. Chng minh rng tn ti mt dy v hn {p
n
} cc s nguyn t phn bit sao cho
p
n
1 (mod 1999
n
) vi mi n = 1, 2, ...
Bi 17. Tm tt c cc s nguyn t p sao cho
f (p) = (2 + 3) - (2
2
+ 3
2
) + ... - (2
p-1
+ 3
p - 1
) + (2
p
+ 3
p
) chia ht cho 5.
Bi 18. (Trung Quc 2001) Cho cc s nguyn dng a, b, c sao cho a, b, c, a + b - c,
c + a - b, b + c - a v a + b + c l by s nguyn t phn bit. d l s cc s nguyn phn
bit nm gia s b nht v ln nht trong by s . Gi s rng s 800 l mt phn t
ca tp {a + b, b + c, c + a}. Tm gi tr ln nht ca d.
Bi 19. Chng minh rng vi mi s nguyn a th lun tn ti mt dy v hn {a
k
} sao
cho dy {a
k
+ a} cha hu hn s nguyn t.
Bi 20. Chng minh rng mi s t nhin u biu din c di dng hiu ca hai s
t nhin c cng s c nguyn t.
Bi 21. Cho p l s nguyn t l v a
1
, a
2
, ..., a
p - 2
l dy cc s nguyn dng sao cho p
khng l c ca a
k
v a
k
k
- 1 vi mi k = 1, 2, ..., p - 2.
Chng minh rng tn ti mt s phn t trong dy trn c tich khi chia cho p d 2.
Bi 22. Chng minh rng nu c s nguyn t nh nht p ca s nguyn dng n khng
vt qu
3
n th
p
n
l s nguyn t.
Bi 23. (Balan 2000) Cho dy cc s nguyn t p
1
, p
2
, ... tha mn tnh cht: p
n
l c
nguyn t ln nht ca p
n - 1
+ p
n - 2
+ 2000. Chng minh rng dy s trn b chn.
Bi 24. Cho a
1
, a
2
, ..., a
n
l cc s t nhin i mt khc nhau v c c nguyn t khng
ln hn 3. Chng minh rng
. 3
1
...
1 1
2 1
< + + +
n
a a a

Bi 25. Gi A l tp cc s nguyn t p sao cho phng trn
x
2
+ x + 1 = py
c nghim nguyn x, y. Chng minh rng A l tp v hn.
Bi 26. Chng minh rng tn ti v s s k nguyn dng sao cho p
2
+ k l hp s vi
mi s nguyn t p.
Bi 27. Cho n l s nguyn dng sao cho n
2
+ n + 1 phn tch c thnh tch ca 4 s
nguyn t. Chng minh rng n 67.
Bi 28. Chng minh rng khng th phn tch bt k s nguyn t no thnh tng bnh
phng ca hai s t nhin theo hai cch khc nhau.
Bi 29. Tm ba s nguyn t p, q, r sao cho p
2
+ q
2
+ r
2
cng l s nguyn t.
Bi 30. Tm cc s nguyn t p sao cho 2
11p - 2
chia ht cho 11p.

26
Chng II
CC BI TON V NG D

II.1. nh ngha v cc tnh cht c bn ca ng d
II.1.1. L thuyt
II.1.1.1 nh ngha
Cho ba s nguyn a, b, m (m 0). Ta ni a ng d vi b theo modulo n nu a b
chia ht cho m.
K hiu: a b (mod m).
II.1.1.2 Cc tnh cht
a) a b (mod m) a b m
b) Nu a
i
b
i
(mod m) vi mi i = 1, 2, , n th
1 1
n n
i i
i i
a b
= =

(mod m).
c) Nu a b (mod m) v c d (mod m)
th a c b d (mod m).
d) a b (mod m) v b c (mod m) a c (mod m).
e) Nu a
i
b
i
(mod m) vi mi i = 1, 2, , n th
1 1
n n
i i
i i
a b
=

(mod m)
f) Nu a b (mod m) th a
n
b
n
(mod m).
g) Cho P(x) l a thc tu vi h s nguyn
nu a b (mod m) th P(a) P(b) (mod m)
Chng minh
a) Hin nhin
b) Do a
i
b
i
(mod m) nn ta c a
i
b
i
m
M
1 1 1
( )
n n n
i i i i
i i i
a b a b
= = =
=

m
T suy ra pcm.
c) Do a b (mod m) v c d (mod m)
nn a b v c d u chia ht cho m
M (a - c) (b - d) = (a - b) (c - d) o (mod m)
Suy ra pcm.
27
d) Gi s a = mq + r
V a b (mod m) nn b = mp + r
V b c (mod m) nn c = ml + r
a b (mod m).
(Cc phn cn li xin nhng bn c)

28
II.1.2. Cc v d
V d 1. A v B l hai s c 7 ch s khc nhau t 1 n 7 v A > B.
Chng minh rng A khng chia ht cho B.
Li gii
K hiu S(n) l tng cc ch s ca n.
Khi S(A) = S(B) = 1 + 2 + + 7 = 28.
M A S(A) (mod 9); B S(B) (mod 9).
T suy ra A B 1 (mod 9).
Gi s A B hay A = pB, p nguyn dng.
Do A >B nn p > 1.
V A v B c 7 ch s khc nhau t 1 n 7 nn
1111111 < B < A < 7777777
Suy ra
7
A
B
<
T suy ra 1 < p < 7
M B 1 (mod 9) nn B = 9k + 1 A = p(9k + 1) p (mod 9)
Mt khc A 1 (mod 9) nn p 1 (mod 9). V l v 1 < p < 7.
Vy iu gi s l sai.
Suy ra A khng chia ht cho B.
V d 2. Chng minh rng 10
3n+1
khng th biu din thnh tng hai lp phng.
Li gii
Ta thy vi mi s nguyn a th
3
3
3
0(mod7)
1(mod7)
1(mod7)
a
a
a

Do vi mi a, b nguyn th
3 3
3 3
3 3
0(mod7)
1(mod7)
2(mod7)
a b
a b
a b
+

M 10
3n+1
3.3
3n
3.27
n
3(-1)
n
3 (mod7)
Nn suy ra pcm.
29
V d 3. Cho 11 s nguyn dng a
1
, a
2
, , a
11
. Chng minh rng lun tn ti cc s x
i

{-1, 0, 1} , i = 1, 2, , 11 khng ng thi bng 0 sao cho:
x
1
a
1
+ x
2
a
2
+ + x
11
a
11
chia ht cho 2047.
Li gii
t S = {b
1
a
1
+ b
2
a
2
+ + b
11
a
11
| b
i
{0, 1}}.
Khi |S| = 2048
Do khi chia cc s ca S cho 2047 phi c 2048 s d.
V vy phi tn ti hai s trong S m khi chia cho 2047 c cng s d
Gi s hai s l
11 11
1 1
,
m i i n i i
i i
A b a A c a
= =
= =

.
Ta c A
m
A
n
2047.
M
11 11
1 1
( )
m n i i i i i
i i
A A b c a x a
= =
= =

V b
i
, c
i
{0, 1} nn x
i
{-1, 0, 1}
Li c (b
1
, b
2
, , b
11
) (c
1
, c
2
, , c
11
) nn x
i
khng ng thi bng 0.
pcm.
V d 4. Xt 100 s t nhin lin tip 1, 2, , 100.
Gi A l s thu c bng cch xp mt cch tu 100 s thnh mt dy, B l s thu
c bng cch t mt cch tu cc du cng vo gia cc ch s ca A. Chng minh
rng c A v B u khng chia ht cho 2010.
Li gii
K hiu S(n) l tng cc ch s ca s t nhin n.
Ta thy t 1 n 100 xut hin 21 ch s 1, 20 ch s 2, 3, 4, 5, 6, 7, 8, 9.
Do S(A) = 21.1 + 20(2 + 3 + + 9) = 901
M A S(A) 1 (mod 3)
Nn A khng chia ht cho 3 do A khng chia ht cho 2010.
Gi s sau khi t cc du cng vo gia cc ch s ca A ta c
B = b
1
+ b
2
+ + b
n
.
Khi
B = b
1
+ b
2
+ + b
n
S(b
1
) + S(b
2
) + + S(b
n
) (mod 3).
M S(b
1
) + S(b
2
) + + S(b
n
) = S(A) 1 (mod 3)
Suy ra B 1 (mod 3). Do B khng chia ht cho 2010.
30
V d 5. Chng minh rng 11
n+2
+ 12
2n+1
chia ht cho 133 vi mi s t nhin n.
Li gii
Ta c 11
n+2
+ 12
2n+1
= 121.11
n
+ 12.144
n

= 133.11
n
+ 12(144
n
11
n
)
M 144
n
11
n
144-11 = 133
Nn ta c pcm.
V d 6. Chng minh rng 19.8
n
+ 17 l hp s vi mi s t nhin n.
Li gii
Ta c
19.8
n
+ 17

19.(-1)
n
+ 17 (mod 3)
Nu n chn th
19.(-1)
n
+ 17 19 + 17 0 (mod 3)
M 19.8
n
+ 17 > 3 nn 19.8
n
+ 17 l hp s khi n chn.
Nu n = 4k + 1
Ta c
19.8
n
+ 17 = 19.8
4k + 1
+ 17
48.64
2k
+ 17 (mod 13)
48.(-1)
2k
+ 17 (mod 12)
0 (mod 13)
Do 19.8
n
+ 17 l hp s.
Nu n = 4k + 3 th
19.8
4k+3
+ 17 0 (mod 5)
Tm li vi mi n th 19.8
n
+ 17 l hp s.
V d 7.(Nga 2000) Tm cc s nguyn t p v q sao cho p + q = (p - q)
3
.
Li gii
Ta c
(p - q)
3
= p + q 0
Nn p v q l hai s nguyn t phn bit.
Ta c
p q 2p (mod p + q)
(p - q)
3
8p
3
(mod p + q)
8p
3
0 (mod p + q). (*)
31
Do (p, q) = 1 (p, p + q) = 1
(p
3
, p + q) = 1
T (*) 8 p + q
p + q 8
M p, q 2 nn 2 q < p 5
Do (p, q) = (5, 3).
V d 8. Cho a l mt s nguyn dng l. Chng minh rng
2 2 2 2
2 , 2
n n m m
a a + +
nguyn t cng nhau vi moi s nguyn dng m n.
Li gii
Gi s m > n
Gi p l mt c nguyn t ca
2 2
2
n n
a +
Ta c
2 2
2 (mod )
n n
a p (*)
Bnh phng hai v ca (*) m n ln ta c:
2 2
2 (mod )
m m
a p
Do
2 2 2
2 2.2 (mod )
m m m
a p + nn p khng th l c ca
2 2
2
m m
a + .

32
II.1.3. Bi tp

Bi 1. Chng minh rng vi mi n nguyn dng ta c:
a) 1 2 4
2 2
+ +
n n

0 (mod 7)
b)
) 9 (mod 0 1 15 2
2
+ n
n
.
Bi 2. Tm cc s t nhin x, y, z tha mn
2
x
.3
y
+ 1 = 17
z
.
Bi 3. Tm tt c cc s nguyn dng n sao cho 5
n
- 1 (mod 7
2000
).
Bi 4. Chng minh rng vi mi n l th
1
n
+ 2
n
+ ... + n
n
1 + 2 +... + n.
Bi 5. Cho p l s nguyn t. a, b l hai s nguyn bt k. Chng minh rng
(a + b)
p
a
p
+ b
p
(mod p).
Bi 6. Cho a, n nguyn dng, p nguyn t tha mn
2
p
+ 3
p
= a
n

Chng minh rng n = 1.
Bi 7. Tm x nguyn sao cho |x| 1997 sao cho x
2
+ (x + 1)
2
1997.
Bi 8. Tm s nguyn dng n = 2
p
3
q
sao cho n + 25 l mt s chnh phng.
Bi 9. Cho cc s nguyn khng m a
1
, a
2
< ... < a
101
< 5050. Chng minh rng tn ti
bn s nguyn phn bit sao cho
(a
k
+ a
l
- a
m
- a
n
) 5050.
Bi 10. Chng minh rng tn ta s nguyn dng a sao cho mi s nguyn k th cc s
m = k
2
+ k - 3a v n = k
2
+ k + 1 - 3a u khng chia ht cho 2000
2001
.
Bi 11. Chng minh rng tn ti mt s t nhin 2001 ch s gm ton ch s 1, 2 v
chia ht cho 2
2001
.
Bi 12. Chng minh rng t 11 s t nhin tu lun chon c ra hai s sao cho hiu
bnh phng ca chng chia ht cho 20.

33
II.2. nh l Fermat, nh l euler v nh l Wilson
II.2. 1. H thng d y v h thng d thu gn.
II.2.1.1 nh ngha 1
Nu x y (mod m) ta ni y l mt thng d ca x modulo m.
Tp S = {x
1
, x
2
, , x
m
} c gi l mt h thng d y modulo m nu mi s
nguyn y tu u tn ti duy nht mt s x
i
sao cho y x
i
(mod m).
II.2.1.2 Cc tnh cht c bn
+) Tp {1, 2, , m - 1} l mt h thng d y modulo m.
+) Mi h thng d y modulo m u c ng m phn t.
+) Mt h gm m phn t l h thng d y modulo m khi v ch khi hai phn
t khc nhau bt k ca n khng ng d vi nhau modulo m.
+) Mi s nguyn m lun c v s h thng d y .
+) Vi mi s nguyn a, m > 0. Tp tt c cc s x nguyn tho mn x a (mod m)
lp thnh mt cp s cng. Tp hp ny pc gi l mt lp thng d modulo m.
+) Vi mi s nguyn dng m th lun c m lp thng d modulo m.
II.2.1.3 nh l 1
Cho a, b, m l cc s nguyn. Khi a b (mod m) th (a, m) = (b, m).
Chng minh
Ta c a b (mod m) a b 0 (mod m) a = b + mq
(a, m) = (b + mq, m) = (b, m).
pcm.

II.2.1.4 nh ngha 2
Tp S = {x
1
, x
2
, , x
n
} vi cc s x
i
phn bit gi l mt h thng d thu gn
modulo m nu (x
i
, m) = 1 vi mi i = 1, 2, , n v mi s nguyn y nguyn t cng nhau
vi m u tn ti s x
i
sao cho y x
i
(mod m).
Nhn xt:
+) Ta c th thu c mt h thng d thu gn bng cch loi ra khi h thng d
y nhng s khng nguyn t cng nhau vi m.
+) Mi h thng d y u c cng s phn t, s phn t ca mt h thng d
thu gn k hiu l (m). (m) gi l phi hm Euler.
+) Nu p l s nguyn t th (p) = p -1.
+) (m) bng s cc s nguyn khng vt qu m v nguyn t cng nhau vi m.
34
II.2.1.5 nh l 2
Cho (a, m) = 1. Nu S = {x
1
, x
2
, , x
n
l} l mt h thng d thu gn (hoc y )
modulo m th aS = {ax
1
, ax
2
, , ax
n
} cng l mt h thng d thu gn ( hoc tng
ng y ) modulo m.

Chng minh
Ta c (a, m) = 1 Nu ax
i
ax
j
(mod m) th x
i
x
j
(mod m)
Do / vi i j th x
i
khng ng d vi x
j
ax
i
cng khng ng d vi ax
j
(mod m).
Suy ra cc phn t ca ca aS i mt phn bit theo modulo m.
M S v aS c cng s phn t do nu S l h thng d y th aS cng l h thng
d y .
Nu S l h thng d thu gn th ta ch cn chng minh cc phn t ca aS u
nguyn t cng nhau vi m.
Tht vy, v (a, m) = 1 v (x
i
, m) = 1 vi mi i (ax
i
, m) = 1 aS l h thng d
thu gn modulo m.

II.2.1.6 nh l Eurler
Cho a, m l cc s nguyn tho mn (a, m) = 1. Khi
( )
1(mod )
m
a m

Chng minh
Gi y
1
, y
2
, , y
(m)
l mt h thng d thu gn modulo m.
V (a, m) = 1 nn ay
1
, ay
2
, , ay
(m)
cng l mt h thng d thu gn modulo m.
Do , vi mi i {1, 2, , (m)} u tn ti duy nht j {1, 2, , (m)} sao cho y
i

ay
j
(mod m).
T ta c
( ) ( ) ( )
( )
1 1 1
( ) (mod )
m m m
m
i i i
i i i
y ay a y m

= = =
=

M (y
i
, m) = 1 vi mi i = 1, 2, , (m)
Suy ra a
(m)
1 (mod m).
II.2.1.7 nh l Fermat
Cho p l mt s nguyn t, a l mt s nguyn bt k khng chia ht cho p. Khi
a
p-1
1 (mod p).
Chng minh
35
Do a khng chia ht cho p nn (a, p) = 1. Do , theo nh l Euler ta c
a
(p)
1 (mod p)
M p l s nguyn t nn (p) = p 1 a
p 1
1 (mod p)
pcm.
+) Nhn xt
T nh l Fermat suy ra vi mi s nguyn a v s nguyn t p th
a
p
a (mod p).
II.2.1.7 nh l Wilson
Cho p l mt s nguyn t. Khi
(p - 1)! -1 (mod p)
(Phn chng minh ca nh l kh n gin, xin nhng cho bn c )

36
II.2.2. Cc v d
V d 1. Cho n l mt s t nhin bt k. Chng minh rng
n
7
n 0 (mod 42).
Li gii
Do 7 l mt s nguyn t nn, theo nh l Fermat, ta c
n
7
n 0 (mod 7). (1)
Ta li c
n
7
n = n(n
6
- 1) = (n - 1)n(n + 1)(n
4
+ n
2
+ 1) 0 (mod 6) (2)
M (6, 7) = 1 nn t (1) v (2) suy ra pcm.

V d 2. Cho p l mt s nguyn t ln hn 7. Chng minh rng
(3
p
2
p
- 1) 42p.
Li gii
Ta c
3
p
2
p
1 = (3
p
- 3) (2
p
- 2) 0 (mod p). (1)
Mt khc
3
p
2
p
1 = (3
p
- 1) 2
p
2 (2)
M p > 7 p l
Do
3
p
2
p
1 - (-1)
p
1 0 (mod 3) (3)
By gi ta cn chng minh 3
p
2
p
1 7
Ta c
3
p
2
p
- 1

= 3.3
p-1
2
p
1
=
1 1
2 2
3.9 2 1 3.2 2 1
p p
p p

(mod 7)
=
1 1
2 2
2 2 2 1
p p
p
+
+
Do (p, 3) = 1 nn p = 3k + 1 hoc p = 3k + 2
Nu p = 3k + 1 th
1 1
2 2
2 2 2 1
p p
p
+
+ =
1 1
2 2
8 1 2 2 2 2 (mod7)
p p
k p p
+ +
+
1 1 1
2 2 2
2 (2 1) 2 (8 1) 0(mod7)
p p p
k
+ +
= =
37
Nu p = 3k + 2 ta chng minh tng t.
T suy ra pcm.
V d 3. Cho x l mt s nguyn t. Khi , phng trnh x
2
-1 (mod p) (1) c nghim
khi v ch khi p = 2 hoc p 1 ( mod 4).
Li gii
Nu p = 2, phng trnh c nghim x = 1.
Nu p 1 (mod 4)
1
2
p
l s chn
Khi ta s chng minh x =
1
( )!
2
p
l mt nghim ca (1).
Tht vy, ta c
1 ( 1)(mod )
2 ( 2)(mod )
...
1 1
( )(mod )
2 2
p p
p p
p p
p

Do
1
2
1 1
( )! ( 1) ( 1)( 1)...
2 2
p
p p
p p
+
(mod p)

1
2
2
1
2
1 1 1
( !) ( 1) .1.2...( ). ...( 1)(mod )
2 2 2
( 1) ( 1)!
p
p
p p p
p p
p
+

=

M theo nh l Wilson ta c (p - 1)! -1 (mod p)
p 1 (mod 4) nn
1
2
p
l s chn
T suy ra
1
2
( 1) ( 1)! 1(mod )
p
p p

Do x =
1
!
2
p
l mt nghim ca (1).
Ngc li, nu p l s nguyn t l v (1) c nghim
Khi , gi a l mt nghim ca (1)
Ta c
38
1 1
1 2
2 2
( ) ( 1) (mod )
p p
p
a a p

=
M theo nh l Fermat, ta c a
p-1
1 (mod p) nn
1
2
1 ( 1) (mod )
p
p

suy ra
1
2
p
chn hay p 1 (mod 4)
pcm.
V d 4. Cho a, b l hai s nguyn tha mn 24a
2
+ 1 = b
2
. Chng minh rng c mt v
ch mt trong hai s chia ht cho 5.
Li gii
Ta c 24a
2
b
2
= 1 khng chia ht cho 5 nn a v b khng th cng chia ht cho 5.
Gi s a v b cng khng chia ht cho 5
a
4
1 0 (mod 5)
b
4
1 0 (mod 5)
Do
(a
2
b
2
)(a
2
+ b
2
) = a
4
b
4
0 (mod 5)
Nu a
2
+ b
2
0 (mod 5) th 25a
2
+ 1 = a
2
+ b
2
0 (mod 5) (v l)
Vy a
2
b
2
0 (mod 5)
23a
2
+ 1 = b
2
a
2
0 (mod 5) 23a
2
+ 1 0 (mod 5)
V (a, 5) = 1 nn a 1 (mod 5) hoc a 2 (mod 5)
Nu a 1 (mod 5) th
0 23a
2
+ 1 23( 1)
2
+ 1 -1 (mod 5) (v l)
Nu a 2 (mod 5) th
0 23a
2
+ 1 23( 2)
2
+ 1 3 (mod 5) (v l).
Vy iu gi s l sai
T ta c pcm.
V d 5. Cho p l mt s nguyn t, a v b l hai s nguyn dng.Chng minh rng:
ab
p
ba
p
0 (mod p).
Li gii
Ta c
ab
p
ba
p
= ab(b
p-1
a
p-1
)
39
Nu ab p th hin nhin ab
p
ba
p
p.
Nu ab khng chia ht cho p (a, p) = (b, p) = 1
a
p-1
1 0 (mod p) v b
p-1
1 0 (mod p)
a
p-1
b
p-1
0 (mod p)
ab
p
ba
p
0 (mod p)
pcm.
V d 6. Cho a l mt s nguyn. Chng minh rng a
2
+ 1 khng c c nguyn t dng
4k + 3. T suy ra cc phng trnh sau khng c nghim nguyn dng.
a) 4xy x y = z
2

b) x
2
y
3
= 7.

Li gii
Gi s a
2
+ 1 c c nguyn t p = 4k + 3 (a, p) = 1.
Khi
a
p-1
+ 1 = a
4k+ 2
+ 1 = (a
2
)
2k + 1
+ 1 a
2
+ 1 (1)
Mt khc, theo nh l Fermat, ta c
a
p 1
1 p (2)
T (1) v (2) suy ra 2 p p = 2 (v l v 2 khng c dng 4k + 3)
Vy a
2
+ 1 khng c c nguyn t dng 4k + 3.
p dng
a) Ta c
4xy x y = z
2

(4x - 1)(4y - 1) = 4z
2
+ 1
(4x - 1)(4y - 1) = (2z)
2
+ 1
Do 4x 1 3 vi mi x nguyn dng v c dng 4k + 3 nn n c t nht mt c
nguyn t dng 4k + 3
M (2z)
2
+ 1 khng c c nguyn t dng 4k + 3 nn phng trnh trn v nghim.
b) Ta c
x
2
y
3
= 7 x
2
+ 1 = y
3
+ 8
x
2
+ 1 = (y + 2)(y
2
2y + 4)
Nu y chn th
(y + 2)(y
2
2y + 4) 4
40
x
2
+ 1 4 x
2
-1 (mod 4) v l
Do y l y = 4k + 1 hoc y = 4k + 3
Nu y = 4k + 1
y + 2 = 4k + 3 nn c c t nht mt c nguyn t dng 4k + 3.
M x
2
+ 1 khng c c nguyn t dng 4k + 3 phng trnh trn khng c nghim
trong trng hp ny.
Nu y = 4k + 3 y
2
2y + 4 (-1)
2
2(-1) (mod 4) 3 (mod 4)
nn phng trnh trn cng v nghim trong trng hp ny.
T ta c pcm.

V d 7. Cho a, b l cc s nguyn. p l mt s nguyn t c dng 4k + 3. Chng minh
rng nu x
2
+ y
2
p th x p v y p. T suy ra phng trnh sau v nghim nguyn:
x
2
+ 2y + 4y
2
= 37
Li gii
Gi s p = 4k + 3 l s nguyn t tha mn x
2
+ y
2
p nhng x khng chia ht cho p x
2

khng chia ht cho p y khng chia ht cho p.
x
p 1
1 p (x
2
)
2k + 1
1 p
Tng t, ta cung c
(y
2
)
2k + 1
1 p
suy ra
(x
2
)
2k + 1
+ (y
2
)
2k + 1
2 (mod p)
M (x
2
)
2k + 1
+ (y
2
)
2k + 1
x
2
+ y
2
p 2 p p = 2 (v l)
Vy x p v y p.
p dng
Ta c
x
2
+ 2x + 4y
2
= 37
(x +1)
2
+ (2y)
2
= 38 19 = 4.4 + 3
Do x + 1 19 v 2y 19.
V x + 1 v 2y khng th cng bng 0 nn |x + 1| 19 hoc |2y| 19
Khi (x + 1)
2
+ (2y)
2
19
2
> 38 nn phng trnh trn v nghim.
V d 8. Cho p 7, p nguyn t. Chng minh rng s S = 111 (p 1 ch s 1) chia ht
cho p.
41
Li gii
Ta c
S =
1
10 1
9
p

V p 7 nn (10, p) = 1
Do
10
p 1
1 p
10
p 1
1 (10 - ) = 9
M (p, 9) = 1 nn 10
p 1
1 9p
T suy ra S p.
pcm.
V d 9. [IMO - 2005] Cho dy s (a
n
) xc nh nh sau
a
n

= 2
n
+ 3
n
+ 6
n
1 vi n = 1, 2,
Tm s t nhin nguyn t cng nhau vi mi s hng ca dy trn.
Li gii
Ta s chng minh rng vi mi s nguyn t p u tn ti mt s hng a
n
chia ht cho p.
Tht vy, ta c a
2
= 2
2
+ 3
2
+ 6
2
1 = 48 chia ht cho 2 v 3.
Xt p 5
Ta c
(2, p) = 1; (3, p) = 1; (6, p) = 1
Do , t nh l Fermat suy ra
2
p 1
3
p 1
6
p 1
1 (mod p)
T d dng chng minh c 6a
p 2
p
M (p, 6) = 1 nn a
p 2
p
Do ch c s 1 l s t nhin duy nht nguyn t cng nhau vi mi s hng ca dy
(a
n
).
V d 10. [IMO - 2003] Tm s nguyn dng k nh nht sao cho tn ti cc s x
1
, x
2
, ,
x
k
sao cho:
x
1
3
+ x
2
3
+ + x
k
3
= 2002
2002
.
Li gii
Ta c 2002 4 (mod 9) 2002
3
4
3
1 (mod 9)
2002
2002
= (2002
3
)
667
.2002 2002 (mod 9) 4 (mod 9)
42
Mt khc, vi mi s nguyn a ta c
a
3
1 (mod 9) hoc a
3
0 (mod 9)
Do
x
1
3
; x
1
3
+ x
2
3
; x
1
3
+ x
2
3
+ x
3
3
khng th ng d vi 4 modulo 9 c.
Tc l vi k 3 th phng trnh trn khng c nghim nguyn.
Ta s chng minh k = 4 l gi tr cn tm.
Tht vy, ta c 2002 = 10
3
+ 10
3
+ 1
3
+ 1
3

M 2002 = 3. 667 + 1
2002
2002
= 2002. (2002
667
)
3

= (10
3
+ 10
3
+ 1
3
+ 1
3
) (2002
667
)
3

= (10.2002
667
)
3
+ (10.2002
667
)
3
+ (2002
667
)
3
+ (2002
667
)
3

Vy vi k = 4 th phng trnh trn c nghim.
KL: k = 4 l gi tr cn tm.
V d 11. (Balan - 98) Cho dy s (a
n
) c xc nh nh sau:
a
1
= 1,
1
[ ]
2
n n n
a a a
= + vi mi n 2.
Chng minh rng dy (a
n
) c v s s hng chia ht cho 7.
Li gii
Gi s trong dy trn c hu hn s hng chia ht cho 7.
Khi gi a
k
l s hng cui cng ca dy chia ht cho 7.
iu ny l tn ti v c a
5
= 7 7.
Ta c
a
2k
= a
2k-1
+ a
k
; a
2k + 1
= a
2k

+ a
k
.
Do
a
2k + 1
a
2k
a
2k 1
x (mod 7).
Vi x 7.
Mt khc
a
4k 2

= a
4k 3
+ a
2k 1
a
4k 3
+ x (mod 7)
a
4k 1
= a
4k 2
+ a
2k 1
a
4k 2
+ x (mod 7) a
4k 3
+ 2x (mod 7)
a
4k
= a
4k 1
+ a
2k
a
4k 3
+ 3x (mod 7)
a
4k + 1
= a
4k
+ a
2k
a
4k 3
+ 4x (mod 7)
a
4k + 2
= a
4k + 1
+ a
2k + 1
a
4k 3
+ 5x (mod 7).
43
a
4k + 3

= a
4k + 2
+ a
2k + 1
a
4k 3
+ 6x (mod 7)
Ta c a
4k 3
7 v x 7 nn trong cc s a
4k 3
+ ix (i = 1, 2, , 6.) phi c s chia ht
cho 7 nn trong cc s a
4k 3 + i
, i = 1, 2, , 6 phi c s chia ht cho 7.
Vy iu gi s l sai
V d 12. Chng minh rng nu p l mt s nguyn t th (p - 2)! 1 p.
Nu p > 5 th (p - 2)! 1 khng l lu tha ca p.
Li gii
Theo nh l Wilson ta c
(p - 1)! - 1 (mod p) p 1 (mod p)
(p - 1)(p - 2)! p - 1 (mod p) (*)
Do (p, p - 1) = 1 nn
(*) (p - 2)! 1 (mod p)
Vi p > 5, gi s (p - 2)! 1 = p
n

Ta c
(p - 2)! p 1 p
n
+ 1 p 1
M
p
n
+ 1 = (p
n
1) + 2 2 (mod p - 1)
2 0 (mod p 1)
V l v p > 5
Vy c iu phi chng minh.
V d 13.
a) Cho a l mt s nguyn dng. Chng minh rng mi c nguyn t p ca a
2
+
1 vi p > 2 th p u c dng 4k + 1.
b) Chng minh rng c v s s nguyn t c dng 4k + 1.

Li gii
1) Gi s p l s nguyn t dng 4k + 3 v p | a
2
+ 1
Khi
a
2
-1 (mod p)
1
2 2 2 1
2
( ) ( )
p
k
a a
+
= -1 (mod p)
Mt khc theo nh l Fermat, ta c
44
a
p 1
1 (mod p)
Do
2 0 (mod p)
V l v p > 2
Vy c iu phi chng minh
b) Theo phn a) ta c mi c nguyn t ca (n!)
2
+ 1 u c dng 4k + 1
Gi s c hu hn c nguyn t dng 4k + 1 khi gi p l s nguyn t ln nht c
dng 4k + 1.
Ta c mi c nguyn t ln hn 2 ca (p!)
2
+ 1 u c dng 4k + 1 v u khng ln
hn p (do p ln nht dng 4k + 1)
((p!)
2
+ 1, q) = 1 vi mi q p d (p!)
2
+ 1 khng c c nguyn t nh hn hoc
bng p (v l)

V d 14. Chng minh rng vi mi s nguyn t p, tn ti v hn cc s nguyn dng
n sao cho
2
n
n p (*)
Li gii
Nu p = 2 th mi n chn u tha mn (*)
Nu p > 2, theo nh l Fermat, ta c
2
p 1
1 (mod p)
2
m(p - 1)
1 mod p
Chn m = kp -1, n = m(p - 1) = (kp - 1)(p - 1) 1 (mod p)
Khi
2
n
- n = 2
m(p - 1)
n 1 1 0 (mod p)
T suy ra pcm.
V d 15. (Bulgarian 95) Tm s cc s t nhin n > 1 sao cho
a
25
a 0 (mod n)
Vi mi s t nhin a.
Li gii
Vi mi s nguyn t p th
(p
2
, p
25
- p) = p p
25
p p
45
Do n p
2
vi mi p nguyn t.
suy ra n l tch ca cc s nguyn t phn bit
(S t nhin nh vy c gi l s squarefree)
Mt khc
2
25
2 = 2.3
2
.5.7.13.17.241
Nhng n khng th chia ht cho 17 v 241 v
3
25
3 -6 (mod 17)
v 3
25
3 29 (mod 241)
By gi ta xt p = 2, 3, 5, 7, 13.
+) p = 2, ta c vi mi a nguyn th a
25
a 2.
+) p = 3. Nu a 3 th a
25
a 3
Nu a 3 a
2
1 (mod 3) a
25
= (a
2
)
12
. a a (mod 3)
a
25
a 3.
Tng t cho p = 5, 7, 13 th a
25
a p vi mi a nguyn.
Do n chnh l tch ca k (1 k 5) s trong 5 s trn
T suy ra c 2
5
1 = 31 s t nhin nh vy
V d 16. Cho n 5 l s t nhin .Chng minh rng

(

n
n )! 1 (
n-1 .
Li gii
a) Trng hp 1. n l s nguyn t
Theo nh l Winson (n-1)! -1(mod n) suy ra ((n-1)!+1 n
Ta c
1
1 )! 1 ( 1 1 )! 1 ( )! 1 (
+
=
(

+
=
(

n
n
n n
n
n
n
(v 1
1
0 < <
n
)
= 1) - (n
) 1 ( )! 1 (
n
n n
v (n, n - 1) = 1
b) Trng hp 2. n l hp s
+) n khng l bnh phng ca mt s nguyn t.
Khi n = rs vi 1< r < s < n.
Do (n,n-1)=1 suy ra s < n-1 ) n(n- ) rs(n- )! (n- 1 1 1 = hay (n-1)! = kn(n-1)
suy ra
46
) (n ) k(n
n
)! (n
1 1
1
=
(

.
+) n = p
2
vi p l mt s nguyn t.
Do p =
2
n, n 5 suy ra p 1 2 3 3
2
+ > p p p
1 2
2
< p p hay 2p < n-1
Nn 1 < p < 2p < n-1
Suy ra (n-1)! p.2p.(n-1) = 2n(n-1).
T o suy ra ) (n-
n
)! (n
1
1

.

47
II.2.3. Bi tp
Bi 1.
a) Cho a l s nguyn sao cho (a, 7) = 1. Chng minh rng
a
12
- 1 7.
b) a l s nguyn dng sao cho (a, 240) = 1. Chng minh rng
a
4
- 1 240.
Bi 2. Cho a
1
+ a
2
+ ... + a
n
30, v a
1
, a
2
, ..., a
n
nguyn. Chng minh rng
. 30 ...
5 5
2
5
1

n
a a a + + +
Bi 3. Chng minh rng
n
7
- n 42
vi mi s nguyn n.
Bi 4. Cho n nguyn dng. Chng minh rng
a) 3 2
1 4
3
+
+ n
11.
b) 19 2
1 10
2
+
+ n
23.
c)
2 6
2
2
+ n
16 (mod 37).
Bi 5. Cho p l s nguyn t ln hn 17. Chng minh rng
P
16
1 (mod 16320).
Bi 6. Cho p l s nguyn t l. Chng minh rng
2(p-3)! -1 (mod p).
Bi 7. Cho n l hp s, n 4. Chng minh rng (n - 1)! 0 (mod n).
Bi 8. Cho p v q l hai s nguyn t phn bit. Chng minh rng
q
p - 1
+ p
q - 1
1 (mod pq).
Bi 9. Cho a, b l cc s nguyn, p l s nguyn t. Chng minh rng
(a + b)
p
a
p
+ b
p
(mod p).
Bi 10. Chng minh rng n v n + 2 l cp s nguyn t sinh i khi v ch khi
4[(n - 1)! + 1] + n 0 (mod n(n + 2)).
Bi 11. Cho p l mt s nguyn t l. Chng minh rng s m =
8
1 9
p
l mt hp s l,
khng chia ht cho 3 v 3
m - 1
1 (mod m).
Bi 12. Chng minh rng vi mi s nguyn t p, tn ti v hn s nguyn dng n tha
mn
2
n
- n p.
48
Bi 13. Tm tt c cc s nguyn t p sao cho
p) (
p
mod 1 5
2
2

Bi 14. Cho a, b l hai s nguyn dng sao cho 2a - 1, 2b - 1 v a + b u l cc s
nguyn t. Chng minh rng a
a
+ b
b
v a
b
+ b
a
u khng chia ht cho a + b.
Bi 15. Tm s nguyn dng n sao cho n = a
2
+ b
2
vi a, b l hai s nguyn dng
nguyn t cng nhau v ab chia ht cho mi s nguyn t nh hn hoc bng n .
Bi 16. Cho p l mt s nguyn t l. Chng minh rng khng tn ti x, y nguyn tha
mn h thc
x
p
+ y
p
= p[(p - 1)!]
p
.
Bi 17. Tm ba s nguyn t p, q, r sao cho p
2
+ q
2
+ r
2
cng l s nguyn t.

49
II.3. S chnh phng mod p
II.3.1. L thuyt
II.3.1.1 nh ngha 1
Cho s nguyn t p. S nguyn a c gi l s chnh phng (mod p) nu tn ti
s nguyn x sao cho x
2
a ( mod p).
Nhn xt:
+) Mi s chnh phng u l s chnh phng (mod p)
+) a 0 (mod p) th a
2
a (mod p) nn mi a 0 (mod p) u l s chnh phng
(mod p). Do , t y v sau, ta ch xt s nguyn a sao cho (a, p) = 1.
+) Mi s nguyn l u l s chnh phng (mod 2)
II.3.1.2 K hiu Legendre
Cho p l s nguyn t l.
1
a
p
| |
=
|
\
nu a l s chnh phng mod p

a
p
| |
|
\
= -1 nu a khng l s chnh phng mod p.
K hiu trn gi l k hiu Legendre.
II.3.1.3 nh l 1
Cho p l mt s nguyn t l. Khi
1
2
1 1(mod )
p
a
a p
p
| |
=
|
\
(1)
1
2
1 1(mod )
p
a
a p
p
| |
=
|
\
(2)
Chng minh
Gi s a l s chnh phng mod p, khi , tn ti s t nhin x sao cho
x
2
a (mod p)
Do (a, p) = 1 nn (x, p) = 1.
1
1
2
1 (mod )
p
p
x a p

Ngc li, nu c (1) th vi mi k {1, 2, , p - 1} c duy nht mt s k {1, 2, , p
- 1} sao cho k.k a (mod p)
50
Nu tn ti k = k th k.k = k
2
a (mod p) a l s chnh phng (mod p).
Tri li, tp {1, 2, , p - 1} c chia thnh
1
2
k
tp con {k, k} ri nhau sao cho k.k
a (mod p). (p - 1)!
1
2
1(mod )
p
a p

Mt khc, theo nh l Wilson, ta c
(p - 1)! -1 (mod p)
T suy ra
1 -1 (mod p) p = 2 (v l v p l)
Vy (1) c chng minh xong.
Theo nh l Fermat, ta c a
p 1
1 (mod p)

1
2
1
2
1(mod )
1(mod )
p
p
a p
a p

Do , (2) c chng minh.

II.3.1.4 nh l 2 (B Gauss)
Cho p l s nguyn t l, a l s nguyn, (a, p) = 1. Xt tp
{ka| k = 1, 2, ,
1
2
p
}.
Gi r
k
ka (mod p), 1 r
k
p.
Gi n l s cc s r
k
thuc khong ( ;
2
p
p). Khi
1
2
( 1) (mod )
p
n
a p
.
(n chnh l s bi s ca a trong khong ( ;
2
p
p))
Chng minh
Ta c
ka r
k
(mod p)
Cho k chy t 1 n (p - 1)/2 ri nhn cc ng thc li ta c:
1
1
2
2
1
1
! (mod )
2
p
p
k
k
p
a r p

51
Gi A = |
2
k k
p
r r

>
`
)
; B = |
2
k k
p
r r

<
`
)

Khi
1
2
1
( 1) ( ) (mod )
k k k k
p
n
k k k k k
k r A r B r A r B
r r r p r r p
=
=

Ta c vi mi r
k
A th p r
k

1
2
p
.
Mt khc Nu r
i
A, r
j
B th p r
i
r
j
v nu p r
i
= r
j
th r
i
+ r
j
= p
a(i + j) 0 (mod p) i + j 0 (mod p).
iu ny khng th v i v j thuc
1
(1; )
2
p
nn 1 < i + j < p .
T suy ra
1
1
2
2
1
1 1
! ( 1) !
2 2
p
p
n
k
k
p p
a r
(*)
M
1
( !, ) 1
2
p
p
= nn t (*) suy ra
1
2
( 1) (mod )
p
n
a p

pcm.
T ta c mt s h qu quan trng sau.
H qu 1. Cho p l s nguyn t l. Gi n l s cc s chn thuc ( ;
2
p
p) th ta c
1
2
2 ( 1) (mod )
p
n
p
.
Chng minh
T nh l 2, cho a = 2 ta c iu phi chng minh.
H qu 2. Cho p l s nguyn t l. Khi
1
2
1
( ) ( 1)
p
p
=
Chng minh
(Hin nhin)
H qu 3. Cho p l s nguyn t l. Khi
2
( ) 1
p
= p 1 (mod 8)
52
v
2
1
8
2
( 1)
p
p
| |
=
|
\

Chng minh
Gi s p = 4k + 1, tp cc s chn trong khong (0; p) l {2i | 1 i 2k}
Khi , s cc s chn trong khong ( ;
2
p
p) l n = k.
Tng t nh vy, nu p = 4k 1 th ta cng tnh c s cc s chn trong khong
( ;
2
p
p) l n = k.
Do , theo h qu 1, ta c
1
2
2 ( 1) (mod )
p
n
p
(-1)
k
(mod p)
2 l s chnh phng mod p
1
2
1 2 ( 1) (mod )
p
k
p

k chn p 1 (mod p).
2 khng l s chnh phng mod p k l p 3 (mod p)
pcm.
H qu 4. Cho p l s nguyn t l. Gi n l s cc bi ca 3 trong khong ( ;
2
p
p).
Khi

1
2
3 ( 1) (mod )
p
n
p

Chng minh
c suy ra hin nhin t nh l, trong trng hp a = 3.

H qu 5. Cho p l s nguyn t c dng 6k 1. Khi , 3 l s chnh phng
mod p khi v ch khi p 1 (mod 12).
Chng minh
Gi s p = 6k + 1. Tp hp cc s l bi ca 3 trong khong (0; p) l
{3i | 1 i 2k}
M
3i >
1
1
2 6 6
p p
i k i k > = + +
53
Do , s cc s l bi ca 3 trong khong ( ;
2
p
p) l n = k.
Tng t khi p = 6k 1, ta cng chng minh c n = k.
Vy trong c hai trng hp ta u chng minh c s cc s l bi ca 3 trong khong
( ;
2
p
p) l n = k.
V vy, theo h qu 4, ta c
1
2
3 ( 1) (mod )
p
n
p
(-1)
k
(mod p)

3
( ) 1
p
= (-1)
k
1 (mod p)
k chn
p 1 (mod 12).
pcm.

II.3.1.5 nh l 2
Cho p l s nguyn t. a b (mod p), (a, p) = (b, p) = 1. Khi
( ) ( )
a b
p p
= .
Chng minh
Do a b (mod p)
1 1
2 2
(mod )
p p
a b p

( ) ( )
a b
p p
=
pcm.
II.3.1.5 nh l 4
Cho p l mt s nguyn t. a
1
, a
2
, , a
n
l cc s nguyn khng chia ht cho p.
Khi
1 2 1 2
...
( ) ( )( )...( )
n n
a a a a a a
p p p p
=
Chng minh
(Phn chng minh kh n gin, xin nhng cho bn c)

II.3.1.6 nh l 5
Cho p l s nguyn t l, a l s nguyn khng chia ht cho p. Khi
54
1
2
( 1) (mod )
p
s
a p

Vi s =
1
2
1
p
k
ka
p
=
(
(

Chng minh
Gi n l s cc bi ca a trong khong ( ;
2
p
p), theo nh l 2, ta c
1
2
( 1) (mod )
p
n
a p

V vy, ta ch cn chng minh s n l s chn.
(Phn ny kh n gin, xin nhng li cho bn c).
II.3.1.6 nh l 7 (Lut tng h Gauss)
Cho p, q l hai s nguyn t l phn bit.
Khi :
a) Nu c t nht mt trong hai s c dng 4k + 1 th
( ) ( )
p q
q p
= .
b) Nu c hai s c dng 4k + 3 th
( ) ( ).
p q
q p
=
Chng minh
a) t
s
1
=
1 1
2 2
2
1 1
;
p q
i i
iq ip
s
p q

= =
( (
=
( (

Khi
s
1
+ s
2
=
1 1
( )( )
2 2
p q

(tnh cht ny c chng minh trong ti liu Mt s bi ton v phn nguyn ca
cng tc gi).
Do p hoc q c dng 4k + 1 nn
1 1
( )( )
2 2
p q
l s chn.
Nn s
1
v s
2
c cng tnh chn l.
55
Theo nh l 5, ta c
1
1
2
( 1) (mod )
p
s
q p

2 2
( 1) (mod )
q
s
p q
T d dng suy ra iu phi chng minh.
b) Chng minh tng t.

II.3.2. Cc v d
V d 1. Cho p l s nguyn t c dng 8k + 5 hoc 8k + 7. x, y l hai s nguyn tha mn
x
2
+ 2y
2
chia ht cho p.
Chng minh rng x p v y p.
Li gii
Gi s ngc li x p 2y
2
p y p.
M
x
2
+ 2y
2
p x
2
-2y
2
(mod p)

2 2
2
( ) ( )
x y
p p
=
1 =
2
2 2 1 2
( )( ) ( ) ( )( )
y
p p p p p

= = . (1)
Nu p = 8k + 5
2
1
2
1
8
1
( ) ( 1) 1
2
( ) ( 1) 1
p
p
p
p

= =
= =

Thay vo (1) c 1 = -1 (v l).
Nu p = 8k + 1
2
1
2
1
8
1
( ) ( 1) 1
2
( ) ( 1) 1
p
p
p
p

= =
= =
cng khng tho mn (1)

Vy iu gi s l sai
T suy ra pcm.
56
V d 2. Cho
2
2 1
n
k = + vi n nguyn dng. Chng minh rng k l s nguyn t khi v
ch khi k l c ca
1
2
3 1
k
+ .
Li gii
Nu k l c ca
1
2
3 1
k
+ th ta c

1
2
3
k
-1 (mod k) (1)
3
k -1
1 (mod k) (2)
Gi d l bc ca 3 modulo k
T (1) v (2) ta c d | k 1 nhng d li khng chia ht
1
2
k

d = k 1 k l s nguyn t.
Ngc li, k l s nguyn t
Ta c k l s nguyn t dng 4l + 1 nn theo lut tng h Gauss ta c
3
( ) ( )
3
k
k
=
M k 2 (mod 3) nn
2
( ) ( ) 1
3 3
k
= = (do 2 khng phi s chnh phng mod 3).
T suy ra
1 1
2 2
3 1(mod ) 3 1 0(mod )
k k
k k

+ .
pcm.
V d 3. Chng minh rng vi mi n nguyn dng, s 2
n
+ 1 khng c c nguyn t
dng 8k + 7.
Li gii
Gi s tn ti s nguyn t p = 8k + 7 sao cho p | 2
n
+ 1
Nu n chn, ta c
2
n
-1 (mod p)
Suy ra -1 l s chnh phng mod p
Do
1
4 3
2
1
1 ( ) ( 1) ( 1) 1
p
k
p
= = = = (v l)
Nu n l, ta c
57
2
n
-1 (mod p) 2
n + 1
-2 (mod p)
Suy ra -2 l s chnh phng mod p
Do , ta c
2 1 2
1 ( ) ( )( ) 1
p p p

= = = .1 = -1. (v l)
V d 4. Tm x, n nguyn dng sao cho
x
3
+ 2x + 1 = 2
n
. (1)
Li gii
Do x nguyn dng nn x
3
+ 2x + 1 4 n 2.
Nu n = 2, ta d dng tm c x = 1.
Xt n 3
(1) x(x
2
+ 2) = 2
n
1 l s l nn x l
Do , x
2
+ 2 3 2
n
(1 mod 3) (-1)
n
1 (mod 3)
T suy ra n chn.
Mt khc
x
3
+ 2x + 1 = 2
n

x
3
+ 2x + 3 = 2
n
+ 2
(x + 1)(x
2
x + 3) = 2
n
+ 2.
Gi s p l mt c nguyn t ca x
2
x + 3 p l
Khi
2
n
+ 2 0 (mod p) 2
n
-2 (mod p)
M n chn suy ra
2
( ) 1
p
=
Ta c
1 =
2
1 1
8 2
2 1 2
( ) ( )( ) ( 1) ( 1)
p p
p p p

= =
T suy ra p = 8k + 1 hoc p = 8k + 3.
M n 3 2
n
= 8.2
n 3
0 (mod 8)
Do ta suy ra
x
3
+ 2x + 1 0 (mod 8).
58
M x l x = 8k 1, x = 8k 3
Nu x = 8k 1 x
3
+ 2x + 1 ( 1)
3
+ 2( 1) + 1 0 (mod 8) (v l)
Nu x = 8k + 3 th x
3
+ 2x + 1 cng khng th chia ht cho 8.
Nu x = 8k + 5 th tha mn.
Khi
x
2
x + 3 5
2
5 + 3 7 (mod 8)
Hay
x
2
x + 3 = 8l + 7
M s dng 8l + 7 th khng th c c nguyn t dng 8k + 1 hoc 8k + 3
Do (1) v nghim khi n 3.
Vy x = 1, n = 2.

V d 5. Cho p l s nguyn t dng 12k 1. Tm x, y, n nguyn khng m sao cho
3a
2
+ b
2
p
n
(1)
Vi a v b khng chia ht cho p.
Li gii
Nu n = 0 th mi a, b nguyn khng m v a p, b p u tha mn (1)
Nu n 0 a > 0 3a
2
+ b
2
p
Do
b
2
-3a
2
(mod p)

1 1 1
2 2
2 2 2
( ) ( 3) ( ) (mod )
p p p
b a p

b
p 1

1
2
( 3)
p
a
p 1
(mod p)
M
(a, p) = (b, p) = 1 a
p 1
b
p 1
1 (mod p)
Suy ra
1
2
( 3) 1(mod )
p
p

Mt khc
1
6 1
2
3 1 3 3 3 3
1 ( ) ( )( ) ( 1) ( ) ( 1) ( ) ( )
p
k
p p p p p p

= = = = = (*)
59
Li c p = 12k 1 nn 3 l s chnh phng mod p hay
3
( ) 1
p
=
Thay vo (*) ta c 1 = -1 (v l)
Vy khi n > 0 th khng tn ti a, b, n tha mn.
V d 6. (Serbi - 2008) Gii phng trnh
12
x
+ y
4
= 2008
z

Vi x, y, z l cc s nguyn khng m.
Li gii
Nu z = 0 x = y = 0.
Nu z > 0 y > 0 v 12
x
251 m 2008 = 251.8
TH1: x chn
Ta c 12
x
+ y
4
=
2 2 2 2 2
2
(12 ) ( )
x
y a b + = +
Vi a = 12
x/2
, b = y
2
.
V 2008 = 251.8 a
2
+ b
2
251
M 251 l s nguyn t v 251 = 4k + 3 nn c a v b u phi chia ht cho 251
V l v 12
x/2
251.
TH2. x l lm tng t.
Vy phng trnh c nghim duy nht x = y = z = 0.

60
II.3.3. Bi tp
Bi 1. Chng minh rng mi c nguyn t ca n
4
- n
2
+ 1 u c dng 12k + 1.
Bi 2. (Ba Lan 2007) Chng minh rng phng trnh x
2
+ 5 = y
3
khng c nghim
nguyn.
Bi 3. Chng minh rng vi mi s nguyn t p th tn ti cc s nguyn a, b sao cho a
2
+
b
2
+ 1 chia ht cho p.
Bi 4. Cho s nguyn t p. Chng minh rng 3
p
+ 7p - 4 khng l bnh phng ca mt s
nguyn.
Bi 5. (IMO 2006) Tm tt c cc nghim nguyn ca phng trnh
1 + 2
x
+ 2
2x + 1
= y
2
.
Bi 6. Cho m, n l cc s nguyn sao cho A =
m
m
n
3
1 ) 3 ( + +
l mt s nguyn. Chng
minh rng A l s l.
Bi 7. ( ngh IMO 2004)Chng minh rng 2
n
+ 1 khng c c nguyn t dng 8k + 7.
Chng minh rng 1 2
3
+
n
c t nht n c nguyn t dng 8k + 3.
Bi 8. Tm tt c cc s nguyn dng n sao cho 3
n
- 1

2
n
- 1.

61
II. 4. nh l thng d Trung Hoa
II.4.1 L thuyt
II.4.1.1. nh l 1 (nh l thng d Trung Hoa)
Cho h phng trnh
1 1
2 2
(mod )
(mod )
...
(mod )
n n
x r m
x r m
x r m

(1)
Trong m
1
, m
2
, , m
n
l cc s nguyn i mt nguyn t cng nhau. Khi h
phng trnh trn lun c nghim. Nu x
1
v x
0
l hai nghim ca (1) th x
1
x
0
(mod
m
1
m
2
m
n
).

Chng minh
t s
i
=
1
n
k
k
i
m
m
=
.
Do m
1
, m
2
, , m
n
i mt nguyn t cng nhau nn (s
i
, m
i
) = 1.
Nn vi mi s nguyn dng s
i
lun tn ti mt s nguyn h
i
sao cho
s
i
h
i
1 (mod m
i
).
t x
0
=
1
n
i i i
i
s h r
=

V s
i
m
j
vi mi j i nn
x
0
s
i
h
i
r
i
(mod m
i
) r
i
(mod m
i
)
Do x
0
chnh l mt nghim ca (1).
Gi s x
1
cng l mt nghim ca (1)
Ta c
x
1
x
0
(mod m
i
) x
1
x
0
m
i
.vi mi i
M m
1
, m
2
, , m
n
i mt nguyn t cng nhau nn
x
1
x
o
m
1
m
2
m
n
.

62
II.4.1.2. nh l 2
Cho h phng trnh
1 1
2 2
(mod )
(mod )
...
(mod )
n n
x r m
x r m
x r m

(1)
iu kin cn v h trn c nghim l
r
i
r
j
(mod (m
i
, m
j
)).
Khi h trn c nghim duy nht theo modulo [m
1
, m
2
, , m
n
].
Chng minh
(xin nhng cho bn c)

II.4.1.3. Phng php gii h (1) trong trng hp cc s m
i
i
mt nguyn t cng nhau.
Bc 1. t m = m
1
m
2
m
n
= M
i
m
i
vi i = 1, 2, ,n.
Bc 2. Tm cc s N
i
nghim ng phng trnh
M
i
x 1 (mod m)
Bc 3. Tm c mt nghim ca h l
x
0
=
1
n
i i i
i
M N r
=
l mt nghim ca h
Bc 4. Kt lun x = x
0
+ mt.

63
II.4.2 Cc v d
V d 1. Gii h
4(mod11)
3(mod17)
x
x

Li gii
Xt phng trnh
17y 1(mod 11)
6y 1 (mod 11)
Ta d dng tm c mt nghim l N
1
= 2.
Xt phng trnh
11y 1 (mod 17)
Ta cng d dng tm c mt nghim l N
2
= 14.
Suy ra mt nghim l x
0
= 17.2 .4 +11.14.3
T tm c nghim ca h l x = 17.2.4 + 11.14. 3 + 11.17t.
V d 2. Gii h
1(mod2)
2(mod3)
3(mod5)
x
x
x

Li gii
Xt phng trnh
15y 1 (mod 2)
Phng trnh ny c mt nghim l N
1
= 1
Xt phng trnh
10y 1 (mod 3)
Cng d dng tm c mt nghim l N
2
= 1.
Xt phng trnh
6y 1 (mod 5)
Cng tm c N
3
= 1 l mt nghim.
Vy x
0
= 15.1.1 + 10.1.2 + 6.1.3 = 53 l mt nghim ca h
Do h phng trnh cho c nghim l
x 53 (mod 30) 23 (mod 30)
64
V d 3. Gii h

0(mod2)
0(mod3)
1(mod5)
6(mod7)
x
x
x
x

Li gii
Xt phng trnh
42y 1 (mod 5)
2y 1 (mod 5)
Tm c N
3
= 3.
Xt phng trnh
30y 1 (mod 7)
2y 1 (mod 7)
Tm c N
3
= 4
T suy ra x
0
= 42.3.1 + 30.4.6 l mt nghim ca h
Vy h c nghim l x
V d 4. Chng minh rng vi mi s nguyn dng k tu lun tn ti k s nguyn lin
tip ton hp s.
Li gii
Gi p
1
< p
2
< ...<p
k
l cc s nguyn t tu . Khi , theo nh l thng d Trung Hoa,
lun tn ti n sao cho

) (mod
...
) (mod 2
) (mod 1
2
1
k
p k n
p n
p n

Do vi mi i = 1, 2, ..., k th n + i p
k
.
Do ch cn chn n > p
k
th dy {n + i| i = 1, 2, ..., n} lun l hp s.
V d 5. (VMO - 2008) Cho m = 2007
2008
. Hi c tt c bao nhiu s t nhin n<m sao
cho m | n(2n +1)(5n + 2)?
Li gii
Ta c m = 3
2008
.223
2008
.
Ta li c (n, 2n + 1) = 1; (n, 5n + 2) = (n, 2) 2
65
(2n + 1; 5n + 2) = (2n + 1, n) = 1
Do m | n(2n + 1)(5n +2) khi v ch khi xy ra mt trong cc trng hp sau:
1) m | n
2) m | 2n + 1
3) m | 5n + 2
4) 3
4096
| n v 223
2008
| 2n +1
5) 3
4096
| n v 233
2008
| 5n + 2
6) 3
4096
| 5n + 2 v 223
2008
| 2n + 1
7) 3
4096
| 5n + 2 v 233
2008
| n
8) 3
4096
| 2n + 1 v 223
2008
| 5n + 2
9) 3
4096
| 2n + 1 v 223
2008
| n
Trong mi trng hp y, theo nh l thng d Trung hoa, c duy nht mt s t nhin n
(modulo m) tha mn.
Nn c tt c 9 s t nhin tha mn bi.
V d 6. ( ngh IMO 2002) Trong li im nguyn ca mt phng ta Oxy, mt
im c ta l cc s nguyn A(x, y) Z
2
c gi l nhn thy c t O nu trn
on OA khng c im no thuc Z
2
, tr O v A. Chng minh rng vi mi s t nhin n
tu , lun tn ti hnh vung n x n c cc nh nguyn v mi im nguyn bn trong v
trn bin ca hnh vung u khng nhn thy c t O.
Li gii
Ta c nu (x, y) = d
th im ) ; (
d
y
d
x
M l im nguyn thuc on OA vi A(x; y).
Do , A(x, y) l im nhn thy c t O khi v ch khi (x, y) = 1.
Gi
j i
p
,
l cc s nguyn t i mt khc nhau vi 0 i, j
n
(c (n +1)
2
s nguyn t nh vy)
Xt hai h sau:
) ... (mod
...
) ... (mod 1
) ... (mod 0
, 1 , 0 ,
, 1 1 , 1 0 , 1
, 0 1 , 0 0 , 0
n n n n
n
n
p p p n x
p p p x
p p p x

66
v
) ... (mod
...
) ... (mod 1
) ... (mod 0
, , 1 , 0
1 , 1 , 1 1 , 0
0 , 0 , 1 0 , 0
n n n n
n
n
p p p n x
p p p x
p p p x

Theo nh l thng d Trung Hoa, tn ti cc s t nhin y nh vy.
M x + i v y + j u chia ht cho p
i,j

Do , mi im trong hnh vung n x n vi (n + 1)
2
im nguyn A
i,j
(x + i, y + j) trn
u khng nhn thy c t O.
V d 8. (Nordic - 98) Tn ti hay khng mt dy c hn cc s t nhin
{x
1
, x
2
, ..., x
n
, ...} = {1, 2, ..., n, ...}
Sao cho x
i
x
j
vi mi i j v
x
1
+ x
2
+ ... + x
k
k vi mi k = 1, 2, ...
Li gii
Ta xy dng mt dy tha mn bi nh sau:
Chn x
1
= 1, x
2
= 3, x
3
= 2.
Gi s x
1
, x
2
, ..., x
n
l dy s tha mn
x
1
+ x
2
+ ... + x
k
k vi mi k = 1, 2, ..., n.
Gi m l s nguyn dng b nht khng nm trong dy x
1
, x
2
, ..., x
n
.
Do (n + 1, n + 2) = 1 nn, theo nh l thng d Trung Hoa, tn ti s nguyn x ln hn
max {x
1
, x
2
, ..., x
n
} v tha mn
+
+
) 2 (mod
) 1 (mod
n s m x
n s x
vi s = x
1
+ x
2
+ ... + x
n
.
Khi , t x
n+1
= x, x
n + 2
= m
T ta c dy x
1
, x
2
, ..., x
n+1
, x
n + 2
tho mn
x
1
+ x
2
+ ... + x
n
+ x
n+1
= s + x n +1.
x
1
+ x
2
+ ... + x
n+1
+ x
n + 2
= s + x + n n + 2.
Do
x
1
+ x
2
+ ... + x
k
k vi mi k = 1, 2, ..., n + 2
C tip tc nh vy ta thu c dy s v hn tha mn yu cu bi ton.

67
II.4.3. Bi tp

Bi 1. Gii cc h phng trnh sau:
a)
) 7 (mod 3
) 11 (mod 1
x
x

b)
) 7 (mod 5
) 5 (mod 3
) 3 (mod 1
x
x
x

c)
) 11 (mod 3 7
) 8 (mod 2 5
) 12 (mod 1 5
x
x
x

Bi 2. (IMO 1989) Chng minh rng vi mi s t nhin n, lun tn ti n s t nhin lin
tip m c n s u khng phi lu tha ca mt s nguyn t.
Bi 3. (Hn Quc 1999) Tm tt c cc s t nhin n sao cho 2
n
- 1 chia ht cho 3 v tn
ti m Z sao cho 4m
2
+ 1 chia ht cho
3
1 2
n
.
Bi 4. Chng minh rng vi mi s nguyn dng k ln tu u tn ti k s nguyn
lin tip gm ton hp s.
Bi 5. Cho S = {a
1
, a
2
, ..., a
n
} Z. Chng minh rng tn ti mt s b Z sao cho tp
b.S = {ba
1
, ba
2
, ..., ba
n
} m mi phn t ca n u l lu tha ln hn 1 ca mt s
nguyn.
Bi 6. Cho f(x) l mt a thc vi h s nguyn. Gi s c mt tp hu hn cc s nguyn
t {p
1
, p
2
,..., p
n
} m vi mi n th u tn ti p
i
| f(n). Chng minh rng tn ti mt s
nguyn t p sao cho vi mi n th f(n) p.

68
Chng III
MT S VN KHC
III.1. Lu tha ca mt s nguyn
III.1.1 S chnh phng
III.1.1.1 nh ngha
S t nhin n c gi l mt s chnh phng nu tn ti m nguyn sao cho n = m
2
.
Nhn xt: Nu phn tch tiu chun n =
k
k
p p p

...
2 1
2 1
th:
+) n l s chnh phng khi v ch khi
i
chn vi mi i = 1, 2, ..., k.
+) n l lu tha s ca mt s nguyn khi v ch khi
i
s vi mi i = 1, 2, ..., k.
III.1.1.2 Cc v d
V d 1. Tm tt c cc s chnh phng c dng A = ab 1985
Li gii
Ta c
445
2
= 198025 < A < 198916 = 446
2

T suy ra khng c s chnh phng no tha mn yu cubi ton.
V d 2. Chng minh rng nu abc l s nguyn t th b
2
- 4ac khng phi l s chnh
phng.
Li gii
Gi s b
2
- 4ac l s chnh phng th
b
2
- 4ac = k
2
, k nguyn dng.
Ta c
ac ab a abc a 4 40 400 . 4
2
+ + =
= 400a
2
+ 40ab + b
2
- (b
2
- 4ac)
= (20a + b)
2
- k
2

= (20a + b + k)(20a + b - k)
V abc l s nguyn t nn c 0 ac > 0
Do
b > k 20a + b + k > 20a + b - k > 20a
T suy ra
n m
a
k b a k b a
abc .
4
) 20 )( 20 (
=
+ + +
=
69
M 20a + b + k v 20a + b - k u ln hn 4a nn m v n u ln hn 1
Nn abc l hp s, tri vi gi thit
V d 3. Chng minh rng mt s chnh phng lun c s c s nguyn dng l l v
ngc li mt s t nhin c s c nguyn dng l l th s phi l s chnh phng.
Li gii
a) Nu A l mt s chnh phng th phn tch tiu chun ca A l
n
k
n
k k
p p p A
2 2
2
2
1
...
2 1
=
T suy ra s c s nguyn dng ca A l
(2k
1
+ 1)(2k
2
+ 1)...(2k
n
+ 1) l s l.
b) Ngc li: Nu A c s c s l l
Xt phn tch tiu chun ca A

n
k
n
k k
p p p A ...
2 1
2 1
=
T suy ra s c s ca A l
(k
1
+ 1)(k
2
+ 1)...(k
n
+ 1) l s l
Do , tt c cc nhn t trn u l
Suy ra k
i
chn vi mi i = 1, 2, ..., n
T suy ra A l s chnh phng.
V d 4. (Romani - 2004) Tm tt c cc s khng m n sao cho tn ti hai s nguyn a
v b sao cho
n
2
= a + b v n
3
= a
2
+ b
2
.
Li gii
Ta c
2(a
2
+ b
2
) (a + b)
2
2n
3
n
4
0 n 2.
Nu n = 0, chn a = b = 0
Nu n = 1, chn c a = 1, b = 0.
Nu n = 2, chn c a = b = 2.
Vy n = 0, n = 1, n = 2 l cc gi tr cn tm.
V d 5. Chng minh rng nu 2n (n N
*
) l tng ca hai s chnh phng th n cng l
tng ca hai s chnh phng.
Li gii
Gi n l s t nhin tha mn
70
2n = a
2
+ b
2
vi a, b N. (1)
T (1) suy ra a v b cng tnh chn l
Do a +b v a - b l s chn
t
=
= +
y b a
x b a
2
2

Khi a = x + y v b = x - y
Thay vo (1) ta c
2n = (x + y)
2
+ (x - y)
2

n = x
2
+ y
2
.
V d 6. Cho a, b l hai s nguyn dng sao cho a
2
+ b
2
ab + 1.
Chng minh rng
1
2 2
+
+
ab
b a
l s chnh phng.
Li gii
t

1
2 2
+
+
=
ab
b a
k (1)
Khng mt tnh tng qut ta gi s a b.
Khi
(1) a
2
+ b
2
- kab - k = 0
a
2
- kb.a + b
2
- k = 0.(*)
Gi s rng k khng phi s chnh phng. Xt phng trnh
x
2
- 2bx + b
2
- k = 0 (3)
Ta c a l mt nghim ca (3), gi a
1
l mt nghim cn li
Khi
a + a
1
= kb
Do a, k, b nguyn nn suy ra a
1
cng l s nguyn.
+) Nu a
1
= 0 th k = b
2
, tri vi iu gi s.
+) Nu a
1
< 0, ta c
a
1
2
- kba
1
+ b
2
= k
M a
1
nguyn m nn a
1
2
-kba
1
+ b
2
> -kba
1
= (-a
1
b)k > k (v l)
71
+) Do o a
1
> 0 th
a.a
1
= b
2
- k a
1
= a
a
k b
<
2

Dt b
1
= b khi a + b > a
1
+ b
1
. ta c
a
1
2
- kb
1
a
1
+ b
1
2
- k = 0 (4)
Li xut pht t (4) suy ra phng trnh (3) c nghim t nhin mi (a
2
, b
2
) m
a
2
+ b
2
< a
1
+ b
1
.
T suy ra phng trnh hai bin (*) c v hn nghim t nhin tha mn
(a
1
, b
1
), (a
2
, b
2
), ... tha mn a
1
+ b
1
> a
2
+ b
2
> ...(v l)
Nn iu gi s l sai.
Vd 7. Tm n nguyn dng sao cho
A = 2
8
+ 2
11
+ 2
n

l mt s chnh phng.
Li gii
Nu A l s chnh phng th
2
8
+ 2
11
+ 2
n
= x
2
2
n
= (x - 48)(x + 48)
Vi x l mt s nguyn dng no .
Khi
x - 48 = 2
s
v x + 48 = 2
n - s
, n > 2s
T suy ra
2
n - s
- 2
s
= 96 2
s
(2
n - 2s
- 1) = 3.2
5
.
T suy ra
=
=
=
=
12
5
3 1 2
5
2
n
s s
s n

KL: n = 12.
V d 8. Chng minh rng
A = 1
k
+ 9
k
+ 19
k
+ 2013
k

khng phi s chnh phng vi mi k nguyn dng l.
Li gii
Vi mi k nguyn dng l, ta c
1
k
1 (mod 4)
72
9
k
1 (mod 4)
19
k
-1 (mod 4)
2013
k
1 (mod 4)
Nn A 2 (mod 4)
Vy A khng th l s chnh phng.
V d 9. Tm s t nhin n sao cho n - 50 v n + 50 u l s chnh phng.
Li gii
Ta c
= +
=
2
2
50
50
b n
a n

vi a, b nguyn dng v a > b.
Suy ra b
2
- a
2
= 100 (b - a)(b + a) = 2
2
.5
2
.
Do b - a < b + a v chng c cng tnh chn l nn a + b v b - a phi l cc s chn. Do

=
=
= +
=
26
24
50
2
b
a
a b
a b

T tm c n = 626.
V d 10. Chng minh rng vi mi s nguyn dng n th s
2 4
) 2 12 17 ( ) 2 12 17 (
n
n
+

l mt s nguyn v khng phi s chnh phng.
Li gii
Ta c
4
) 1 2 ( 2 12 17 + = + v
4
) 1 2 ( 2 12 17 =
Do
2 4
) 2 12 17 ( ) 2 12 17 (
n
n
+
=
2 2
) 1 2 ( ) 1 2 (
.
2
) 1 2 ( ) 1 2 (
2 2 2 2 n n n n
+ + +

t
2
) 1 2 ( ) 1 2 (
2 2 n n
A
+ +
= v
2 2
) 1 2 ( ) 1 2 (
2 2 n n
B
+
=
S dng nh thc Niutn ta suy ra
( 2 + 1)
2n
= x + y 2 v ( 2 - 1)
2n
= x - y 2
73
Vi x, y l cc s nguyn dng.
T suy ra
x A
n n
=
+ +
=
2
) 1 2 ( ) 1 2 (
2 2
v y B
n n
=
+
=
2 2
) 1 2 ( ) 1 2 (
2 2

Nn A.B l mt s nguyn dng.
Mt khc, ta li c
A
2
- 2B
2
= (A - B 2 )(A + B 2 ) = ( 2 +1)
2n
( 2 - 1)
2n
= 1
Do A v B nguyn t cng nhau.
Vy chng minh AB khng phi s chnh phng ta ch cn chng minh mt trong hai
s khng phi l s chnh phng.
Ta c
2
) 1 2 ( ) 1 2 (
2 2 n n
A
+ +
= =
| |
1
2
) 1 2 ( ) 1 2 (
2
+ +
n n

2
) 1 2 ( ) 1 2 (
2 2 n n
A
+ +
= =
| |
1
2
) 1 2 ( ) 1 2 (
2
+
+
n n

T d dng suy ra c A khng phi s chnh phng
Vy suy ra iu phi chng minh.
V d 11. (Polish - 2001) Cho a, b l cc s nguyn sao cho vi mi n th 2
n
a + b u l
s chnh phng. Chng minh rng a = 0.
Li gii
Gi s a 0.
Nu a 0, b = 0 th 2
1
a + b v 2
2
a + b khng th ng thi l s chnh phng.
Do a v b u phi khc 0.
T d dng suy ra c a v b u dng.
Xt hai dy s (x
n
) v (y
n
) nh sau
b a y b a x
n
n
n
n
+ = + =
+2
2 2 2
D thy (x
n
) v (y
n
) l hai dy s nguyn dng, n iu tng v hn.
Ta c
(x
n
+ y
n
)(x
n
- y
n
) = 3b
Suy ra 3b x
n
+ y
n
vi mi n 3b x
n
+ y
n
vi mi n (v l)
Vy iu gi s l sai
74
V d 12. Tm n nguyn dng sao cho
n
2
+ 3
n

l s chnh phng.
Li gii
Gi s
n
2
+ 3
n
= m
2

vi m l mt s nguyn dng no .
Ta c
(m - n)(m + n) = 3
n

T suy ra

= +
=
k n
k
n m
n m
3
3
(*)
M m +n > m - n nn n - 2k 1.
Nu n - 2k = 1
T (*) suy ra 2n = 3
n - k
- 3
k
= 3
k
(3
n - 2k
- 1) = 2.3
k

3
k
= n = 2k + 1 k = 0, k = 1.
T tm c n = 1, n = 3.
Nu n - 2k 2 k n - k - 2
T (*) suy ra 2n = 3
n - k
- 3
k
3
n - k
- 3
n - k - 2
= 8.3
n - k - 2

Theo bt ng thc Bernoulli ta c
8.3
n - k - 2
= 8.(1 + 2)
n - k - 2
8[1 + 2(n - k - 2)]
= 16n - 16k - 24.
Do
2n 16n - 16k - 24 8k + 12 7n .
M n - 2k 2 nn n 2k + 2 7n 14k + 14
T suy ra 8k + 12 14k + 14 v l v k 0.
KL: n = 1, n = 3.

75
III.1.2 Lp phng ca mt s nguyn
V d 1. Chng minh rng nu n l lp phng ca mt s nguyn (n -1) th
n
2
+ 3n + 3 khng th l lp phng ca mt s nguyn.
Li gii
n = 0 th n
2
+ 3n + 3 = 3 m
3
.
Gi s n
2
+ 3n + 3 = k
3
vi k l mt s nguyn no
V n l lp phng ca mt s nguyn nn
n(n
2
+ 3n + 3) = l
3

(n + 1)
3
- 1 = l
3

Vi n 0, n 1, n nguyn th 0 < 3n
2
+ 3n < 3n
2
+ 3n + 1
n
3
< n
3
+ 3n
2
+ 3n < n
3
+ 3n
2
+ 3n + 1
n
3
< n
3
+ 3n
2
+ 3n < (n + 1)
3

Do n
3
+ 3n
2
+ 3n khng th l lp phng ca mt s nguyn.
Vy iu gi s l sai
Do ta c iu phi chng minh.
V d 2. (Iran - 98)Chng minh rng khng c s t nhin no c dng abab trong h c
s 10 l lp phng ca mt s nguyn. Hy tm c s b nh nht sach trong h c s b,
c t nht mt s c dng abab l lp phng ca mt s nguyn.
Li gii
Ta c abab = 101ab l lp phng ca mt s nguyn th
101 | ab (v l)
Vy abab khng th l lp phng ca mt s nguyn.
Xt trong h c s b
Ta c
) )( 1 ( ) 1 (
2
) (
2
) ( b an n ab n abab n n + + = + =
vi a, b < n v n
2
+ 1 > an + b.
Nu n
2
+ 1 khng chia ht cho mt s chnh phng no th n
2
+ 1 = p
1
p
2
...p
k

Khi an + b phi chia ht cho (p
1
p
2
...p
k
)
2
v l
Vy n
2
+1 phi chia ht cho mt s chnh phng.
Th trc tip thy n = 7 l s nh nht nh vy (n
2
+ 1 = 50)
Mt khc thy 1000 2626 ) 7 ( = = 10
3
.
76
Do n = 7 chnh l s cn tm.
Vd 3. Cho x, y l cc s t nhin tha mn x
2
+ y
2
+ 6 chia ht cho xy.
Chng minh rng
xy
y x 6
2 2
+ +
l lp phng ca mt s t nhin.
Li gii
V x
2
+ y
2
+ 6 xy nn x
2
+ y
2
+ 6 = pxy (1)
Gi (x
0
, y
0
) l nghim ca (1) v tha mn x
0
+ y
0
nh nht.
Khng mt tnh tng qut, gi s x
0
y
0

Xt phng trnh
y
2
- px
0
y + x
0
2
+ 6 = 0 (2)
D thy y
0
l mt nghim ca (2). Gi y
1
l nghim cn li
Khi , theo Viet ta c
+ =
= +
6
2
0 1 0
0 1 0
x y y
px y y
(3)
D thy y
1
> 0 nn (x
0
, y
1
) cng l mt nghim nguyn dng ca (1)
Do
x
0
+ y
0
x
0
+ y
1
y
0
y
1

Nu x
0
= y
0
th t (1) ta c
2
0
0
2
0
2
0
6
2
6 2
x
x
x
x
p + =
+
= Z
x
0
= 1 p = 8 = 2
3

Nu x
0
< y
0

+) y
0
= y
1
th t (3) suy ra y
0
2
= x
0
2
+ 6
(y
0
- x
0
)(y
0
+ x
0
) = 6 (4)
M VT(4) 0 (mod 4) cn VP(4) 2 (mod 4) nn (4) khng xy ra
+) y
0
< y
1
nn x
0
< y
0
< y
1

Ta c y
0
x
0
+ 1 y
1
y
0
+ 1 x
0
+ 2 y
0
y
1
(x
0
+ 1)(x
0
+ 2)
x
0
2
+ 6 (x
0
+ 1)(x
0

+ 2)

3
4
0
x
V x
0
nguyn dng nn x
0
= 1
Do y
0
.y
1
= x
2
+ 6 = 7
77
Do tm c y
0
= 1, y
1
= 7 (khng tha mn iu kin x
0
< y
0
)
Vy ta c p = 8 = 2
3
(iu phi chng minh).
V d 4. Chng minh rng khng tn ti s t nhin n sao cho
2
n + 1
- 1 v 2
n - 1
(2
n
- 1)
ng thi l lp phng ca cc s nguyn.
Li gii
Gi s ngc li, tn ti n sao cho 2
n + 1
- 1 v 2
n - 1
(2
n
- 1) u l lp phng ca cc s
nguyn.
Khi
2
n - 1
(2
n
- 1) = k
3

M 2
n
- 1 khng chia ht cho 2 nn 2
n - 1
cng phi l lp phng ca mt s nguyn hay
n - 1 = 3m.
T suy ra
a
3
= 2
n +1
- 1 = 2
3m + 2
- 1 = 4.8
m
- 1 3(mod 7)
V l v a
3
0; 1 (mod 7)
V d 5. Chng minh rng vi mi s nguyn khng m n th
A = 2
n
+ 3
n
+ 5
n
+ 6
n

khng th l lp phng ca mt s nguyn.
Li gii
Ta c 2
6
3
6
5
6
6
6
1 (mod 7)
M n = 6k + r vi r = 0, 1, 2, 3, 4, 5
Nu r = 6k th
A 4 (mod 7) do A m
3
.
Nu n = 6k + 1 th
A = 2.(2
6
)
k
+ 3.(3
6
)
k
+ 5.(5
6
)
k
+ 6(6
6
)
k
2 + 3 + 5 + 6 2 (mod 7)
nn A m
3

Nu n = 6k + 2 th A 2
2
+ 3
2
+ 5
2
+ 6
2
4 (mod 7) nn A m
3

Nu n = 6k + 3 th A 2
3
+ 3
3
+ 5
3
+ 6
3
5 (mod 7) A m
3

Nu n = 6k + 4 th A 2
4
+ 3
4
+ 5
4
+ 6
4
2 (mod 7) A m
3

Nu n = 6k + 5 th A 2
5
+ 3
5
+ 5
5
+ 6
5
4 (mod 7) A m
3
.
78
III.1.3 Cc bi ton biu din mt s nguyn thnh tng cc lu
tha
V d 1. Chng minh rng nu
3
1
2
n
l tch ca hai s t nhin lin tip th n l tng
bnh phng ca hai s nguyn lin tip.
Li gii
Gi s n l s t nhin m
3
1
2
n
= a(a + 1) (1)
vi a l mt s t nhin no .
Ta c
(1) n
2
= 3a
2
+ 3a + 1
4n
2
= 12a
2
+ 12a + 4
(2n - 1)(2n + 1) = 3(2a + 1)
2
.
Do 2n - 1 v 2n + 1 l hai s l lin tip v (2n - 1, 2n + 1) = 1 nn

=
= +
= +
=
(**)
1 2
3 1 2
(*)
1 2
3 1 2
2
2
2
2
p n
m n
p n
m n

T (*) suy ra p
2
= 3m
2
+2 (v l v s chnh phng chia 3 ch d 0 v 1)
Do , ch c (**) xy ra.
T (**) suy ra m v p u l
t p = 2k + 1 ta c
2n = p
2
+ 1 = (2k +1)
2
+ 1 = 4k
2
+ 4k + 2
n = (k +1)
2
+ k
2
.
l iu phi chng minh.
V d 2. (Nga - 1996) Cho x, y, p, n, k l cc s t nhin tha mn
x
n
+ y
n
= p
k
. (1)
Chng minh rng nu n > 1, n l v p l mt s nguyn t l th n l mt lu tha ca p.
Li gii
t m = (x, y) th x = ma, y = mb vi (a, b) = 1.
Khi
79
(1) m
n
(a
n
+ b
n
) = p
k
. (2)
Do p nguyn t nn t (2) suy ra m = p
q

Do
(2) a
n
+ b
n
= p
k - nq
.
M n l nn
a
n
+ b
n
= (
a + b
)(a
n - 1
- a
n - 2
b + ... - ab
n - 2
+ b
n - 1
) (3)
= (a + b)A
Vi A = a
n - 1
- a
n - 2
b + ... - ab
n - 2
+ b
n - 1
.
V p l nn p > 2 suy ra hai s x v y khc tnh chn l nn t nht mt trong hai s a v b
phi ln hn 1.
Do a
n
+ b
n
> a+ b A > 1
M
A(a + b) = p
k - nq
> 1
Suy ra A v a + b u chia ht cho p
Hay a + b = p
r

T suy ra
A = a
n - 1
- a
n - 2
(p
r
- a) + ... - a(p
r
- a)
n - 2
+ (p
r
- a)
n - 1
= na
n - 1
+ Bp.
M A p na
n - 1
p
a + b p, (a, b) = 1 nn a khng chia ht cho p
Do n p n = mp
Thay vo (1) ta d dang suy ra c n = p
l
V d 3. Cho p l s nguyn t v a, n l cc s nguyn dng. Chng minh rng nu
2
p
+ 3
p
= a
n

th n = 1.
Li gii
Nu p = 2 th 2
p
+ 3
p
= 13 n = 1
Nu p > 2 p l
Ta c
2
p
+ 3
p
2
p
+ (-2)
p
(mod 5) 0 (mod 5)
Do a 5
Gi s n > 1.
80
Khi a
n
25 v
3 2
3 2
+
+
p p
5 2
p - 1
- 2
p - 2
.3 + ... + 3
p - 1
5
M
2
p - 1
- 2
p - 2
.3 + ... + 3
p - 1
p.2
p - 1
(mod 5)
suy ra p.2
p - 1
5 p = 5 (do p l s nguyn t)
M 2
5
+ 3
5
= 753 a
n
, ( vi n > 1)
Vy iu gi s l sai.

III.1.4. Bi tp
Bi 1. Tm cc hm s f: N N tho mn ng thi cc iu kin sau
i) f(2n) = f(n) + n
ii) f(n) l s chnh phng th n l s chnh phng
iii) f l hm tng nghim ngt.
Bi 2. Tm tt cc cc s nguyn dng n sao cho 2n + 1 v 3n + 1 u l s chnh
phng. Khi chng minh rng n chia ht cho 40.
Bi 3. Chng minh rng tng ca 3, 4, 5, hoc 6 s nguyn lin tip khng th l s chnh
phng.
Bi 4. (IMO 86) Cho d l mt s nguyn khc 2, 5, 13. Chng minh rng lun tm c
hai s nguyn a, b phn bit trong tp {2, 5, 13, d} sao cho ab - 1 khng phi s chnh
phng.
Bi 5. Tm tt c cc s nguyn dng n sao cho lu tha 4 ca s c ca n chnh bng
n.
Bi 6. Chng minh rng bnh phng ca mt s nguyn l lun c dng 8k + 1.
Bi 7. (Hungari 1998) Cho x, y, z l cc s nguyn v z > 1. Chng minh rng
(x + 1)
2
+ (x + 2)
2
+ ... (x + 99)
2
y
z
.
Bi 8. Chng minh rng vi mi s t nhin n th gia n
2
v (n + 1)
2
lun tn ti ba s t
nhin phn bit a, b, c sao cho a
2
+ b
2
c
2
.
Bi 9. Cho n l s t nhin c s c s t nhin l s. Chng minh rng tch tt c cc
c s bng
n s
n .
Bi 10. Tm tt c cc cp s nguyn dng x, y sao cho
(x + 1)
y
- 1 = x!
Bi 11. Tm cc s nguyn t p sao cho tn ti cc s nguyn dng n, x, y tha mn
x
3
+ y
3
= p
n
.
81
Bi 12. Cho n l s nguyn dng. Chng minh rng nu 2n+1 v 3n + 1 l cc s chnh
phng th 5n + 3 khng phi s nguyn t.
Bi 13. Cho a v b l hai s nguyn dng. S (36a + b)(a + 36b) c th l lu tha ca 2
c hay khng?
Bi 14. Cho tp A gm cc s nguyn dng v |A| > 3. Bit rng tch ba phn t bt k
ca A u l s chnh phng. Chng minh rng mi phn t ca A u l s chnh
phng.
Bi 15. Cho n l mt s nguyn dng sao cho 1 28 2
2
+ n l mt s nguyn. Chng
minh rng 2 + 1 28 2
2
+ n l mt s chnh phng.
Bi 16. Cho a, b, c l cc s nguyn dng sao cho
0 < a
2
+ b
2
- abc c
Chng minh rng a
2
+ b
2
- abc l mt s chnh phng.
Bi 17. Cho a v b l cc s nguyn dng sao cho a
2
+ b
2
chia ht cho ab + 1. Chng
minh rng
1
2 2
+
+
ab
b a

l mt s chnh phng.
Bi 18. Cho x, y, z l cc s nguyn dng.
Chng minh rng (xy + 1)(yz +1)(zx + 1) l cc s nguyn dng khi v ch khi xy + 1,
yz +1, zx + 1 u l s chnh phng.
Bi 19. Cho a v b l cc s nguyn sao cho vi mi s khng m n th 2
n
a = b u l s
chnh phng. Chng minh rng a = 0.
Bi 20. Cho p l mt s nguyn dng l. Chng minh rng tng cc lu tha bc p ca p
s nguyn lin tip chia ht cho p
2
.
Bi 21. Tm cc s nguyn dng n sao cho n.2
n
+ 3
n
chia ht cho 5.
Bi 22. Tm cc s nguyn dng n sao cho n.2
n
+ 3
n
chia ht cho 25.
Bi 23. Tm cc s t nhin n sao cho n
n + 1
+ (n + 1)
n
chia ht cho 5.
Bi 24. Tm cc s nguyn dng m, n, k ln hn 1 sao cho
1! + 2! +... + n! = m
k
.
Bi 25. Tm cc s nguyn t c dng 17 2
2002
+
n
(n l s t nhin) biu din di dng
hiu lp phng ca hai s t nhin.

82
III. 2. p dng t hp vo cc bi ton s hc
III.2.1. Mt s nh l c bn
III.2.1.1. Nh thc Newton
(a + b)
n
=
n
k
k k n k
n
b a C
0

vi a, b l cc s thc tu , n nguyn dng.
)! ( !
!
k n k
n
C
k
n
=
III.2.1.2. nh l
Cho p l mt s nguyn t. Khi

k
p
C p vi mi p = 1, 2, ..., p - 1.
Chng minh
Ta c
!
) 1 )...( 1 (
)! ( !
!
k
k p p p
k p k
p
C
p
n
+
=
=
Do p nguyn t v k {1, 2, ..., p -1} nn (p, k!) = 1
M C
p
k
nguyn nn (p-1)(p-2) ...(p - k + 1) k!
Hay
Z a
k
k p p p
=
+
!
) 1 )...( 2 )( 1 (

III.2.1.3 Mt s h thc c bn
1)
k n
n
k
n
C C

=
2)
1
1 1

+ =
k
n
k
n
k
n
C C C (H thc Pascal)
3)
(
+
(

= < < <
2
1
2
1
1 0
...
n
n
n
n n n
C C C C
4)
n n
n n n
C C C 2 ...
1 0
= + + +
5)
k
n m
i k
m
k
i
i
n
C C C
+
=
=
0
(H thc Vandermon)

III.2.2. Cc v d v bi tp

V d 1. Chng minh rng vi n l s nguyn dng l th tp
83
S = } C ,..., C , {C
2
1 - n
n
2
n
1
n

cha l cc s l.
Li gii
t
S
n
=
2
1
2 1
...

+ + +
n
n n n
C C C
Khi
2S
n
= 2 ...
1 0
+ + +
n
n n n
C C C = 2
n
- 2.
S
n
= 2
n - 1
- 1 l s l
Vy tp S phi cha l cc s l.
V d 2. (Trung Quc - 1998) Tm s t nhin n 3 sao cho
2
2000
1 + .
3 2 1
n n n
C C C + +
Li gii
Theo bi ta c
1 +
k
n n n
C C C 2
3 2 1
= + + (0 k 2000, k nguyn)

k
n n n
2
6
) 6 )( 1 (
2
=
+ +

(n + 1)(n
2
- n + 6) = 3.2
k + 1
t m = n + 1 (m 4)
Khi ta c
m(m
2
- 3m + 8) = 3.2
k + 1
.
Do , ch c th xy ra mt trong hai trng hp sau:
+) Trng hp 1: m = 2
s

Do m 4 nn s 2
m
2
- 3m + 8 = 2
2s
- 3.2
s
+ 8 = 3.2
k + 1 - s
.
Nu s 4 th 2
2s
- 3.2
s
+ 8 8 (mod 16).
8 3.2
k + l - s
(mod 16) 2
k + 1 - s
= 8 m
2
- 3m + 8 = 24
(khng c nghim nguyn)
Nu s = 2 m = 4 n = 3 (tha mn)
Nu s = 3 m = 8 n = 7 (tha mn)
+) Trng hp 2. m = 3.2
s

84
Lm tng t nh trn, ta tm c n = 23.
Vy n = 3, n = 7, n = 23 l nhng gi tr cn tm.
V d 3. Cho p l mt s nguyn t. Chng minh rng
) (mod 2
2
2
p C
p
p

Li gii
Theo h thc Vandermon, ta c
0 1 1 0
2
...
p
p
p
p
p p
p
p p
p
p
C C C C C C C + + + =

M
k
p
C p vi mi p = 1, 2, ..., p - 1.
Do
i p
p
i
p
C C

p
2
vi mi i = 1, 2, ..., p - 1
V d 3. (Hungari - 2001) Cho m, n l cc s nguyn dng v 1 m
n. Chng minh
rng
1
1
) 1 (
m
k
n
k
C n m.
Li gii
Ta c
) ( ) 1 ( ... ) ( ) (
) 1 ...(
1
1
2 1 2
1
1
1
1
1
0
1
0
1
1 1 2 1 0

+ + + + + =
+
m
n
m
n
m
n n n n n
m
n
m
n n n
C C C C C C C
C C C C

= (-1)
m - 1
1
1
m
n
C

Do
1
1
) 1 (
m
k
n
k
C n = (-1)
m - 1
n
1
1
m
n
C = (-1)
m-1
.m
m
n
C m.
T c iu phi chng minh.
V d 4. (VMO - 2011) Cho dy s nguyn (a
n
) xc nh bi
a
0
= 1, a
1
= - 1
a
n
= 6a
n - 1
+ 5a
n - 2
, vi n = 2, 3, ...
Chng minh rng a
2012
- 2010 chia ht cho 2011.
Li gii
D dng tm c s hng tng qut ca dy s l
85
14
) 14 3 )( 14 2 7 ( ) 14 3 )( 14 2 7 (
n n
n
a
+ + +
=
Do
14
) 14 3 )( 14 2 7 ( ) 14 3 )( 14 2 7 (
2012 2012
2012
+ + +
= a
Mt khc, theo khai trin Newton ta c
14 ) 14 .( 3 ) 14 3 (
2012
0
2012
2012
2012
B A C
k
k
k k
+ = = +

=

14 ) 14 .( 3 ) 1 ( ) 14 3 (
2012
0
2012
2012
2012
B A C
k
k
k k k
= =

=
.
Trong
. 14 ... 14 . 3 3
1006 2012
2012
2010 2
2012
2012 0
2012
C C C A + + + =
. 14 . 3 . ... 14 . 3 3
1005 2011
2012
2009 3
2012
2011 1
2012
C C C B + + + =
Do
14
) 14 )( 14 2 7 ( ) 14 )( 14 2 7 (
2012
B A B A
a
+ + +
=
a
2012
= A + 4B.
By gi ta ch cn chng minh A + 4B -1 (mod 2011)
Tht vy, ta c
1
2011 2011 2012

+ =
k k k
C C C vi mi k = 2, 3, ..., 2010
M 2011 l s nguyn t nn
k
C
2011
2011 vi mi k = 1, 2, ..., 2010.
T suy ra
k
C
2012
2011 vi mi k = 2, 3, ..., 2010.
Do A + 4B 3
2012
+ 14
1006
- 4(3
2011
+ 3.14
1005
) (mod 2011)
2. 14
1005
- 3
2011
(mod 2011)
M 3
2011
3 (mod 2011)
14
1005
2025
1005
(45
2
)
1005
45
2010
1 (mod 2011).
T suy ra A + 4B 2 - 3 (mod 2011) -1 (mod 2011)

86
III.2.3 Bi tp
Bi 1. Tm c chung ln nht ca
2005
2006
3
2006
1
2006
,..., , C C C .
Bi 2. (T7/245) Cho cc s t nhin m, n, p tha mn iu kin p m + n.
Chng minh rng
+
b
a i
i p
m
i
n
C C p b n m ! )! (
chia ht cho (m + n - a)!
Trong a = max {0, p - m}, b = min {p, n}.
Bi 3. Cho x
n
=
| |
n
) 15 4 ( +
, vi [x] l phn nguyn ca x, n l s t nhin.
Tm s d ca x
n
khi chia cho 8.
Bi 4. Chng minh rng s
=
1004
0
2 2008 2
2009
3 2
k
k k k
C S

l tng ca hai s chnh phng lin tip.
Bi 5. Chng minh rng vi mi s nguyn dng n ta c
) 1 (
2
+ n C
n
n

Bi

6. Tm cp s t nhin n, k sao cho
k n
n
n C ) 3 (
3
=
.
Bi 7. Cho m v n l cc s nguyn dng, m l. Chng minh rng
=

m
k
k k
m
m
n C
n
0
3
3
) 1 3 (
3 .
1

l mt s nguyn.
Bi 8. Chng minh rng vi mi s nguyn dng n th s
=
+
+
n
k
k k
n
C
0
3 1 2
1 2
2

khng chia ht cho 5.

87
III. 3 Tnh cht s hc ca dy s nguyn
Trong phn ny ti xin gii thiu cng bn c mt s tnh cht s hc c bn ca
dy s nguyn nh tnh chia ht, tnh chnh phng, tm s hng nguyn t, ... Tuy nhin,
phn su hn s c tc gi gii thiu trong chuyn tip theo, s vit ring v dy s
nguyn.
III.3.1. Tnh chia ht trong dy s nguyn.
V d 1. Cho dy s {u
n
} tha mn
= + + =
= =
+
,... 3 , 2 , 22 5 4
50 , 7
1 1
2 1
n u u u
u u
n n n

Chng minh rng u
1996
chia ht cho 1997.
Li gii
Xt dy {v
n
} tha mn v
n
= 4u
n
+ 11 khi
= + =
= =
+
,... 3 , 2 , 5 4
211 , 39
1 1
2 1
n v v v
v v
n n n

Da vo phng trnh c trng ca dy {v
n
} ta d dng xc nh c s hng tng qut
ca dy l
3
5 . 25 ) 1 ( 8
n n
n
v
+
=
Do
3
5 . 25 8
1996
1996
+
= v
V 1997 l s nguyn t nn theo nh li Fermat, ta c
5
1996
1 (mod 1997)
8 + 25.5
1996
8 + 25 (mod 1997) 33 (mod 1997).
3v
1996
33 (mod 1997).
M v
1996
= 4u
1996
+ 11 nn suy ra
12u
1996
+ 33

33 (mod 1997)
12u
1996
1997
Mt khc (12, 1997) = 1 nn u
1996
1997.
V d 2. Cho dy s {u
n
} xc nh nh sau
= =
= = =
+
,... 4 , 3 6 7
18 , 14 , 0
2 1 1
3 2 1
n u u u
u u u
n n n

88
Chng minh rng vi mi s nguyn t p th u
p
p.
Li gii
Theo cch xc nh dy s ta tm c s hng tng qut ca u
n
l
u
n
= 1 + 2
n
+ (-3)
n
.
Vi mi s nguyn t p th
2
p
2 (mod p) v (-3)
p
-3 (mod p)
Do
u
p
= 1 + 2
p
+ (-3)
p
1 + 2 + (-3) (mod p)
Hay u
p
p.
Nhn xt: Vi nhng dy s nguyn tuyn tnh c phng trnh c trng c nghim
nguyn th ta d dng s dng nh l Fermat trong chng minh chia ht. Cn vi nhng
dy nguyn tuyn tnh c phng trnh c trng c nghim v t th bao gi ta cng phi
s dng nh thc Newton chng minh chia ht.
V d 3. (VMO - 2011) Cho dy s nguyn (a
n
) xc nh bi
a
0
= 1, a
1
= - 1
a
n
= 6a
n - 1
+ 5a
n - 2
, vi n = 2, 3, ...
Chng minh rng a
2012
- 2010 chia ht cho 2011.
Li gii
D dng tm c s hng tng qut ca dy s l
14
) 14 3 )( 14 2 7 ( ) 14 3 )( 14 2 7 (
n n
n
a
+ + +
=
Do
14
) 14 3 )( 14 2 7 ( ) 14 3 )( 14 2 7 (
2012 2012
2012
+ + +
= a
Mt khc, theo khai trin Newton ta c
14 ) 14 .( 3 ) 14 3 (
2012
0
2012
2012
2012
B A C
k
k
k k
+ = = +

=

14 ) 14 .( 3 ) 1 ( ) 14 3 (
2012
0
2012
2012
2012
B A C
k
k
k k k
= =

=
.
Trong
. 14 ... 14 . 3 3
1006 2012
2012
2010 2
2012
2012 0
2012
C C C A + + + =
. 14 . 3 . ... 14 . 3 3
1005 2011
2012
2009 3
2012
2011 1
2012
C C C B + + + =
89
Do
14
) 14 )( 14 2 7 ( ) 14 )( 14 2 7 (
2012
B A B A
a
+ + +
=
a
2012
= A + 4B.
By gi ta ch cn chng minh A + 4B -1 (mod 2011)
Tht vy, ta c
1
2011 2011 2012

+ =
k k k
C C C vi mi k = 2, 3, ..., 2010
k
C
2011
2011 vi mi k = 1, 2, ..., 2010.
T suy ra
k
C
2012
2011 vi mi k = 2, 3, ..., 2010.
Do A + 4B 3
2012
+ 14
1006
- 4(3
2011
+ 3.14
1005
) (mod 2011)
2. 14
1005
- 3
2011
(mod 2011)
M 3
2011
3 (mod 2011)
14 l s chnh phng mod 2011 nn 14
1005
=
2
1 2011
14

1 (mod 2011).
T suy ra A + 4B 2 - 3 (mod 2011) -1 (mod 2011)
V d 4. Cho dy s {u
n
} c xc nh nh sau

= + =
= =
+
,... 3 , 2 , 2
6 , 2
1 1
2 1
n u u u
u u
n n n

Tm phn d ca u
1024
chia cho 1023.
Li gii
D dng tm c s hng tng qut ca dy {u
n
} l
n n
n
u ) 2 1 ( ) 2 1 ( + + =
Do
1024 1024
1024
) 2 1 ( ) 2 1 ( + + = u
Theo khai trin nh thc Newton, ta c
2 ) 2 1 ( , 2 ) 2 1 (
1024 1024
B A B A = + = +
Vi
1024
1024
512 4
1024
2 2
1024
0
1024
2 ... 2 2 C C C C A + + + + =
1023
1024
512 5
1024
2 3
1024
1
1024
2 ... 2 2 C C C C B + + + + =
90
Do u
1024
= 2A
Ta c
1
1023 1023 1024

+ =
k k k
C C C vi mi k = 2, 3, ..., 1022.
k
C
1023
1023
vi mi k = 1, 2, ..., 1022.
T suy ra
k
C
1024
1023 vi mi k = 2, 3, ..., 1022.
Nn
) 1023 (mod 2 2 2
1024
1024
513 0
1024
C C A +
2+2
513
(mod 1023).
Mt khc
2
10
1 (mod 1023) 2
513
= 8.(2
10
)
51
8 (mod 1023)
Do 2A 10 (mod 1023)
Vy phn d ca php chia u
1024
cho 1023 l 10.
Nhn xt: Vic s dng nh thc Newton rt c hiu qu i vi cc bi ton chng minh
mt s hng c th ca dy chia ht cho p. Tuy nhin n thng khng c tc dng i
vi vic chng minh trong dy s tn ti mt s hng ca dy chia ht cho p hoc tn ti
v hn s hng ca dy chia ht cho p. i vi nhng bi ton dng ny ta thng phi
chng minh dy s d ca u
n
cho p tun hon k t mt s hng no .
V d 5. Cho dy s {u
n
} c xcnh nh sau
= + =
= =
+
,... 3 , 2 , 1976 5 4
100 , 20
1 1
2 1
n u u u
u u
n n n

Chng minh rng tn ti t nht mt s hng ca dy chia ht cho 1996.
Li gii
Xt dy {v
n
} vi v
n
l phn d ca php chia u
n
cho 1996.
Hay v
n
u
n
(mod 1996), 0 v
n
1995.
D thy v
n+1
4v
n
+ 5v
n - 1
- 1976 (mod 1996)
Xt cc cp (v
1
, v
2
), (v
2
, v
3
), ..., (v
n
, v
n + 1
), ...
V dy {v
n
} l v hn m s cc cp (a, b) vi 0 a, b, 1995 l hu hn nn phi tn
ti hai s t nhin i, j (i > j) sao cho
=
=
+ + 1 1 j i
j i
v v
v v

Khi . Ta c
91
5(v
i - 1
- v
j - 1
) 5(v
i +1
- 4v
i
+ 1976 ) - 5(v
j+1
- 4v
j
+ 1996)
5(v
i+1
- v
j+1
) - 20(v
i
- v
j
) (mod 1996)
0 (mod 1996)
M (5, 1996) = 1 nn v
i - 1
- v
j - 1
0 (mod 1996)
V 0 v
i - 1
, v
j - 1
1995 nn v
i - 1
= v
j - 1

L lun tng t ta dn n v
i - 2
= v
j - 2

C tip tc nh vy ta s dn n
=
=
+
+
) ( 1 1
) ( 2 2
j i
j i
v v
v v

By gi ta s chng minh v
i - j
= 0
Tht vy, ta c
5v
i - j
v
i - j + 2
- 4v
i - j + 1
+ 1976 (mod 1996)
v
2
- 4v
1
+ 1976 (mod 1996)
u
2
- 4u
1
+ 1976 (mod 1996)
100 - 4.20 + 1976 (mod 1996)
0 (mod 1996).
V (5, 1996) = 1 nn v
i - j
0 (mod 1996)
Do u
i - j
0 (mod 1996)
Vy c iu phi chng minh.
V d 6. (Chn T Khoa hc t nhin - 2009)
Cho dy {a
n
} c xc nh
a
0
= 0, a
1
= 1, a
2
= 2, a
3
= 6
a
n + 4
= 2a
n + 3
+ a
n + 2
- 2a
n + 1
- a
n
, n = 0, 1, ...
a) Chng minh rng a
n
chia ht cho n vi mi n 1.
b) Chng minh rng dy s
)
`
n
a
n
, n = 1, 2, ... cha v s s hng chia ht cho
2009.
Li gii
a) Phng trnh c trng ca dy {a
n
} l
x
4
- 2x
3
- x
2
+ 2x +1

= 0
(x
2
- x - 1)
2
= 0
92

=
=
+
=
2
5 1
2
5 1
x
x

Khi s hng tng qut ca dy trn l
a
n
= c
1
n
+ c
2
n
+ n(c
3
n
+ c
4
n
)
D dng tm c
c
1
= c
2
= 0,
5
1
,
5
1
4 3
= = c c .
Do
)
5
1
5
1
(
n n
n
n a =
T suy ra
n
n
F
n
a
= vi {F
n
} l dy Fibonaci.
Do a
n
n vi mi n.
b) B sung vo dy {F
n
} mt s hng F
0
= 0 m ta vn gi c h thc
F
n +1
= F
n
+ F
n - 1
, n = 0, 1, ...
Xt dy {v
n
} vi v
n
l phn d ca php chia F
n
cho 2009.
Hay v
n
u
n
(mod 2009), 0 v
n
2008.
D thy v
n+1
v
n
+ v
n - 1
(mod 2009)
Xt cc cp (v
1
, v
2
), (v
2
, v
3
), ..., (v
n
, v
n + 1
), ...
V dy {v
n
} l v hn m s cc cp (a, b) vi 0
a, b 2008 l hu hn nn phi tn ti
hai s t nhin i, j (i > j) sao cho
=
=
+ + 1 1 j i
j i
v v
v v

Lm tng t v d 5, ta suy ra 0 = v
0
= v
i - j

v dy {v
n
} tun hon vi chu k (i - j).
Do v
k(i - j)
= 0 hay F
k(i - j)
0 (mod 2009)

93
III.3. 2. Dy s v s chnh phng

V d 1. Cho dy s {a
n
} c xc nh nh sau
= =
+
= =
+
,... 2 , 1 , ) 1 ((
2
3
1 , 0
1 1
1 0
n
a a a
a a
n n n n

Chng minh rng vi mi n th a
n
l s chnh phng.
Li gii
Ta s chng minh vi mi n th a
n
= F
n
2
, trong {F
n
} l dy Fibonaci
Tht vy
a
0
= 1 = F
0
2
, a
1
= 1 = F
1
2
, a
2
= 4 = F
2
2
.
Gi s a
k
= F
k
2
vi mi k
n
Khi
a
n

= F
n
2
, a
n - 1

= (F
n-1
)
2
, a
n - 2
= (F
n - 2
)
2

Theo cch xc nh dy {a
n
} ta c
a
n + 1
-3a
n
+ a
n - 1
= 2(-1)
n

a
n
- 3a
n - 1
+ a
n - 2
= 2(-1)
n - 1

T ta suy ra
a
n+1
- 2a
n
- 2a
n - 1
+ a
n - 2
= 0
a
n +1
= 2(F
n
)
2
+ 2(F
n - 1
)
2
- (F
n - 2
)
2

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

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

T suy ra diu phi chng minh.
V d 2. Cho dy s {a
n
} xc nh nh sau
= =
= =
+
,... 2 , 1 , 3
3 , 2
1 1
1 0
n a a a
a a
n n n

Tm n sao cho 5(a
n
- 2) l mt s chnh phng.
Li gii
D dng xc nh c s hng tng qut ca dy trn l
n n
n
a )
2
5 3
( )
2
5 3
(

+
+
=
Mt khc ta cng chng minh c ngay
94
a
2k
2 (mod 5) v a
2k + 1
3 (mod 5).
Do 5(a
n
- 2) l s chnh phng th a
n
- 2 5 n = 2k.
Khi
k k
k
a
2 2
2
)
2
5 3
( )
2
5 3
(

+
+
=
Khi
5(a
2k
- 2) =
2
)
2
5 3
( )
2
5 3
( 5
|
|
\
|

+
k k

Theo khai trin Newton ta c

k
k
k
k
B A B A
2
5
)
2
5 3
( ,
2
5
)
2
5 3
(

=
+
=
+

Vi
(
+ + + =
+ + + =
2
1
2
2 1
2
2
3 3 1 1
2 2
2
2
2
2 2 0
5 3 ... 5 . 3 3
5 . 3 ... 5 . 3 3
k k
k
k
k
k
k
k
k
k k
k
k
k
k
k
k
k
C C C B
C C C A

Khi
k
k
k k
c
B
. 5
2
5
)
2
5 3
( )
2
5 3
(
1
= =
vi c
k
l s hu t.
a
2k
- 2 = 5c
k
2
nguyn nn c
k
2
l s nguyn
M c
k
hu t nn c
k
Z
T suy ra 5(a
2k
- 2) = (5c
k
)
2
vi 5c
k
Z
Vy vi mi k th 5(a
2k
- 2) l s chnh phng.
V d 3. Cho dy s {a
n
} c xc nh nh sau
a
n
= 2
8
+ 2
11
+ 2
n
, n = 1, 2, ...
Tm n a
n
l mt s chnh phng.
Li gii
Ta c
a
n
= 2
8
+ 2
11
+ 2
n
= x
2

2
n
= (x - 48)(x + 48)
Vi x l mt s nguyn dng no .
Khi
x - 48 = 2
s
v x + 48 = 2
n - s
, n > 2s
T suy ra
95
2
n - s
- 2
s
= 96.
2
s
(2
n - 2s
- 1) = 3.2
5
.
T suy ra
=
=
=
=
12
5
3 1 2
5
2
n
s s
s n

Vy a
n
l s chnh phng khi v ch khi n = 12
V d 4. Cho dy s {a
n
} c xc nh nh sau
= + + =
= =
+
,... 3 , 2 ) 1 ( ) 2 (
3 , 1
1 1
2 1
n a n a n a
a a
n n n

Tm n a
n
l lu tha p ca mt s nguyn (p 2).
Li gii
Ta d dng chng minh c
a
n
= 1! + 2! + ... + n!
Trng hp 1: p = 2.
Ta c n! 10 vi mi n 5
Do , nu n 5 th a
n
1! + 2! + 3! + 4! (mod 10)
(1 + 2 + 6 + 24) (mod 10) 3 (mod 10)
T suy ra a
n
khng th l s chnh phng nu n 5.
Vi 1 n 4, th trc tip thy n = 1 v n = 3 tha mn.
Trng hp 2. n 3
Ta c a
1
= 1 = 1
p
vi mi p.
Vi n 2 th a
n
= 1! + 2! + 3! +...+ n! 3
Gi s a
n
= b
p
(p 3) u
n
27
Ta c 9! 27 nn k! 27 vi mi k 9.
Do
a
n
a
8
(mod 27) vi n 9.
M
a
8
= 1! + 2! + ... +8! = 46233 1(mod 27).
Nn a
n
khng chia ht cho 27 vi mi n 8 hay a
n
b
p
vi mi n 8.
Bng cch th trc tip k = 2, 3, ..., 7 thy khng c gi tr no tha mn.
Vy n = 1 l gi tr cn tm.
96
III.3.3. Dy s nguyn s nguyn t.

V d 1. Cho dy s {u
n
} c xc nh nh sau
u
n
= 3
n
- 2
n
- 1
Chng minh rng nu p l s nguyn t th u
p
42p.
Li gii
Ta c
u
p
= 3
p
2
p
1 = (3
p
- 3) (2
p
- 2) 0 (mod p). (1)
Mt khc
3
p
2
p
1 = (3
p
- 1) 2
p
2 (2)
M p > 7 p l
Do
3
p
2
p
1 - (-1)
p
1 0 (mod 3) (3)
By gi ta cn chng minh 3
p
2
p
1 7
Ta c
3
p
2
p
- 1

= 3.3
p-1
2
p
1
=
1 1
2 2
3.9 2 1 3.2 2 1
p p
p p

(mod 7)
=
1 1
2 2
2 2 2 1
p p
p
+
+
Do (p, 3) = 1 nn p = 3k + 1 hoc p = 3k + 2
Nu p = 3k + 1 th
1 1
2 2
2 2 2 1
p p
p
+
+ =
1 1
2 2
8 1 2 2 2 2 (mod7)
p p
k p p
+ +
+
1 1 1
2 2 2
2 (2 1) 2 (8 1) 0(mod7)
p p p
k
+ +
= =
Nu p = 3k + 2 ta chng minh tng t.
T suy ra pcm.
V d 2. [IMO - 2005] Cho dy s (a
n
) xc nh nh sau
a
n

= 2
n
+ 3
n
+ 6
n
1 vi n = 1, 2,
Tm s t nhin nguyn t cng nhau vi mi s hng ca dy trn.
Li gii
Ta s chng minh rng vi mi s nguyn t p u tn ti mt s hng a
n
chia ht cho p.
Tht vy, ta c a
2
= 2
2
+ 3
2
+ 6
2
1 = 48 chia ht cho 2 v 3.
97
Xt p 5
Ta c
(2, p) = 1; (3, p) = 1; (6, p) = 1
Do , t nh l Fermat suy ra
2
p 1
3
p 1
6
p 1
1 (mod p)
T d dng chng minh c 6a
p 2
p
M (p, 6) = 1 nn a
p 2
p
Do ch c s 1 l s t nhin duy nht nguyn t cng nhau vi mi s hng ca dy
(a
n
).

III.3.4 Bi tp
Bi 1. Cho x
1
, x
2
l nghim ca phng trnh
x
2
- 6x +1 = 0.
Chng minh rng vi mi n N th x
1
n
+ x
2
n
l mt s nguyn v khng chia ht cho 5.
Bi 2. Cho dy {u
n
} tha mn
,... 5 , 4 ,
8 6
24 , 2 , 1
3 2
2
2 1 3
2
1
3 2 1
=
=
= = =

n
u u
u u u u
u
u u u
n n
n n n n
n

Chng minh rng vi mi n th u
n
chia ht cho n.
Bi 3. (T6/254) Cho dy s {x
n
} xc nh nh sau:
=
= =
+
. 2 , 3 5
,
1
2
1
1 0
n x x x
b x a x
n n n

vi a, b l hai s nguyn cho trc. Chng minh rng dy s trn hoc khng c s hng
no chia ht cho 1997 hoc c v s s hng chia ht cho 1997.
Bi 4. (T6/255) Cho dy {a
n
} c xc nh nh sau
=
= =
+ + +
. 1 , 1994 75 30
96 , 1964
1
2
1 2
2 1
n a a a a a
a a
n n n n n

Chng minh rng khng tn ti s hng no ca dy l tng lu tha by ca ba s
nguyn.
Bi 5. Cho dy {u
n
} c xc nh bi:
+ =
= =
+ +
. 0 , 7 2
11 , 3
1 2
1 0
n u u u
u u
n n n

98
Tm cc s nguyn dng l a sao cho vi cc s nguyn dng m v n tu lun tm
c s nguyn dng k sao cho a u
k
n
chia ht cho 2
m
.
Bi 6. Cho dy {u
n
} c xc nh nh sau:
=
= =
+ +
0 , 1999
1
1 2
1 0
n u u u
u u
n n n

Tm cc s t nhin n sao cho u
n
l s nguyn t.
Bi 7. (Bulgari 1999) Cho {a
n
} l dy s nguyn tha mn
(n - 1)a
n + 1
= (n + 1)a
n
- 2(n - 1).
Bit rng a
1999

chia ht cho 2000. Tm s nguyn dng n 2 v n nh nht sao cho a
n
chia
ht cho 2000.
Bi 8.
Cho mt dy s gm 2n + 1 s nguyn dng lin tip sao cho tng bnh phng
ca n +1 hng u tin bng tng bnh phng ca n s hng cn li. Hi trong dy c
s 2001 khng?
Bi 9
. Cho dy {a
n
} xc nh nh sau
= + =
= =
+ +
,... 1 , 0 , 2
1 , 0
1 2
1 0
n a a a
a a
n n n

Chng minh rng a
n
chia ht cho 2
k
khi v ch khi n chia ht 2
k
, vi mi k nguyn khng
m.
Bi 10
. Cho dy s {u
n
} tha mn
+ =
= =
+ +
. 1 7 2
11 , 3
1 2
2 1
n u u u
u u
n n n

Tm s nguyn dng l a sao cho vi mi m, n nguyn dng tu lun tm c s
nguyn dng k sao cho
a u
k
n

chia ht cho 2
m
.
Bi 11. Cho dy {u
n
} c xc n nh sau
= =
= =
+ +
... , 1 , 0 , 1999
1 , 0
1 2
1 0
n u u u
u u
n n n

Tm cc s t nhin n sao cho u
n
l s nguyn t.

99
TI LIU THAM KHO
[1] ng Hng Thng, Nguyn Vn Ngc, V Kim Thu - NXBGD, 1997.
[2] Nguyn V Lng, Nguyn Ngc Thng, Nguyn Lu Sn, Phm Vn Hng -
NXB i Hc Quc Gia H Ni, 2006.
[3] Phan Huy Khi - Cc chuyn S hc - NXBGD, 2005.
[4] Nguyn Vn Mu, Trn nam Dng, ng Hng Thng, ng Huy Run -
NXBGD, 2008.
[5] Nguyn Sinh Nguyn, Nguyn Vn Nho, L Honh Ph - Tuyn tp cc bi d thi
Olimpiad Ton hc Quc t 1991 - 2001 - NXBGD, 2001.
[6] Titu Andreescu, Dorin Andrica, Zuming Feng - 104 Number theory problems from
the training of the USA IMO team - NXB Birkhauser, 2006.
[5] Tp ch Ton hc v tui tr
[6] Cc thi v ch cc nc.
[7] Cc ti liu trn mng Internet.

các chuyên đề số học

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

các chuyên đề số học

Uploaded by

Copyright:

Available Formats

Nguyn Vn Tho Chuyn S Hc - Phn I

khng th chia ht cho 9.

Z) c nghim nguyn. Chng minh

cng khng tho mn (1)

You might also like