📚 Counting Principles | 计数原理
Counting principles form the backbone of combinatorics and are essential for solving problems in probability, statistics, and discrete mathematics. In the IB Mathematics curriculum, whether you are studying Analysis and Approaches (AA) or Applications and Interpretation (AI), a solid grasp of multiplication and addition principles, permutations, combinations, and the binomial theorem is indispensable. This article systematically covers every major counting technique required at both Standard Level and Higher Level, with clear examples and direct pairings of English and Chinese explanations to support bilingual learners.
计数原理是组合数学的基石，对于解决概率、统计和离散数学问题至关重要。在IB数学课程中，无论你学习的是分析与方法（AA）还是应用与解释（AI），牢固掌握乘法原理、加法原理、排列、组合以及二项式定理都是不可或缺的。本文系统地涵盖了标准级别和高级别所需的所有主要计数技巧，并配有清晰的示例和中英对照解释，以支持双语学习者的理解。
1. The Multiplication Principle | 乘法原理
n the total number of ways to complete the entire task is given by the product m × n × p × … is is the fundamental multiplication principle, often called the basic counting principle.
如果一项任务可以分解成一系列相互独立的步骤，其中第一步有m种完成方式，第二步有n种，第三步有p种，依此类推，那么完成整个任务的总方式数就等于乘积 m × n × p × …。这就是基本的乘法原理，通常被称为基本计数原理。
e choices are independent; the selection of a starter does not affect the number of main courses available.
例如，一家餐厅提供3种开胃菜、4种主菜和2种甜点。可能的三道菜套餐数量是 3 × 4 × 2 = 24。请注意，这些选择是独立的；选择开胃菜并不会影响可选主菜的数量。
Tree diagrams visually represent the multiplication principle: each branch corresponds to a choice at a given step, and the total number of outcomes is the total number of end branches. While drawing every branch is impractical for large numbers, the underlying logic is identical – multiply the numbers of options for each stage.
树状图能直观地表现乘法原理：每个分支对应某个步骤中的一个选项，而最终结果的总数就是末端分支的总数。虽然对于大样本直接画出所有分支不太现实，但其背后的逻辑是完全相同的——将每个阶段的选项数相乘。
2. The Addition Principle | 加法原理
When a task can be performed by choosing exactly one option from several mutually exclusive categories, the total number of ways is the sum of the numbers of ways in each category. The addition principle applies when events cannot occur simultaneously – you must take one route or the other, not both.
当一项任务可以通过从几个互斥的类别中选择恰好一种方式来完成时，总的完成方式数就是各类别方式数之和。当事件不能同时发生时适用加法原理——你必须选择其中一种途径，而不能同时选择两者。
one mode of transport can be chosen, the total number of travel options is 4 + 3 + 2 = 9.
假设一名学生可以乘公共汽车、火车或骑自行车上学。共有4条公交线路、3条火车线路和2条安全的自行车道。由于只能选择一种交通方式，因此出行方案的总数为 4 + 3 + 2 = 9。
ation yields 3 × 2 = 6 options. Since the two types of meal are mutually exclusive, the total is 12 + 6 = 18.
加法原理常常与乘法原理结合使用来解决复杂问题。例如，一个套餐优惠提供：一个三明治（4种）加一杯饮料（3种） 或者 一份沙拉（3种）加一杯饮料（2种）。三明治+饮料的组合有 4 × 3 = 12 种选择；沙拉+饮料的组合有 3 × 2 = 6 种选择。由于这两种餐食是互斥的，总数为 12 + 6 = 18。
3. Factorial Notation | 阶乘记号
For any positive integer n, n factorial, denoted by n!, is the product of all positive integers from n down to 1. By definition, 0! ks of permutation and combination formulas because they count the number of ways to arrange a complete set of distinct objects in a line.
对于任意正整数n，n的阶乘（记作n!）是从n一直乘到1的所有正整数的乘积。根据定义，0! = 1。阶乘是排列和组合公式的基石，因为它计算的是将一组完全不同的物体排成一列的总方式数。
For example, 5! 1 = 120. If you have five different books and want to arrange them on a shelf, there are 5! = 120 possible orders.
例如，5! = 5 × 4 × 3 × 2 × 1 = 120。如果你有五本不同的书，想把它们排列在书架上，共有 5! = 120 种可能的顺序。
The factorial function grows extremely rapidly, which explains why counting problems can quickly involve astronomically large numbers. Factorials also appear in the binomial coefficients and in the expansions of many series.
阶乘函数增长得非常快，这也解释了为什么计数问题很快就会涉及天文数字。阶乘也出现在二项式系数以及许多级数展开中。
4. Permutations of Distinct Objects | 不同物体的排列
ange them in a specific order, the number of possible permutations is given by P(n, r) = n! / (n − r)! multiplication principle: there are n choices for the first position, n−1 for the second, …, and n−r+1 for the r‑th position.
排列是指物体的有序安排。当我们从n个不同的物体中选取r个并按特定顺序排列时，可能的排列数由 P(n, r) = n! / (n − r)! 给出。这个公式反映了乘法原理：第一个位置有n个选择，第二个位置有n−1个，……，第r个位置有n−r+1个。
e 8 can win gold, then any of the remaining 7 win silver, and any of the remaining 6 win bronze.
考虑一场有8名选手的赛跑。金、银、铜牌的分配方式有 P(8, 3) = 8 × 7 × 6 = 336 种。这很合理：任何一个人都可能得金牌，然后剩下7人中任何一人得银牌，接着剩下6人中任何一人得铜牌。
When r = n, i.e., we arrange all n objects, the formula simplifies to n!/(n − n)! = n!/0! = n!, which is the number of permutations of the whole set.
当 r = n，即我们将所有n个物体全部排列时，公式简化为 n!/(n − n)! = n!/0! = n!，这正是整个集合的全排列数。
5. Permutations with Identical Items | 含相同物体的排列
there are n objects in total, with n₁ identical objects of type 1, n₂ identical of type 2, …, and nₖ identical of type k, then the number of distinct permutations is n! / (n₁! × n₂! × … × nₖ!).
当某些物体无法区分时，直接使用阶乘会高估不同的排列数。如果总共有n个物体，其中有n₁个相同的类型1物体，n₂个相同的类型2物体，……，nₖ个相同的类型k物体，那么不同的排列数为 n! / (n₁! × n₂! × … × nₖ!)。
For example, how many distinct arrangements can be made from the letters of the word 'BANANA'? There are 6 letters in total: 3 A's, 2 N's, and 1 B. The number of distinct permutations is 6! / (3! × 2! × 1!) = 720 / (6 × 2) = 60.
例如，单词 'BANANA' 中的字母可以组成多少种不同的排列？共有6个字母：3个A，2个N和1个B。不同的排列数为 6! / (3! × 2! × 1!) = 720 / (6 × 2) = 60。
This principle extends to arranging objects in a circle when rotations are considered identical, where the formula becomes (n − 1)! for distinct objects, but the adjustments for identical items still apply.
该原理也延伸到考虑旋转视为相同时的圆排列，对于不同物体，公式变为 (n − 1)!，但当存在相同物体时仍需进行相应调整。
6. Combinations | 组合
umber of ways to choose r objects from a set of n distinct objects is given by C(n, r) = n! / [r!(n − r)! binations are always smaller than or equal to the corresponding permutations because the r! different orders of the same selected set are collapsed into a single combination.
组合是从集合中选择物体而不考虑顺序。从n个不同物体中选取r个的方式数由 C(n, r) = n! / [r!(n − r)!] 给出。这也写作 nCr 或者二项式系数 (n选r)。由于同一组选中物体的 r! 种不同排列被合并为一种组合，组合数总是小于或等于相应的排列数。
needs to be formed from a group of 10, the number of possible committees is C(10, 4) = 10!/(4! × 6! he order of selection does not matter, which distinguishes this from permutation problems.
如果需要从10人中选出一个4人委员会，可能的不同委员会有 C(10, 4) = 10!/(4! × 6!) = 210 个。选择的顺序无关紧要，这正是组合问题与排列问题的不同之处。
hich reflects the symmetry of choice: selecting r objects to include is equivalent to selecting n − r objects to exclude.
一个关键的恒等式是 C(n, r) = C(n, n − r)，这反映了选择的对称性：选取r个物体纳入与选取n−r个物体排除是等价的。
7. The Binomial Theorem and Counting | 二项式定理与计数
The binomial theorem provides a powerful link between algebra and combinatorics. For any positive integer n, (a + b)n = Σr=0n C(n, r) an−r br. Each coefficient C(n, r) counts the number of ways to choose r positions for the b term when expanding the product (a + b)(a + b)...(a + b) n times.
二项式定理在代数和组合学之间架起了一座强有力的桥梁。对于任意正整数n，(a + b)n = Σr=0n C(n, r) an−r br。每个系数 C(n, r) 表示在n次乘积 (a + b)(a + b)...(a + b) 展开时，选择b项出现r个位置的方式数。
For example, (x + y)4 = C(4,0)x4 + C(4,1)x3 y + C(4,2)x2 y2 + C(4,3)x y3 + C(4,4)y4. The coefficients 1, 4, 6, 4, 1 are exactly the entries of Pascal's triangle.
例如，(x + y)4 = C(4,0)x4 + C(4,1)x3 y + C(4,2)x2 y2 + C(4,3)x y3 + C(4,4)y4。系数 1, 4, 6, 4, 1 正好是帕斯卡三角形中的一行。
The binomial theorem is extremely versatile: it helps find specific terms without full expansion, calculate probabilities in binomial distributions, and prove combinatorial identities. The term containing br is Tr+1 = C(n, r) an−r br.
二项式定理用途极其广泛：它可以在不进行完全展开的情况下找到某一特定项，可用于计算二项式分布中的概率，还能证明组合恒等式。包含 br 的项为 Tr+1 = C(n, r) an−r br。
8. Arrangements and Selections with Restrictions | 有限制条件的排列与选择
Many IB exam questions impose constraints such as 'two people must sit together' or 'one item must not be chosen'. Such problems are typically solved by treating a group of objects that must stay together as a single block, then multiplying by the internal arrangements within that block, or by employing complementary counting: total ways minus the ways that violate the restriction.
许多IB考题会施加一些限制条件，例如“两个人必须坐在一起”或“某个物品不能被选中”。这类问题通常可以通过将必须放在一起的一组物体视为一个整体（块），然后乘上块内部的排列数来求解；或者采用补集计数法：总方法数减去违反限制条件的方法数。
specific friends must sit next to each other. Treat the two friends as one block, giving 4! ways to arrange the block and the other 3 people; within the block there are 2! arrangements. Total = 4! × 2! = 24 × 2 = 48.
考虑将5个人排成一排，其中两个特定的朋友必须相邻而坐。将这两位朋友视作一个整体，于是排列整体和另外3个人的方式有 4! 种；整体内部有 2! 种排列方式。总数 = 4! × 2! = 24 × 2 = 48。
) = 330. If the captain must be excluded, choose all 5 from the 11 others: C(11, 5) = 462.
对于有限制的选择问题，比如从12名球员中选出一个5人队伍，且队长必须入选，可以先确定队长，然后从其余11人中选出剩下的4人：C(11, 4) = 330。如果队长不能入选，则需从其他11人中选出5人：C(11, 5) = 462。
9. The Pigeonhole Principle | 鸽巢原理
The pigeonhole principle states that if n items are placed into m containers and n > m, then at least one container must contain more than one item. Though simple, it has profound implications in combinatorics and is often used to prove the existence of certain configurations without explicitly constructing them.
鸽巢原理指出：如果把n个物体放入m个容器中，且 n > m，那么至少有一个容器包含多于一个物体。尽管这个原理很简单，它在组合数学中有着深远的意义，常用于证明某种配置的存在性而无需显式地构造出来。
For example, in a group of 13 people, at least two share the same birth month, because there are only 12 months. In a more advanced IB context, the principle justifies that among any 5 points placed inside an equilateral triangle of side length 2, at least two points are at most 1 unit apart, by dividing the triangle into four smaller congruent triangles.
例如，在13个人中，至少有两个人的生日月份相同，因为总共只有12个月份。在更高级的IB情境中，该原理可证明：在一个边长为2的等边三角形内任意放置5个点，至少有两个点之间的距离至多为1，这可以通过将大三角形分割成四个全等的小三角形得证。
The generalised pigeonhole principle asserts that if n items are put into m containers, then at least one container holds at least ⌈n/m⌉ items. This is especially useful for distribution problems involving minimum guarantees.
广义鸽巢原理断言，如果将n个物体放入m个容器，那么至少有一个容器包含至少 ⌈n/m⌉ 个物体。这在涉及最小保证的分配问题中尤其有用。
10. Applications in Probability | 概率中的应用
utcomes in A) / (total number of outcomes). Calculating both numerator and denominator nearly always relies on permutations and combinations.
计数原理是离散概率的语言。在等可能结果空间中，事件A的概率为 P(A) = （A中的结果数）/（总结果数）。计算分子和分母几乎总是依赖于排列和组合。
ls are drawn at random without replacement, what is the probability that exactly 2 are red? = 120. Favourable outcomes = C(6, 2) × C(4, 1) = 15 × 4 = 60. Probability = 60/120 = 1/2.
一个典型的IB问题：一个盒子里有6个红球和4个蓝球。如果随机抽取3个球且不放回，恰好抽到2个红球的概率是多少？总结果数 = C(10, 3) = 120。有利结果数 = C(6, 2) × C(4, 1) = 15 × 4 = 60。概率 = 60/120 = 1/2。
ses in n independent trials. If the probability of success is p, then P(X = r) = C(n, r) pr (1−p)n−r. Here, counting combinations underlies the entire probability mass function, highlighting how foundational counting principles are.
此外，二项式分布利用 C(n, r) 来模拟n次独立试验中成功的次数。如果每次成功的概率为p，那么 P(X = r) = C(n, r) pr (1−p)n−r。这里，组合计数是整个概率质量函数的基础，彰显了计数原理的根本重要性。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图