📚 Permutations and Combinations | 排列与组合
Permutations and combinations form the core of counting theory, essential for solving problems in probability, statistics, and discrete mathematics. In Edexcel A‑Level Mathematics, mastering these concepts allows you to calculate the number of possible arrangements or selections without listing every outcome. This article will guide you through the fundamental principles, formulae, and real‑world applications, while highlighting common pitfalls and examiner tips.
排列与组合是计数理论的核心，对于解决概率、统计和离散数学中的问题至关重要。在Edexcel A‑Level数学中，掌握这些概念能够让你无需逐一列举结果，就能计算可能的排列或选择数量。本文将引导你了解基本原理、公式及实际应用，同时指出常见错误和应试技巧。
1. Introduction to Counting Principles | 计数原理导论
Counting is not simply tallying; it is built on structured principles. The fundamental counting principle (multiplication rule) states that if one task can be performed in m ways and a second independent task in n ways, then the total number of ways to perform both tasks in sequence is m × n. This idea extends naturally to any number of tasks.
计数并非仅仅是点查数目，而是建立在结构化的原理之上。基本计数原理（乘法法则）指出，若一项任务能以 m 种方式完成，另一项独立任务能以 n 种方式完成，那么按顺序完成这两项任务的总方式数为 m × n。这一概念自然推广至任意数量的任务。
main course from 4 options and a dessert from 3 options, there are 4 × 3 = 12 possible two‑course meals. Similarly, a combination lock with 3 dials, each having digits 0‑9, yields 10 × 10 × 10 = 1000 possible codes.
例如，从4种主菜和3种甜点中各选一种，共有 4 × 3 = 12 种套餐组合。同样，一把带有3个转盘的密码锁，每个转盘有数字0‑9，则共有 10 × 10 × 10 = 1000 种可能的密码。
It is crucial to identify whether events are independent (one outcome does not affect the next) and whether order matters – this distinction leads directly to permutations and combinations.
关键在于识别事件是否独立（一个结果不影响下一个），以及顺序是否重要——这一区别直接引出排列与组合的概念。
2. Factorial Notation | 阶乘记法
Factorial notation provides a compact way of writing products of decreasing positive integers. The factorial of a positive integer n, denoted n!, is defined as n! = n × (n − 1) × (n − 2) × … × 3 × 2 × 1. By convention, 0! = 1.
阶乘记号提供了一种书写依次递减的正整数乘积的简洁方式。正整数 n 的阶乘，记作 n!，定义为 n! = n × (n − 1) × (n − 2) × … × 3 × 2 × 1。按惯例，0! = 1。
5! = 5 × 4 × 3 × 2 × 1 = 120
Factorials grow extremely fast. While 5! = 120, 10! 800. This rapid growth highlights why direct listing becomes impractical even for moderate n, making factorial‑based formulae indispensable.
阶乘增长极快。5! = 120 时，10! 已经达到 3,628,800。这种快速增长凸显了为何即使对中等大小的 n，直接列举也变得不切实际，从而使得基于阶乘的公式不可或缺。
You will frequently encounter factorial ratios such as n! / (n − r)!, which simplifies to n × (n − 1) × … × (n − r + 1). Being comfortable cancelling factorials is essential for efficient calculation.
你会经常遇到诸如 n! / (n − r)! 的阶乘比值，它可简化为 n × (n − 1) × … × (n − r + 1)。熟练地对阶乘进行约分，对高效计算至关重要。
3. Permutations (Order Matters) | 排列（顺序重要）
A permutation is an arrangement of objects in a specific order. The number of permutations of n distinct objects taken r at a time is denoted by P(n, r) or nPr, and is given by the formula:
排列是指将对象按特定顺序加以安排。从 n 个不同对象中取出 r 个进行排列的数目记作 P(n, r) 或 nPr，公式为：
P(n, r) = n! / (n − r)!
Think of filling r positions. The first position can be filled in n ways, the second in (n−1) ways, down to the r‑th in (n−r+1) ways. Multiplying these yields the same product as the factorial formula.
设想依次填充 r 个位置。第一个位置有 n 种填充方式，第二个有 (n−1) 种，直至第 r 个有 (n−r+1) 种方式。将这些相乘，便得到与阶乘公式相同的乘积。
For example, how many 3‑letter codes can be formed from the letters A, B, C, D, E without repetition? Here n=5, r=3, so P(5,3) = 5! / 2! = 5 × 4 × 3 = 60. Notice the order ABC is different from ACB.
例如，从字母 A、B、C、D、E 中可组成多少个无重复的3字母代码？这里 n=5, r=3，故 P(5,3) = 5! / 2! = 5 × 4 × 3 = 60。请注意顺序 ABC 与 ACB 是不同的。
4. Permutations of n Distinct Objects | n 个不同对象的全排列
When r = n, we arrange all objects. The number of permutations of n distinct objects is simply n!. This follows from P(n, n) = n! / 0! = n!.
当 r = n 时，我们对所有对象进行排列。n 个不同对象的排列数就是 n!。这源自 P(n, n) = n! / 0! = n!。
For instance, arranging the letters of the word 'MATHS' yields 5! rrangement is a distinct permutation. If the word contained repeated letters, the count would reduce, as we will see later.
例如，排列单词 'MATHS' 中的字母可得到 5! = 120 种不同的序列。每一种重新排列都构成一个不同的排列。如果单词中包含重复字母，计数将会减少，我们稍后会看到。
Permutations are used in problems involving ordering, ranking, seating arrangements, and race outcomes. Always check whether items are distinct; identical items require a different treatment.
排列用于涉及顺序、排名、座位安排以及比赛结果的问题。务必检查物品是否互异；相同物品需要不同的处理方法。
5. Permutations with Restrictions and Repeated Items | 带限制及有重复元素的排列
xample, how many ways can 5 people sit in a row if two particular people must sit together? Treat the pair as a single 'block' – we then arrange 4 items (the block plus 3 others) in 4! ways, and multiply by 2! for the internal arrangement of the pair, giving 4! × 2! = 48.
经常会对某些位置施加约束。例如，5个人坐成一排，若特定两人必须相邻，有多少种坐法？将这对人视为一个“整体”——然后对4个物件（该整体加上其他3人）进行排列，有4!种方式，再乘以该对二人内部的2!种排列，得到 4! × 2! = 48。
When items are repeated, permutations are fewer. If there are n items with n₁ identical of one type, n₂ identical of another type, etc., the number of distinct permutations is:
当有重复元素时，排列数会更少。若有 n 个物品，其中一类有 n₁ 个相同，另一类有 n₂ 个相同，依此类推，则不同排列的数目为：
n! / (n₁! × n₂! × …)
Thus, the letters of 'MISSISSIPPI' can be arranged in 11! / (4! × 4! × 2!) ways, accounting for the four I's, four S's and two P's.
因此，单词 'MISSISSIPPI' 中的字母可按 11! / (4! × 4! × 2!) 种方式排列，其中分母的 4!、4! 和 2! 分别对应四个 I、四个 S 和两个 P。
6. Combinations (Order Does Not Matter) | 组合（顺序无关）
A combination is a selection of objects without regard to order. The number of ways to choose r objects from n distinct objects is denoted C(n, r), nCr, or (ⁿᵣ), and is given by:
组合是指不考虑顺序而选取对象。从 n 个不同对象中选出 r 个的方式数目，记作 C(n, r)、nCr 或 (ⁿᵣ)，公式为：
C(n, r) = n! / (r! (n − r)!)
Notice how C(n, r) differs from P(n, r) by an extra r! in the denominator, which removes the arrangements of the chosen items. This reflects the fact that each selection of r items corresponds to r! permutations.
注意 C(n, r) 与 P(n, r) 的区别在于分母多了一个 r!，它去掉了所选元素的排列效应。这反映了每一组 r 个元素的选取均对应 r! 种排列。
For example, selecting a 3‑person committee from 10 candidates yields C(10,3) = 10! / (3! × 7! 20 ways. Here, the committee {Alice, Bob, Carol} is identical regardless of listing order.
例如，从10位候选人中选出3人委员会，共有 C(10,3) = 10! / (3! × 7!) = 120 种方式。此处，委员会{Alice, Bob, Carol}不论列出顺序如何，都是相同的。
7. Combination Formula and Properties | 组合公式及其性质
The binomial coefficient C(n, r) satisfies several important identities. Symmetry property: C(n, r) = C(n, n − r), because choosing r items is equivalent to leaving out n − r items.
二项式系数 C(n, r) 满足若干重要恒等式。对称性质：C(n, r) = C(n, n − r)，因为选出 r 个物品等价于留下 n − r 个物品。
Also, C(n, 0) = C(n, n) = 1. Pascal’s rule states that C(n, r) = C(n−1, r−1) + C(n−1, r), which is the basis for Pascal’s triangle. These relationships speed up manual calculations and appear frequently in proof questions.
此外，C(n, 0) = C(n, n) = 1。帕斯卡法则指出 C(n, r) = C(n−1, r−1) + C(n−1, r)，这是帕斯卡三角形的基础。这些关系能加快手工计算速度，并频繁出现在证明题中。
| r | C(5, r) | C(6, r) |
|---|---|---|
| 0 | 1 | 1 |
| 1 | 5 | 6 |
| 2 | 10 | 15 |
| 3 | 10 | 20 |
| 4 | 5 | 15 |
| 5 | 1 | 6 |
| 6 | — | 1 |
h manipulation is extremely useful when proving identities involving sums of combinations.
利用上表可以验证 C(6,2) = C(5,1) + C(5,2) = 5 + 10 = 15。这种处理在证明涉及组合数求和的恒等式时非常有用。
8. Permutations and Combinations with Repetition | 有放回/重复选取的排列与组合
So far we assumed sampling without replacement. If repetition is allowed, the counting changes. The number of sequences of length r chosen from n types of objects with repetition allowed is nʳ. Think of a 4‑digit PIN: 10⁴ = 10,000.
到目前为止，我们假设的是无放回取样。若允许重复，计数方式将发生变化。从 n 种对象中可重复地选取 r 次所形成的序列个数为 nʳ。例如，4位PIN码：10⁴ = 10,000。
For combinations with repetition (multisets), where order does not matter but items can be repeated, the number of ways is C(n + r − 1, r). This formula applies to problems like choosing 3 scoops of ice‑cream from 5 flavours, where repeat flavours are allowed.
对于顺序无关但元素可重复的组合（多重集），其方式数为 C(n + r − 1, r)。该公式适用于诸如从5种口味中选取3球冰淇淋（允许重复口味）的问题。
Although these cases appear less often in core A‑Level exams, they are valuable for extension problems and statistics modules. Always read the question carefully: 'with replacement' or 'without replacement' and 'order matters' or 'order does not matter' determine which formula to use.
虽然这类情况在A‑Level核心考试中出现较少，但它们对于拓展题和统计学模块很有价值。务必仔细审题：“有放回”还是“无放回”，以及“顺序重要”还是“顺序无关”，决定了应使用哪个公式。
9. Applications in Probability | 在概率中的应用
(total number of equally likely outcomes). Permutations and combinations are used to find these numerator and denominator values without tedious listing.
计数方法直接服务于古典概率：P(事件) = (有利结果数) / (等可能结果总数)。排列与组合可用于求出分子与分母，而无需繁琐地列举。
e found via combinations: choose 2 red from 6 in C(6,2) ways, 1 blue from 4 in C(4,1) ways, total selections C(10,3). Thus probability = [C(6,2) × C(4,1)] / C(10,3) = (15 × 4) / 120 = 60/120 = 1/2.
例题：一个盒子装有6个红球和4个蓝球。若无放回地随机抽取3个球，则恰好抽到2个红球的概率可通过组合来求解：从6个红球中选2个有C(6,2)种方式，从4个蓝球中选1个有C(4,1)种方式，总选择数为C(10,3)。因此概率 = [C(6,2) × C(4,1)] / C(10,3) = (15 × 4) / 120 = 60/120 = 1/2。
In more complex problems, you may need to multiply permutations for ordered events or use combinations for unordered selections, while applying the addition/multiplication rules of probability. Always define the sample space clearly.
在更复杂的问题中，你可能需要对有序事件使用排列相乘，或对无序选择使用组合，同时应用概率的加法/乘法规则。务必清晰地定义样本空间。
10. Connection to the Binomial Theorem | 与二项式定理的联系
The binomial coefficients C(n, r) are the same coefficients in the expansion of (a + b)ⁿ. The binomial theorem states:
二项式系数 C(n, r) 正是 (a + b)ⁿ 展开式中的系数。二项式定理指出：
(a + b)ⁿ = Σ C(n, r) aⁿ⁻ʳ bʳ, for r = 0 to n
Understanding combinations underpins why the expansion works: to form each term aⁿ⁻ʳ bʳ, you must choose b from exactly r of the n factors, which can be done in C(n, r) ways. This elegantly links combinatorics and algebra.
对组合的理解解释了展开式为何成立：要形成每一项 aⁿ⁻ʳ bʳ，你必须从 n 个因子中恰好选择 r 个 b，这有 C(n, r) 种方式。这巧妙地将组合学与代数联系起来。
Hence, problems requiring a specific term in a binomial expansion often ask you to evaluate C(n, r = 56 × 8 = 448. Being fluent with combinations makes binomial expansions straightforward.
因此，要求二项展开式中特定项的题目常常要你计算 C(n, r)。例如，(2 + x)⁸ 中 x⁵ 的系数为 C(8,5) × 2³ = 56 × 8 = 448。熟练掌握组合可使二项展开式变得简单。
11. Common Mistakes and Tips | 常见错误与技巧
One of the most frequent errors is confusing permutations with combinations. A helpful check: ask yourself "if I swap two selected items, does it count as a new outcome?" If yes, use permutations; if no, use combinations.
最常见的错误之一是混淆排列与组合。一个有用的检验方法是自问：“如果我将选出的两个元素互换，是否算作一个新的结果？”若是，则使用排列；若否，则使用组合。
Another pitfall is forgetting to divide by the factorial of repeated indistinguishable items. Also, when using the formula for probabilities, always ensure the outcomes in the denominator are equally likely – a biased die would not allow simple counting methods.
另一个易犯错误是忘记除以相同不可区分物品的阶乘。此外，使用概率公式时，务必确保分母中的结果是等可能的——一枚不均匀的骰子就不能用简单的计数方法。
Examiners often embed restrictions: "the captain must be included" or "two people cannot sit together". Drawing a diagram or using the block method for permutations is recommended. For combinations, use complement counting when 'at least' conditions appear, e.g. C(total) − C(none).
考官经常嵌入限制条件：“队长必须包含在内”或“两人不能相邻”。建议绘制示意图，或在排列问题中使用“捆绑法”。对于组合，当出现“至少”条件时，可使用补集计数，如 C(总数) − C(无) 。
Finally, always simplify factorial expressions before multiplying large numbers. Use calculator functions (nPr, nCr) only after writing down the complete formula to reduce input errors and gain method marks.
最后，在计算大数乘积之前务必先化简阶乘表达式。在写下完整公式后再使用计算器功能（nPr, nCr），以减少输入错误并确保得到步骤分。
12. Practice Problems and Summary | 练习题与总结
To solidify your understanding, try the following typical exam‑style questions:
为巩固你的理解，请尝试以下典型考试风格的题目：
- How many ways can 7 different books be arranged on a shelf if two specific books must be at the ends? (Answer: 2! × 5! = 240)
- “若特定两本书必须放在两端，7本不同的书在书架上共有多少种排列方式？”（答案：2! × 5! = 240）
- A committee of 4 is to be chosen from 6 men and 5 women. How many committees contain at least 2 women? (Use cases and sum combinations.)
- “从6名男性和5名女性中选出4人委员会，至少包含2名女性的委员会有多少种？”（分情况并求和组合数。）
- Find the term independent of x in the expansion of (x + 1/x)⁶. (Answer: C(6,3) = 20)
- “求 (x + 1/x)⁶ 展开式中与 x 无关的项。”（答案：C(6,3) = 20）
In summary, permutations deal with ordered arrangements, combinations with unordered selections. Their formulae are based on factorial ratios, and they serve as the backbone for probability and the binomial theorem. Regular practice with exam questions and a clear, structured approach will make these concepts second nature.
总之，排列处理有序的安排，组合处理无序的选择。它们的公式基于阶乘比，并且共同构成了概率论与二项式定理的基石。通过定期练习真题并采用清晰、有条理的方法，这些概念将成为你的第二天性。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图