📚 Mastering Proof by Induction | 掌握数学归纳法
Proof by mathematical induction is a cornerstone of A-Level Edexcel Pure Mathematics, providing a rigorous method for establishing the truth of infinitely many statements. Whether you are summing series, proving divisibility, or verifying matrix powers, the inductive framework remains the same. This article breaks down every step, explores common question types, and equips you with examiner-friendly presentation techniques.
数学归纳法是 Edexcel A-Level 纯数部分的核心证明方法，它为一组无限命题的真实性提供了严谨的验证工具。无论是求和公式、整除性证明还是矩阵乘方问题，归纳法的逻辑框架始终不变。本文将逐层拆解每一步，分析常见题型，并帮助你掌握阅卷老师青睐的规范表达方式。
1. The Principle of Induction | 归纳法原理
Induction works by proving two key components: the base case and the inductive step. If both hold, the statement is true for all positive integers n. Think of it like a line of dominoes — once you push the first one and ensure each domino knocks over the next, all will fall.
归纳法依靠两个关键部分：基础情形与归纳步骤。如果两者都成立，命题对所有正整数 n 都成立。可以想象成一排骨牌——一旦推倒第一块，并且保证每一块都能碰倒下一块，全部骨牌都会依次倒下。
- Base case: verify the statement for the smallest value of n (usually n = 1).
- 基础情形：验证当 n 取最小值（通常为 n = 1）时命题成立。
- Inductive hypothesis: assume the statement is true for some integer k ≥ 1.
- 归纳假设：假设命题对于某个正整数 k ≥ 1 成立。
- Inductive step: prove the statement for n = k + 1 using the hypothesis.
- 归纳步骤：利用假设推导出命题对 n = k + 1 也成立。
- Conclusion: the statement is true for all positive integers n by mathematical induction.
- 结论：由数学归纳法可知，命题对所有正整数 n 成立。
2. Setting Out a Proof Clearly | 规范书写证明步骤
Examiners expect a clear structure. Always label the base case, hypothesis, inductive step, and conclusion. A well-organised layout not only helps you avoid mistakes but also earns full marks when the working is logically complete.
阅卷标准要求结构清晰。一定要标明基础情形、归纳假设、归纳步骤和结论。条理分明的布局不但能防止丢步漏步，还能因逻辑完整而获得满分。
| Step | What to write |
|---|---|
| Base case | Substitute n = 1 and show LHS = RHS. |
| Inductive hypothesis | "Assume true for n = k." Write the assumed equation. |
| Inductive step | = k + 1. Use the hypothesis to rewrite the expression until it matches the required form. |
| Conclusion | " true for n = k, then true for n = k + 1. Since true for n = 1, by induction true for all n ∈ ℕ." |
3. Standard Summation Proof | 标准求和公式证明
One of the most common induction tasks is proving a formula for the sum of the first n terms. For example, the sum of the first n integers is ½n(n+1). The inductive step usually involves adding the (k+1)-th term to the sum assumed in the hypothesis and then factoring.
最常见的归纳题型之一是证明前 n 项求和公式。例如前 n 个正整数的和为 ½n(n+1)。归纳步骤通常需要将第 (k+1) 项加入假设中的总和，再进行因式分解。
Example: Prove that 1 + 2 + 3 + … + n = n(n+1)/2 for all n ∈ ℕ.
示例：证明对于所有正整数 n，有 1 + 2 + 3 + … + n = n(n+1)/2。
Base case n = 1: LHS = 1, RHS = 1×2/2 = 1, so true. Assume true for n = k: 1+2+…+k = k(k+1)/2. For n = k+1: LHS = (1+2+… (k+1) = (k+1)(k/2 + 1) = (k+1)(k+2)/2, which matches RHS for n = k+1. Conclusion follows.
基础情形 n = 1：左式 = 1，右式 = 1·2/2 = 1，成立。假设 n = k 成立：1+2+…+k = k(k+1)/2。对于 n = k+1：左式 = (1+2+…+k) + (k+1) = k(k+1)/2 + (k+1) = (k+1)(k/2 + 1) = (k+1)(k+2)/2，这与 n = k+1 时的右式一致。归纳结论成立。
4. Summation of Squares and Cubes | 平方和与立方和公式
)/2]². These require careful algebraic manipulation, but the core structure remains unchanged. Always expand, combine, and factor in the inductive step.
考试可能会要求证明 Σr² = n(n+1)(2n+1)/6 或 Σr³ = [n(n+1)/2]²。这类题目需要精细的代数运算，但整体结构不变。在归纳步骤中要经历展开、合并、因式分解的过程。
Σr² = n(n+1)(2n+1)/6
+6)/6, then factor the quadratic as (k+2)(2k+3). This gives the required form for n = k+1.
在归纳步骤中，将 (k+1)² 加入假设公式得到：k(k+1)(2k+1)/6 + (k+1)²。提取因子 (k+1)/6 得到 (k+1)(2k²+7k+6)/6，然后将二次式分解为 (k+2)(2k+3)，即可得到 n = k+1 时的目标形式。
5. Divisibility Proofs | 整除性证明
sibility induction requires a slightly different approach. After assuming a statement like "7ⁿ - 1 is divisible by 6" e trick is to write f(k+1) = a·f(k) + multiple of the divisor, or to split terms cleverly.
整除性归纳证明的方法略有不同。假设对于 n = k，如“7ⁿ - 1 能被 6 整除”成立，你需要用 f(k) 表示 f(k+1)。技巧在于将 f(k+1) 写成 a·f(k) 加上除数的倍数，或巧妙地拆分项。
en f(k+1) = 3²ᵏ⁺² - 1 = 9·3²ᵏ - 1 = 9(8m + 1) - 1 = 72m + 8 = 8(9m+1), which is a multiple of 8. Hence true.
示例：证明对所有正整数 n，3²ⁿ - 1 可被 8 整除。设 f(n) = 3²ⁿ - 1。基础情形 n=1: 3² - 1 = 8，可被 8 整除。假设 f(k) = 3²ᵏ - 1 = 8m。那么 f(k+1) = 3²ᵏ⁺² - 1 = 9·3²ᵏ - 1 = 9(8m + 1) - 1 = 72m + 8 = 8(9m+1)，这是 8 的倍数。因此成立。
6. Induction with Matrices | 矩阵乘方归纳
Proving matrix power formulas such as Aⁿ = [ … ᵏ A. Substitute the assumed form for Aᵏ and perform multiplication, then simplify entries.
证明矩阵乘方公式如 Aⁿ = [ … ] 是 Edexcel 试卷中的常见题型。基础情形验证 n=1（即矩阵本身）。归纳步骤使用矩阵乘法：Aᵏ⁺¹ = Aᵏ A。代入假设的 Aᵏ 形式并进行乘法运算，然后化简各元素。
When simplifying, remember to use standard trigonometric identities if the matrix involves sine and cosine entries, for instance in rotation matrices. Show each element explicitly to secure method marks.
化简时，如果矩阵包含正弦和余弦项（如旋转矩阵），要灵活运用标准三角恒等式。详细写出每个元素的运算过程，以确保拿到方法分。
7. Proving Inequalities | 证明不等式
step usually starts from the hypothesis and builds the k+1 case by multiplying or adding terms. You must justify each inequality sign to satisfy the examiner.
归纳法还能处理不等式，例如 2ⁿ > n²（n ≥ 5）。归纳步骤通常从归纳假设出发，通过乘或加某些项构建出 k+1 的情形。必须为每一个不等号的成立提供依据，才能令阅卷人信服。
pand and simplify to k² - 2k - 1 ≥ 0, which is true for k ≥ 3). Hence 2ᵏ⁺¹ > (k+1)². Done.
示例：证明当 n ≥ 5 时 2ⁿ > n²。基础情形 n=5：32 > 25。假设 2ᵏ > k²。两边乘 2 得 2ᵏ⁺¹ > 2k²。接着证明当 k ≥ 5 时 2k² ≥ (k+1)²（展开得 k² - 2k - 1 ≥ 0，对 k ≥ 3 成立）。因此 2ᵏ⁺¹ > (k+1)²。证毕。
8. Recurrence Relation Proofs | 递推关系的证明
es the explicit formula for n = 1, and the inductive step uses the recurrence to connect uₖ₊₁ to uₖ.
有些题目定义一个序列，如 uₙ₊₁ = 3uₙ - 4，并要求证明其通项公式 uₙ = 3ⁿ⁻¹ + 2。归纳法是完美利器。基础情形验证 n = 1 时的显式公式，归纳步骤则利用递推关系将 uₖ₊₁ 与 uₖ 连接起来。
that the result matches the closed form. State clearly that the formula holds for n = k+1.
将归纳假设小心地代入递推关系，化简后检查结果是否与通项公式一致。最后明确陈述该公式对 n = k+1 也成立。
9. Sequences in Context | 情境中的数列证明
A-Level questions may embed induction in real-world contexts, like population growth or compound interest, where a sequence models the scenario. The reasoning is identical, but you must interpret the results within the given context.
A-Level 题目有时会把归纳法融入实际情境，例如种群增长或复利问题，其中数列用于建模。论证过程完全相同，只是你需要在给定情境中解释结果。
ion is Pₙ = 2000 × 1.05ⁿ. Prove by induction that the model is consistent with an annual 5% ase show P₁ = 2100. Inductive step: Pₖ₊₁ = Pₖ × 1.05, substitute assumed form and confirm.
例如，某模型给出 n 年后人口为 Pₙ = 2000 × 1.05ⁿ。用归纳法证明该模型与年增长率 5% 相一致。基础情形显示 P₁ = 2100。归纳步骤：Pₖ₊₁ = Pₖ × 1.05，代入假设形式并确认即可。
10. Common Pitfalls and How to Avoid Them | 常见失误及避免方法
Many students lose marks by ignoring the base case or failing to state the conclusion explicitly. Another common error is manipulating both sides of an equation simultaneously, which can imply the result you are trying to prove. Instead, work from one side to the other.
许多同学因遗漏基础情形或未明确写出结论而丢分。另一个常见错误是同时对方程两边进行变形，这容易陷入循环论证。正确做法是由等式一端推导至另一端。
- Always verify the base case with actual values, not just a symbolic n = 1.
- 务必用实际数值验证基础情形，而不是仅仅写个 n = 1 的符号。
- Do not write "true for n = k+1" before fully simplifying.
- 在彻底化简完毕之前，不要急着写“对 n = k+1 成立”。
- In divisibility proofs, clearly state "f(k+1) = multiple of divisor".
- 在整除性证明中，要明确写出“f(k+1) 是除数的倍数”。
- Use the exact phrase "by mathematical induction" in your final sentence.
- 在结尾处使用准确的术语“由数学归纳法”。
11. Building Fluency Through Practice | 通过练习培养熟练度
Mastering induction requires writing out full proofs until the structure becomes second nature. Begin with simple summation, progress to divisibility, then tackle matrices and inequalities. Work through past Edexcel questions, and always check your algebra.
掌握归纳法需要完整写出证明过程，直至结构内化成习惯。从简单的求和开始，再到整除性，然后挑战矩阵和不等式。钻研往年 Edexcel 真题，并始终检查代数运算。
Create a checklist: base case, assumption statement, target for k+1, manipulation using hypothesis, and final conclusion. Time yourself — the inductive step of a routine proof should take no more than five minutes with practice.
制作一个清单：基础情形、假设陈述、k+1 的目标形式、运用假设进行变形、以及最终结论。给自己计时——经过练习，常规证明的归纳步骤最多只需五分钟。
12. Summary and Final Tips | 总结与冲刺建议
Proof by induction is a highly predictable topic; once you learn the pattern, you can secure essential marks. Focus on neat presentation, correct algebraic steps, and a complete concluding statement. In the exam, underline the final result and box the keywords "by induction".
数学归纳法是高度可预测的题型；一旦掌握固定的套路，就能将关键分数稳稳收入囊中。重点关注书写工整、代数步骤正确和完整的总结陈述。考试时，在最终结果下划线，并把“由数学归纳法”这几个关键字圈出来。
| Quick review | Action |
|---|---|
| Base case | Show n=1 explicitly |
| Hypothesis | Assume for n=k and write formula |
| Step | Derive n=k+1 using hypothesis |
| Conclusion | State "therefore true for all n by induction" |
With consistent practice and attention to these guidelines, you will turn induction into one of your strongest areas on the Edexcel A-Level Mathematics paper.
坚持练习并严格遵循这些指南，你就能让归纳法成为 Edexcel A-Level 数学试卷上最具优势的得分板块。
Published by TutorHao | Pure Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图