IB Mathematics: Combinatorics Concepts and Calculation | IB数学：组合的概念与计算

📚 IB Mathematics: Combinatorics Concepts and Calculation | IB数学：组合的概念与计算

Combinatorics is a fundamental branch of mathematics that deals with counting, arrangement, and selection of objects. In the IB Mathematics curriculum, understanding combinations is essential for solving problems in probability, statistics, and beyond. This article explores the core concepts of combinations, their formulas, properties, and applications, with a focus on what IB students need to know for their exams.

组合数学是数学的一个重要分支，研究对象的计数、排列与选取。在IB数学课程中，理解组合的概念对于解决概率、统计及其他领域的问题至关重要。本文将深入探讨组合的核心概念、公式、性质及其应用，重点覆盖IB学生在考试中需要掌握的知识点。

1. Fundamental Principle of Counting | 计数基本原理

Before diving into combinations, we must understand the multiplication principle. If one event can occur in m ways and a second independent event can occur in n ways, then the two events together can occur in m × n ways. This principle forms the foundation of all combinatorial counting.

在学习组合之前，我们必须理解乘法原理。如果一个事件有 m 种发生方式，另一个独立事件有 n 种发生方式，那么这两个事件同时发生共有 m × n 种方式。这一原理是组合计数的基石。

For example, if a restaurant offers 4 appetizers and 6 main courses, the total number of ways to choose one appetizer and one main course is 4 × 6 = 24. This simple yet powerful idea extends to any number of independent choices.

例如，一家餐厅提供4种开胃菜和6种主菜，选择一份开胃菜和一份主菜的总方式数为 4 × 6 = 24。这个简单而强大的思想可以推广到任意多个独立选择。

2. Factorial Notation | 阶乘记号

The factorial of a non-negative integer n, denoted as n!, is the product of all positive integers from 1 to n. For example, 5! = 5 × 4 × 3 × 2 × 1 = 120. By definition, 0! = 1. Factorials are essential in defining permutations and combinations.

非负整数 n 的阶乘，记为 n!，是从1到 n 的所有正整数的乘积。例如，5! = 5 × 4 × 3 × 2 × 1 = 120。根据定义，0! = 1。阶乘是定义排列和组合的基础。

n! = n × (n − 1) × (n − 2) × … × 2 × 1

In IB exams, students must be comfortable computing factorials quickly and simplifying expressions involving factorials, such as (n+1)! / n! = n + 1.

在IB考试中，学生需要熟练计算阶乘，并能简化涉及阶乘的表达式，例如 (n+1)! / n! = n + 1。

3. Permutations vs. Combinations | 排列与组合的区别

Permutations and combinations both involve selecting items from a set, but they differ in whether order matters. A permutation is an arrangement of items where order is significant; a combination is a selection of items where order is insignificant.

排列和组合都涉及从集合中选取元素，但二者的区别在于顺序是否重要。排列是考虑顺序的安排，而组合是不考虑顺序的选取。

For example, selecting 3 students from a class to form a committee is a combination (order doesn’t matter), while selecting 3 students to be president, vice-president, and treasurer is a permutation (order matters).

例如，从班级中选3名学生组成委员会是组合（顺序无关），而选3名学生分别担任主席、副主席和财务主管是排列（顺序重要）。

Permutation: order matters, denoted as P(n, r) or ⁿPᵣ
排列：顺序重要，记为 P(n, r) 或 ⁿPᵣ
Combination: order does not matter, denoted as C(n, r) or ⁿCᵣ
组合：顺序不重要，记为 C(n, r) 或 ⁿCᵣ

4. The Combination Formula | 组合公式

The number of ways to choose r objects from a set of n distinct objects, where order does not matter, is given by the combination formula:

从 n 个不同对象中选取 r 个对象（不考虑顺序）的方式数由以下组合公式给出：

C(n, r) = ⁿCᵣ = n! / [r!(n − r)!]

For instance, C(5, 2) = 5! / (2! × 3!) = 120 / (2 × 6) = 10. This means there are 10 different ways to choose 2 items from a set of 5 distinct items.

例如，C(5, 2) = 5! / (2! × 3!) = 120 / (2 × 6) = 10。这意味着从5个不同物品中选取2个共有10种不同的方式。

In IB Mathematics, combinations are also denoted using the binomial coefficient notation (ₙᵣ), which is read as “n choose r.” The notation C(n, r) is commonly used at the Analysis and Approaches level, while (ₙᵣ) appears frequently in the binomial theorem section.

在IB数学中，组合也可以用二项式系数记号 (ₙᵣ) 表示，读作”n选r”。在分析与方法（AA）级别中常用 C(n, r)，而在二项式定理部分则经常使用 (ₙᵣ)。

5. Key Properties of Combinations | 组合的重要性质

Several important properties of combinations simplify calculations and are frequently tested in IB exams.

组合有几个重要的性质可以简化计算，这些性质在IB考试中经常出现。

Symmetric property: C(n, r) = C(n, n − r). Choosing r items is equivalent to choosing the n − r items to leave out.
对称性：C(n, r) = C(n, n − r)。选取 r 个物品相当于选择 n − r 个物品不选。
Boundary values: C(n, 0) = 1 and C(n, n) = 1. There is exactly one way to choose nothing or to choose everything.
边界值：C(n, 0) = 1 且 C(n, n) = 1。选择无或选择全部恰好只有一种方式。
Pascal’s identity: C(n, r) + C(n, r + 1) = C(n + 1, r + 1).
帕斯卡恒等式：C(n, r) + C(n, r + 1) = C(n + 1, r + 1)。

For example, C(10, 3) = C(10, 7), because choosing 3 items from 10 is the same as choosing the 7 items to leave out. This property is especially useful when r is close to n, as it reduces computation effort.

例如，C(10, 3) = C(10, 7)，因为从10个中选3个等价于选7个不选。当 r 接近 n 时，利用这一性质可以显著减少计算量。

6. Permutation Formula and Its Relation to Combinations | 排列公式及其与组合的关系

The permutation formula counts arrangements where order matters. The formula for the number of permutations of r objects chosen from n distinct objects is:

排列公式用于计算考虑顺序的安排数。从 n 个不同对象中选取 r 个对象的排列数为：

P(n, r) = ⁿPᵣ = n! / (n − r)!

The key relationship between permutations and combinations is: P(n, r) = r! × C(n, r). In other words, to obtain the number of permutations, we first choose r items (combination) and then arrange them in r! different orders.

排列与组合的关键关系是：P(n, r) = r! × C(n, r)。换言之，要计算排列数，我们首先选取 r 个物品（组合），然后将其在 r! 种不同的顺序中排列。

For example, P(5, 2) = 20, while C(5, 2) = 10. The 10 combinations, each arranged in 2! = 2 ways, yield 10 × 2 = 20 permutations.

例如，P(5, 2) = 20，而 C(5, 2) = 10。这10种组合分别按 2! = 2 种方式排列，得到 10 × 2 = 20 种排列。

7. Combinations with Repetition | 有重复的组合

In some problems, we may choose items with repetition allowed. The number of ways to choose r objects from n types of objects where repetition is allowed and order does not matter is given by:

在某些问题中，我们允许重复选取物品。从 n 类物品中选取 r 个（允许重复且不考虑顺序）的方式数为：

C(n + r − 1, r) = (n + r − 1)! / [r!(n − 1)!]

For example, choosing 4 scoops of ice cream from 3 available flavors, with repetition allowed, gives C(3 + 4 − 1, 4) = C(6, 4) = 15 different combinations.

例如，从3种口味中选择4球冰淇淋（允许重复），共有 C(3 + 4 − 1, 4) = C(6, 4) = 15 种不同的组合。

This concept is sometimes called a “multiset” combination. In the IB syllabus, this topic appears mainly at Higher Level, but a strong foundation in it helps with complex counting problems.

这一概念有时被称为”多重集”组合。在IB教学大纲中，这一主题主要出现在高级水平（HL），但扎实掌握它有助于解决复杂的计数问题。

8. Binomial Theorem and Combinations | 二项式定理与组合

Combinations appear naturally in the expansion of binomial expressions. The binomial theorem states that for any positive integer n:

组合自然地出现在二项式的展开中。二项式定理指出，对任意正整数 n：

(a + b)ⁿ = Σᵣ₌₀ⁿ C(n, r) aⁿ⁻ʳ bʳ

Equivalently, the coefficient of aⁿ⁻ʳbʳ in the expansion is exactly C(n, r). For example, (x + y)³ = x³ + 3x²y + 3xy² + y³, where the coefficients 1, 3, 3, 1 correspond to C(3, 0), C(3, 1), C(3, 2), and C(3, 3) respectively.

等价地，展开式中 aⁿ⁻ʳbʳ 的系数恰好是 C(n, r)。例如，(x + y)³ = x³ + 3x²y + 3xy² + y³，其中系数 1、3、3、1 分别对应于 C(3, 0)、C(3, 1)、C(3, 2) 和 C(3, 3)。

In IB exams, students are often asked to find a specific term in a binomial expansion without writing out the entire expansion. For example, to find the coefficient of x⁵ in (2x + 1)⁸, we use the general term Tᵣ₊₁ = C(8, r)(2x)⁸⁻ʳ(1)ʳ and solve for the power of x.

在IB考试中，学生经常需要在不写出整个展开式的情况下找到二项式展开中的某一特定项。例如，求 (2x + 1)⁸ 中 x⁵ 的系数，我们可以使用通项 Tᵣ₊₁ = C(8, r)(2x)⁸⁻ʳ(1)ʳ 并根据 x 的指数来求解。

9. Pascal’s Triangle | 帕斯卡三角形

Pascal’s Triangle is a triangular array of binomial coefficients. Row n (starting with row 0) contains the values C(n, 0), C(n, 1), …, C(n, n). Each entry is the sum of the two entries directly above it.

帕斯卡三角形是二项式系数的三角形排列。第 n 行（从第0行开始）包含 C(n, 0)、C(n, 1)、…、C(n, n)。每个条目是其正上方两个条目之和。

The first few rows are:

前几行如下：

Row 0	1
Row 1	1 1
Row 2	1 2 1
Row 3	1 3 3 1
Row 4	1 4 6 4 1
Row 5	1 5 10 10 5 1

Pascal’s Triangle provides a quick visual method for finding combinations without calculating factorials. It also illustrates many interesting properties, such as the symmetry C(n, r) = C(n, n − r) and the fact that alternating sums of each row equal zero.

帕斯卡三角形提供了一种无需计算阶乘即可快速查找组合数的可视化方法。它还展示了许多有趣的性质，例如对称性 C(n, r) = C(n, n − r)，以及每行交错和等于零的事实。

10. Applications in Probability | 组合在概率中的应用

Combinations are widely used in probability problems where we need to count favorable outcomes and total outcomes. In IB Mathematics, questions often involve selecting cards from a deck, choosing balls from a bag, or forming committees.

组合在概率问题中广泛应用，我们需要计算有利结果数和总结果数。在IB数学中，题目常涉及从牌堆中选牌、从袋中取球或组建委员会等情境。

For example, in a class of 20 students, if 5 students are randomly selected to form a project group, the probability that a specific student is included is C(19, 4) / C(20, 5) = 5/20 = 1/4. This is because once the specific student is fixed, we choose the remaining 4 from the other 19.

例如，在一个20名学生的班级中，随机选取5名学生组成项目小组，某特定学生被选中的概率是 C(19, 4) / C(20, 5) = 5/20 = 1/4。因为一旦确定了该特定学生，我们只需从其余19名学生中选4人。

Another classic example: drawing 2 cards from a standard deck of 52, the probability that both are hearts is C(13, 2) / C(52, 2) = 78 / 1326 = 1/17. The combination formula efficiently handles such counting tasks.

另一个经典例子：从52张标准扑克牌中抽取2张，两张都是红心的概率是 C(13, 2) / C(52, 2) = 78 / 1326 = 1/17。组合公式可以高效地处理这类计数问题。

11. Common IB Exam Tips | IB考试常见技巧

IB students often lose marks due to small errors in combinatorial reasoning. Here are some essential tips to avoid common pitfalls.

IB学生常常因为在组合推理上的小错误而失分。以下是一些避免常见陷阱的关键技巧。

Identify order: Always determine whether order matters before choosing a formula. If order matters, use permutations; if not, use combinations.
判断顺序：在使用公式前，始终确认顺序是否重要。如果顺序重要用排列，否则用组合。
Check n and r: Ensure that r ≤ n. Combinations with r > n are undefined in this context.
核对 n 和 r：确保 r ≤ n。在本语境下，r > n 的组合没有定义。
Use symmetry wisely: When r is large, replace C(n, r) with C(n, n − r) to simplify calculations.
善用对称性：当 r 较大时，用 C(n, n − r) 替代 C(n, r) 以简化计算。
Watch for identical items: If items are not distinct, the standard combination formula does not apply directly; divide by the factorial of the number of identical items.
注意相同物品：如果物品不完全不同，标准组合公式不能直接使用；应除以相同物品数量的阶乘。
Practice calculator use: Many IB-approved calculators have a “nCr” function. Know how to use it efficiently, but also understand the underlying logic.
练习计算器使用：许多IB认可的计算器具有”nCr”功能。学会高效使用它，同时理解其背后的逻辑。

12. Worked Example: Full IB-Style Problem | 完整例题：IB风格问题

Consider the following problem: A committee of 4 people is to be formed from 6 boys and 5 girls. How many different committees can be formed if the committee must contain at least 2 girls?

考虑以下问题：从6名男生和5名女生中组建一个4人委员会。如果委员会必须至少包含2名女生，可以组建多少种不同的委员会？

We solve this by considering three mutually exclusive cases:

我们通过考虑三种互斥情况来求解：

Case 1: Exactly 2 girls and 2 boys. C(5, 2) × C(6, 2) = 10 × 15 = 150
情况1：恰好2名女生和2名男生。C(5, 2) × C(6, 2) = 10 × 15 = 150
Case 2: Exactly 3 girls and 1 boy. C(5, 3) × C(6, 1) = 10 × 6 = 60
情况2：恰好3名女生和1名男生。C(5, 3) × C(6, 1) = 10 × 6 = 60
Case 3: Exactly 4 girls and 0 boys. C(5, 4) × C(6, 0) = 5 × 1 = 5
情况3：恰好4名女生和0名男生。C(5, 4) × C(6, 0) = 5 × 1 = 5

Adding these cases gives the total number of committees: 150 + 60 + 5 = 215.

将以上情况相加，得到委员会总数为：150 + 60 + 5 = 215。

Alternatively, we could use the complement method: total committees minus committees with 0 or 1 girl. Total C(11, 4) = 330; committees with 0 girls: C(6, 4) = 15; committees with exactly 1 girl: C(5, 1) × C(6, 3) = 5 × 20 = 100. Thus 330 − 15 − 100 = 215, confirming our answer.

或者，我们可以使用补集方法：总委员会数减去包含0名或1名女生的情况。总数 C(11, 4) = 330；包含0名女生的：C(6, 4) = 15；恰好1名女生的：C(5, 1) × C(6, 3) = 5 × 20 = 100。因此 330 − 15 − 100 = 215，验证了我们的答案。

Understanding combinations requires a clear grasp of when order matters, fluency with factorial arithmetic, and the ability to break complex selection problems into manageable cases. Mastering these skills not only prepares you for IB Mathematics exams but also builds essential problem-solving abilities for university-level study in science, engineering, economics, and data science. Regular practice with IB-style questions is the key to success.

理解组合需要清晰把握顺序何时重要、熟练运用阶乘运算以及将复杂的选择问题拆分为可管理的案例。掌握这些技能不仅为IB数学考试做好准备，也为大学阶段在科学、工程、经济学和数据科学等领域的学习构建了必不可少的解决问题的能力。定期练习IB风格题目是取得成功的钥匙。

Published by TutorHao | Mathematics Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）

IB Mathematics: Combinatorics Concepts and Calculation | IB数学：组合的概念与计算