| English | 释义 | 拼音 |
|---|---|---|
| permutation/ˌpɜːmjuːˈteɪʃn/ | 排列 | pái liè |
| combination/ˌkɒmbɪˈneɪʃn/ | 组合 | zǔ hé |
| factorial/fækˈtɔːrɪəl/ | 阶乘 | jiē chéng |
| multiplication principle/ˌmʌltɪplɪˈkeɪʃn ˈprɪnsɪpl/ | 乘法原理 | chéng fǎ yuán lǐ |
How many ways to arrange a bookshelf?
- You have 10 books and want to choose 3 to display. How many ways? If order matters, it's a permutation 排列. If you just want any 3, it's a combination 组合.
- Counting techniques are the foundation of probability — and they appear everywhere, from lottery odds to password security.
排列或组合实验
在计数问题中选择顺序是否重要。
Permutations (order matters)
- A permutation is an arrangement where order matters: ${}^nP_r = \dfrac{n!}{(n-r)!}$.
- Example: arranging 3 books from 10: ${}^{10}P_3 = \dfrac{10!}{7!} = 10 \times 9 \times 8 = 720$.
Worked example. How many 3-letter codes can be made from 26 letters (no repeats)? ${}^{26}P_3 = 26 \times 25 \times 24 = 15\,600$.

Permutations: 3 books arrange in 3 × 2 × 1 = 6 different orders
在组合中,所选项目的顺序:
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
组合忽略顺序;排列计算顺序。
从 3 本书中选取 10 本在书架上排列,共有多少种排法?(¹⁰P₃)?
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
¹⁰P₃ = 10!/(10-3)! = 10!/7! = 10 × 9 × 8 = 720.
Combinations (order doesn't matter)
- A combination is a selection where order doesn't matter: ${}^nC_r = \dbinom{n}{r} = \dfrac{n!}{r!\,(n-r)!}$.
- Example: choosing 3 books from 10: ${}^{10}C_3 = \dfrac{10!}{3!\,7!} = \dfrac{720}{6} = 120$.
Permutation vs combination. Choosing a committee of 3 from 10 people is a combination (order doesn't matter). Choosing a president, vice-president, and secretary from 10 is a permutation (order matters — the roles are different).

Order matters for a permutation, but not for a combination
有多少种选择方法 2 来自 5 (⁵C₂)?
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
⁵C₂ = 5!/(2!3!) = 120/(2×6) = 10.
⁵P₃ 大于 ⁵C₃。
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
⁵P₃ = 60(顺序重要),⁵C₃ = 10(顺序不重要)。排列数总是 ≥ 组合数。
Arrangements with repeats
- To arrange a word with repeated letters, divide by the factorial 阶乘 of each repeat count.
- Example: NEEDLESS has 8 letters with 3 E's and 2 S's: arrangements $= \dfrac{8!}{3!\,2!} = \dfrac{40320}{12} = 3360$.
NEEDLESS 字母的排列有多少种?(8 个字母:E×3, S×2 → 8!/(3!2!))
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
8!/(3!2!) = 40320/(6×2) = 40320/12 = 3360.
The multiplication principle 乘法原理
- If one choice can be made in $m$ ways and another in $n$ ways, both together can be made in $m \times n$ ways.
- Example: 3 shirts and 4 trousers → $3 \times 4 = 12$ outfits.
你有 3 件衬衫和 4 条裤子。可以搭配出多少套服装?
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
3 × 4 = 12 套(乘法原理)。
You've got it
- permutation (order matters): ${}^nP_r = \dfrac{n!}{(n-r)!}$
- combination (order doesn't): ${}^nC_r = \dfrac{n!}{r!(n-r)!}$
- repeated letters: divide $n!$ by each repeat's factorial (NEEDLESS → $\dfrac{8!}{3!\,2!}$)
Write from the data given
- Eight distinct letters are available and two are chosen.
- Find the permutation count and the combination count.
从8个不同的字母中,可以选出多少个有序对和无序对?
8乘以7等于56,且每个无序对被计算了两次。
有多少个无序对?
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
8 C 2等于28。