📚 Permutations and Combinations: Core Problem Types & Strategies | 排列组合：核心题型与解题策略
Permutations and combinations form a fundamental topic in A-Level Mathematics, testing not only your ability to memorise formulas but, more importantly, your logical reasoning and systematic counting skills. These problems often appear in Paper 1 (Pure Mathematics) and Statistics papers, and they frequently serve as the gateway to probability questions.
排列组合是A-Level数学中的基础性考点，它不仅考查你对公式的记忆，更重要的是考查逻辑推理能力和系统计数的技巧。这类题目经常出现在Paper 1（纯数卷）和统计学试卷中，同时也是概率题目的前置基础。
1. Fundamental Principles: The Multiplication Rule and the Addition Rule | 基本原理：乘法原理与加法原理
Before diving into formulas, you must master the two core principles upon which all counting is built. The multiplication rule states that if one event can occur in m ways and a second event can occur in n ways independently, then the two events together can occur in m × n ways. The addition rule states that if two events cannot occur simultaneously, the total number of ways either can occur is the sum of their individual counts.
在学习公式之前，必须掌握支撑一切计数的两大核心原理。乘法原理是指：若一件事有m种发生方式，另一件事有n种独立发生方式，则两件事共同发生的方式为m × n种。加法原理则是指：若两件事不能同时发生，则其中任意一件发生的方式总数为各自方式数之和。
Multiplication Rule: m × n | Addition Rule: m + n
Key question type: “How many different outcomes are possible?” — identify whether steps are sequential (multiply) or alternative (add).
核心题型标志：“一共有多少种不同结果？”——判断步骤是先后发生（相乘）还是相互替代（相加）。
Worked Example: A restaurant offers 3 appetisers, 5 main courses, and 4 desserts. How many different three-course meals are possible?
示例：某餐厅提供3种开胃菜、5种主菜和4种甜点。问共有多少种不同的三道菜套餐？
Since the three choices are made sequentially and independently, the total is 3 × 5 × 4 = 60.
因为三次选择依次进行且相互独立，所以总数为3 × 5 × 4 = 60。
2. The Difference Between Permutations and Combinations | 排列与组合的本质区别
This is the most crucial distinction in this topic. A permutation is an ordered arrangement of items — changing the order produces a different outcome. A combination is a selection of items where the order does not matter. In English exam problems, look for signal words: “arrange”, “order”, “line up” suggest permutations; “choose”, “select”, “committee” suggest combinations.
这是本专题中最关键的区分。排列是对物品的有序安排——改变顺序即产生不同结果。组合是对物品的选择，顺序无关紧要。在英文题目中，注意信号词：“arrange（排列）”“order（顺序）”“line up（排成队列）”提示用排列；“choose（选择）”“select（挑选）”“committee（委员会）”则提示用组合。
ₙPᵣ = n! / (n − r)! | ₙCᵣ = n! / [r!(n − r)!]
Example: The number of ways to choose 2 monitors from 10 candidates is ¹⁰C₂ = 45. The number of ways to arrange a president and vice-president from 10 candidates is ¹⁰P₂ = 90 — twice as many because each pair can be ordered in 2 ways.
示例：从10名候选人中选出2名监考员的方法数为¹⁰C₂ = 45。而从10名候选人中安排1名主席和1名副主席的方法数为¹⁰P₂ = 90——是前者的两倍，因为每一对人可以按2种方式排序。
3. Factorial Notation and Basic Formulas | 阶乘记号与基本公式
Factorial notation n! means the product n × (n − 1) × (n − 2) × … × 2 × 1. You must be comfortable with simplifying expressions involving factorials, especially 0! = 1 and n! / (n − r)! where cancellations often occur.
阶乘记号n!表示乘积n × (n − 1) × (n − 2) × … × 2 × 1。你必须熟练化简含阶乘的表达式，特别要注意0! = 1，以及在n! / (n − r)!中经常发生约分。
n! = n × (n − 1) × (n − 2) × … × 2 × 1; 0! = 1
Key simplification skill: 8! / 5! = 8 × 7 × 6 = 336 — write out only the unfactored tail rather than computing both factorials fully. This saves time and reduces errors.
关键化简技巧：8! / 5! = 8 × 7 × 6 = 336——只写出未被约分的尾部，而不是把两个阶乘完全算出。这既节省时间又减少错误。
4. Restricted Permutations: Items That Must or Must Not Be Together | 受限排列：必须相邻或必须不相邻的元素
When certain items must stay together, treat them as a single “block”, then multiply by the internal arrangements within the block. For example, arranging 5 books where 2 particular books must be beside each other: treat the 2 books as 1 unit, giving 4! arrangements of the units, then multiply by 2! internal arrangements — total 4! × 2! = 48.
当某些元素必须相邻时，把它们看作一个整体“大块”，再乘以块内部的排列数。例如，摆放5本书且其中2本必须相邻：把这2本书视为1个整体，得到4!种整体排列，再乘以2!种内部排列——总数4! × 2! = 48。
When certain items must NOT be together, use the “gap method”: arrange the other items first, creating gaps between them, then place the restricted items into those gaps. For 5 books where 2 must not touch: arrange the other 3 books (3! ways), creating 4 gaps, then place the 2 restricted books into 2 different gaps: ⁴P₂ = 12. Total: 3! × 12 = 72.
当某些元素必须不相邻时，使用“插空法”：先将其他元素排列，在其间形成空隙，然后把受限元素放入这些空隙中。例如5本书中2本不能相邻：先把另外3本排列（3!种），形成4个空隙，再从4个空隙中选2个放入那2本书：⁴P₂ = 12。总数：3! × 12 = 72。
5. Fixed Position Restrictions | 固定位置限制
If a particular item must occupy a specific position — for example, the letter A must be first in a 5-letter arrangement — fix A in place first, then permute the remaining items freely. The number of arrangements is simply the number of ways to arrange the rest.
如果某个特定元素必须占据特定位置——例如字母A在5字母排列中必须排第一位——先把A固定在位置上，再对其余元素自由排列。此时的排列数就是其余元素的排列数。
Example: How many 5-digit numbers can be formed from the digits 1–9 without repetition? Hundreds digit must be even.
示例：用数字1–9无重复地组成5位数，其中百位必须是偶数，问共有多少个？
Step 1: Choose the hundreds digit from {2, 4, 6, 8} — 4 choices. Step 2: From the remaining 8 digits, choose and arrange 4 for the remaining positions: ⁸P₄ = 8 × 7 × 6 × 5 = 1680. Total: 4 × 1680 = 6720.
第一步：从{2, 4, 6, 8}中选百位数字——4种选择。第二步：从剩余8个数字中选出4个填入其余位置并排列：⁸P₄ = 8 × 7 × 6 × 5 = 1680。总数：4 × 1680 = 6720。
6. Permutations with Repeated Items | 含重复元素的排列
When a collection contains identical items, the number of distinct permutations is reduced. The formula is the total factorial divided by the factorial of each repeated group’s size. For the word MISSISSIPPI: 11 letters with 4 I’s, 4 S’s, 2 P’s, 1 M — the number of distinct arrangements is 11! / (4!4!2!1!).
当集合中含有相同元素时，不同排列的数量会减少。公式为：总阶乘除以每个重复组大小的阶乘。以单词MISSISSIPPI为例：共11个字母，其中有4个I、4个S、2个P、1个M——不同排列数为11! / (4!4!2!1!)。
Number of distinct arrangements = n! / (a!b!c!…)
This formula also handles scenarios like arranging beads of different colours where multiple beads share the same colour.
该公式同样适用于如不同颜色的珠子排列中同色珠子有多个的情形。
7. Circular Arrangements | 圆桌排列
For arranging n distinct objects in a circle, the number of distinct circular arrangements is (n − 1)!, not n!. This is because rotating the entire circle does not produce a new arrangement — fixing one object as a reference point eliminates the rotational symmetry.
将n个不同物体围成一圈排列时，不同圆排列数为(n − 1)!，而不是n!。这是因为将整个圆旋转并不会产生新的排列——固定一个物体作为参照点即可消除旋转对称性。
Example: 6 people seated around a round table: (6 − 1)! = 5! = 120. If two specific people must sit together, treat them as a block: 5 units in a circle gives (5 − 1)! = 24, multiply by 2! internal = 48.
示例：6人围圆桌就座： (6 − 1)! = 5! = 120。若2个特定的人必须相邻，将其视为一个整体：5个单位围成圆有(5 − 1)! = 24种，再乘以内部2! = 48。
8. Combinations with Conditions | 有条件限制的组合
When selecting a group subject to conditions such as “at least”, “at most”, or “must include”, break the problem into exhaustive, mutually exclusive cases and sum them. For example, choosing a committee of 4 from 7 men and 6 women with at least 2 women:
当选择一组对象时若附加“至少”“至多”或“必须包含”等条件，应将问题分解为穷尽且互斥的各种情况再求和。例如，从7名男性和6名女性中选4人组成委员会且至少包含2名女性：
Total = ⁶C₂·⁷C₂ + ⁶C₃·⁷C₁ + ⁶C₄ = 315 + 210 + 15 = 540
Alternatively, use the complement method: total unrestricted choices minus those violating the condition. Total = ¹³C₄ = 715; subtract cases with 0 women (⁷C₄ = 35) and 1 woman (⁶C₁·⁷C₃ = 210). 715 − 245 = 470. Wait — the two approaches must agree. The error: cases with at least 2 women are exactly 540; the complement approach gives 715 − 35 − 210 = 470 — this is wrong. Let me recheck.
或者可以使用补集法：无条件限制的总数减去违反条件的数目。总数为¹³C₄ = 715；减去0名女性(⁷C₄ = 35)和1名女性(⁶C₁·⁷C₃ = 210)的情况。715 − 245 = 470——等等，两种方法必须一致。这里的错误在于：至少2名女性的情况精确为540；补集法给出715 − 35 − 210 = 470——这说明计算有误，需要重新检查。
Correct complement check: 0 women = ⁷C₄ = 35. 1 woman = ⁶C₁ × ⁷C₃ = 6 × 35 = 210. So total valid = 715 − 35 − 210 = 470. But direct calculation gives ⁶C₂·⁷C₂ = 15 × 21 = 315; ⁶C₃·⁷C₁ = 20 × 7 = 140; ⁶C₄ = 15. Sum = 315 + 140 + 15 = 470. The second term was miscomputed earlier — the correct direct sum is also 470. Always verify your arithmetic!
正确的补集验证：0名女性 = ⁷C₄ = 35。1名女性 = ⁶C₁ × ⁷C₃ = 6 × 35 = 210。所以有效总数 = 715 − 35 − 210 = 470。而直接计算：⁶C₂·⁷C₂ = 15 × 21 = 315；⁶C₃·⁷C₁ = 20 × 7 = 140；⁶C₄ = 15。总和 = 315 + 140 + 15 = 470。之前第二项算错了——正确的直接求和也是470。务必检查你的算术！
9. Arrangements with Both Selections and Permutations | 先选后排的综合问题
Many A-Level questions combine selection and arrangement: first choose which items will be used, then arrange them. For example, selecting 3 letters from the word “MATHS” and arranging them to form 3-letter sequences: first choose 3 letters from 5 (⁵C₃ = 10), then arrange them (3! = 6) — total 10 × 6 = 60. This equals ⁵P₃ directly, which confirms the logic.
许多A-Level题目将选择和排列结合：先选出使用哪些元素，再对它们进行排列。例如，从单词“MATHS”中选3个字母并排成3位序列：先从5个中选3个(⁵C₃ = 10)，再排列(3! = 6)——总数10 × 6 = 60。这与⁵P₃直接相等，验证了逻辑的正确性。
For more complex cases — e.g., selecting a team of 3 from 8 boys and 2 from 6 girls, then arranging all 5 in a row — first count selections (⁸C₃ × ⁶C₂), then multiply by the arrangements of the 5 selected people (5!).
对于更复杂的情形——例如从8名男生中选3人、6名女生中选2人组成团队，再让这5人排成一排——先计算选择方式（⁸C₃ × ⁶C₂），再乘以这5人的排列方式(5!)。
10. The Powerful Complement Technique | 强大的补集技巧
For problems involving “at least one”, “not all”, or “avoiding certain configurations”, direct computation can be tedious and error-prone. The complement strategy — count the total unrestricted arrangements and subtract the unwanted cases — is often dramatically simpler.
对于涉及“至少一个”“并非全部”或“避免某些配置”的问题，直接计算往往繁琐且容易出错。补集策略——先计算无限制的总数，再减去不需要的情况——通常极其简洁。
Classic problem: How many arrangements of the letters of the word ‘FATHER’ have the two vowels not together? Direct gap method: arrange 4 consonants in 4! ways, creating 5 gaps; place 2 vowels into 2 gaps: ⁵P₂ = 20. Total = 24 × 20 = 480. Complement check: total arrangements = 6! = 720; vowels together: 5! × 2! = 240; 720 − 240 = 480. Both methods agree.
经典问题：单词“FATHER”的字母排列中两个元音不相邻的有多少种？直接插空法：4个辅音有4!种排列，形成5个空隙；将2个元音放入其中2个空隙：⁵P₂ = 20。总数 = 24 × 20 = 480。补集验证：总排列 = 6! = 720；元音相邻时：5! × 2! = 240；720 − 240 = 480。两种方法一致。
11. Distinguishing Ordered and Unordered Groups | 区分有序分组与无序分组
A common pitfall in A-Level exams is failing to divide by the factorial when distributing identical quantities into equal-sized groups. For example, dividing 6 people into 3 groups of 2 each (unordered groups) requires dividing 6! / (2!2!2!) by 3! = 15, whereas distributing them into 3 distinct labelled rooms using pairs involves no extra division.
A-Level考试中的一个常见陷阱是：将相同数量的物品分入等大小的组时，忘记除以阶乘。例如，将6人分为每组2人的3个组（组不编号）：需要将6! / (2!2!2!)再除以3! = 15；而将他们以每2人一组分配进3个有标记的房间则不需要额外约分。
Unordered equal groups: n! / [(r!)ᵏ × k!] | Labelled equal groups: n! / (r!)ᵏ
The key indicator: if the groups have distinct labels (Room A, Room B, Room C), keep the full denominator without k!. If the groups are indistinguishable (just “3 groups of 2”), include the k! factor.
判断关键：若各组有明确标记（A房间、B房间、C房间），则分母不含k!；若各组不可区分（只说“每组2人的3个组”），则分母必须包含k!。
12. Exam Strategies and Common Pitfalls | 考场策略与常见误区
Do: Identify whether order matters before writing any formula. Write down the conceptual plan (e.g., “fix A, arrange remaining 7”) before computing. Use the complement method when “at least” appears with large numbers. Cross-check by computing an alternative approach when time permits.
应做：写公式前先判断顺序是否重要。先写出解题思路（例如“固定A，排列剩余7个”）再计算。当出现“至少”且数字较大时使用补集法。时间允许时用另一种方法交叉验证。
Do not: Forget 0! = 1. Do not confuse ₙPᵣ with ₙCᵣ — in permutations, order is explicit. Do not apply the same arrangement formula to identical items. Do not forget to divide by k! for unlabelled equal groups.
勿做：别忘记0! = 1。不要混淆ₙPᵣ与ₙCᵣ——排列中顺序是明确要求的。不要将相同的排列公式套用到含相同元素的情形。不要忘记对无标记等组除以k!。
Final tip: In exam conditions, clearly present your factorised expressions (e.g., 4 × ⁸P₄) rather than the final numeric value only. Examiners award method marks for the expression even if arithmetic fails.
最后提示：考场中，请清晰呈现分解后的表达式（如4 × ⁸P₄），而不要只写最终数值。考官会根据表达式给方法分，即使最终算术出错也能得分。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply