Mastering Mathematical Induction: IB Math Exercise 1H | 掌握数学归纳法：IB数学练习1H

📚 Mastering Mathematical Induction: IB Math Exercise 1H | 掌握数学归纳法：IB数学练习1H

Mathematical induction is a cornerstone of proof in the IB Mathematics: Analysis and Approaches and Applications and Interpretation courses. Exercise 1H typically consolidates students’ ability to construct rigorous inductive arguments for sequences, series, divisibility, and inequalities. Mastering this exercise ensures you can confidently tackle Paper 1 and Paper 2 proof questions.

数学归纳法是 IB 数学分析与方法、应用与解释课程中证明问题的基石。练习 1H 通常用于巩固学生构造严格归纳论证的能力，涵盖数列、级数、整除性和不等式。掌握这个练习，可以确保你自信地应对试卷一二中的证明题。

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

Mathematical induction is a method of proving that a statement P(n) holds for all natural numbers n ≥ k, where k is a starting integer (usually 1). It relies on the domino effect: if you can knock down the first domino and show that each domino knocks down the next, all dominoes fall.

数学归纳法是一种证明命题 P(n) 对所有自然数 n ≥ k（k 为起始整数，通常为1）成立的方法。它依赖多米诺效应：如果你能推倒第一块多米诺骨牌，并证明每块骨牌都会推倒下一块，那么所有骨牌都会倒下。

The method consists of two core steps: the base case and the inductive step. Together they establish infinite truth from a finite verification.

该方法包含两个核心步骤：基础情形和归纳递推。二者结合，从有限验证建立起无穷真理。

• Base Case: Prove P(k) is true.
• 基础情形：证明 P(k) 为真。
• Inductive Step: Assume P(m) is true for some arbitrary m ≥ k (inductive hypothesis), then prove P(m+1) is true.
• 归纳递推：假设对某个 m ≥ k，P(m) 为真（归纳假设），然后证明 P(m+1) 为真。

---

2. Step 1: Setting Up the Base Case | 第一步：建立基础情形

The base case is the smallest value of n for which the statement must be checked. In IB Exercise 1H, the base case is often n = 1 or n = 0. Verifying it correctly prevents the entire proof from collapsing.

基础情形是命题需要验证的最小 n 值。在 IB 练习 1H 中，基础情形通常是 n = 1 或 n = 0。正确验证它能防止整个证明崩塌。

For example, to prove 1 + 2 + … + n = n(n+1)/2, the base case n = 1 gives LHS = 1, RHS = 1(2)/2 = 1, so P(1) is true. Always show both sides of the equation or statement explicitly.

例如，要证明 1 + 2 + … + n = n(n+1)/2，基础情形 n=1 时左边=1，右边=1×2/2=1，因此 P(1) 为真。务必明确展示等式或陈述的两边。

---

3. Step 2: Formulating the Inductive Hypothesis | 第二步：表述归纳假设

Assume the statement is true for n = k, where k is some integer greater than or equal to the base case. This assumption is called the inductive hypothesis and must be stated clearly: ‘Assume P(k) holds, i.e. …’

假设命题对 n = k 成立，其中 k 是大于等于基础情形的某个整数。这一假设称为归纳假设，需清晰陈述：“假设 P(k) 成立，即……”

In IB mark schemes, explicitly writing the inductive hypothesis earns crucial method marks. Never skip this step or treat it as implicitly understood.

在 IB 评分方案中，明确写出归纳假设可获得关键的方法分。千万不要跳过此步骤或认为不言自明。

A typical hypothesis for the sum of cubes 1³ + 2³ + … + k³ = [k(k+1)/2]² would be: Assume true for n = k, so sum = [k(k+1)/2]².

对于立方和 1³ + 2³ + … + k³ = [k(k+1)/2]² 的典型假设是：假设 n=k 时成立，即总和 = [k(k+1)/2]²。

---

4. Step 3: Executing the Inductive Step | 第三步：执行归纳递推

Using the inductive hypothesis, you must prove that the statement holds for n = k+1. This often involves adding the (k+1)-th term to both sides of an equation or substituting n = k+1 into a divisibility expression.

利用归纳假设，你必须证明命题对 n = k+1 成立。这通常涉及在等式两边加上第 k+1 项，或将 n=k+1 代入整除性表达式。

For example, for the sum 1 + 3 + 5 + … + (2n-1) = n², start with LHS up to term k, add (2(k+1)-1) = 2k+1, and show it equals (k+1)². Algebraic manipulation and factorisation are key skills here.

例如，对求和 1 + 3 + 5 + … + (2n-1) = n²，从截至第 k 项的左边出发，加上 (2(k+1)-1) = 2k+1，并证明它等于 (k+1)²。代数操作与因式分解是此处的关键技能。

Always conclude the inductive step with a sentence: “Thus P(k+1) is true whenever P(k) is true.” This completes the logical link.

始终用一句话总结归纳递推：“因此，若 P(k) 为真，则 P(k+1) 为真。”这完成了逻辑链条。

---

5. Concluding the Proof | 归纳证明的结论

After verifying the base case and proving the inductive step, you must write a formal conclusion. The standard IB phrasing is: “Since P(1) is true and P(k) ⇒ P(k+1), by mathematical induction, P(n) is true for all n ∈ ℕ, n ≥ 1.”

验证完基础情形并证明归纳递推后，你必须写出正式的结论。IB 标准措辞是：“由于 P(1) 为真且 P(k) ⇒ P(k+1)，根据数学归纳法，对所有自然数 n ≥ 1，P(n) 成立。”

Omitting the conclusion might lose the final mark. It seals the proof and shows understanding of the induction principle.

省略结论可能会丢失最后一分。它给证明画上句号，并展现对归纳原理的理解。

---

6. Proving Summation Formulas | 证明求和公式

A major category in Exercise 1H is proving formulas for series. These include arithmetic series, sum of squares, sum of cubes, and other finite sums given in sigma notation.

练习 1H 中的一大类别是证明级数公式，包括等差数列、平方和、立方和以及其他以 Σ 符号给出的有限和。

Consider proving Σ(r=1 to n) r(r+1) = (1/3)n(n+1)(n+2). The base case n=1: LHS=1×2=2, RHS=(1/3)(1)(2)(3)=2. For the inductive step, assume Σ(r=1 to k) r(r+1) = (1/3)k(k+1)(k+2). Then for n=k+1, add (k+1)(k+2) to the hypothesis and factor to reach (1/3)(k+1)(k+2)(k+3). Careful algebraic expansion and common factor extraction are necessary.

考虑证明 Σ(r=1 to n) r(r+1) = (1/3)n(n+1)(n+2)。基础情形 n=1：LHS=1×2=2，RHS=(1/3)(1)(2)(3)=2。归纳递推时，假设 Σ(r=1 to k) r(r+1) = (1/3)k(k+1)(k+2)，然后对 n=k+1，把 (k+1)(k+2) 加到假设上，因式分解得到 (1/3)(k+1)(k+2)(k+3)。需要仔细进行代数展开并提取公因式。

Series Formula 级数公式	Induction Structure 归纳结构
1 + 2 + … + n = ½n(n+1)	Add n+1, factor to ½(n+1)(n+2)
1² + 2² + … + n² = ⅙n(n+1)(2n+1)	Add (k+1)², combine fractions
1³ + 2³ + … + n³ = [½n(n+1)]²	Add (k+1)³, factor perfect square

---

7. Divisibility Proofs with Induction | 用归纳法证明整除性

IB exams frequently ask to prove that an expression like 3²ⁿ⁻¹ + 1 is divisible by 4. Exercise 1H trains you to handle these by expressing the (k+1)-th case in terms of the k-th case.

IB 考试常要求证明形如 3²ⁿ⁻¹ + 1 的表达式能被 4 整除。练习 1H 训练你通过用 k 情形表示 k+1 情形来处理这类问题。

The strategy: assume f(k) = 3²ᵏ⁻¹ + 1 = 4M for some integer M. Then compute f(k+1) = 3²⁽ᵏ⁺¹⁾⁻¹ + 1 = 3²ᵏ⁺¹ + 1. Relate it to f(k) by writing 3²ᵏ⁺¹ = 9 × 3²ᵏ⁻¹. Subtract and add to introduce f(k), then show the result is a multiple of the divisor.

策略：假设 f(k) = 3²ᵏ⁻¹ + 1 = 4M（M 为整数）。然后计算 f(k+1) = 3²⁽ᵏ⁺¹⁾⁻¹ + 1 = 3²ᵏ⁺¹ + 1。通过写 3²ᵏ⁺¹ = 9 × 3²ᵏ⁻¹ 将其与 f(k) 关联，减去并加上以引入 f(k)，然后证明结果是除数的倍数。

f(k+1) = 9(f(k) – 1) + 1 = 9f(k) – 8

If f(k) is divisible by 4, then 9f(k) – 8 is also divisible by 4. This completes the inductive step. Practice this algebraic manipulation; it appears in many Exercise 1H problems.

如果 f(k) 能被 4 整除，那么 9f(k) – 8 也能被 4 整除。这就完成了归纳递推。多练习这种代数操作，它在许多练习 1H 题目中出现。

---

8. Proving Inequalities by Induction | 用归纳法证明不等式

Inequality proofs require a different touch. For instance, show that 2ⁿ > n² for n ≥ 5. The base case n=5: 2⁵=32, 5²=25, true. Assume 2ᵏ > k². For k+1, we need 2ᵏ⁺¹ > (k+1)².

不等式证明需要不同的技巧。例如，证明当 n ≥ 5 时 2ⁿ > n²。基础情形 n=5：2⁵=32，5²=25，成立。假设 2ᵏ > k²。对 k+1，需证 2ᵏ⁺¹ > (k+1)²。

Start from the hypothesis: 2ᵏ⁺¹ = 2 × 2ᵏ > 2k². Now we want to prove 2k² ≥ (k+1)² for the valid k range. This reduces to k² – 2k – 1 ≥ 0, true for k ≥ 3. Since we started at k ≥ 5, the chain holds.

从归纳假设出发：2ᵏ⁺¹ = 2 × 2ᵏ > 2k²。现在需要证明在有效的 k 范围内 2k² ≥ (k+1)²。这简化为 k² – 2k – 1 ≥ 0，对 k ≥ 3 成立。由于我们从 k ≥ 5 开始，链条成立。

Such proofs often require combining the inductive hypothesis with an additional algebraic inequality. Clearly show each ‘>’ or ‘≥’ transition.

此类证明常需将归纳假设与一个额外的代数不等式结合。清楚地展示每一步“>”或“≥”的过渡。

---

9. Common Pitfalls in Induction Proofs | 归纳证明中的常见陷阱

Many students lose marks by assuming P(k+1) before proving it, or by circular reasoning. Never start with the statement you want to prove for k+1 and work backwards unless you explicitly indicate equivalence.

许多学生因在证明 P(k+1) 之前就假设它成立，或因循环推理而失分。除非明确标明等价关系，否则不要从你试图证明的 k+1 命题出发反向推导。

Another error is forgetting the base case or choosing the wrong base value. When proving a statement for n ≥ 3, checking n=1 or n=2 alone is insufficient.

另一个错误是忘记基础情形，或选错了起始值。若需证明 n ≥ 3 的命题，仅检验 n=1 或 n=2 是不够的。

Also, in divisibility proofs, avoid dividing by variables; always use integer multiples. Keep the logical flow clear: Base case → Hypothesis → Derivation → Conclusion.

此外，在整除性证明中，避免用变量相除；始终使用整数倍数。保持逻辑流程清晰：基础情形 → 假设 → 推导 → 结论。

---

10. Exercise 1H: Typical Questions and Detailed Solutions | 练习1H：典型题目与详细解答

Let’s analyse a classic Exercise 1H question: Prove that 1×2 + 2×3 + 3×4 + … + n(n+1) = ⅓n(n+1)(n+2). Base case n=1: LHS=2, RHS=2. Assume true for n=k. Then sum to k+1 is ⅓k(k+1)(k+2) + (k+1)(k+2). Factor (k+1)(k+2): = (k+1)(k+2)[⅓k + 1] = (k+1)(k+2)(k+3)/3, which matches the formula for n=k+1. Hence proven.

我们来分析一道经典的练习 1H 题目：证明 1×2 + 2×3 + 3×4 + … + n(n+1) = ⅓n(n+1)(n+2)。基础情形 n=1：左边=2，右边=2。假设 n=k 时成立。则前 k+1 项和为 ⅓k(k+1)(k+2) + (k+1)(k+2)。因式分解 (k+1)(k+2)：= (k+1)(k+2)[⅓k + 1] = (k+1)(k+2)(k+3)/3，与 n=k+1 时的公式吻合。因此得证。

Another common type: Prove 7ⁿ – 1 is divisible by 6 for all n ∈ ℕ. Base n=1: 7¹–1=6, divisible. Assume 7ᵏ – 1 = 6m. Then 7ᵏ⁺¹ – 1 = 7×7ᵏ – 1 = 7(6m+1) – 1 = 42m + 7 – 1 = 42m + 6 = 6(7m+1), divisible by 6.

另一常见类型：证明对所有自然数 n，7ⁿ – 1 能被 6 整除。基础 n=1：7¹–1=6，可整除。假设 7ᵏ – 1 = 6m。则 7ᵏ⁺¹ – 1 = 7×7ᵏ – 1 = 7(6m+1) – 1 = 42m + 7 – 1 = 42m + 6 = 6(7m+1)，能被 6 整除。

Practising a variety of Exercise 1H problems builds fluency in these techniques.

练习多样化的练习 1H 题目可熟练这些技巧。

---

11. Connecting Induction to Other IB Topics | 归纳法与其他 IB 主题的联系

Mathematical induction extends beyond Chapter 1. In calculus, you may prove the nth derivative of eᵃˣ, or in complex numbers, de Moivre’s theorem for integer powers. Exercise 1H lays the foundation for these higher-level applications.

数学归纳法不止于第一章。在微积分中，你可能需要证明 eᵃˣ 的 n 阶导数，或在复数中证明整数次幂的棣莫弗定理。练习 1H 为这些更高级的应用奠定了基础。

The structured approach—base case, hypothesis, inductive step—remains identical, whether you are proving algebraic identities or geometric properties. Recognising this unity helps you tackle unseen proofs in Paper 1.

无论证明代数恒等式还是几何性质，结构化方法——基础情形、假设、归纳递推——保持不变。认识到这种统一性有助于你应对卷一中的陌生证明题。

---

12. Final Tips and Practice Strategy | 最后提示与练习策略

To master Exercise 1H, attempt at least ten mixed induction problems from past IB questionbanks. Focus on writing every step clearly, even if it feels repetitive. Use the mark scheme to check that you are not omitting essential justifications.

要掌握练习 1H，至少尝试 IB 往年真题库中的十道混合归纳法题。专注于清晰地写出每一步，即使感觉重复。利用评分方案检查你是否遗漏了关键的论证。

Pair up with a study partner and explain your proof aloud. Verbalising the logic reinforces understanding. Remember, induction is a formal proof technique—precision and structure are rewarded.

找一个学习伙伴结对，并大声解释你的证明。把逻辑说出来能加深理解。记住，归纳法是一种形式化证明技巧——精确性和结构会得到回报。

Keep a separate notebook for ‘Induction Templates’ for summation, divisibility, and inequalities. Over time, you will internalise the patterns and tackle Exercise 1H with confidence.

准备一个单独的笔记本记录“归纳法模板”，涵盖求和、整除性和不等式。久而久之，你将内化这些模式，自信地应对练习 1H。

Published by TutorHao | Mathematics Revision Series | aleveler.com

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