📚 Permutations and Combinations: Concept Clarification | 排列与组合：概念辨析
Permutations and combinations form a fundamental chapter in AS Mathematics, yet many students find the distinction between them tricky. This article clarifies the key ideas, formulas, and common pitfalls through detailed explanations and worked examples in both English and Chinese. By the end, you will confidently tackle any counting problem that comes your way.
排列与组合是 AS 数学中的基础章节，但许多学生容易混淆这两个概念。本文将通过中英双语的详细讲解和例题，厘清核心思想、公式以及常见误区，帮助你从容应对各类计数问题。
1. Introduction to Counting Principles | 计数原理简介
Before diving into permutations and combinations, it is essential to understand the basic counting principle, often called the multiplication principle. If one event can occur in m ways and another independent event can occur in n ways, then the total number of ways both events can occur is m × n. This simple rule underpins all permutation and combination calculations.
在深入排列与组合之前，必须先理解基本的计数原理，也称乘法原理。如果一个事件能以 m 种方式发生，另一个独立事件能以 n 种方式发生，那么这两个事件先后发生的总方式数为 m × n。这一简单规则是所有排列与组合计算的基础。
For instance, if you have 3 shirts and 4 pairs of trousers, the number of distinct outfits is 3 × 4 = 12. Counting principles allow you to break a complex problem into a sequence of simple choices, multiplying the numbers of options at each step.
例如，如果你有 3 件衬衫和 4 条裤子，不同的穿搭组合总数就是 3 × 4 = 12。计数原理将复杂问题分解为一系列简单的选择步骤，只需将每一步的选项数相乘即可。
2. What Is a Permutation? | 什么是排列？
A permutation is an arrangement of objects in a specific order. The order of the elements is crucial: changing the order creates a different permutation. For example, the letters A, B, C can be arranged as ABC, ACB, BAC, BCA, CAB, CBA – a total of 6 permutations. The number of permutations of n distinct objects taken all at a time is n! (n factorial).
排列是指将对象按特定顺序进行安排。元素的顺序至关重要：改变顺序就会产生不同的排列。例如，字母 A、B、C 可以排成 ABC、ACB、BAC、BCA、CAB、CBA，共 6 种排列。n 个不同对象的全排列数为 n!（n 的阶乘）。
When we select only r objects from n and then arrange them, the number of permutations is given by P(n, r) = n! / (n – r)!. This formula assumes all objects are distinct and no repetition is allowed. The notation ⁿPᵣ or P(n, r) is commonly used.
当我们从 n 个对象中只选取 r 个然后进行排列时，排列数公式为 P(n, r) = n! / (n – r)!。该公式假设所有对象互不相同且不允许重复。常用符号 ⁿPᵣ 或 P(n, r) 表示。
3. What Is a Combination? | 什么是组合？
A combination is a selection of objects where the order does not matter. For instance, choosing 2 letters from A, B, C gives the combinations AB, AC, BC – note that AB and BA are considered the same combination because order is irrelevant. This is the fundamental difference from permutations.
组合是指不考虑顺序的对象选择。例如，从 A、B、C 中选 2 个字母的组合有 AB、AC、BC——注意 AB 与 BA 被视为同一个组合，因为顺序无关紧要。这是与排列的根本区别。
The number of combinations of r objects chosen from n distinct objects is C(n, r) = n! / (r! (n – r)!). This is also written as ⁿCᵣ or the binomial coefficient (n choose r). Since each combination of r items can be arranged in r! ways, the relation C(n, r) = P(n, r) / r! holds.
从 n 个不同对象中选取 r 个的组合数公式为 C(n, r) = n! / (r! (n – r)!) ，也写作 ⁿCᵣ 或二项式系数 (n choose r)。由于每个含有 r 个元素的组合可以排列成 r! 种排列，因此有 C(n, r) = P(n, r) / r!。
4. Key Difference: Order Matters or Not | 关键区别：顺序是否重要
The litmus test for choosing between permutations and combinations is to ask: ‘If I swap two elements, do I get a different outcome?’ If yes, you are dealing with a permutation (order matters). If no, it is a combination (order does not matter). This question alone resolves many confusions.
区分排列与组合的试金石就是问自己：“如果我交换两个元素，结果会不同吗？”如果会，就是排列问题（顺序重要）；如果不会，就是组合问题（顺序不重要）。仅凭这一问题就能厘清许多困惑。
Consider selecting a president, vice-president, and secretary from 10 candidates. Here the order (the position) matters, so it is a permutation. Counting how many different 3-person committees can be formed from the same 10 candidates ignores roles, so it is a combination.
考虑从 10 名候选人中选出一名主席、一名副主席和一名秘书。这里顺序（职位）很重要，因此是排列问题。而如果只是从 10 人中选出一个 3 人委员会而不分配职务，则是组合问题。
5. Factorial Notation and Formulas | 阶乘符号与公式
The factorial symbol ‘!’ is central to counting. For any positive integer n, n! = n × (n–1) × (n–2) × … × 2 × 1, with 0! defined as 1. Factorials grow extremely fast, so be comfortable simplifying expressions like 10! / 8! or using the formula directly without computing huge numbers.
阶乘符号 ‘!’ 是计数的核心。对于任意正整数 n，n! = n × (n–1) × (n–2) × … × 2 × 1，并定义 0! = 1。阶乘增长极快，因此要熟练掌握化简如 10! / 8! 的技巧，或直接套用公式，避免计算庞大数字。
P(n, r) = n! / (n – r)!
C(n, r) = n! / (r! (n – r)!)
Both formulas can be adapted to many contexts. For instance, if some objects are identical, we use division by factorials of the frequencies to avoid overcounting. Understanding the structure of these formulas is more important than memorising them blindly.
两个公式可适用于多种情境。如果有对象相同，我们可以除以重复元素频次的阶乘以避免重复计数。理解公式的结构比盲目记忆更为重要。
6. Permutations with Repetition | 有重复的排列
When some items are indistinguishable, the number of distinct permutations of n items, where there are n₁ identical items of type 1, n₂ of type 2, etc., is n! / (n₁! n₂! …). For example, the number of ways to arrange the letters in ‘MISSISSIPPI’ involves dividing by 4! for the I’s, 4! for the S’s, and 2! for the P’s.
当部分元素相同时，n 个元素中若有 n₁ 个第 1 类相同元素、n₂ 个第 2 类相同元素等，不同排列总数为 n! / (n₁! n₂! …)。例如，排列单词 ‘MISSISSIPPI’ 中的字母时，需要除以 I 的 4!、S 的 4! 和 P 的 2!。
This idea is crucial because many students forget to adjust for repeated letters. Also remember that permutations of n distinct items taken r at a time when repetition is allowed is nʳ. The context determines which version to use.
这一要点至关重要，因为许多学生忘记对重复字母进行调整。另外，当允许重复时，从 n 个不同元素中取 r 个的排列总数为 nʳ。具体语境决定使用哪个版本。
7. Combinations and the Binomial Theorem | 组合与二项式定理
Combinations appear naturally in the binomial expansion: the coefficient of xʳ in (1 + x)ⁿ is C(n, r). This link reinforces the symmetry property C(n, r) = C(n, n – r) and helps in solving problems involving selections and distributions.
组合自然地出现在二项式展开式中：(1 + x)ⁿ 中 xʳ 的系数正是 C(n, r)。这一联系强化了对称性质 C(n, r) = C(n, n – r)，也有助于解决涉及选取与分配的问题。
Using Pascal’s triangle or the formula, we can quickly find how many ways to choose subsets of a given size. For example, the number of ways to choose 2 items from 5 is C(5,2) = 10, matching the fifth row of Pascal’s triangle.
利用帕斯卡三角形或公式，可以快速求出指定大小子集的选取方式数。例如，从 5 个中选 2 个的方式数为 C(5,2) = 10，与帕斯卡三角形第 5 行对应。
8. Common Misconceptions | 常见误解
One frequent error is using permutations when combinations are needed, or vice versa, simply because the student does not check the role of order. Another mistake is confusing the formulas: many write P(n, r) as n! / (r! (n – r)!) by accident.
一个常见错误是，在应该使用组合时用了排列，或者相反，仅仅因为学生没有检查顺序的作用。另一个错误是混淆公式：许多人误将 P(n, r) 写成 n! / (r! (n – r)!)。
Some students also add instead of multiply in multi‐step counting. The multiplication principle tells us to multiply choices of independent steps. Adding is appropriate only when we have mutually exclusive cases (the addition principle).
一些学生在多步计数时还会错误地将乘法变为加法。乘法原理要求将各独立步骤的选择数相乘。只有在处理互斥情形时（加法原理），才使用加法。
Lastly, forgetting to divide by the factorial of identical items in permutations with repetition leads to overcounting. Always ask: ‘Are any of the objects indistinguishable?’
最后，在有重复的排列中忘记除以相同元素个数的阶乘会导致重复计数。始终要问：“是否有任何对象是不可区分的？”
9. Worked Example: Choosing a Committee | 例题：选择委员会
Problem: From 8 students, a committee of 3 is to be chosen. (a) How many different committees are possible? (b) The committee needs to assign positions: chair, secretary, and treasurer. How many ways now?
题目：从 8 名学生中选出一个 3 人委员会。(a) 可能有多少种不同的委员会？(b) 委员会需要分配职务：主席、秘书和财务。此时有多少种方式？
For (a), order does not matter, so we use combinations: C(8,3) = 8!/(3!5!) = 56. For (b), the three chosen individuals are arranged into distinct roles, so we use permutations: P(8,3) = 8!/5! = 336. Notice 336 = 56 × 3! – each combination yields 6 arrangements.
对于 (a)，顺序不重要，故使用组合：C(8,3) = 8!/(3!5!) = 56。对于 (b)，三名被选者要分配不同角色，因此使用排列：P(8,3) = 8!/5! = 336。注意 336 = 56 × 3!——每个组合产生 6 种排列。
This example highlights the direct relationship between the two counts and reinforces when to apply each formula.
此例题凸显了两种计数方式间的直接关系，并强化了何时应用哪个公式的判断。
10. Another Example: Arranging Letters | 例题：排列字母
Problem: How many distinct arrangements can be made from the letters of the word ‘BUTTER’?
题目：单词 ‘BUTTER’ 中的字母可以有多少种不同的排列方式？
The word has 6 letters, with T repeated twice. The total permutations of 6 distinct letters would be 6! = 720, but because of the identical T’s, we divide by 2! = 2, giving 360 distinct arrangements.
该单词有 6 个字母，其中 T 重复两次。若 6 个字母完全不同，排列数为 6! = 720，但由于存在两个相同的 T，需要除以 2! = 2，得到 360 种不同排列。
If we now require that the two T’s must be next to each other, treat the pair ‘TT’ as a single block. Then we have 5 items to arrange (the block plus B, U, E, R), giving 5! = 120 arrangements. Because the T’s are identical inside the block, no extra factor is needed.
如果要求两个 T 必须相邻，可以把 ‘TT’ 视为一个整体块。于是我们有 5 个对象（块加上 B, U, E, R）排列，共 5! = 120 种。由于块内 T 相同，无需再乘因子。
11. Real-life Applications | 实际应用
Permutations and combinations are not just abstract exam topics. They are used in probability (e.g., lottery odds), computer science (algorithm design), cryptography, and even in everyday decisions like creating passwords or seating arrangements.
排列与组合并非仅仅抽象的考试题目，它们被用于概率（如彩票赔率）、计算机科学（算法设计）、密码学，甚至日常决策中，例如创建密码或安排座位。
Understanding these concepts helps you calculate the number of possible outcomes in games of chance, assess risks, and optimise selections. For example, how many 4-digit PINs exist? That’s 10⁴ = 10000 if repetition is allowed – a permutation with repetition.
理解这些概念有助于计算机会游戏中的可能结果数、评估风险以及优化选择。例如，存在多少种 4 位数的 PIN 码？若允许重复，答案为 10⁴ = 10000——这属于可重复排列。
Similarly, lottery combinations where order doesn’t matter are classic C(n, r) problems, explaining why the odds of winning are often millions to one.
类似地，彩票中不考虑顺序的组合就是典型的 C(n, r) 问题，这解释了为什么中奖概率常常是数百万分之一。
12. Summary and Tips for Exams | 总结与考试技巧
To master permutations and combinations, always start by asking whether order matters. Write down the n and r values carefully. Check for identical items if repetitions exist. Remember that C(n, r) = C(n, n–r) can simplify calculations.
要掌握排列与组合，始终从询问“顺序是否重要”开始。仔细写下 n 和 r 的值。如果有重复元素，检查是否有相同项。记住 C(n, r) = C(n, n–r) 可简化计算。
Use addition when counting disjoint cases and multiplication for sequential steps. Drawing a simple tree diagram or listing sample outcomes can prevent conceptual mistakes, especially under exam pressure.
在互斥情形下使用加法，在连续步骤中使用乘法。画一个简单的树状图或列出样本结果可以防止概念性错误，尤其在考试压力下。
| Concept | Key Identifier | Formula |
| Permutation | Order matters | P(n,r) = n!/(n–r)! |
| Combination | Order does not matter | C(n,r) = n!/(r!(n–r)!) |
| Permutation with identical items | Indistinguishable objects | n!/(n₁! n₂! …) |
By internalising these distinctions and practising with a variety of problems, you will be able to approach any AS counting question with clarity and precision. Keep this guide handy for quick revision!
通过内化这些区别并大量练习各类问题，你将能够清晰、准确地解答任何 AS 计数类题目。收藏本文，方便快速复习！
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导