The Multiplication Counting Principle in IB Mathematics | IB数学：乘法计数原理的应用

📚 The Multiplication Counting Principle in IB Mathematics | IB数学：乘法计数原理的应用

The multiplication counting principle is a cornerstone of combinatorics and probability in IB Mathematics. It provides a systematic way to count the number of possible outcomes when a process can be divided into independent sequential stages.

乘法计数原理是IB数学中组合学与概率论的基础。它提供了一种系统计数的方法，适用于一个过程可以划分为若干独立且依次进行的阶段的情形。

1. Core Definition and Formula | 核心定义与公式

The principle states that if one task can be performed in \(m\) ways, and a second task can be performed in \(n\) ways, then the two tasks together can be performed in \(m \times n\) ways. Here, the word “together” means that the first task is followed by the second task.

该原理指出：若完成第一件事有 \(m\) 种方式，完成第二件事有 \(n\) 种方式，则依次完成这两件事共有 \(m \times n\) 种方式。这里的“一起”指的是先完成第一件事，再完成第二件事。

Total ways = m × n

For example, if a student has 3 different shirts and 4 different pairs of trousers, the number of possible outfits is \(3 \times 4 = 12\).

例如，若一名学生有3件不同衬衫和4条不同裤子，则可能的搭配总数为 \(3 \times 4 = 12\)。

2. Extension to Multiple Stages | 推广到多阶段

The principle extends naturally to any number of stages. If there are \(k\) stages, with \(n_1, n_2, \ldots, n_k\) choices respectively, the total number of outcomes is the product of all choices.

该原理可以自然推广到任意多个阶段。若有 \(k\) 个阶段，每个阶段分别有 \(n_1, n_2, \ldots, n_k\) 种选择，则总结果数为所有选择之积。

Total ways = n₁ × n₂ × … × nₖ

This is particularly useful when counting the number of ways to form sequences, such as license plates, PIN codes, or ordered selections from several categories.

这在计数序列（如车牌、PIN码，或从多个类别中进行有序选择）时尤为有用。

3. Application: Permutations and Order | 应用：排列与顺序

When we arrange objects in a specific order, the multiplication principle degenerates into the factorial formula. For \(n\) distinct objects, the first position has \(n\) choices, the second has \(n-1\), and so on, giving \(n \times (n-1) \times \cdots \times 1 = n!\).

当我们将对象按特定顺序排列时，乘法原理就退化为阶乘公式。对 \(n\) 个不同对象，第一个位置有 \(n\) 种选择，第二个有 \(n-1\) 种，依此类推，得到 \(n \times (n-1) \times \cdots \times 1 = n!\)。

For example, arranging 5 books on a shelf: \(5! = 120\) arrangements. The principle also underlies the permutation formula \(^nP_r = n!/(n-r)!\), which counts ordered selections of \(r\) objects from \(n\).

例如，将5本书排上书架有 \(5! = 120\) 种排列。该原理也是排列公式 \(^nP_r = n!/(n-r)!\) 的基础，该公式用于计算从 \(n\) 个对象中有序选取 \(r\) 个的方法数。

4. Application: Digits and Passwords | 应用：数字与密码

A classic IB problem involves counting the number of possible passwords. For a 4-digit PIN where each digit can be 0–9, the multiplication principle gives \(10^4 = 10{,}000\) possibilities.

一个典型的IB问题涉及密码可能性的计数。对于一个每位数字可取0–9的4位PIN码，乘法原理给出 \(10^4 = 10{,}000\) 种可能。

If repetition is not allowed, the first digit has 10 choices, the second 9, the third 8, and the fourth 7, giving \(10 \times 9 \times 8 \times 7 = 5040\). This distinction is essential in IB exams.

若不允许重复，则第一位有10种选择，第二位9种，第三位8种，第四位7种，共 \(10 \times 9 \times 8 \times 7 = 5040\)。这一区别在IB考试中至关重要。

5. Application: Maps and Routes | 应用：地图与路径

The principle can solve route-counting problems. Suppose a student walks from home to school and then from school to the library. If there are 3 possible home-to-school routes and 2 school-to-library routes, the total number of distinct commuting paths is \(3 \times 2 = 6\).

该原理可用于解决路线计数问题。假设一名学生从家到学校有3条路，从学校到图书馆有2条路，则从家经学校到图书馆的不同通勤路径共有 \(3 \times 2 = 6\) 条。

This idea generalizes to grid paths. In an \(m \times n\) grid, the number of monotonic paths from one corner to the opposite is \(\binom{m+n}{m}\), which itself relies on repeated multiplication when constructing Pascal’s triangle.

这一思想可推广到网格路径。在一个 \(m \times n\) 网格中，从一个角到对角的单调路径数为 \(\binom{m+n}{m}\)，而这一公式本身就依赖于Pascal三角形中的重复乘法。

6. Application: Sets and Cartesian Products | 应用：集合与笛卡尔积

In set theory, the multiplication principle is equivalent to counting the number of elements in a Cartesian product. If set \(A\) has \(|A| = m\) elements and set \(B\) has \(|B| = n\) elements, then \(A \times B\) has \(m \times n\) ordered pairs.

在集合论中，乘法原理等价于计算笛卡尔积的元素个数。若集合 \(A\) 有 \(|A| = m\) 个元素，集合 \(B\) 有 \(|B| = n\) 个元素，则 \(A \times B\) 有 \(m \times n\) 个有序对。

For example, if \(A = \{1,2\}\) and \(B = \{x,y,z\}\), then \(A \times B = \{(1,x),(1,y),(1,z),(2,x),(2,y),(2,z)\}\), which has \(2 \times 3 = 6\) elements.

例如，若 \(A = \{1,2\}\)，\(B = \{x,y,z\}\)，则 \(A \times B = \{(1,x),(1,y),(1,z),(2,x),(2,y),(2,z)\}\)，共有 \(2 \times 3 = 6\) 个元素。

7. Distinction from the Addition Principle | 与加法原理的区别

Students often confuse the multiplication principle with the addition principle. The addition principle states that if two events cannot occur simultaneously, the total number of outcomes is the sum of the individual counts.

学生常将乘法原理与加法原理混淆。加法原理指出：若两个事件不能同时发生，则总结果数为各自结果数之和。

Use multiplication when the process is sequential and each choice is combined with every other choice. Use addition when the problem offers mutually exclusive alternatives.

当过程是依次进行的，且每个选择都要与其他所有选择组合时，使用乘法；当问题提供互斥的替代方案时，使用加法。

Multiplication: AND (both) → × Addition: OR (either) → +

8. Common Pitfalls and Misconceptions | 常见陷阱与误区

One common error is applying the multiplication principle without checking whether the stages are truly independent. If the number of choices at a later stage depends on an earlier choice, the principle fails unless conditions are handled carefully.

一个常见错误是不检查各阶段是否真正独立便直接使用乘法原理。若后面阶段的选项数量依赖于前面的选择，则除非仔细处理条件，否则该原理失效。

Another pitfall is forgetting to distinguish between ordered and unordered selections. The multiplication principle counts ordered outcomes by default; if order does not matter, divide by the factorial of the group size or use combinations.

另一个陷阱是忘记区分有序与无序选择。乘法原理默认计数有序结果；若顺序无关紧要，则需要除以组大小的阶乘，或改用组合公式。

For example, choosing 2 representatives from a group of 5 is not \(5 \times 4 = 20\), but \(\frac{5 \times 4}{2!} = 10\).

例如，从5人中选2名代表并非 \(5 \times 4 = 20\)，而是 \(\frac{5 \times 4}{2!} = 10\)。

9. IB Exam Style Worked Example | IB考试风格例题

Question: A restaurant offers 3 starters, 5 main courses, and 2 desserts. How many different three-course meals can a customer choose, assuming each course is selected independently?

问题：一家餐厅提供3道开胃菜、5道主菜和2道甜点。若每道菜独立选择，顾客可以组成多少种不同的三道菜套餐？

Solution: By the multiplication principle, the total number is simply the product of the choices for each course.

解答：根据乘法原理，总数为每道菜选择数的乘积。

3 × 5 × 2 = 30

Thus, there are 30 possible meals. In an IB exam, this type of question may appear in Paper 1 (no calculator) or as a short-response item in Paper 2.

因此共有30种可能的套餐。在IB考试中，此类题目可能出现在Paper 1（不允许使用计算器）或Paper 2的简答题中。

10. Probability and the Multiplication Principle | 概率中的乘法原理

The multiplication counting principle directly supports probability calculations. If all outcomes are equally likely, the probability of a specific event is the ratio of the number of favourable outcomes to the total number of outcomes. The total number of outcomes often comes from the multiplication principle.

乘法计数原理直接支持概率计算。若所有结果等可能，则某事件发生的概率为有利结果数与总结果数之比。而总结果数常由乘法原理得出。

For example, when tossing two dice, the total number of outcomes is \(6 \times 6 = 36\). The probability of rolling a sum of 7 is \(\frac{6}{36} = \frac{1}{6}\), because there are 6 favourable pairs.

例如，掷两颗骰子时，总结果数为 \(6 \times 6 = 36\)。掷出点数和为7的概率为 \(\frac{6}{36} = \frac{1}{6}\)，因为有6个有利数对。

In IB, this connection often appears in tree diagram questions, where each branch represents a mutually exclusive outcome and the probabilities along a path are multiplied.

在IB中，这种联系常出现在树状图题目中，每条分支代表一个互斥结果，沿路径的概率相乘。

11. Strategies for Solving Counting Problems | 解决计数问题的策略

To apply the multiplication principle effectively in IB, follow a step-by-step strategy. First, identify the stages of the process. Second, determine whether the stages are independent and whether order matters. Third, count the number of choices at each stage, paying attention to restrictions.

要在IB中有效运用乘法原理，需遵循分步策略。首先，确定过程的各个阶段；其次，判断各阶段是否独立以及顺序是否重要；第三，计算每个阶段的选择数，并注意限制条件。

Break the problem into sequential decisions.

将问题分解为依次进行的决策。
Use a tree diagram for small problems to visualise the stages.

对于较小的问题使用树状图可视化各阶段。
Handle restrictions with casework or the subtraction principle when necessary.

必要时使用分情况讨论或减法原理处理限制。
Always check whether the product makes sense in the context of the question.

始终检查乘积在问题情境中是否合理。

12. Summary | 总结

The multiplication counting principle is a simple yet powerful tool for counting outcomes in IB Mathematics. It forms the basis for permutations, combinations, probability, and many real-world applications such as password generation, route planning, and product combinations.

乘法计数原理是IB数学中一个简单而强大的计数工具。它构成了排列、组合、概率以及许多实际应用（如密码生成、路线规划、产品组合）的基础。

Mastering this principle requires clear understanding of when to multiply, careful handling of independence and order, and practice with a variety of problem types. With these skills, IB students can confidently solve both routine and challenging counting problems.

掌握这一原理需要清楚理解何时相乘、谨慎处理独立性与顺序，并通过多种题型进行练习。具备这些技能后，IB学生可以自信地解决常规及具有挑战性的计数问题。

Published by TutorHao | Mathematics Revision Series | aleveler.com

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

The Multiplication Counting Principle in IB Mathematics | IB数学：乘法计数原理的应用