Σ學習通 · W20D3 · 120 / 129
0 / 15
第 20 週 · 排列組合與概率 · 第 3 節

組合(從一堆裡選一組,nCr)

排列看「順序」,組合只看「選了誰」。這節用「做披薩」「選委員會」把組合講透:選 2 個 = 只挑出一組、不分先後。並導出 nCr = nPr ÷ r! 的由來,配滿圖例。

pick 2 of A B Corder: permAB BA AC CA BC CBvsgroup: combo{A,B} {A,C} {B,C}6 arrangements = 3 groupscombo = perm ÷ 2! = 3
▶ 第一關: 組合 = 只選不排(順序無關)
same 3 toppings P H MPHMPMHHPMHMPMPHMHP1 pizza6 orders → 1 combo (order ignored)
perms pair up into combosABBA{A,B}ACCA{A,C}BCCB{B,C}6 ÷ 2 = 3 groups
▶ 第二關: nCr 公式(先排再除 r!)
nPrarrange r÷r!dup=nCrnCr = n! ÷ ( r! (n−r)! )arrange first, then divide out repeats
5C2 step by step5 × 4 = 20÷ 2! = 220 ÷ 2 = 10= 10
nC0 = 1pick nonenC1 = npick onenCn = 1pick all
▶ 第三關: 對稱性 + 排列 vs 組合判斷
10 items: pick 8 = leave 2chosen 8left 210C8 = 10C2 = 45
does order matter?order?YES → permnPrNO → combonCr (÷ r!)
⚔ BOSS: 組合綜合(分類相乘 · 必選 · 至少)
pick 2 boys AND 2 girls4 boys → 24C2 = 6×3 girls → 23C2 = 36 × 3 = 18 teams