The Product Principle — 乘法原理

Introduction to the Product Principle

乘法原理简介

The Product Principle, also known as the Multiplication Principle or the Fundamental Counting Principle, is one of the most foundational ideas in combinatorics and probability. It provides a systematic way to count the total number of possible outcomes when a task can be broken down into a sequence of independent choices or stages. For IB Mathematics students, mastering this principle is essential because it underpins nearly every counting technique encountered in the syllabus, from basic permutations and combinations to more advanced problems in probability distributions.

乘法原理，也称为乘法计数原理或基本计数原理，是组合数学和概率论中最基础的思想之一。当一个任务可以分解为一系列独立的选择或阶段时，它提供了一种系统的方法来计算所有可能结果的总数。对于 IB 数学学生来说，掌握这一原理至关重要，因为它支撑着课程大纲中几乎所有的计数技术，从基本的排列组合到概率分布中更高级的问题。

At its core, the Product Principle states a deceptively simple idea: if one event can occur in m different ways, and for each of those ways a second independent event can occur in n different ways, then the two events together can occur in m multiplied by n ways. This seemingly obvious statement becomes remarkably powerful when applied to problems involving multiple stages, repeated selections, or constrained choices.

乘法原理的核心是一个看似简单的想法：如果一个事件可以以 m 种不同的方式发生，而对于每一种方式，第二个独立事件可以以 n 种不同的方式发生，那么这两个事件一起发生的方式总数为 m 乘以 n。这个看似显而易见的陈述在应用于涉及多个阶段、重复选择或受限选择的问题时变得非常强大。

Formal Definition and Notation

形式化定义与符号表示

Let us state the Product Principle more formally. Suppose a procedure consists of k sequential stages. Let n1 be the number of ways to complete the first stage. For each outcome of the first stage, let n2 be the number of ways to complete the second stage. For each combined outcome of the first two stages, let n3 be the number of ways to complete the third stage, and so on. The total number of ways to complete the entire procedure is the product n1 x n2 x n3 x … x nk.

让我们更正式地陈述乘法原理。假设一个过程由 k 个顺序阶段组成。设 n1 为完成第一阶段的方法数。对于第一阶段的每个结果，设 n2 为完成第二阶段的方法数。对于前两个阶段的每个组合结果，设 n3 为完成第三阶段的方法数，依此类推。完成整个过程的总方法数为乘积 n1 x n2 x n3 x … x nk。

In set-theoretic notation, if A1, A2, …, Ak are finite sets representing the possible choices at each stage, and the choices are made independently, then the cardinality of the Cartesian product A1 x A2 x … x Ak is the product of the individual cardinalities: |A1 x A2 x … x Ak| = |A1| x |A2| x … x |Ak|. This connection to the Cartesian product is precisely why it is called the “Product” Principle.

用集合论的符号表示，如果 A1, A2, …, Ak 是表示每个阶段可能选择的有限集合，且选择是独立进行的，那么笛卡尔积 A1 x A2 x … x Ak 的基数是个别基数的乘积：|A1 x A2 x … x Ak| = |A1| x |A2| x … x |Ak|。这种与笛卡尔积的联系正是它被称为”乘法”原理的原因。

Simple Two-Stage Examples

简单的两阶段示例

Consider a restaurant menu with 4 starters and 5 main courses. If a customer chooses exactly one starter and exactly one main course, how many different two-course meals are possible? By the Product Principle, the answer is 4 x 5 = 20. For each of the 4 starters, there are 5 possible main courses to pair with it, giving 4 groups of 5, which is 20 total combinations.

考虑一家餐厅的菜单，有 4 道开胃菜和 5 道主菜。如果顾客恰好选择一道开胃菜和一道主菜，有多少种不同的两道菜套餐？根据乘法原理，答案是 4 x 5 = 20。对于 4 道开胃菜中的每一道，都有 5 道可能的主菜与之搭配，产生 4 组各 5 种的组合，总计 20 种。

Another classic example involves clothing choices. Suppose you have 6 shirts, 4 pairs of trousers, and 3 pairs of shoes. How many distinct outfits can you create by choosing one of each? The answer is 6 x 4 x 3 = 72. This extends the principle to three stages, demonstrating that the product rule scales naturally to any finite number of independent choices.

另一个经典示例涉及服装选择。假设你有 6 件衬衫、4 条裤子和 3 双鞋。通过各选一件，你可以搭配出多少种不同的服装？答案是 6 x 4 x 3 = 72。这将原理扩展到三个阶段，表明乘积规则自然地适用于任意有限数量的独立选择。

The Tree Diagram: A Visual Representation

树状图：一种可视化表示

A powerful way to understand and verify the Product Principle is through a tree diagram. At the first stage, draw a branch for each possible choice. At the second stage, from the end of each first-stage branch, draw branches for each second-stage choice. The total number of endpoints in the tree equals the product of the number of branches at each level. This visual tool is especially useful for checking whether the Product Principle applies: each path from root to leaf must represent a unique and complete outcome, and no two paths should represent the same outcome.

理解和验证乘法原理的一个强大方法是通过树状图。在第一阶段，为每个可能的选择画一个分支。在第二阶段，从每个第一阶段分支的末端，为每个第二阶段选择画出分支。树中端点的总数等于每一层分支数的乘积。这个可视化工具对于检查乘法原理是否适用特别有用：从根到叶的每条路径必须代表一个唯一且完整的结果，且没有两条路径代表相同的结果。

Tree diagrams also reveal when the choices at later stages depend on the outcomes of earlier stages, a situation where the Product Principle still applies but requires careful counting of the number of branches at each dependent stage. This is fundamentally different from the Addition Principle, which we will discuss shortly, and understanding this distinction is critical for IB examination success.

树状图还揭示了后期阶段的选择何时依赖于早期阶段的结果，在这种情况下，乘法原理仍然适用，但需要仔细计算每个依赖阶段的分支数量。这与我们即将讨论的加法原理有着根本的不同，理解这一区别对于 IB 考试的成功至关重要。

Product Principle vs. Addition Principle

乘法原理与加法原理

It is essential to distinguish the Product Principle from the Addition Principle. The Addition Principle states that if a task can be completed in one of several mutually exclusive ways, the total number of ways is the sum of the ways for each case. In contrast, the Product Principle applies when all stages must be completed sequentially to form one outcome. The key question to ask is: “Am I doing this AND that (multiply), or am I doing this OR that (add)?”

区分乘法原理和加法原理至关重要。加法原理指出，如果一个任务可以通过几种互斥的方式之一完成，那么总方法数是每种情况的方法数之和。相比之下，乘法原理适用于所有阶段必须按顺序完成才能形成一个结果的情况。要问的关键问题是：”我是做这个并且做那个（相乘），还是做这个或者做那个（相加）？”

For example, if a student must choose one question from Section A (5 questions) and one question from Section B (4 questions), the number of ways to select the pair is 5 x 4 = 20 by the Product Principle. However, if the student must choose one question from either Section A or Section B, the number of ways is 5 + 4 = 9 by the Addition Principle. The conjunctions “and” versus “or” provide the decisive clue.

例如，如果学生必须从 A 部分（5 道题）中选择一道题，并从 B 部分（4 道题）中选择一道题，那么选择这对题目的方法数是 5 x 4 = 20，使用乘法原理。然而，如果学生必须从 A 部分或 B 部分中选择一道题，那么方法数是 5 + 4 = 9，使用加法原理。连接词”并且”与”或者”提供了决定性的线索。

Applications in Permutations

在排列中的应用

The Product Principle provides the logical foundation for permutations. Consider arranging n distinct objects in a line. For the first position, there are n choices. After placing the first object, there are n-1 choices for the second position. Continuing this reasoning, the number of permutations is n x (n-1) x (n-2) x … x 2 x 1 = n factorial, denoted n!. This is the Product Principle applied to n stages where the number of choices decreases by one at each subsequent stage.

乘法原理为排列提供了逻辑基础。考虑将 n 个不同的物体排成一行。对于第一个位置，有 n 种选择。放置第一个物体后，第二个位置有 n-1 种选择。继续这个推理，排列数为 n x (n-1) x (n-2) x … x 2 x 1 = n 的阶乘，记作 n!。这是将乘法原理应用于 n 个阶段，每个后续阶段的选择数减少一个。

Partial permutations, or arrangements of r objects chosen from n distinct objects, denoted P(n,r) or nPr, also rely on the Product Principle. The first position has n choices, the second has n-1, and so on until the r-th position has n-r+1 choices. Multiplying these gives P(n,r) = n x (n-1) x … x (n-r+1) = n! / (n-r)!. This formula appears frequently in IB Mathematics, particularly in the Analysis and Approaches (AA) syllabus, where combinatorics forms a significant portion of Topic 1 (Number and Algebra).

部分排列，即从 n 个不同物体中选择 r 个进行排列，记作 P(n,r) 或 nPr，也依赖于乘法原理。第一个位置有 n 种选择，第二个有 n-1 种，依此类推，直到第 r 个位置有 n-r+1 种选择。将这些相乘得到 P(n,r) = n x (n-1) x … x (n-r+1) = n! / (n-r)!。这个公式在 IB 数学中频繁出现，特别是在分析与方法 (AA) 课程中，组合数学构成主题 1（数与代数）的重要部分。

Applications in Combinations

在组合中的应用

While combinations C(n,r) = n! / (r! x (n-r)!) are not a direct application of the Product Principle alone, they are derived by combining the Product Principle with a clever division. First, count the number of ordered selections (permutations of r from n) using the Product Principle, yielding n!/(n-r)!. Then divide by r! because each unordered selection of r objects can be arranged in r! different orders, and all these orders correspond to the same combination. This illustrates how the Product Principle, together with logical reasoning about overcounting, yields the combination formula.

虽然组合 C(n,r) = n! / (r! x (n-r)!) 并不仅仅是乘法原理的直接应用，但它们是通过将乘法原理与巧妙的除法相结合而推导出来的。首先，使用乘法原理计算有序选择的数量（从 n 中排列 r 个），得到 n!/(n-r)!。然后除以 r!，因为 r 个物体的每个无序选择可以以 r! 种不同的顺序排列，而所有这些顺序对应同一个组合。这说明了乘法原理如何与关于重复计数的逻辑推理一起，得出组合公式。

This connection is particularly important for IB Applications and Interpretation (AI) students, who need to apply combinations to probability problems and hypothesis testing involving the binomial distribution. Understanding that the binomial coefficient emerges from the Product Principle deepens a student’s grasp of why these formulas work, rather than merely memorising them.

这种联系对 IB 应用与解释 (AI) 学生尤为重要，他们需要将组合应用于涉及二项分布的概率问题和假设检验。理解二项式系数源于乘法原理能够加深学生对公式为何有效的把握，而不仅仅是记忆它们。

The Product Principle with Repetition

有放回的乘法原理

When selections are made with replacement or repetition is allowed, the Product Principle takes a particularly elegant form. If an experiment involves selecting one item from a set of n items, recording the result, and then replacing it before the next selection, and this process is repeated r times, the total number of possible sequences is n raised to the power r, written n^r. Each of the r stages offers n independent choices, so the product is n multiplied by itself r times.

当选择是有放回的或允许重复时，乘法原理呈现出一种特别优雅的形式。如果一个实验涉及从 n 个物品的集合中选择一个，记录结果，然后在下一次选择之前将其放回，并将此过程重复 r 次，那么可能序列的总数为 n 的 r 次方，写作 n^r。r 个阶段中的每一个都提供 n 个独立选择，因此乘积是 n 乘以自身 r 次。

A practical example is the number of possible 4-digit PIN codes. Each digit can be any of the 10 digits from 0 to 9, and digits can repeat. By the Product Principle, the total number is 10 x 10 x 10 x 10 = 10^4 = 10,000. Similarly, the number of possible outcomes when flipping a fair coin 5 times is 2^5 = 32, because each flip offers 2 independent outcomes. These problems appear regularly in IB examination questions on discrete probability.

一个实际例子是可能的 4 位数 PIN 码的数量。每位数字可以是 0 到 9 中的任意一个，且数字可以重复。根据乘法原理，总数为 10 x 10 x 10 x 10 = 10^4 = 10,000。类似地，抛一枚公平硬币 5 次可能出现的结果数是 2^5 = 32，因为每次抛掷提供 2 个独立结果。这些问题经常出现在 IB 考试中关于离散概率的题目中。

Counting with Restrictions

带有约束条件的计数

Many IB examination problems introduce restrictions that complicate the straightforward application of the Product Principle. For instance, counting the number of 4-digit numbers with all digits different requires a slight modification: the first digit cannot be 0 (9 choices), the second digit can be any digit except the first (9 choices), the third digit can be any except the first two (8 choices), and the fourth can be any except the first three (7 choices). The total is 9 x 9 x 8 x 7 = 4,536.

许多 IB 考试题目引入了限制条件，使得直接应用乘法原理变得复杂。例如，计算所有数字不同的 4 位数数量需要稍作修改：第一位数字不能是 0（9 种选择），第二位数字可以是除第一位外的任何数字（9 种选择），第三位可以是除前两位外的任何数字（8 种选择），第四位可以是除前三位外的任何数字（7 种选择）。总数为 9 x 9 x 8 x 7 = 4,536。

When restrictions involve adjacency or separation conditions, the Product Principle is often combined with complementary counting or the inclusion-exclusion principle. A typical problem might ask: “How many arrangements of the letters A, B, C, D, E have A and B separated?” The standard approach is to count all arrangements (5! = 120) and subtract those where A and B are adjacent (treat AB as a single block, giving 4! x 2! = 48). The answer is 120 – 48 = 72. This demonstrates that the Product Principle often works in concert with other counting techniques.

当限制条件涉及相邻或分离条件时，乘法原理通常与补集计数或容斥原理结合使用。一个典型问题可能问：”字母 A、B、C、D、E 的排列中，有多少种使 A 和 B 分离？”标准方法是计算所有排列（5! = 120）并减去 A 和 B 相邻的那些（将 AB 视为一个整体块，得到 4! x 2! = 48）。答案是 120 – 48 = 72。这表明乘法原理通常与其他计数技术协同工作。

The Product Principle in Probability

乘法原理在概率中的应用

In probability theory, the Product Principle manifests as the multiplication rule for independent events: P(A and B) = P(A) x P(B) when A and B are independent. The denominator of a probability fraction is often computed using the Product Principle to count the size of the sample space, while the numerator counts the favourable outcomes, again often using the Product Principle or its derivatives.

在概率论中，乘法原理表现为独立事件的乘法规则：当 A 和 B 独立时，P(A 且 B) = P(A) x P(B)。概率分数的分母通常使用乘法原理计算样本空间的大小，而分子则计算有利结果的数量，再次经常使用乘法原理或其衍生方法。

Consider drawing two cards from a standard 52-card deck without replacement. The probability that both are aces is (4/52) x (3/51) = 12/2652 = 1/221. Here, the Product Principle applies to the counting of both numerator and denominator: the denominator counts all possible ordered pairs (52 x 51), and the numerator counts ordered pairs of aces (4 x 3). The cancellation yields the correct probability. IB students should become fluent in this dual application of the Product Principle to both numerator and denominator in probability calculations.

考虑从一副标准的 52 张牌中不放回地抽取两张。两张都是 A 的概率是 (4/52) x (3/51) = 12/2652 = 1/221。这里，乘法原理适用于分子和分母的计数：分母计算所有可能的有序对 (52 x 51)，分子计算 A 的有序对 (4 x 3)。约分后得出正确的概率。IB 学生应该熟练地将乘法原理双重应用于概率计算中的分子和分母。

Advanced IB Applications: Binomial Theorem

高级 IB 应用：二项式定理

The binomial theorem, a cornerstone of the IB Mathematics syllabus, has deep connections to the Product Principle. The expansion of (a + b)^n produces terms of the form C(n,k) x a^(n-k) x b^k. The coefficient C(n,k) counts the number of ways to select k positions for b from the n factors in the product (a+b)(a+b)…(a+b), which directly invokes the combination formula that itself derives from the Product Principle.

二项式定理是 IB 数学课程大纲的基石，与乘法原理有着深刻的联系。(a + b)^n 的展开产生形式为 C(n,k) x a^(n-k) x b^k 的项。系数 C(n,k) 计算从乘积 (a+b)(a+b)…(a+b) 的 n 个因子中选择 k 个位置放置 b 的方法数，这直接调用了本身源于乘法原理的组合公式。

For IB AA HL students, the Product Principle extends further into the proof of the binomial theorem itself. Each term in the expansion corresponds to choosing either a or b from each of the n factors. The number of ways to obtain exactly k b’s and n-k a’s is C(n,k), which is derived by first counting ordered selections using the Product Principle and then adjusting for the fact that the order of selection of the k positions does not matter. Understanding this derivation distinguishes high-performing students from those who simply memorise the formula.

对于 IB AA HL 学生，乘法原理进一步延伸到二项式定理本身的证明。展开式中的每一项对应从 n 个因子的每一个中选择 a 或 b。恰好得到 k 个 b 和 n-k 个 a 的方法是 C(n,k)，这是通过首先使用乘法原理计算有序选择，然后调整 k 个位置的选择顺序不重要这一事实而推导的。理解这一推导能够区分表现出色的学生和仅仅记忆公式的学生。

Common Mistakes and How to Avoid Them

常见错误及如何避免

One of the most frequent errors IB students make is confusing when to multiply and when to add. Multiplying is appropriate when you are combining choices from independent stages that ALL must be completed. Adding is appropriate when you are counting mutually exclusive alternatives where only ONE path is taken. A helpful mnemonic: AND means multiply, OR means add. Always pause to identify whether the logical structure of the problem is conjunctive (AND) or disjunctive (OR).

IB 学生最常犯的错误之一是混淆何时相乘和何时相加。当你组合来自独立阶段的选择且所有阶段都必须完成时，适合相乘。当你计算互斥的替代方案且只走一条路径时，适合相加。一个有用的口诀：且（AND）意味着相乘，或（OR）意味着相加。始终停下来识别问题的逻辑结构是合取的（且）还是析取的（或）。

Another common mistake is misidentifying whether choices are independent. The Product Principle requires that the number of choices at each stage does not depend on which specific choices were made at earlier stages. For example, if selecting a committee of 3 from 10 people, the number of ways to fill the first position is 10, the second is 9, and the third is 8, giving 10 x 9 x 8 = 720. While the number of choices at later stages does depend on earlier selections, the key point is that the NUMBER of remaining choices is the same regardless of which specific person was selected earlier. As long as the count of options at each stage is well-defined and independent of the identity of earlier choices, the Product Principle holds.

另一个常见错误是错误判断选择是否独立。乘法原理要求每个阶段的选择数量不依赖于早期阶段所做的具体选择。例如，从 10 人中选出一个 3 人委员会，填补第一个职位的方法数是 10，第二个是 9，第三个是 8，得到 10 x 9 x 8 = 720。虽然后期阶段的选择数量确实依赖于早期的选择，但关键是剩余选项的数量无论之前选择了哪个具体的人都是相同的。只要每个阶段的选项数量是明确定义的且独立于早期选择的身份，乘法原理就成立。

Overcounting is another pitfall. When counting arrangements or selections, students sometimes apply the Product Principle without checking whether the resulting set of outcomes contains duplicates. For instance, when counting the number of ways to form a committee by first selecting a chair and then selecting two ordinary members, one might write 10 x C(9,2) = 10 x 36 = 360. But each committee of 3 appears three times in this count because any of the 3 members could have been designated as chair. The correct count, if order within the committee does not matter, is C(10,3) = 120. Always verify that your counting method does not count the same outcome multiple times.

重复计数是另一个陷阱。在计算排列或选择时，学生有时应用乘法原理而没有检查结果集合是否包含重复项。例如，计算通过先选主席再选两名普通成员来组成委员会的方法数时，可能会写 10 x C(9,2) = 10 x 36 = 360。但每个 3 人委员会在这个计数中出现了三次，因为 3 名成员中的任何一个都可能被指定为主席。如果委员会内部的顺序不重要，正确的计数是 C(10,3) = 120。始终验证你的计数方法不会多次计数相同的结果。

Practice Problems for IB Students

IB 学生练习题

To consolidate your understanding of the Product Principle, work through the following problems that mirror the style and difficulty of IB examination questions. Attempt each problem independently before checking the solution.

为了巩固你对乘法原理的理解，请完成以下反映 IB 考试题目风格和难度的练习题。在查看解答之前独立尝试每道题。

Problem 1: A password consists of 2 letters followed by 3 digits. Letters must be chosen from the 26 letters of the English alphabet, and digits from 0 to 9. Repetition is allowed. How many different passwords can be created? Solution: 26 x 26 x 10 x 10 x 10 = 26^2 x 10^3 = 676 x 1,000 = 676,000.

题目 1：一个密码由 2 个字母后跟 3 个数字组成。字母必须从英文字母表的 26 个字母中选择，数字从 0 到 9 中选择。允许重复。可以创建多少个不同的密码？解答：26 x 26 x 10 x 10 x 10 = 26^2 x 10^3 = 676 x 1,000 = 676,000。

Problem 2: A restaurant offers 3 choices for starter, 6 choices for main course, and 4 choices for dessert. A customer decides to order either a starter and a main course, or a main course and a dessert. How many different meal combinations are possible? Solution: For starter + main: 3 x 6 = 18. For main + dessert: 6 x 4 = 24. Total (Addition Principle) = 18 + 24 = 42.

题目 2：一家餐厅提供 3 种开胃菜、6 种主菜和 4 种甜点。一位顾客决定要么点一道开胃菜和一道主菜，要么点一道主菜和一道甜点。有多少种不同的餐食组合？解答：开胃菜 + 主菜：3 x 6 = 18。主菜 + 甜点：6 x 4 = 24。总计（加法原理）= 18 + 24 = 42。

Problem 3: How many 5-digit numbers can be formed using the digits 1, 2, 3, 4, 5, 6 without repetition? Solution: 6 x 5 x 4 x 3 x 2 = 720. This is P(6,5) = 6! / 1! = 720.

题目 3：使用数字 1, 2, 3, 4, 5, 6 不重复地可以组成多少个 5 位数？解答：6 x 5 x 4 x 3 x 2 = 720。即 P(6,5) = 6! / 1! = 720。

Problem 4: A multiple-choice test has 8 questions, each with 4 possible answers. In how many ways can a student answer all questions? Solution: 4^8 = 65,536.

题目 4：一项选择题测试有 8 道题，每道题有 4 个可能答案。一个学生有多少种方式回答所有问题？解答：4^8 = 65,536。

Problem 5: How many arrangements of the letters in the word “COMBINE” have the vowels (O, I, E) together? Solution: Treat the three vowels as a single block. There are 5 items to arrange (4 consonants + 1 vowel block): 5! = 120. The vowels within the block can be arranged in 3! = 6 ways. Total = 120 x 6 = 720.

题目 5：单词 “COMBINE” 中字母的排列有多少种使元音字母 (O, I, E) 在一起？解答：将三个元音视为一个整体块。有 5 个项目要排列（4 个辅音 + 1 个元音块）：5! = 120。块内的元音可以以 3! = 6 种方式排列。总计 = 120 x 6 = 720。

Connection to the IB Learner Profile

与 IB 学习者培养目标的联系

The study of the Product Principle and combinatorics more broadly embodies several attributes of the IB Learner Profile. Students develop as thinkers when they reason through multi-stage counting problems and decide whether to multiply or add. They become inquirers when they explore why the Product Principle works and extend it to new contexts such as probability trees. The precision required in stating the number of choices at each stage cultivates students as communicators, especially when explaining their reasoning to peers or in examination responses.

乘法原理和更广泛的组合数学的学习体现了 IB 学习者培养目标的多个特质。学生在推理多阶段计数问题并决定相乘还是相加时，发展为思考者。在探索乘法原理为何有效并将其扩展到概率树等新情境时，他们成为探究者。在陈述每个阶段的选择数量时所需的精确性培养了学生作为交流者的能力，尤其是在向同学或考试答题中解释推理时。

Moreover, combinatorics problems often admit multiple solution paths, encouraging open-mindedness and reflection. A problem that can be solved directly using the Product Principle might also be solved using permutations, combinations, or complementary counting. Evaluating which approach is most elegant or efficient develops mathematical maturity and aligns with the IB emphasis on deep conceptual understanding over rote procedure.

此外，组合数学问题通常允许多种解决路径，鼓励开放心态和反思。一个可以直接使用乘法原理解决的问题，也可能使用排列、组合或补集计数来解决。评估哪种方法最优雅或最高效，能够培养数学成熟度，并与 IB 强调深度概念理解而非机械程序的理念相一致。

Summary

总结

The Product Principle is the cornerstone of combinatorial counting. It states that if a task consists of k independent stages, with n1 choices at stage one, n2 at stage two, and so on, the total number of outcomes is n1 x n2 x … x nk. This principle underpins permutations, combinations, binomial coefficients, and a vast range of probability calculations encountered in the IB Mathematics curriculum. The key distinction from the Addition Principle is that the Product Principle applies when all stages must be completed (AND logic), while the Addition Principle applies to mutually exclusive alternatives (OR logic).

乘法原理是组合计数的基石。它指出，如果一个任务由 k 个独立阶段组成，第一阶段有 n1 种选择，第二阶段有 n2 种选择，依此类推，那么结果的总数是 n1 x n2 x … x nk。这一原理支撑着排列、组合、二项式系数以及 IB 数学课程中遇到的大量概率计算。与加法原理的关键区别在于，乘法原理适用于所有阶段都必须完成的情况（且逻辑），而加法原理适用于互斥的替代方案（或逻辑）。

Mastering the Product Principle requires not just memorising the rule but developing the discernment to recognise when it applies, when the Addition Principle applies, and when both must be used together. Practice with a wide variety of problems is essential. For IB students, the Product Principle appears throughout the syllabus, from Topic 1 (Number and Algebra) through Topic 4 (Statistics and Probability), and a strong command of it provides a solid foundation for examination success and further study in mathematics.

掌握乘法原理不仅需要记住规则，还需要培养辨别何时适用、何时适用加法原理以及何时两者必须结合使用的判断力。广泛练习各种题目是必不可少的。对于 IB 学生来说，乘法原理贯穿整个课程大纲，从主题 1（数与代数）到主题 4（统计与概率），对其的扎实掌握为考试成功和进一步学习数学提供了坚实的基础。