📚 The Principle of Mathematical Induction | 数学归纳法原理
Mathematical induction is one of the most powerful and elegant proof techniques in mathematics. It allows us to prove statements that are claimed to hold for all natural numbers, or for an infinite sequence of cases, by establishing a kind of domino effect. In the IB Mathematics: Analysis and Approaches course, induction is a core tool for reasoning about sequences, series, divisibility, and inequalities. This article explains the principle, provides worked examples, and highlights common pitfalls to help you master this essential method.
数学归纳法是数学中最强大、最优美的证明技巧之一。它通过建立一种多米诺骨牌效应，使我们能够证明那些声称对所有自然数都成立的命题，或是无限多种情形下的结论。在IB数学“分析与方法”课程中，归纳法是处理数列、级数、整除性和不等式问题的核心工具。本文将讲解归纳法原理，给出实际示例，并指出常见错误，帮助你掌握这一重要方法。
1. Introduction to Mathematical Induction | 数学归纳法简介
ctive reasoning, which moves from general principles to specific cases, induction builds from the specific to the general by verifying a base case and then showing that if the statement holds for an arbitrary case, it must also hold for the next one. This two-step process creates an unbreakable chain of truth.
归纳法是一种用来证明命题 P(n) 对所有自然数 n（通常从 n = 1 开始）都成立的证明方法。与从一般原理推向具体情形的演绎推理不同，归纳法通过验证初始情形，然后证明若命题对任一情形成立则对下一情形也成立，从而由具体走向一般。这个两步过程建立起一条牢不可破的真值链条。
2. The Fundamental Principle | 基本原理
The principle of mathematical induction states: Let P(n) be a statement involving the natural number n. If P(1) is true and, for every natural number k, the truth of P(k) implies the truth of P(k+1), then P(n) is true for all natural numbers n. This is often called weak induction to distinguish it from strong induction, but it is the standard form used in most proofs.
数学归纳法的基本原理为：设 P(n) 是一个与自然数 n 有关的命题。如果 P(1) 成立，并且对于每个自然数 k，P(k) 成立能推出 P(k+1) 成立，那么 P(n) 对所有自然数 n 都成立。为与强归纳法区分，这常被称为弱归纳法，但它是大多数证明中使用的标准形式。
3. The Analogy of Falling Dominoes | 多米诺骨牌的比喻
Imagine an infinite row of dominoes standing on their ends. If you can ensure that the first domino falls, and you also know that whenever any domino falls it knocks over the next one in line, then you can conclude that every domino will eventually fall. The base case is the first domino, and the inductive step is the rule that a falling domino topples its neighbour. This visual analogy captures the logical structure of induction perfectly.
想象有无限多张直立的多米诺骨牌排成一列。如果你能确保第一张骨牌倒下，并且知道每当任意一张骨牌倒下时，它都会撞倒紧随其后的下一张，那么你就可以断定所有骨牌最终都会倒下。初始情形对应第一张骨牌，而归纳步骤对应“一张倒下的骨牌撞倒相邻骨牌”的规则。这个直观比喻完美地捕捉了归纳法的逻辑结构。
4. Formal Structure of Induction | 归纳法的形式结构
is assumption to prove P(k+1). The conclusion that P(n) holds for all n follows by the principle of induction. Clarity and precise algebraic manipulation are essential in the induction step.
一个归纳法证明通常由三个明确标注的部分组成：初始情形、归纳假设和归纳步骤。初始情形验证 P(1) 为真。归纳假设假定对某个任意的 k ≥ 1，P(k) 成立。归纳步骤则利用这个假设来证明 P(k+1)。依据归纳法原理，即可得出 P(n) 对所有 n 都成立的结论。在归纳步骤中，清晰的思路和精确的代数操作至关重要。
5. Step-by-Step Guide to an Inductive Proof | 归纳法证明的分步指南
(n) precisely. (2) Prove the base case, usually n = 1. (3) State the induction hypothesis: 'Assume P(k) is true for some k ≥ 1.' it matches the required form of P(k+1). (6) Conclude by stating that, by mathematical induction, P(n) is true for all natural numbers n. Include a clear concluding sentence.
为有效组织你的证明，请遵循以下步骤：(1) 精确定义命题 P(n)。(2) 证明初始情形，通常为 n = 1。(3) 陈述归纳假设：“假设对某个 k ≥ 1，P(k) 成立。” (4) 写出需要证明的 P(k+1) 的表达式。(5) 运用假设对左端或相关表达式进行变形，直至匹配 P(k+1) 所需的形式。(6) 以“根据数学归纳法，P(n) 对所有自然数 n 成立”作结，确保有一个清晰的总结句。
6. Example 1: Summation Formula | 示例1：求和公式
Prove that 1 + 2 + … + n = n(n+1)/2 for all n ∈ ℕ ment. Base case: n=1, LHS=1, RHS=1(2)/2=1, so P(1) true. Inductive hypothesis: Assume 1+2+…+k = k(k+1)/2 for some k≥1. Induction step: Consider sum up to k+1. LHS = (1+2+… 1) = k(k+1)/2 + (k+1) = (k+1)(k/2 + 1) = (k+1)(k+2)/2, which is exactly P(k+1). Hence P(k) ⇒ P(k+1). By induction, the formula holds for all n.
证明对所有 n ∈ ℕ，1 + 2 + … + n = n(n+1)/2。令 P(n) 为该命题。初始情形：n=1，左端=1，右端=1(2)/2=1，P(1) 成立。归纳假设：假设对某个 k≥1，有 1+2+…+k = k(k+1)/2。归纳步骤：考虑前 k+1 项之和。左端 = (1+2+…+k) + (k+1) = k(k+1)/2 + (k+1) = (k+1)(k/2 + 1) = (k+1)(k+2)/2，这正是 P(k+1)。因此 P(k) ⇒ P(k+1)。由归纳法，公式对所有 n 均成立。
7. Example 2: Inequality Proof | 示例2：不等式证明
5). Hence 2ᵏ⁺¹ > (k+1)², so P(k+1) true. By induction, the inequality holds for all n ≥ 5.
证明对所有整数 n ≥ 5，有 2ⁿ > n²。令 P(n) 为该命题。初始情形：n=5，2⁵ = 32，5² = 25，故 32 > 25 成立。归纳假设：假设对某个 k ≥ 5，2ᵏ > k²。归纳步骤：需证 2ᵏ⁺¹ > (k+1)²。由假设，2ᵏ⁺¹ = 2·2ᵏ > 2k²。因为 k ≥ 5，我们有 2k² = k² + k² ≥ k² + 5k > k² + 2k + 1 = (k+1)²。因此 2ᵏ⁺¹ > (k+1)²，P(k+1) 成立。由归纳法，该不等式对所有 n ≥ 5 均成立。
8. Example 3: Divisibility Proof | 示例3：整除性证明
Prove that 7ⁿ − 2ⁿ is divisible by 5 for all n ∈ ℕ 5·2ᵏ = 5(7m + 2ᵏ), which is a multiple of 5. Hence P(k+1) holds, completing the induction.
证明对所有 n ∈ ℕ，7ⁿ − 2ⁿ 能被 5 整除。初始情形：n=1，7¹ − 2¹ = 5，可被 5 整除。归纳假设：假设 7ᵏ − 2ᵏ = 5m，其中 m 为整数。归纳步骤：7ᵏ⁺¹ − 2ᵏ⁺¹ = 7·7ᵏ − 2·2ᵏ。将其改写为7·7ᵏ − 7·2ᵏ + 7·2ᵏ − 2·2ᵏ = 7(7ᵏ − 2ᵏ) + 2ᵏ(7 − 2) = 7·5m + 5·2ᵏ = 5(7m + 2ᵏ)，这是 5 的倍数。因此 P(k+1) 成立，归纳完成。
9. Strong Induction | 强归纳法
Strong induction, or the second principle of mathematical induction, differs slightly: to prove P(k+1), you may assume that P(1), P(2), …, P(k) are all true, rather than just P(k). This is particularly useful for sequences defined by recurrence relations, such as the Fibonacci numbers, where a term depends on more than one previous term. The base case may also require verifying the first few values. The logical validity of strong induction follows from the standard form.
强归纳法，又称数学归纳法第二原理，稍有不同：为证明 P(k+1)，你可以假设 P(1), P(2), …, P(k) 全部成立，而不仅仅是 P(k)。这对由递推关系定义的数列（如斐波那契数列）尤为有用，因为此时某一项依赖于前面多个项。初始情形通常需要验证前几个值。强归纳法的逻辑有效性可从标准形式推出。
10. Induction and Recurrence Relations | 归纳法与递推关系
ₖ and simplifies to 2·(2ᵏ⁺¹ − 1) + 1 = 2ᵏ⁺² − 1, which matches the closed form. Strong induction may be needed if a term depends on two preceding ones.
在IB数学中，归纳法常与递归定义的数列一同出现。例如，给出 u₁ = 3 和 uₙ₊₁ = 2uₙ + 1，要求证明 uₙ = 2ⁿ⁺¹ − 1。先检验 n=1 的初始情形。假设 uₖ = 2ᵏ⁺¹ − 1，归纳步骤利用递推关系将 uₖ₊₁ 用 uₖ 表示，化简得 2·(2ᵏ⁺¹ − 1) + 1 = 2ᵏ⁺² − 1，与封闭形式吻合。若某一项依赖于前两项，则可能需要强归纳法。
11. Common Mistakes to Avoid | 需避免的常见错误
One frequent mistake is forgetting to prove the base case or assuming what needs to be proved in the inductive step. Another is using the induction hypothesis incorrectly—always work from P(k) to P(k+1), not the other way around. Algebraic slips when manipulating expressions are common; carefully factor and expand terms. Also, the induction hypothesis must be explicitly stated. Finally, ensure the induction step genuinely covers all cases from the base onwards; sometimes the logic fails for small values if the base case is too weak.
一个常见错误是忘记证明初始情形，或在归纳步骤中假设了要证的结论。另一个是错误地使用归纳假设——切记应从 P(k) 推导 P(k+1)，而不是反过来。代数变形时的疏忽也很普遍，务必仔细进行因式分解和展开。此外，归纳假设必须明确陈述。最后，要确保归纳步骤真正涵盖了从初始情形往后的所有情形；若初始情形设定得过弱，有时逻辑在小数值处可能出现漏洞。
12. Induction in the IB Mathematics Curriculum | IB数学课程中的归纳法
In the IB Mathematics: Analysis and Approaches syllabus, mathematical induction is a key part of the topic 'Proofs.' Students are expected to understand the principle, apply it to summation and product formulas, prove divisibility results, and verify inequalities. Induction questions frequently appear in Paper 2 and can be worth a significant number of marks. The assessment criteria reward a clear logical flow, correct notation, and a well-written conclusion. Mastering induction also deepens your understanding of number theory and sequences, which are central themes in higher-level mathematics.
在IB数学“分析与方法”课程大纲中，数学归纳法是“证明”这一主题的关键部分。学生应理解归纳法原理，能将其应用于求和公式与乘积公式，证明整除性结果，以及验证不等式。归纳法题目经常出现在试卷2中，且可能占有相当分量的分值。评分标准鼓励清晰的逻辑流程、正确的符号以及条理分明的结论。掌握归纳法还能加深你对数论与数列的理解，这些均为高层次数学的核心主题。
Published by TutorHao | IB Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图