TS.

Trn Vn Hoi

2008-2009

T hp & Php m (Combinatorics & Counting)

T hp & Php m (Combinatorics & Counting)

Page 1

TS. Trn Vn Hoi

2008-2009

L thuyt t hp
Combinatorics l mt ngnh ton hc nghin cu s lit k, t hp, v hon v ca tp nhng phn t nhng mi quan h ton hc.
(Concise Encyclopedia of Mathematics)

Combinatorics bao gm m m cc i tng tha iu kin (enumerative combinatorics) Quyt nh khi no iu kin tha, xy dng v phn tch cc i tng tha iu kin (combinatorial designs and matroid theory) Tm ln nht, nh nht, ti u (combinatorial optimization)
(en.wikipedia.org)
T hp & Php m (Combinatorics & Counting) Page 2

TS. Trn Vn Hoi

2008-2009

ng dng ca l thuyt t hp
L thuyt phc tp ca thut ton L thuyt ti u ri rc L thuyt xc sut Vt l thng k Hnh hc

T hp & Php m (Combinatorics & Counting)

Page 3

TS. Trn Vn Hoi

2008-2009

Nhng quy tc m c bn
Rt nhiu bi ton m c th thc hin ch dng 2 quy tc c bn: cng (sum) v nhn (product). C nhng quy tc m nng cao khc

Lit k cc kh nng thi mt lng tin vi mt tp cc loi tin xc nh m bao nhiu mt khu (password) c th c vi mt chiu di cho trc m c bao nhiu a ch Internet

T hp & Php m (Combinatorics & Counting)

Page 4

TS. Trn Vn Hoi

2008-2009

Bao nhiu cch chn ?

Hp dn m ang Chn ai y?!?! M ch c 1 m thi :-(

T hp & Php m (Combinatorics & Counting)

Page 5

TS. Trn Vn Hoi

2008-2009

Quy tc cng
V d: Hoc l 1 ging vin ca khoa KH&KT MT, hoc l 1 sinh vin ca khoa KH&KT MT s l i din ca trng. Nh vy nu c 24 ging vin, 310 sinh vin th c bao nhiu cch chn la i din ? Li gii: Chn i din t ging vin th c 24 cch, chn i din t sinh vin th c 310 cch. Nh vy ta c 24+310=334 cch chn i din.

T hp & Php m (Combinatorics & Counting)

Page 6

TS. Trn Vn Hoi

2008-2009

Quy tc cng
V d: Hoc l 1 ging vin ca khoa KH&KT MT, hoc l 1 sinh vin ca khoa KH&KT MT s l i din ca trng. Nh vy nu c 24 ging vin, 310 sinh vin th c bao nhiu cch chn la i din ? Li gii: Chn i din t ging vin th c 24 cch, chn i din t sinh vin th c 310 cch. Nh vy ta c 24+310=334 cch chn i din.

Gi thit cng vic 1 c th lm bng n1 cch, cng vic 2 c th lm bng n2 cch. Nu 2 cng vic khng th lm ng thi th c n1 + n2 cch lm mt trong 2 cng vic.
T hp & Php m (Combinatorics & Counting) Page 7

TS. Trn Vn Hoi

2008-2009

Tng qut ha quy tc cng

Tng qut ln m cng vic khng th lm ng thi v s cch lm chng tng ng l n1, n2 , . . . , nm . S cch lm mt trong m cng vic l m i=1 ni .

V d: Mt sinh vin chn n mn hc trong 5 nhm: khoa hc my tnh, c s d liu, cng ngh phn mm, h thng & mng my tnh, k thut my tnh. Mi nhm c s lng ti tng ng l: 10, 15, 14, 16, 11. C bao nhiu cch chn ? Li gii: 10+15+14+16+11 = 66 cch

T hp & Php m (Combinatorics & Counting)

Page 8

TS. Trn Vn Hoi

2008-2009

Gc nhn tp hp
Gi thit A1, A2 , . . . , Am l cc tp hp ri nhau (disjoint). Khi s cch chn mt phn t t mt trong cc tp chnh l |A1 A2 . . . Am| = |A1 | + |A2| + . . . + |Am |

T hp & Php m (Combinatorics & Counting)

Page 9

TS. Trn Vn Hoi

2008-2009

Chn nh no y ?

Mc tiu Chn nh no y ?!?! M ch 1 nh thi :-(

T hp & Php m (Combinatorics & Counting)

Page 10

TS. Trn Vn Hoi

2008-2009

Quy tc nhn
V d: Mt trung tm my tnh c 32 my vi tnh. Mt my c 12 cng. Nh vy trung tm c bao nhiu cng ? Li gii: Qu trnh gm 2 bc 1. Chn my 2. Chn cng ca my c chn D thy, s cch l 32 12 = 384 cng.

Gi s mt nhim v c tch lm 2 vic: vic 1 lm bng n1 cch, vic 2 lm n2 cch khi vic 1 c lm. Khi s c n1 n2 cch thc hin nhim v ny.
T hp & Php m (Combinatorics & Counting) Page 11

TS. Trn Vn Hoi

2008-2009

Tng qut quy tc nhn

Gi thit mt nhim v c m cng vic phi thc hin T1, . . . , Tm. Nu vic Ti c ni cch thc hin. Khi ta c n1 . . . nm cch thc hin nhim v.

V d: C bao nhiu xu nh phn c di 7 ? Li gii: Mi bit c th chn 1 trong 2 cch: 0 v 1. Quy tc nhn cho s lng xu l 27 = 128. V d: C bao nhiu hm n nh xc nh trn tp hu hn A c m phn t v nhn gi tr trn tp B c n phn t ?

T hp & Php m (Combinatorics & Counting)

Page 12

TS. Trn Vn Hoi

2008-2009

Phi hp 2 quy tc
V d: Mt khu my tnh di t 6 8 k t. Mi k t c th l s hoc ch hoa. Mi mt khu phi c t nht mt ch s. C bao nhiu mt khu ? Li gii: Gi P1 , P2 , P 3 l tng s mt khu c chiu di tng ng l 6, 7, 8. Dng quy tc nhn tnh Pi ta c P6 = (10 + 26)6 266 P7 = (10 + 26)7 267 P8 = (10 + 26)8 268 Dng quy tc cng ta c tng s mt khu P = P6 + P7 + P8 = 366 + 367 + 368 (266 + 267 + 268 )

T hp & Php m (Combinatorics & Counting)

Page 13

TS. Trn Vn Hoi

2008-2009

Quy tc b tr
V d: C bao nhiu chui bit c di 8 bit hoc c bt u bng 1 hoc kt thc bng 2 bit 00 ? Li gii: S lng chui bit bt u bng 1 l 27 = 128 S lng chui bit kt thc bng 00 l 26 = 64 S lng chui bit bt u bng 1 v kt thc bng 00 l 25 = 32 S lng chui bit tha bi l 128 + 64 32 = 160.

V d: C bao nhiu chui bit c di 8 bit hoc c bt u bng 01 hoc c bt u bng 10 ?

T hp & Php m (Combinatorics & Counting)

Page 14

TS. Trn Vn Hoi

2008-2009

Gc nhn tp hp
Cho A1 v A2 l cc tp hp. T1 l cng vic chn 1 phn t t A1, T2 l cng vic chn 1 phn t t A2 .  |A1 | cch lm T1, |A2 | cch lm T2  S cch lm T1 hoc T2 l |A1 A2| = |A1| + |A2| |A1 A2| T1 v T2 c th lm ng thi

T hp & Php m (Combinatorics & Counting)

Page 15

TS. Trn Vn Hoi

2008-2009

Gin cy
Gin cy gii bi ton m:  Nhnh: i din nhng kh nng c th c
1 0 1 0 1 0 0 1 0 0 0 0

V d: C bao nhiu chui nh phn di 4 bit khng c 2 s 1 lin tip ?

0 0 1

 L: l nhng kt qu c th c
Bit 1

Bit 2

Bit 3

Bit 4

T hp & Php m (Combinatorics & Counting)

Page 16

TS. Trn Vn Hoi

2008-2009

Nguyn l lng chim b cu (Pigeonhole principle)

Nu c k + 1 hoc nhiu hn vt c t vo trong k hp th c t nht mt hp cha 2 hoc nhiu hn 2 vt

V d: C 109 sinh vin v thang im c 110 bc th c t nht 2 sinh vin cng im thi.

T hp & Php m (Combinatorics & Counting)

Page 17

TS. Trn Vn Hoi

2008-2009

Nguyn l Dirichlet tng qut

Nu c N vt c t vo trong k hp, s tn ti mt hp cha t nht N/k vt.

V d: Trong 100 ngi c t nht 100/12 = 9 ngi cng thng sinh. V d: Xt 1 thng 30 ngy. Mt i bng chi t nht 1 ngy 1 trn, nhng c thng khng qu 45 trn. Hy ch ra rng c nhng ngy lin tip i bng chi tt c 14 trn.

T hp & Php m (Combinatorics & Counting)

Page 18

TS. Trn Vn Hoi

2008-2009

Hon v v chnh hp
V d: Bao nhiu cch chn 22 cu th tham d i tuyn bng Vit Nam t danh sch 30 cu th c ? Bao nhiu cch chn ra mt danh sch c th t 11 cu th thi u ?

 Hon v ca 1 tp cc i tng = 1 cch sp xp cc i tng  Mt cch sp xp c th t r phn t ca tp n phn t c gi l chnh hp chp r ca tp n phn t n! P (n, r) = n(n 1)(n 2) . . . (n r + 1) = (n r)!
T hp & Php m (Combinatorics & Counting) Page 19

TS. Trn Vn Hoi

2008-2009

V d hon v v chnh hp
V d: Bao nhiu cch chn 22 cu th tham d i tuyn bng Vit Nam t danh sch 30 cu th c ? Bao nhiu cch chn ra mt danh sch c th t 11 cu th thi u ? Li gii: C P (22, 11) cch chn danh sch c th t 11 cu th t 22 cu th trong i.

V d: Mt thng nhn i qua 6 tnh bun bn v ch qua mt tnh mt v ch mt ln duy nht m thi. Sau thng nhn quay v tnh xut pht. Hi c bao nhiu l trnh ?

T hp & Php m (Combinatorics & Counting)

Page 20

TS. Trn Vn Hoi

2008-2009

T hp
Mt t hp chp r ca mt tp hp vi bn s n l mt cch chn khng c th t r phn t ca tp cho n! C (n, r) = r!(n r)!

H qu d thy C (n, r) = C (n, n r)

V d: C C (30, 22) cch chn ra 22 cu th t danh sch c 30 cu th.

T hp & Php m (Combinatorics & Counting) Page 21

TS. Trn Vn Hoi

2008-2009

Mt s nh l
Hng ng thc Pascal C (n + 1, k ) = C (n, k 1) + C (n, k ) Hng ng thc Vandermonde
r

C (m + n, r) =
k =0

C (m, r l)C (n, k )

nh l nh thc
n

(x + y )n =
j =0
T hp & Php m (Combinatorics & Counting)

C (n, j )xnj y j

Page 22

TS. Trn Vn Hoi

2008-2009

Hon v c lp
V d: T bng ch ci ting Anh c th to ra bao nhiu chui c di n ? Li gii: 26n (dng quy tc nhn)

C s tng t nh chnh hp (c th t), nhng cho php s lp li ca cc ch ci. S cc chnh hp lp chp r t tp n phn t bng nr

T hp & Php m (Combinatorics & Counting)

Page 23

TS. Trn Vn Hoi

2008-2009

T hp lp
V d: Bao nhiu cch by mm 5 qu nu ch chn cc loi qu: da, u , xoi ? Li gii: Lit k ra 21 trng hp

S t hp lp chp r ca n phn t bng C (n + r 1, r)

T hp & Php m (Combinatorics & Counting)

Page 24

TS. Trn Vn Hoi

2008-2009

V d: Phng trnh x1 + x2 + x3 = 11 c bao nhiu nghim nguyn khng m ? Li gii: Mi nghim tng ng vi mt cch chn 11 phn t ca 1 tp c 3 loi sao cho c x1 phn t loi 1, x2 phn t loi 2, x3 phn t loi 3. Suy ra s nghim l t hp lp chp 11 t tp 3 phn t C (3 + 11 1, 11) = C (13, 11) = 78

T hp & Php m (Combinatorics & Counting)

Page 25

TS. Trn Vn Hoi

2008-2009

Hon v c phn t ging nhau

V d: C bao nhiu chui khc nhau bng cch sp xp li cc ch ci SUCCESS ? Li gii: Khng th l hon v ca 7 ch ci v c s lp li. 3 ch S, 2 ch C, 1 ch U, 1 ch E C C (7, 3) cch chn ch cho 3 ch ci S. C C (4, 2) cch chn ch cho 2 ch ci C. C C (2, 1) cch chn ch cho 1 ch U. C C (1, 1) cch chn ch cho 1 ch E. Theo quy tc nhn ta c s chui l: 7!4!2!1! C (7, 3)C (4, 2)C (2, 1)C (1, 1) = 3!4!2!2!1!1!1!0! 7! = 3!2!1!1! = 420
T hp & Php m (Combinatorics & Counting) Page 26

TS. Trn Vn Hoi

2008-2009

Hon v c phn t ging nhau

Tng qut ha n phn t c n1 thuc loi 1, ..., nk phn t thuc loi k . S hon v l n! n1 ! . . . nk !

T hp & Php m (Combinatorics & Counting)

Page 27

TS. Trn Vn Hoi

2008-2009

Phn b vt vo hp
n vt khc nhau, b vo trong k hp sao cho c n1 vt trong hp 1, ..., nk vt trong hp nk . S cch l n! n1 ! . . . nk !

T hp & Php m (Combinatorics & Counting)

Page 28