Mastering Proof by Induction for IB Mathematics HL | 掌握IB数学HL中的归纳法证明

📚 Mastering Proof by Induction for IB Mathematics HL | 掌握IB数学HL中的归纳法证明

Proof by mathematical induction is one of the most elegant and powerful tools in the IB Mathematics Higher Level syllabus. It appears across topics such as sequences, series, divisibility, inequalities, matrix algebra, and calculus. Mastering induction not only secures high marks on Paper 1 and Paper 2 but also develops the logical rigour essential for further study in mathematics. This guide walks you through the principle, step-by-step structure, common pitfalls, and a rich collection of worked examples that reflect the style and depth of examination questions.

数学归纳法证明是IB数学高级程度课程中最优雅、最强大的工具之一。它贯穿数列、级数、整除性、不等式、矩阵代数和微积分等多个主题。掌握归纳法不仅能在试卷一和试卷二中稳稳拿分，还能培养深入学习数学所必需的逻辑严谨性。本指南将带你系统掌握归纳法原理、分步结构、常见误区，并通过大量贴近考试风格的例题，帮助你彻底吃透这一方法。

1. The Principle of Mathematical Induction | 数学归纳法的基本原理

s on the well-ordering property of the natural numbers. Imagine an infinite row of dominoes: if you can knock over the first one and ensure that any falling domino will knock over the next, then all dominoes will fall. Induction formalises this intuition.

数学归纳法是一种证明命题P(n)对所有自然数n ≥ n₀成立的方法，其根基在于自然数的良序性。想象一列无限长的多米诺骨牌：如果你能推倒第一张，并且保证任意一张倒下的骨牌都会推倒下一张，那么所有骨牌都会倒下。归纳法正是将这一直观过程严谨化。

2. The Formal Steps of Induction | 归纳证明的规范步骤

assume P(k) is true for some arbitrary k ≥ n₀. Third, the inductive step: prove that P(k) ⇒ ou to conclude that P(n) is true for all n ≥ n₀. IB examiners expect explicit labelling of 'Base case', 'Inductive hypothesis', and 'Inductive step'.

任何一个归纳证明都必须包含三个清晰标注的阶段。第一，基础情形：验证P(n₀)为真。第二，归纳假设：假设对某个任意的k ≥ n₀，P(k)成立。第三，归纳递推：证明P(k) ⇒ P(k+1)。顺利完成这些步骤后，就可以断言对所有n ≥ n₀，P(n)为真。IB阅卷老师明确要求标注“基础情形”、“归纳假设”和“归纳递推”。

3. Common Pitfalls and How to Avoid Them | 常见错误及规避方法

Many students lose marks by writing an incomplete inductive hypothesis, forgetting to state the domain of k, or manipulating the conclusion rather than deriving it from the hypothesis. Another frequent error is proving P(k+1) without using the assumption P(k). The inductive step must explicitly rely on the inductive hypothesis; otherwise the proof is invalid. Also, be careful with algebraic manipulations: factorisation errors in divisibility proofs or sign mistakes in inequalities can derail an otherwise correct structure.

许多学生因归纳假设写得不够完整、忘记声明k的取值范围，或是在推导P(k+1)时直接写下结论而未从假设出发而失分。另一个常见错误是在证明递推步骤时根本没有利用归纳假设。递推步骤必须明确依赖于归纳假设，否则证明无效。此外，要小心代数运算：整除性证明中的因式分解错误或不等式证明中的符号失误，都可能使原本正确的结构功亏一篑。

---

4. Example 1: Summation of Series | 例1：数列求和

tegers n, the sum of the first n positive integers is given by 1 + 2 + ... + n = n(n+1)/2.

证明对所有正整数n，前n个正整数的和为1 + 2 + ... + n = n(n+1)/2。

Base case: For n = 1, LHS = 1, RHS = 1×(1+1)/2 = 1. Thus P(1) holds.

基础情形：当n = 1时，左边 = 1，右边 = 1×(1+1)/2 = 1。因此P(1)成立。

Inductive hypothesis: Assume P(k) is true for some k ≥ 1, i.e. 1 + 2 + ... + k = k(k+1)/2.

归纳假设：假设对某个k ≥ 1，P(k)为真，即1 + 2 + ... + k = k(k+1)/2。

Inductive step: (k+1): (k+1)(k/2 + 1) = (k+1)(k+2)/2. This is exactly the formula for n = k+1. Hence P(k) ⇒ P(k+1). By induction, the statement holds for all n ∈ ℕ.

归纳递推：考虑前k+1项和：1 + 2 + ... + k + (k+1)。利用归纳假设，它等于k(k+1)/2 + (k+1)。提取公因式(k+1)：(k+1)(k/2 + 1) = (k+1)(k+2)/2。这恰好是n = k+1时的公式。因此P(k) ⇒ P(k+1)。由数学归纳法，命题对所有自然数n成立。

∑_i=1ⁿ i = n(n+1)/2

---

5. Example 2: Divisibility Proofs | 例2：整除性证明

Prove that n³ − n is divisible by 6 for all integers n ≥ 1.

证明对所有整数n ≥ 1，n³ − n都能被6整除。

Base case: n = 1: 1³ − 1 = 0, which is divisible by 6. True.

基础情形：n = 1时：1³ − 1 = 0，0可被6整除。成立。

Inductive hypothesis: Suppose k³ − k = 6m for some integer m, where k ≥ 1.

归纳假设：假设对某个k ≥ 1，k³ − k = 6m，其中m为整数。

Inductive step: For n = k+1, (k+1)³ − (k+1) = k³ + 3k² + 3k + 1 − k − 1 = (k³ − k) + 3k(k+1). By hypothesis, k³ t of two consecutive integers, so it is even; thus 3k(k+1) is a multiple of 6. Therefore the sum is divisible by 6. Hence P(k+1) is true. By induction, n³ − n is divisible by 6 for all n ≥ 1.

归纳递推：对于n = k+1，(k+1)³ − (k+1) = k³ + 3k² + 3k + 1 − k − 1 = (k³ − k) + 3k(k+1)。由假设，k³ − k = 6m。注意到k(k+1)是两个连续整数的乘积，必然是偶数，因此3k(k+1)是6的倍数。所以总和可被6整除，即P(k+1)成立。由归纳法，对所有n ≥ 1，n³ − n可被6整除。

---

6. Example 3: Inequalities | 例3：不等式

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

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

Base case: n = 5: 2⁵ = 32, 5² = 25, and 32 > 25. True.

基础情形：n = 5时：2⁵ = 32，5² = 25，32 > 25，成立。

Inductive hypothesis: Assume 2^k > k² for some k ≥ 5.

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

Inductive step: We need to show 2^k+1 > (k+1)². Start with LHS: 2^k+1 = 2×2^k > 2k² (by hypothesis). Now compare 2k² with (k+1)² = k² + 2k + 1. For k ≥ 5, 2k² − (k² + 2k + 1) = k² − 2k − 1 = (k − 1)² − 2 ≥ 16 − 2 = 14 > 0. Hence 2k² > (k+1)². Therefore 2^k+1 > (k+1)². Thus P(k+1) holds. By induction, the inequality is true for all n ≥ 5.

归纳递推：需证明2^k+1 > (k+1)²。由左边出发：2^k+1 = 2×2^k > 2k²（根据假设）。比较2k²与(k+1)² = k² + 2k + 1。当k ≥ 5时，2k² − (k² + 2k + 1) = k² − 2k − 1 = (k − 1)² − 2 ≥ 16 − 2 = 14 > 0。因此2k² > (k+1)²，进而2^k+1 > (k+1)²。P(k+1)成立。由归纳法，原不等式对所有n ≥ 5成立。

---

广告 / Sponsored

7. Example 4: Recurrence Relations | 例4：递推关系

A sequence is defined by u₁ = 2 and u_n+1 = 3u_n − 4 for n ≥ 1. Prove by induction that u_n = 3ⁿ⁻¹ + 1.

数列由u₁ = 2以及u_n+1 = 3u_n − 4(n ≥ 1)定义。用归纳法证明u_n = 3ⁿ⁻¹ + 1。

Base case: n = 1: 3¹⁻¹ + 1 = 3⁰ + 1 = 2 = u₁. True.

基础情形：n = 1时：3¹⁻¹ + 1 = 1 + 1 = 2 = u₁。成立。

Inductive hypothesis: Assume u_k = 3^k−1 + 1 for some k ≥ 1.

归纳假设：假设对某个k ≥ 1，u_k = 3^k−1 + 1成立。

Inductive step: Using the recurrence, u_k+1 = 3u_k − 4 = 3(3^k−1 + 1) − 4 = 3^k + 3 − 4 = 3^k − 1. Wait, this gives 3^k − 1, not 3^k + 1. Let me correct the closed form to match typical questions. Actually, to get 3ⁿ⁻¹ + 1, check: u₂ = 3×2 − 4 = 2, but formula 3¹ + 1 = 4, so not matching. Let's adjust: suppose u₁ = 4, u_n+1 = 3u_n − 8, then u_n = 3ⁿ⁻¹ × 2? No. I need a valid induction example. Better to use a well-known one: u₁ = 1, u_n+1 = 2u_n + 1, prove u_n = 2ⁿ − 1. This is standard. Let's use that instead to avoid mistakes.

重新选择常见例子：u₁ = 1，且u_n+1 = 2u_n + 1 (n ≥ 1)。证明u_n = 2ⁿ − 1。

Base case: n = 1: 2¹ − 1 = 1 = u₁. True.

基础情形：n = 1时，2¹ − 1 = 1 = u₁。成立。

Inductive hypothesis: Suppose u_k = 2^k − 1 for some k ≥ 1.

归纳假设：假设对某个k ≥ 1，u_k = 2^k − 1。

Inductive step: u_k+1 = 2u_k + 1 = 2(2^k − 1) + 1 = 2^k+1 − 2 + 1 = 2^k+1 − 1. This matches the formula for n = k+1. Thus P(k+1) holds. By induction, u_n = 2ⁿ − 1 for all n ∈ ℕ.

归纳递推：u_k+1 = 2u_k + 1 = 2(2^k − 1) + 1 = 2^k+1 − 2 + 1 = 2^k+1 − 1。与n = k+1时的公式一致。因此P(k+1)成立。由归纳法，对所有自然数n，u_n = 2ⁿ − 1。

---

8. Example 5: Matrix Exponentiation | 例5：矩阵乘方

Let A =

1	2
0	1

. Prove that Aⁿ =

1	2n
0	1

for all positive integers n.

设A =

1	2
0	1

。证明对所有正整数n，Aⁿ =

1	2n
0	1

。

Base case: n = 1: A¹ = A, and the formula gives the same matrix. True.

基础情形：n = 1时，A¹ = A，公式给出相同矩阵。成立。

Inductive hypothesis: Assume A^k =

1	2k
0	1

for some k ≥ 1.

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

1	2k
0	1

。

Inductive step: A^k+1 = A^k A. Compute product:

1	2k
0	1

×

1	2
0	1

=

1×1+2k×0	1×2+2k×1
0×1+1×0	0×2+1×1

=

1	2+2k
0	1

=

1	2(k+1)
0	1

. This matches P(k+1). Done.

归纳递推：A^k+1 = A^k A。计算乘积：

1	2k
0	1

×

1	2
0	1

=

1	2+2k
0	1

=

1	2(k+1)
0	1

。与P(k+1)相符。得证。

---

9. Strong Induction | 强归纳法

Standard induction assumes P(k) to prove P(k+1). Strong induction, also examined in HL, assumes P(1), P(2), ..., P(k) are all true to prove P(k+1). It is especially useful for recurrence relations that depend on more than one previous term, such as the Fibonacci sequence.

标准归纳法假设P(k)成立以证明P(k+1)。强归纳法（HL考纲内）则假设P(1), P(2), ..., P(k)全都为真，再利用它们证明P(k+1)。强归纳法对于依赖前多项的递推关系（如斐波那契数列）尤为有用。

Example: Prove that every integer n ≥ 2 can be written as a product of prime numbers.

例题：证明任一整数n ≥ 2都可以写成素数的乘积。 Published by TutorHao | IB Mathematics Revision Series | aleveler.com

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