Mathematical Induction: A Step-by-Step Guide | 数学归纳法证明步骤精讲

📚 Mathematical Induction: A Step-by-Step Guide | 数学归纳法证明步骤精讲

Mathematical induction is one of the most elegant and powerful proof techniques in the IB Mathematics syllabus. It allows us to prove statements that depend on a positive integer n, often expressed as P(n), by establishing a base case and then showing that if P(k) holds, P(k + 1) must also hold. This article breaks down the full process, highlights common pitfalls, and provides worked examples aligned with IB standard level and higher level requirements.

数学归纳法是 IB 数学课程大纲中最优雅且最强大的证明技巧之一。它使我们能够证明依赖于正整数 n 的命题（通常记作 P(n)），方法是先建立基础情形，然后证明若 P(k) 成立，则 P(k + 1) 也必然成立。本文将完整拆解这一过程，指出常见误区，并提供符合 IB 标准级别和高级别要求的例题精讲。

1. What Is Mathematical Induction? | 什么是数学归纳法？

Mathematical induction is a formal method of proof used to show that a statement P(n) is true for all positive integers n (or for all integers n ≥ n₀, where n₀ is the starting point). It is especially useful for proving formulas involving sums, divisibility, inequalities, and recurrence relations.

数学归纳法是一种形式化的证明方法，用于证明命题 P(n) 对所有正整数 n（或对所有满足 n ≥ n₀ 的整数 n，其中 n₀ 是起始值）都成立。它特别适用于证明涉及求和、整除性、不等式和递推关系的公式。

The key idea is to create a “chain reaction”: if the first domino falls, and each falling domino knocks down the next one, then all dominoes fall. In mathematics, we first check that the first statement is true, then prove that truth propagates from one case to the next.

其核心思想是产生一种“连锁反应”：如果第一张多米诺骨牌倒下，并且每一张倒下的骨牌都能推倒下一张，那么所有骨牌都会倒下。在数学中，我们首先验证第一个命题为真，然后证明真值会从一个情形传递到下一个情形。

2. The Principle Behind Induction | 归纳法的原理

The principle of mathematical induction rests on the well-ordering property of the natural numbers. It has two essential components: the base case and the inductive step. If both are established, then by the axiom of induction, the statement is true for all n in the specified range.

数学归纳法的原理建立在自然数的良序性质之上。它包含两个基本部分：基础情形和归纳步骤。如果这两部分都得到证明，那么根据归纳公理，命题在指定范围内对所有 n 都成立。

More formally, suppose we want to prove that P(n) is true for all n ≥ 1. We must show:

更正式地说，假设我们想证明 P(n) 对所有 n ≥ 1 成立。我们必须证明：

Base case: P(1) is true.

基础情形：P(1) 成立。
Inductive step: For every integer k ≥ 1, if P(k) is true, then P(k + 1) is true.

归纳步骤：对每个整数 k ≥ 1，若 P(k) 成立，则 P(k + 1) 成立。

Once these two are verified, we can conclude that P(n) is true for all n ≥ 1 by the principle of induction.

一旦这两个条件得到验证，我们就可以根据归纳原理得出结论：P(n) 对所有 n ≥ 1 成立。

3. The Three-Step Proof Structure | 证明的三步结构

In IB examinations, you are expected to present a clear, coherent proof. The standard structure is:

在 IB 考试中，你应呈现清晰、连贯的证明。标准结构是：

Step 1: Base Case → Step 2: Inductive Hypothesis → Step 3: Inductive Step → Conclusion

第一步：基础情形 → 第二步：归纳假设 → 第三步：归纳步骤 → 结论

Base case: Verify that the statement is true for the smallest allowed integer, usually n = 1. Do not skip this step; it is the foundation of the entire proof.

基础情形：验证命题对最小允许整数（通常是 n = 1）成立。不要跳过这一步；它是整个证明的基础。

Inductive hypothesis: Assume that the statement is true for some arbitrary positive integer k. Write it out explicitly. For example, assume ∑_{i=1}^{k} i = k(k + 1)/2.

归纳假设：假设命题对某个任意正整数 k 成立。明确写出这个假设。例如，假设 ∑_{i=1}^{k} i = k(k + 1)/2。

Inductive step: Using the inductive hypothesis, prove that the statement is true for k + 1. This usually involves manipulating the expression for P(k) to derive P(k + 1).

归纳步骤：利用归纳假设，证明命题对 k + 1 成立。这通常涉及对 P(k) 的表达式进行变形，以推导出 P(k + 1)。

Conclusion: State clearly: “Therefore, by mathematical induction, the statement is true for all positive integers n.”

结论：明确写出：“因此，由数学归纳法可知，该命题对所有正整数 n 成立。”

4. Example 1: Sum of the First n Natural Numbers | 例题1：前 n 个自然数的和

Let us prove that for all n ≥ 1,

让我们证明对所有 n ≥ 1，

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

Base case (n = 1): The left side is 1. The right side is 1(1 + 1)/2 = 1. So LHS = RHS, and P(1) is true.

基础情形（n = 1）：左边为 1。右边为 1(1 + 1)/2 = 1。因此左边 = 右边，P(1) 成立。

Inductive hypothesis: Assume that for some k ≥ 1,

归纳假设：假设对某个 k ≥ 1，

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

Inductive step: We need to show that

归纳步骤：我们需要证明

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

Start with the left side and use the inductive hypothesis:

从左边开始，并利用归纳假设：

1 + 2 + … + k + (k + 1) = [k(k + 1)/2] + (k + 1)

Factor out (k + 1):

提取公因子 (k + 1)：

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

This is exactly P(k + 1). By induction, the formula holds for all n ≥ 1.

这正是 P(k + 1)。由归纳法可知，该公式对所有 n ≥ 1 成立。

5. Example 2: Divisibility by 6 | 例题2：被 6 整除

Prove that for every positive integer n, n³ + 5n is divisible by 6.

证明：对每个正整数 n，n³ + 5n 都能被 6 整除。

Base case (n = 1): 1³ + 5(1) = 6, which is divisible by 6. P(1) is true.

基础情形（n = 1）：1³ + 5(1) = 6，能被 6 整除。P(1) 成立。

Inductive hypothesis: Assume that for some k ≥ 1, k³ + 5k is divisible by 6. That is, k³ + 5k = 6m for some integer m.

归纳假设：假设对某个 k ≥ 1，k³ + 5k 能被 6 整除。也就是说，k³ + 5k = 6m，其中 m 是某个整数。

Inductive step: Consider (k + 1)³ + 5(k + 1). Expand:

归纳步骤：考虑 (k + 1)³ + 5(k + 1)。展开：

(k + 1)³ + 5(k + 1) = k³ + 3k² + 3k + 1 + 5k + 5

= (k³ + 5k) + 3k² + 3k + 6

= (k³ + 5k) + 3k(k + 1) + 6

By the inductive hypothesis, k³ + 5k is divisible by 6. Also, k(k + 1) is always even, so 3k(k + 1) is divisible by 6. Finally, 6 is obviously divisible by 6. Therefore the whole expression is divisible by 6. Hence P(k + 1) is true.

由归纳假设，k³ + 5k 能被 6 整除。同时，k(k + 1) 总是偶数，所以 3k(k + 1) 能被 6 整除。最后，6 显然能被 6 整除。因此整个表达式能被 6 整除。所以 P(k + 1) 成立。

By induction, n³ + 5n is divisible by 6 for all positive integers n.

由归纳法，对一切正整数 n，n³ + 5n 都能被 6 整除。

6. Example 3: Proving an Inequality | 例题3：证明不等式

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

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

Base case (n = 4): 2⁴ = 16 and 4² = 16. Wait, the statement says >. At n = 4, 16 = 16, so the strict inequality fails. We should choose n = 5. Let us check: 2⁵ = 32 > 25 = 5². So we start from n = 5.

基础情形（n = 4）：2⁴ = 16，4² = 16。注意，原命题要求严格大于。在 n = 4 时，16 = 16，所以严格不等式不成立。我们应选择 n = 5。验证：2⁵ = 32 > 25 = 5²。因此我们从 n = 5 开始。

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

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

Inductive step: We want to show that 2ᵏ⁺¹ > (k + 1)². Start with 2ᵏ⁺¹ = 2 × 2ᵏ. By the inductive hypothesis, 2ᵏ > k², so 2ᵏ⁺¹ > 2k².

归纳步骤：我们要证明 2ᵏ⁺¹ > (k + 1)²。从 2ᵏ⁺¹ = 2 × 2ᵏ 开始。由归纳假设，2ᵏ > k²，所以 2ᵏ⁺¹ > 2k²。

Now we need to show that for k ≥ 3, 2k² > (k + 1)². Expand (k + 1)² = k² + 2k + 1. Then 2k² – (k² + 2k + 1) = k² – 2k – 1 = (k – 1)² – 2. For k ≥ 3, (k – 1)² ≥ 4, so (k – 1)² – 2 ≥ 2 > 0. Therefore 2k² > (k + 1)² for all k ≥ 3.

现在我们需要证明当 k ≥ 3 时，2k² > (k + 1)²。展开 (k + 1)² = k² + 2k + 1。则 2k² – (k² + 2k + 1) = k² – 2k – 1 = (k – 1)² – 2。对于 k ≥ 3，(k – 1)² ≥ 4，所以 (k – 1)² – 2 ≥ 2 > 0。因此对所有 k ≥ 3，2k² > (k + 1)²。

Combining these, 2ᵏ⁺¹ > 2k² > (k + 1)², so P(k + 1) is true. By induction, 2ⁿ > n² for all n ≥ 5.

综合可得，2ᵏ⁺¹ > 2k² > (k + 1)²，所以 P(k + 1) 成立。由归纳法，对所有 n ≥ 5，2ⁿ > n²。

7. Common Mistakes to Avoid | 常见错误要避免

Many students lose marks not because they do not understand induction, but because of small but critical errors. Here are the most common ones.

许多学生丢分并非因为不理解归纳法，而是由于一些微小但关键的失误。以下是最常见的错误。

Skipping the base case: Without a true base case, the inductive step proves nothing.

跳过基础情形：没有真确的基础情形，归纳步骤就毫无意义。
Using the inductive hypothesis incorrectly: You cannot assume the statement for k + 1 in advance. Only assume it for k.

错误使用归纳假设：你不能预先假设命题对 k + 1 成立。只能假设它对 k 成立。
Vague algebraic manipulation: You must clearly show how the expression for P(k) becomes the expression for P(k + 1). Do not skip major steps.

代数变形模糊：你必须清楚展示 P(k) 的表达式如何变为 P(k + 1) 的表达式。不要跳过主要步骤。
Forgetting to state the conclusion: The final sentence “By mathematical induction…” is required for full marks.

忘记写结论：最后一句“由数学归纳法……”是获得满分所必需的。
Choosing the wrong starting value: If the statement is true only for n ≥ 5, you must verify n = 5, not n = 1.

选择错误的起始值：如果命题只在 n ≥ 5 时成立，你必须验证 n = 5，而不是 n = 1。

8. Tips for Setting Up the Inductive Step | 归纳步骤的构建技巧

The inductive step is usually the hardest part. A good strategy is to write down what P(k) says and what P(k + 1) should say, then find the connection between them.

归纳步骤通常是最难的部分。一个好的策略是写出 P(k) 的内容以及 P(k + 1) 应是什么，然后找出它们之间的联系。

For sums, isolate the new term. For example, if P(k + 1) involves a sum from 1 to k + 1, split it into the sum from 1 to k plus the (k + 1)-th term. Then apply the inductive hypothesis to the first part.

对于求和，先分离出新的一项。例如，如果 P(k + 1) 涉及从 1 到 k + 1 的求和，就把它拆成从 1 到 k 的和加上第 k + 1 项。然后对前半部分应用归纳假设。

For divisibility, rewrite the k + 1 expression in terms of the k expression, plus a multiple of the divisor. For inequalities, combine the induction hypothesis with additional elementary inequalities.

对于整除性，将 k + 1 的表达式改写为 k 的表达式加上除数的倍数。对于不等式，将归纳假设与额外的初等不等式结合起来。

Always check whether your algebra genuinely uses the inductive hypothesis. If you never use it, something is probably wrong.

始终检查你的代数运算是否真正用到了归纳假设。如果你从未使用它，很可能出错了。

9. IB Exam Presentation Standards | IB 考试书写规范

In IB exams, you should structure your proof so that the examiner can easily identify each step. Use labels such as “Base case:”, “Inductive hypothesis:”, “Inductive step:”, and “Conclusion”. This not only helps you stay organized but also makes it easier for the examiner to award marks.

在 IB 考试中，你应该将证明结构化，使考官能轻松识别每一步。使用“基础情形：”“归纳假设：”“归纳步骤：”和“结论”等标签。这不仅有助于你保持条理，也能让考官更容易给分。

Also, be careful with notation. Write P(n) clearly, and use a variable such as k for the inductive hypothesis to avoid confusion with the original n.

同时，注意符号规范。清楚写出 P(n)，并在归纳假设中使用如 k 这样的变量，以避免与原 n 混淆。

For standard level (SL), induction is usually limited to simple sums and divisibility. For higher level (HL), you may encounter stronger forms, such as induction with a starting value other than 1, or proof by induction for recurrence relations.

对于标准级别（SL），归纳法通常限于简单的求和与整除性问题。对于高级别（HL），你可能会遇到更强的形式，例如起始值不是 1 的归纳，或对递推关系进行归纳证明。

10. Summary and Final Advice | 总结与最终建议

Mathematical induction is a systematic proof technique. Master the three-step structure, practice with different types of problems, and always write down your assumptions explicitly. In the IB exam, clarity and logical rigor matter more than cleverness.

数学归纳法是一种系统化的证明技巧。掌握三步结构，练习不同类型的题目，并始终明确写出你的假设。在 IB 考试中，清晰与逻辑严谨比聪明更重要。

Here is a quick checklist before you submit your proof:

这是提交证明前的快速检查清单：

Did I state the base case and verify it numerically?

我是否写明了基础情形并进行了数值验证？
Did I write the inductive hypothesis for P(k)?

我是否写明了针对 P(k) 的归纳假设？
Did I clearly derive P(k + 1) from P(k)?

我是否清楚地从 P(k) 推出了 P(k + 1)？
Did I include the final conclusion sentence?

我是否包含了最后的结论句？

With enough practice, you will find mathematical induction to be a reliable and even enjoyable method of proof. Good luck with your IB revision!

通过足够的练习，你会发现数学归纳法是一种可靠甚至有趣的证明方法。祝你的 IB 复习顺利！

Published by TutorHao | Mathematics Revision Series | aleveler.com

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

Mathematical Induction: A Step-by-Step Guide | 数学归纳法证明步骤精讲