📚 Combinations | 组合
Combinations are a fundamental concept in combinatorics, which plays a critical role in A-Level Mathematics, particularly within the statistics and probability topics of the Edexcel specification. Understanding how to count selections without regard to order is essential for solving problems involving groups, committees, and probability distributions. This article provides a comprehensive guide to combinations, covering definitions, formulas, properties, and typical examination applications, enabling students to master this key topic.
组合是组合数学中的基本概念，在A-Level数学中起着关键作用，尤其在Edexcel考试大纲的统计与概率部分。理解如何在不考虑顺序的情况下进行计数，对于解决涉及分组、委员会和概率分布的问题至关重要。本文全面介绍组合，涵盖定义、公式、性质以及典型的考试应用，帮助学生掌握这一重要主题。
1. Definition of Combinations | 组合的定义
A combination is a selection of items from a larger set where the order of selection does not matter. For example, choosing three students from a class of ten to form a committee yields the same group regardless of the order in which they are picked. In contrast, if order mattered, we would be dealing with permutations. Combinations are used when we are interested only in which items are chosen, not in the arrangement of those items. This concept is abbreviated frequently as 'n choose r' or the binomial coefficient.
组合是指从一个较大的集合中选取若干项，且选取的顺序无关紧要。例如，从十名学生中选出三人组成委员会，无论以什么顺序挑选，最终形成的三人组都是相同的。与此不同，如果顺序重要，那么处理的就是排列问题。组合适用于我们只关心选取了哪些对象，而不关心它们如何排列的情形。这一概念常被简称为“n选r”或二项式系数。
2. Combinatorial Formula | 组合公式
number of ways to choose r items from n distinct items is given by the formula C(n, r) = n! / (r! (n − r)!). Here n! to n. The formula divides the total number of permutations of r items out of n (which is n!/(n−r)!) by r! to account for the fact that the r items can be arranged in r! correspond to the same combination. This ensures each combination is counted exactly once.
从n个不同项目中选取r个的组合数由公式 C(n, r) = n! / (r! (n − r)!) 给出。其中n!表示n的阶乘，即所有不大于n的正整数的乘积。该公式先将n个项目中抽选r个的排列总数（即 n!/(n−r)!）除以 r!，因为r个项目可以有 r! 种不同的排列顺序，而这些排列全部对应同一个组合。这样即可确保每个组合只被计数一次。
C(n, r) = n! / (r! (n − r)!)
3. Difference Between Permutations and Combinations | 排列与组合的区别
The key difference lies in the importance of order. Permutations count arrangements where the sequence of selection matters, such as race finishing positions. Combinations count selections where the order is irrelevant, such as choosing lottery numbers. A simple test: if swapping two chosen elements results in a different outcome, use permutations; if the outcome remains unchanged, use combinations. In many A-Level problems, the correct approach depends on whether the question mentions words like 'arrange', 'order', 'sequence' (permutation) or 'choose', 'select', 'group' (combination).
关键区别在于顺序是否重要。排列计算的是顺序有关系的安排方式，例如赛跑名次；组合计算的是顺序无关的选取方式，例如选择彩票号码。一个简单的判别方法是：若交换两个被选对象会导致不同结果，则使用排列；若结果保持不变，则使用组合。在许多A-Level问题中，能否选对方法取决于题目是否出现“排列”“顺序”“序列”这类词（用排列），或“选择”“选取”“组”这类词（用组合）。
4. Notation and Symbols | 符号与表示
Combinations are commonly expressed using several equivalent notations. The most widely used forms are C(n, r), nCr, or the binomial coefficient notation (n r) written with parentheses, though in plain text we often write C(n,r) or nCr. The Edexcel specification accepts nCr and the factorial form. It is important to be comfortable with all three because examination papers may present them in any of these styles. Using a calculator, the nCr function directly computes the combination, but students should also be able to apply the factorial formula for algebraic manipulation.
组合通常用几种等价的记号来表示。最常用的形式包括 C(n, r)、nCr，以及用括号写的二项式系数符号 (n r)，不过在普通文本中我们常写为 C(n,r) 或 nCr。Edexcel考试大纲接受 nCr 和阶乘形式。重要的是要熟悉全部三种记法，因为试卷中可能以任何一种形式出现。使用计算器时，nCr 功能可直接求出组合数，但学生也应能够运用阶乘公式进行代数变形。
5. Fundamental Properties of Combinations | 组合的基本性质
osing r items is the same as choosing the n−r items to leave out. The boundary values are C(n, 0) = 1 and C(n, n) = 1. A recurrence relation known as Pascal's rule holds: C(n, r) = C(n−1, r−1) + C(n−1, r). This forms the basis of Pascal' rties are useful in proofs and in simplifying expressions involving binomial coefficients.
有几个性质可以简化计算并加深概念理解。对称性指出 C(n, r) = C(n, n−r)，意即选择r个等同于选择要留下的n−r个。边界值有 C(n, 0) = 1 以及 C(n, n) = 1。满足递推关系（帕斯卡法则）：C(n, r) = C(n−1, r−1) + C(n−1, r)。这正是帕斯卡三角形的基础：每个数等于它上方两数之和。这些性质在证明和化简涉及二项式系数的表达式时非常有用。
6. Combinations with Restrictions | 受限组合问题
Examination questions frequently introduce constraints, such as including or excluding specific items. To handle these, break the problem into cases. If a particular item must be included, first set it aside and choose the remaining r−1 items from the other n−1 items: C(n−1, r−1). If an item must be excluded, simply choose all r items from the remaining n−1: C(n−1, r). For multiple conditions, care must be taken with the addition and multiplication principles, and sometimes the complement method—counting the total without restrictions and subtracting unwanted cases—proves the most efficient strategy.
考试题目常常引入限制条件，例如必须包含或排除某些特定个体。处理这类问题时，可将问题拆分。若某个特定对象必须入选，先将其排除在外，再从剩下的 n−1 个对象中选取余下的 r−1 个：C(n−1, r−1)。若某个对象必须排除，则直接从剩余 n−1 个中选取全部 r 个：C(n−1, r)。对于多重条件，需谨慎运用加法原理和乘法原理，有时补集法——先计算无限制总数，再减去不满足条件的部分——会成为最高效的策略。
7. Combinations in Probability Calculations | 概率计算中的组合
f an event A is given by P(A) = (number of favourable combinations) / (total number of possible combinations). For instance, when drawing a hand of cards, the total number of ways to choose 5 cards from a deck of 52 is C(52, 5). To find the probability of drawing exactly two aces, we count the ways to choose 2 aces from the 4 aces and 3 other cards from the 48 non-aces, and divide by C(52, 5). This method underpins hypergeometric probabilities and many exam problems.
在概率中，当样本空间由无序选取结果构成时，组合用于计算等可能结果的个数。事件A的概率为 P(A) = （有利组合数）/（所有可能组合总数）。例如，从一副52张的扑克牌中抽5张，所有可能方式数为 C(52, 5)。要计算恰好抽到两张A的概率，先求从4张A中选2张的方案数，乘上从48张非A中选3张的方案数，再除以 C(52, 5)。这种方法奠定了超几何概率和许多考题的基础。
8. Link to the Binomial Theorem | 与二项式定理的联系
Combinations appear in the expansion of (a + b)n. The binomial theorem states that (a + b)n = Σ (from r=0 to n) C(n, r) an−r br. Thus C(n, r) is the coefficient of the br term. This direct connection means that any question involving binomial expansions implicitly uses combinations. Understanding combinations helps in determining specific coefficients without full expansion and in solving problems related to binomial distribution in statistics, where the probability of r successes in n trials involves C(n, r).
组合出现在 (a + b)n 的展开式中。二项式定理指出：(a + b)n = Σ (r=0 到 n) C(n, r) an−r br。因此 C(n, r) 就是 br 项的系数。这种直接联系意味着任何涉及二项式展开的问题都隐含地运用了组合。理解组合有助于在不做完全展开的情况下确定特定项的系数，也有助于解决统计学中二项分布的相关问题，其中n次试验中成功r次的概率就包含 C(n, r)。
9. Solving Exam-Style Questions | 典型考题解析
A typical Edexcel question might ask: ' women. Find the number of ways to form the committee if it must contain at least 2 women.' ,0). Breaking conditions into disjoint cases and applying the multiplication principle for independent choices is a fundamental skill. Always verify that cases are mutually exclusive to avoid double-counting.
一道典型的Edexcel题目可能问：“从6名男性和5名女性中选出一个4人委员会，若委员会至少要有2名女性，共有多少种组成方式？”解法是对可能情形求和：2女2男、3女1男或4女0男。计数值为 C(5,2)×C(6,2) + C(5,3)×C(6,1) + C(5,4)×C(6,0)。将条件拆分为互斥的情形，并对独立选择运用乘法原理，是一项基本技能。务必验证各种情形互不相容，以避免重复计数。
10. Common Mistakes and How to Avoid Them | 常见错误及避免方法
One frequent error is confusing permutations with combinations. When order does not matter but the student uses permutations, the answer is overcounted by a factor of r!. Another mistake is mishandling restrictions, for example forgetting to reduce both n and r when an item is fixed. Also, when solving 'at least' problems, pupils sometimes fail to consider all cases or mistakenly include overlapping cases. Finally, not simplifying factorial expressions efficiently can lead to arithmetic errors. The best prevention is to label n and r clearly and draw a simple diagram or list the cases.
一个常见错误是将排列与组合混淆。当顺序无关时若误用排列，答案会因多乘 r! 而偏大。另一个错误是对限制条件处理不当，例如当某个对象固定入选时，忘记同时减小 n 和 r。此外，解答“至少”类问题时，学生有时未能列出所有情形，或错误地包含了重叠情形。最后，未能高效化简阶乘表达式则可能导致算术错误。最好的预防方法是清晰标注 n 和 r，并画出简图或列出所有情形。
11. Using Combinations with Multiplication and Addition Principles | 组合与乘法、加法原理的运用
selections, multiply the number of ways: e.g., choosing 2 from set A AND 3 from set B yields C(size_A,2)×C(size_B,3). For alternative selections, add the ways: e.g., choosing 5 from set A OR 5 from set B yields C(size_A,5) + C(size_B,5). Many harder problems require these combined with permutations or factorials, particularly when arranging the selected items afterwards. Always read the problem carefully to decide whether the final step involves ordering.
在多步骤选取任务中，组合需要结合乘法原理（“且”）和加法原理（“或”）。对独立选取，应相乘：例如从A集中选2个、同时从B集中选3个，方式数为 C(|A|,2)×C(|B|,3)。对选择性情形，则相加：例如从A集中选5个，或从B集中选5个，方式数为 C(|A|,5) + C(|B|,5)。许多较难的题目还需将这些原理与排列或阶乘结合使用，尤其是选完后还要对所选对象进行排列时。务必仔细审题，判断最后是否需要排序。
12. Summary and Key Takeaways | 总结与要点回顾
Combinations count unordered selections from a set. The formula C(n, r) = n!/(r!(n−r)! matters and order-does-not-matter problems is crucial. Properties like symmetry and Pascal' alculations and are tested in proofs. Handling restrictions by splitting into cases, using 'must include' and 'must exclude' ons and probability problems. Mastery of this topic, including efficient use of calculator' lgebraic manipulation, will secure reliable marks on the Edexcel A-Level Mathematics exam.
组合计算的是从集合中进行无序选取的方式数。基本公式为 C(n, r) = n!/(r!(n−r)!)。区分“顺序重要”与“顺序无关”问题至关重要。对称性和帕斯卡法则等性质不仅简化计算，也常在证明题中考查。通过拆分为不同情形来处理限制条件，运用“必须包含”和“必须排除”的逻辑，是经常考核的技能。组合为二项式展开和概率问题提供了计数基础。掌握这一专题，包括熟练操作计算器的 nCr 功能并进行代数变形，将为Edexcel A-Level数学考试赢得稳妥的分数。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图