IB Mathematics: The Basic Process of Mathematical Induction | IB数学：数学归纳法的基本过程

📚 IB Mathematics: The Basic Process of Mathematical Induction | IB数学：数学归纳法的基本过程

Mathematical induction is one of the most elegant and powerful proof techniques in the IB Mathematics curriculum. It is used to prove statements that are claimed to be true for all positive integers, typically denoted by n. This method is especially prominent in IB Analysis and Approaches (AA) at both Standard Level and Higher Level, and it appears in topics such as sequences, series, divisibility, inequalities, and matrices. In this article, we will walk through the fundamental structure of mathematical induction step by step, clarify common misconceptions, and provide worked examples aligned with IB-style questions.

数学归纳法是IB数学课程中最优雅且最有力的证明技巧之一。它用于证明那些声称对所有正整数（通常用 n 表示）都成立的命题。这一方法在IB分析与方法（AA）的标准级别和高级别中尤为重要，常出现在数列、级数、整除性、不等式和矩阵等主题中。在本文中，我们将逐步讲解数学归纳法的基本结构，澄清常见误解，并提供符合IB风格的例题。

---

1. The Principle Behind Induction | 归纳法背后的原理

Imagine an infinite row of dominoes. If you can guarantee two things — first, that the first domino falls, and second, that whenever any domino falls, the next one also falls — then you can conclude that all dominoes will fall. This is the intuition behind mathematical induction. It is not the same as inductive reasoning in science, where observations lead to probable conclusions; rather, mathematical induction is a form of deductive proof that establishes a universal statement with absolute certainty.

想象一排无限长的多米诺骨牌。如果你能保证两件事——第一，第一块骨牌倒了；第二，每当任意一块骨牌倒下时，下一块骨牌也会倒下——那么你就能得出结论：所有骨牌都会倒下。这就是数学归纳法背后的直觉。它不同于科学中的归纳推理（基于观察得出可能性结论），数学归纳法是一种演绎证明，能够绝对确定地建立全称命题。

2. The Base Case: Starting the Chain | 基础情形：启动链条

The first step in any proof by mathematical induction is to verify that the statement holds for the smallest relevant integer. This is called the base case. For most IB problems, the base case is n = 1, but it could be n = 0 or some other starting value depending on the statement. It is essential to substitute the value directly into both sides of the equation or inequality and show that they are equal or that the inequality is true. Skipping the base case is a fatal error — without it, the entire chain of reasoning collapses.

数学归纳法证明的第一步是验证命题对最小的相关整数成立。这称为基础情形。对于大多数IB题目，基础情形是 n = 1，但也可能是 n = 0 或其他起始值，具体取决于命题。关键是直接将该值代入等式或不等式的两边，并证明它们相等或不等式成立。跳过基础情形是致命错误——没有它，整个推理链就会崩塌。

3. The Inductive Hypothesis: Making an Assumption | 归纳假设：作出假设

After establishing the base case, we assume that the statement holds for some arbitrary positive integer n = k. This assumption is called the inductive hypothesis. It is important to understand that we are not proving the statement for k at this stage; we are simply assuming it to be true in order to build a bridge toward the next case. In IB examination writing, you should explicitly write: “Assume that the statement is true for n = k.” This clarity is part of the mark scheme in many past paper questions.

在确立基础情形之后，我们假设命题对某个任意正整数 n = k 成立。这个假设称为归纳假设。需要明白的是，在此阶段我们并不是在证明命题对 k 成立，而只是假设它为真，以便搭建通往下一步的桥梁。在IB考试写作中，应明确写道：“假设命题对 n = k 成立。”这种清晰表述是许多往年真题评分标准的一部分。

4. The Inductive Step: From k to k + 1 | 归纳递推：从 k 到 k + 1

The heart of mathematical induction lies in the inductive step: using the inductive hypothesis to prove that the statement is true for n = k + 1. In other words, we show that if the proposition holds for k, then it must also hold for k + 1. This is usually the most algebraically intensive part of the proof. You will often start with one side of the statement for n = k + 1, manipulate it using the inductive hypothesis, and then simplify to reach the corresponding other side.

数学归纳法的核心在于归纳递推：利用归纳假设证明命题对 n = k + 1 成立。换句话说，我们要证明：如果命题对 k 成立，那么它必定对 k + 1 也成立。这通常是证明中代数运算最密集的部分。你通常从 n = k + 1 时命题的一边开始，利用归纳假设进行改写，然后化简得到相应的另一边。

5. The Conclusion Statement | 结论陈述

Once the inductive step is complete, you must write a clear conclusion. In the IB context, a standard conclusion might be: “Since the statement is true for n = 1, and assuming it is true for n = k implies that it is true for n = k + 1, by the principle of mathematical induction, the statement is true for all positive integers n.” This conclusion is not merely a formality; it demonstrates that you understand the logical structure of the proof and it secures the final marks.

归纳递推完成后，必须写出明确的结论。在IB语境中，标准结论可写为：“因为命题对 n = 1 成立，且假设命题对 n = k 成立能推出命题对 n = k + 1 成立，所以根据数学归纳法原理，命题对所有正整数 n 成立。”这个结论不是形式上的摆设，它表明你理解证明的逻辑结构，并帮助你获得最后一步的分数。

6. Worked Example 1: Sum of the First n Integers | 例题1：前n个整数之和

Let us prove by mathematical induction that for all positive integers n,

1 + 2 + 3 + … + n = n(n + 1) / 2

Base case: For n = 1, the left-hand side is 1, and the right-hand side is 1(1 + 1)/2 = 1. Since both sides are equal, the statement is true for n = 1.

基础情形：当 n = 1 时，左边为 1，右边为 1(1 + 1)/2 = 1。两边相等，因此命题对 n = 1 成立。

Inductive hypothesis: Assume the statement is true for n = k, i.e.,

1 + 2 + 3 + … + k = k(k + 1) / 2

归纳假设：假设命题对 n = k 成立，即

1 + 2 + 3 + … + k = k(k + 1) / 2

Inductive step: We need to show that the statement is true for n = k + 1. Consider the sum up to k + 1:

1 + 2 + 3 + … + k + (k + 1)

Using the inductive hypothesis, we replace the sum up to k:

= k(k + 1)/2 + (k + 1)

Factor out (k + 1):

= (k + 1)(k/2 + 1) = (k + 1)(k + 2)/2

This is exactly the formula for n = k + 1. Therefore, the statement is true for n = k + 1.

归纳递推：我们需要证明命题对 n = k + 1 成立。考虑前 k + 1 项的和：

1 + 2 + 3 + … + k + (k + 1)

利用归纳假设替换前 k 项的和：

= k(k + 1)/2 + (k + 1)

提取公因式 (k + 1)：

= (k + 1)(k/2 + 1) = (k + 1)(k + 2)/2

这正是 n = k + 1 时的公式。因此，命题对 n = k + 1 成立。

Conclusion: By the principle of mathematical induction, the formula is true for all positive integers n.

结论：根据数学归纳法原理，该公式对所有正整数 n 成立。

7. Worked Example 2: Divisibility | 例题2：整除性

Prove that 7ⁿ − 1 is divisible by 6 for all positive integers n.

证明：对所有正整数 n，7ⁿ − 1 能被 6 整除。

Base case: For n = 1, 7¹ − 1 = 6, which is divisible by 6. The statement holds for n = 1.

基础情形：当 n = 1 时，7¹ − 1 = 6，能被 6 整除。命题对 n = 1 成立。

Inductive hypothesis: Assume that 7ᵏ − 1 is divisible by 6 for some positive integer k. This means there exists an integer m such that 7ᵏ − 1 = 6m, or equivalently 7ᵏ = 6m + 1.

归纳假设：假设对某个正整数 k，7ᵏ − 1 能被 6 整除。这意味着存在整数 m 使得 7ᵏ − 1 = 6m，即 7ᵏ = 6m + 1。

Inductive step: We show that 7ᵏ⁺¹ − 1 is divisible by 6. Write:

7ᵏ⁺¹ − 1 = 7 × 7ᵏ − 1

Using the inductive hypothesis 7ᵏ = 6m + 1:

= 7(6m + 1) − 1 = 42m + 7 − 1 = 42m + 6 = 6(7m + 1)

Since 7m + 1 is an integer, 7ᵏ⁺¹ − 1 is divisible by 6. Thus the statement holds for n = k + 1.

归纳递推：我们证明 7ᵏ⁺¹ − 1 能被 6 整除。写出：

7ᵏ⁺¹ − 1 = 7 × 7ᵏ − 1

利用归纳假设 7ᵏ = 6m + 1：

= 7(6m + 1) − 1 = 42m + 7 − 1 = 42m + 6 = 6(7m + 1)

由于 7m + 1 是整数，因此 7ᵏ⁺¹ − 1 能被 6 整除。因此命题对 n = k + 1 成立。

Conclusion: Therefore, by mathematical induction, 7ⁿ − 1 is divisible by 6 for all positive integers n.

结论：因此，根据数学归纳法，7ⁿ − 1 对所有正整数 n 都能被 6 整除。

8. Worked Example 3: Inequalities | 例题3：不等式

Prove that 2ⁿ > n² for all integers n ≥ 5.

证明：对所有整数 n ≥ 5，2ⁿ > n²。

Base case: For n = 5, 2⁵ = 32 and 5² = 25. Since 32 > 25, the statement is true for n = 5.

基础情形：当 n = 5 时，2⁵ = 32 且 5² = 25。因为 32 > 25，命题对 n = 5 成立。

Inductive hypothesis: Assume that 2ᵏ > k² for some integer k ≥ 5.

归纳假设：假设对某个整数 k ≥ 5，有 2ᵏ > k²。

Inductive step: We need to show that 2ᵏ⁺¹ > (k + 1)². Start from the left-hand side:

2ᵏ⁺¹ = 2 × 2ᵏ > 2k²

Now we need to prove that 2k² > (k + 1)² for k ≥ 5. Expand the right-hand side:

2k² > k² + 2k + 1 ⇔ k² − 2k − 1 > 0 ⇔ (k − 1)² − 2 > 0

For k ≥ 5, (k − 1)² ≥ 16, so (k − 1)² − 2 ≥ 14 > 0. Hence 2k² > (k + 1)², and therefore 2ᵏ⁺¹ > (k + 1)². The statement holds for n = k + 1.

归纳递推：我们需要证明 2ᵏ⁺¹ > (k + 1)²。从左边开始：

2ᵏ⁺¹ = 2 × 2ᵏ > 2k²

现在我们需要证明对 k ≥ 5，有 2k² > (k + 1)²。展开右边：

2k² > k² + 2k + 1 ⇔ k² − 2k − 1 > 0 ⇔ (k − 1)² − 2 > 0

因为 k ≥ 5 时，(k − 1)² ≥ 16，所以 (k − 1)² − 2 ≥ 14 > 0。因此 2k² > (k + 1)²，从而 2ᵏ⁺¹ > (k + 1)²。命题对 n = k + 1 成立。

Conclusion: By mathematical induction, 2ⁿ > n² for all integers n ≥ 5.

结论：根据数学归纳法，对所有整数 n ≥ 5，2ⁿ > n²。

9. Common Mistakes and IB Mark Scheme Tips | 常见错误与IB评分建议

Students often lose marks in induction proofs due to a few recurring mistakes. First, forgetting to state the inductive hypothesis clearly. Second, using the conclusion as if it were already proved. Third, making algebraic errors when transforming the expression for n = k + 1. Fourth, failing to write a final conclusion. In IB marking, assessment criteria typically award marks for each of the four components: base case, clear inductive hypothesis, correct inductive step, and a concluding statement. It is also wise to use the phrase “if true for n = k, then true for n = k + 1” explicitly.

学生在归纳法证明中常因几个反复出现的错误而失分。第一，忘记清楚陈述归纳假设。第二，把待证结论当作已知条件使用。第三，在将表达式变换到 n = k + 1 时出现代数错误。第四，未写出最终结论。在IB评分标准中，通常按四个部分给分：基础情形、清晰的归纳假设、正确的归纳递推步骤以及结论陈述。明智的做法是明确写出“若对 n = k 成立，则对 n = k + 1 成立”这句话。

10. When Does Induction Fail? | 归纳法何时失效？

Mathematical induction cannot be used for every statement. It only applies to propositions indexed by the natural numbers (or integers from a certain point onward). It cannot directly prove statements about real numbers, such as “x² ≥ 0 for all real x,” because there is no natural-number ordering to step through. Additionally, the inductive step must actually be provable; sometimes the algebraic jump from k to k + 1 is not straightforward and requires clever manipulation or a stronger statement. In such cases, the original proposition may still be true, but simple induction may not suffice.

数学归纳法并不能用于所有命题。它只适用于以自然数（或从某个整数起）为指标的命题。它不能直接证明关于实数的命题，例如“对所有实数 x，有 x² ≥ 0”，因为不存在自然数的顺序可以逐步推进。此外，归纳递推步骤本身必须是可证明的；有时从 k 到 k + 1 的代数跳跃并不直接，需要巧妙的变形或更强的命题。在这种情况下，原命题可能仍然为真，但简单的归纳法可能不够用。

11. Strong Induction: A Useful Variant | 强归纳法：一个有用的变体

In some IB extension problems, simple induction with a single base case and a direct assumption for n = k is not enough. Strong induction assumes the statement is true for all integers from the base case up to k, and then uses that full range of assumptions to prove the case for k + 1. This is especially useful for recurrence relations, where the term uₖ₊₁ may depend on both uₖ and uₖ₋₁. Although the IB syllabus does not require strong induction explicitly, understanding it deepens your logical foundation and can help in competitions or advanced coursework.

在某些IB拓展问题中，单一的归纳假设（命题对 n = k 成立）不够用。强归纳法假设命题对从基础情形到 k 的所有整数都成立，然后利用这一整段假设来证明 k + 1 的情形。这在递推关系中尤其有用，因为项 uₖ₊₁ 可能同时依赖于 uₖ 和 uₖ₋₁。虽然IB教学大纲并不明确要求强归纳法，但理解它能够加深你的逻辑基础，并有助于竞赛或高级课程。

12. Practice Problems and Final Advice | 练习题目与最终建议

To master mathematical induction, practice is indispensable. Here are two IB-style problems for you to try. First, prove that 1² + 2² + 3² + … + n² = n(n + 1)(2n + 1)/6 for all positive integers n. Second, prove that the nth term of the Fibonacci sequence Fₙ satisfies F₁ + F₂ + … + Fₙ = Fₙ₊₂ − 1. Work through each step carefully: base case, inductive hypothesis, inductive step, and conclusion. As you practice, keep a checklist of the four components near your work.

要掌握数学归纳法，练习必不可少。这里有两道IB风格的题目供你尝试。第一题：证明对所有正整数 n，1² + 2² + 3² + … + n² = n(n + 1)(2n + 1)/6。第二题：证明斐波那契数列的第 n 项 Fₙ 满足 F₁ + F₂ + … + Fₙ = Fₙ₊₂ − 1。请仔细完成每一步：基础情形、归纳假设、归纳递推和结论。练习时，在草稿旁放一份四要素检查清单。

In summary, mathematical induction is a rigorous and beautiful method built on a simple logical foundation. By mastering the base case, the inductive hypothesis, the inductive step, and the final conclusion, you will be well equipped to solve a wide range of IB mathematics problems with confidence.

总之，数学归纳法是一种严谨而优美的方法，建立在简单的逻辑基础之上。通过掌握基础情形、归纳假设、归纳递推和最终结论，你将能够自信地解决广泛类型的IB数学问题。

Published by TutorHao | IB Mathematics Revision Series | aleveler.com

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