📚 Combinations in Edexcel A-Level Mathematics | Edexcel A-Level 数学中的组合
Combinatorics forms the backbone of many advanced probability and statistics topics in Edexcel A-Level Mathematics. Understanding combinations – how to count selections where the order does not matter – is essential not only for solving permutations and combinations problems but also for grasping binomial expansions, probability distributions, and statistical inference. This article walks you through the core ideas of combinations, the nCr formula, key properties, and common exam-style applications. Whether you are taking the International A-Level or the UK specification, mastering combinations will strengthen your problem-solving toolkit.
组合数学是 Edexcel A-Level 数学中许多高等概率与统计专题的基石。理解组合——如何计算顺序无关紧要的选择——不仅是解决排列组合问题的基础，也是掌握二项式展开、概率分布和统计推断的关键。本文将带您梳理组合的核心思想、nCr 公式、关键性质以及常见考题的应用。无论您参加的是国际 A-Level 还是英国本土大纲，掌握组合都会显著增强您的解题能力。
1. Introduction to Combinatorics | 组合数学导论
Combinatorics is the branch of mathematics concerned with counting, arranging, and selecting objects. In the Edexcel A-Level syllabus, combinatorics appears mainly in Statistics modules and underpins the binomial theorem. The two fundamental concepts are permutations (where order matters) and combinations (where order does not matter). A solid grasp of these ideas allows you to tackle probability questions involving selections, lottery draws, team line-ups, and genetic codes efficiently.
组合数学是数学中关于计数、排列和选取对象的分支。在 Edexcel A-Level 大纲中，组合数学主要出现在统计模块中，并支撑着二项式定理。两个基本概念是排列（顺序重要）和组合（顺序不重要）。牢固掌握这些思想，能让您高效地解决涉及抽选、彩票抽奖、团队阵容和遗传密码的概率问题。
2. The Fundamental Counting Principle | 基本计数原理
er of ways both events can occur is m × n. This multiplicative rule extends to any number of events. For example, choosing a starter from 3 soups and a main from 5 dishes gives 3 × 5 = 15 possible two-course meals. This principle is the foundation for permutations and combinations.
基本计数原理指出：如果一个事件能以 m 种方式发生，另一个独立事件能以 n 种方式发生，那么这两个事件先后发生的总方式数为 m × n。这一乘法规则可以扩展到任意多个事件。例如，从 3 种汤中选一道开胃菜，再在 5 道主菜中选一道，共有 3 × 5 = 15 种两菜套餐。该原理是排列和组合的基础。
3. Factorials and Their Notation | 阶乘及其表示法
The factorial of a positive integer n, denoted by n!, is the product of all positive integers from 1 to n: n! = n × (n – 1) × (n – 2) × … × 2 × 1. By convention, 0! = 1. Factorials grow very fast – for instance, 5! = 120 and 10! ly in permutation and combination formulas to compute the number of distinct arrangements.
正整数 n 的阶乘记作 n!，表示从 1 到 n 的所有正整数的乘积：n! = n × (n – 1) × (n – 2) × … × 2 × 1。规定 0! = 1。阶乘增长极快——例如 5! = 120，而 10! = 3,628,800。阶乘被广泛用于排列和组合公式中，以计算不同排列的数目。
4. What Are Permutations? | 什么是排列？
f a set of distinct objects. The number of ways to arrange n different items in a row is n! ly r items taken from n distinct items, the number of permutations is given by P(n, r) = n! / (n – r)!. For example, the number of ways to arrange 3 letters from the word 'ABCD' is P(4, 3) = 4! / 1! otice that ABC, ACB, BAC are considered different permutations because order is important.
排列是指将一组不同的对象按顺序进行安排。将 n 个不同物品排成一排的方式数为 n!。如果只想从 n 个不同物品中选取 r 个进行排列，排列数公式为 P(n, r) = n! / (n – r)!。例如，从 'ABCD' 中取 3 个字母排列，共有 P(4, 3) = 4! / 1! = 24 种方式。注意 ABC、ACB、BAC 被视为不同的排列，因为顺序至关重要。
5. Distinguishing Combinations from Permutations | 区分组合与排列
ation is a selection of items where the order does not matter. If we choose 3 letters from 'ABCD', the combinations are ABC, ABD, ACD, and BCD – only 4 distinct selections. Each combination of size r can be arranged in r! ons is smaller than the number of permutations. The relationship is: C(n, r) = P(n, r) / r!. Recognising whether a problem asks 'how many ways to select' or 'how many ways to arrange' is the critical first step.
组合是不考虑顺序的选取。从 'ABCD' 中选 3 个字母，组合为 ABC、ABD、ACD 和 BCD——仅有 4 种不同的选择。每种大小为 r 的组合可以按 r! 种不同顺序排列，这就解释了为什么组合数比排列数小。两者的关系是：C(n, r) = P(n, r) / r!。识别问题是问“有多少种选取方式”还是“有多少种排列方式”是关键的第一步。
6. The Combination Formula nCr | 组合公式 nCr
The number of combinations of r objects chosen from n distinct objects is most often written as C(n, r) or sometimes as ⁿCᵣ. The standard formula is:
C(n, r) = n! / [r! (n – r)!]
This can be derived by dividing the permutation formula by r! to eliminate the effect of ordering. For example, C(5, 2) = 5! / (2! × 3!) = (5 × 4 × 3!) / (2! × 3! utton, but understanding the formula underpins algebraic manipulation and proof questions.
从 n 个不同物品中选取 r 个的组合数通常写作 C(n, r) 或有时记为 ⁿCᵣ。标准公式为：
C(n, r) = n! / [r! (n – r)!]
这个公式可以通过将排列公式除以 r! 以消除次序影响来推导。例如，C(5, 2) = 5! / (2! × 3!) = (5 × 4 × 3!) / (2! × 3!) = 20/2 = 10。现代计算器都有 nCr 按键，但理解公式是代数操作和证明题的基础。
7. Key Properties of C(n, r) | C(n, r)的关键性质
Combinations exhibit several elegant properties that simplify calculations and are frequently tested:
- Symmetry: C(n, r) = C(n, n – r). Choosing r objects is the same as leaving n – r objects behind.
- Boundary cases: C(n, 0) = C(n, n) = 1. There is exactly one way to select nothing or everything.
- Pascal's rule: C(n, r) + C(n, r – 1) = C(n + 1, r). This gives rise to Pascal's triangle.
- Sum of all combinations: The total number of subsets of an n-element set is 2ⁿ = Σ C(n, r) from r=0 to n.
组合具有几个优美的性质，可简化计算并经常出现在考题中：
- 对称性：C(n, r) = C(n, n – r)。选取 r 个对象等同于留下 n – r 个对象。
- 边界情况：C(n, 0) = C(n, n) = 1。什么都不选或全选都只有唯一一种方式。
- 帕斯卡法则：C(n, r) + C(n, r – 1) = C(n + 1, r)。这就是帕斯卡三角形的生成规则。
- 所有组合数之和：n 元集合的子集总数为 2ⁿ = Σ C(n, r) （r 从 0 到 n）。
A quick reference table of small values:
| n | r=0 | r=1 | r=2 | r=3 | r=4 | r=5 |
|---|---|---|---|---|---|---|
| 5 | 1 | 5 | 10 | 10 | 5 | 1 |
小数组合值的速查表：
| n | r=0 | r=1 | r=2 | r=3 | r=4 | r=5 |
|---|---|---|---|---|---|---|
| 5 | 1 | 5 | 10 | 10 | 5 | 1 |
8. Combinations in Binomial Expansion | 二项式展开中的组合
inomial expansion of (a + b)ⁿ, the coefficient of each term is a combination: the term aⁿ⁻ʳ bʳ The coefficients 1, 5, 10, 10, 5, 1 are exactly C(5, r) for r = 0 to 5. Understanding combinations therefore directly links to expansions and the binomial theorem proof.
在 (a + b)ⁿ 的二项式展开中，每一项的系数都是组合数：项 aⁿ⁻ʳ bʳ 的系数为 C(n, r)。因此 C(n, r) 也称作二项式系数。例如，展开 (1 + x)⁵ 得到 1 + 5x + 10x² + 10x³ + 5x⁴ + x⁵。系数 1、5、10、10、5、1 正是 C(5, r) 在 r = 0 到 5 时的值。因此理解组合直接与展开和二项式定理证明相关联。
9. Solving Typical Edexcel Problems | 解决典型Edexcel问题
xam questions often ask you to count selections with or without restrictions. For example: ' of 4 is to be chosen from 6 men and 5 women. How many ways can it include exactly 2 women?' The women's part: C(5,2) = 10 ways. The men's part: C(6,2) = 15 ways. Total = 10 × 15 = 150. Another common type: 'How many ways to select 3 letters from A, B, B, C?' repeated letter requires careful casework, but the combination principle remains central.
Edexcel 考题经常要求计算有限制或无限制的选取数。例如：“从6男5女中选出4人组成委员会，恰好含2名女生的方法有多少种？” 女生部分：C(5,2) = 10；男生部分：C(6,2) = 15。总方式 = 10 × 15 = 150。另一种常见类型：“从 A, B, B, C 中选3个字母的方法数？” 此时重复字母需要仔细分情况讨论，但组合原理仍是核心。
When restrictions are placed, break the problem into mutually exclusive cases, count each using combinations, and then apply the addition principle if cases do not overlap or the multiplication principle if selections are independent.
当有限制条件时，将问题分解为互斥的情况，用组合分别计算每种情况，然后根据不同情况是否重叠应用加法原理或独立选取时用乘法原理。
10. Common Pitfalls and How to Avoid Them | 常见陷阱及避免方法
One frequent mistake is to misuse the combination formula when order actually matters. Always read the question carefully: words like 'arrange', 'line up', 'sequence' imply permutations; 'choose', 'select', 'committee' imply combinations. Another error is forgetting to adjust for identical items – the standard combination formula only works for distinct objects. For repeated letters, use separate counting or multinomial coefficients. Also, be careful with the 'at least' condition: converting to complementary counting (total minus none) often simplifies the work.
一个常见错误是在顺序重要时误用了组合公式。务必仔细读题：出现“排列”、“排队”、“序列”等词通常意味着排列；而“选取”、“选择”、“委员会”意味着组合。另一个错误是忘记对相同物品进行调整——标准组合公式仅适用于不同物品。对于重复字母，要采用分情况计数或多项式系数。此外，对于“至少”条件要格外小心：转化为补集计数（全部情况减去不符合的情况）常常可以简化计算。
Many students also get confused by the notation and forget that C(n, r) = C(n, n – r the question asks for the coefficient of a term or the full term including the variable.
很多学生还会被符号搞糊涂，忘记 C(n, r) = C(n, n – r)。利用这个对称性能节省计算时间，尤其是当 r > n/2 时。最后，在二项式展开中，要检查题目要求的是某一项的系数，还是包含变量的完整项。
11. Exam-Style Worked Example | 真题演练实例
Question: A standard deck has 52 cards. A hand of 5 cards is dealt. How many hands contain exactly 2 aces?
Solution: (4,2) = 6 ways. Then, select the remaining 3 cards from the 48 non-ace cards: C(48,3) = 48!/(3!45!) = 17296. Multiply: 6 × 17296 = 103,776 hands.
题目：一副标准扑克牌有 52 张牌，发 5 张牌。恰好含有 2 张 A 的手牌有多少种？
解答：首先，从 4 张 A 中选 2 张：C(4,2) = 6 种。然后，从剩下的 48 张非 A 牌中选 3 张：C(48,3) = 48!/(3!45!) = 17296 种。相乘：6 × 17296 = 103,776 种手牌。
This example shows the direct application of the combination formula with a classic 'exactly' condition. For Edexcel exam success, always show your working clearly, write combinations as C(n, r) or nCr, and check your arithmetic.
这个例子展示了组合公式在典型“恰好”条件下的直接应用。想在 Edexcel 考试中取得成功，务必清晰展示解题步骤，将组合写作 C(n, r) 或 nCr，并检查算术。
12. Summary and Key Takeaways | 总结与重点
choose r items from n distinct items without regard to order. The key formula C(n, r) = n! / [r! (n – r)! tions lies in whether order matters. Properties like symmetry, boundary values, and Pascal' te binomial expansions, probability, and beyond. Practice by solving a variety of problems – committees, cards, and counting with restrictions – uency. Always verify whether you are selecting or arranging, and use the appropriate tool.
组合衡量的，是从 n 个不同物品中不考虑顺序地选择 r 个物品的方式数。核心公式 C(n, r) = n! / [r! (n – r)!] 是基础。与排列的区别在于顺序是否重要。对称性、边界值和帕斯卡法则等性质提供了捷径并加深理解。组合渗透在二项式展开、概率等诸多领域。通过练习各类问题——委员会、扑克牌、带限制的计数——来提升熟练度。始终确认您是在选择还是在排列，并使用恰当的工具。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图