📚 Proof by Induction | 数学归纳法证明
Proof by induction is a powerful logical technique widely examined in Edexcel A-Level Mathematics. It allows us to prove that a given statement holds for all natural numbers by confirming a base case and then showing that if the statement holds for an arbitrary integer k, it must also hold for k+1. This method often appears in questions involving summation formulas, divisibility properties, inequalities, and sequences defined recursively. A clear understanding of the four‑step structure is essential for securing full marks in the Pure Mathematics paper.
数学归纳法是一种在 Edexcel A-Level 数学中广泛考查的强大推理工具。通过验证一个基本情况，进而证明若命题对任意整数 k 成立，则它对 k+1 也必定成立，我们可以论证该命题对所有自然数都成立。这种方法常出现在涉及求和公式、整除性质、不等式以及递推数列的考题中。清晰掌握四步结构对于在纯数学试卷中拿到满分至关重要。
1. What is Proof by Induction? | 什么是数学归纳法？
Proof by induction is a method of mathematical reasoning that establishes the truth of an infinite sequence of statements. Rather than checking every single natural number, which is impossible, we perform two critical tasks: verify the first statement is true, and prove that whenever one statement is true, the next one follows logically. This domino effect guarantees truth for all n ∈ ℕ.
数学归纳法是一种证明无穷多个命题成立的方法。我们不可能逐一检查所有自然数，但只需完成两个关键步骤：验证第一个命题为真，并证明只要某个命题为真，它的下一个命题也必然为真。这种多米诺效应就能保证所有自然数 n 对应的命题都成立。
ten required to prove results involving sums like Σ r², divisibility statements such as 3ⁿ – also essential in further mathematics for proving matrix results and de Moivre’s theorem.
在 Edexcel 考试中，学生常常需要证明与 Σ r² 相关的求和公式、诸如 3ⁿ – 1 能被 2 整除的整除命题，或者例如 n ≥ 5 时 2ⁿ > n² 的不等式。在进阶数学中，这种方法对于证明矩阵结论和棣莫弗定理同样不可或缺。
2. The Principle of Mathematical Induction | 数学归纳法的原理
which can be stated as follows: if a proposition P(n) satisfies that P(1) is true and P(k) ⇒ all k ≥ 1, then P(n) is true for every natural number n. This principle relies on the well‑ e of the natural numbers and is accepted as an axiom or derived from the Peano postulates.
归纳法的核心是数学归纳法原理，它可以表述如下：若一个命题 P(n) 满足 P(1) 为真，且对所有 k ≥ 1 均有 P(k) ⇒ P(k+1)，那么 P(n) 对所有自然数 n 都为真。这一原理依赖于自然数的良序性质，通常被当作公理接受，或由皮亚诺公设推导得出。
When applying this in A‑ ssume P(k) for k greater than or equal to that starting value, and prove P(k+1). The logic remains identical.
在 A‑Level 题目中应用时，我们不一定总从 1 开始；有时命题只对 n ≥ 2 或 n ≥ 5 成立。此时归纳步骤需对大于等于起始值的 k 假设 P(k)，再证明 P(k+1)。逻辑思路完全一致。
3. The Four‑Step Structure for Edexcel | Edexcel 考试要求的四步结构
Examiners expect a very clear layout. The recommended format is:
考官期望非常清晰的书写格式。推荐的结构如下：
- Step 1 – Basis: Show the statement is true for the smallest value, usually n=1.
第一步——奠基：证明命题对最小的值成立，通常是 n=1。 - Step 2 – Assumption: Assume the statement is true for some arbitrary n = k.
第二步——假设：假设命题对某个任意的 n = k 成立。 - Step 3 – Inductive step: Using the assumption, prove the statement is true for n = k+1.
第三步——递推：利用假设，证明命题对 n = k+1 也成立。 - Step 4 – Conclusion: State that by mathematical induction, the statement is true for all n ∈ ℕ (or for the specified domain).
第四步——结论：声明根据数学归纳法，命题对所有自然数 n（或指定范围）成立。
Many candidates lose marks by omitting the concluding sentence or by failing to link the assumption explicitly in the inductive step. The phrase ‘by the principle of mathematical induction’ must appear in the conclusion to signal a complete argument.
不少考生因遗漏结论句或未在递推步骤中明确使用假设而失分。结论中必须出现“根据数学归纳法原理”这一短语，以表明论证完整。
4. Proving Summation Formulas | 证明求和公式
One of the most common induction questions asks you to prove a closed‑form expression for a sum. For example, prove that 1 + 3 + 5 + … + (2n – ich is true. Assuming the formula holds for n=k, the sum to k+1 terms becomes k² + (2(k+1) – 1) = k² + 2k + 1 = (k+1)², completing the inductive step.
最常见的归纳法题型之一是证明求和公式。例如，证明对所有正整数 n 有 1 + 3 + 5 + … + (2n – 1) = n²。当 n=1 时，左边为 1，右边为 1²，成立；假设对 n=k 成立，则前 k+1 项的和为 k² + (2(k+1) – 1) = k² + 2k + 1 = (k+1)²，完成递推步骤。
∑ᵢ₌₁ⁿ (2i – 1) = n²
. The algebra can become messy, so working carefully with common denominators and factorising is essential. Always factorise the final expression to match the required n+1 form.
Edexcel 试卷中常出现平方和与立方和公式，如 Σ r² = n(n+1)(2n+1)/6 与 Σ r³ = n²(n+1)²/4。代数过程可能较为繁杂，仔细处理公分母和因式分解至关重要。最后务必对表达式进行因式分解，使其呈现所需的 n+1 形式。
5. Proving Divisibility Results | 证明整除性
xpression involving n is always a multiple of a given integer. For instance, prove that 7ⁿ – 1 is divisible by 6 for all n ∈ ℕ. The base case n=1 gives 7 – 1 = 6, which is divisible by 6. Assume 7ᵏ – 1 = 6m for some integer m. Then 7ᵏ⁺¹ – 1 = 7 × 7ᵏ – 1 = 7(6m + 1) – 1 = 42m + 6 = 6(7m+1), clearly a multiple of 6.
整除性证明需要表明含有 n 的表达式始终是某个整数的倍数。例如，证明对所有 n ∈ ℕ，7ⁿ – 1 能被 6 整除。n=1 时，7 – 1 = 6 能被 6 整除。假设 7ᵏ – 1 = 6m，其中 m 为整数。则 7ᵏ⁺¹ – 1 = 7 × 7ᵏ – 1 = 7(6m + 1) – 1 = 42m + 6 = 6(7m+1)，显然也是 6 的倍数。
A common trick is to express the (k+1) term by manipulating the assumption, often adding and subtracting a clever form of the base. For expressions like aⁿ – bⁿ, factorisation or the use of the assumption directly simplifies the algebra. In Edexcel mark schemes, clear justification of how the assumption is used is required; simply writing ‘by the inductive hypothesis’ is not enough unless the substitution is shown.
常用技巧是通过对假设进行代数变形来表示 k+1 的情形，常见方法包括加减一个巧妙的形式。对于如 aⁿ – bⁿ 的表达式，可直接利用因式分解或直接代入假设来简化运算。在 Edexcel 评分标准中，需要清晰写出如何利用假设；仅写“由归纳假设”而不写出代入过程是不够的。
6. Proving Inequalities by Induction | 用归纳法证明不等式
e case n=5 gives 32 > 25, which is true. Assume 2ᵏ > k². Then 2ᵏ⁺¹ = 2 × 2ᵏ > 2k². We need to show 2k² ≥ (k+1)² for k ≥ 5, which simplifies to k² – 2k – 1 ≥ 0, true for k ≥ 5. The chain of inequalities then gives 2ᵏ⁺¹ > (k+1)².
不等式的归纳证明往往更具挑战性，因为逻辑推演并非总是一条简单的代数路径。例如证明 n ≥ 5 时 2ⁿ > n²。奠基步骤 n=5 给出 32 > 25，成立。假设 2ᵏ > k²，则 2ᵏ⁺¹ = 2 × 2ᵏ > 2k²。我们需要证明当 k ≥ 5 时 2k² ≥ (k+1)²，化简得 k² – 2k – 1 ≥ 0，对 k ≥ 5 成立。于是不等式链给出 2ᵏ⁺¹ > (k+1)²。
When dealing with inequality induction, it is often necessary to establish an additional algebraic lemma or to use the assumption to bound the expression from below, then simplify to the desired form. The conclusion must link the derived inequality to the statement for k+1. Marks are awarded for clearly demonstrating the logical flow.
处理不等式归纳法时，往往需要建立一个额外的代数引理，或利用假设从下方放缩表达式，再化简为目标形式。结论必须将推导出的不等式与 k+1 的命题联结起来。清晰展现逻辑脉络方能得分。
7. Induction with Sequences and Recurrence Relations | 数列与递推关系的归纳证明
Sequences defined iteratively, such as uₙ₊₁ = 3uₙ – 2 with u₁ = 2, often lead to closed‑ ove it by checking n=1 (2 = 3⁰+1), assume for n=k, and then use the recurrence: uₖ₊₁ = 3uₖ – 2 = 3(3ᵏ⁻¹+1) – 2 = 3ᵏ + 3 – 2 = 3ᵏ + 1, which matches the conjectured form for k+1.
由递推定义的数列，例如 uₙ₊₁ = 3uₙ – 2 且 u₁ = 2，常引导我们猜测闭式，然后用归纳法验证。若猜想 uₙ = 3ⁿ⁻¹ + 1，可验证 n=1（2 = 3⁰+1），假设对 n=k 成立，再利用递推关系：uₖ₊₁ = 3uₖ – 2 = 3(3ᵏ⁻¹+1) – 2 = 3ᵏ + 3 – 2 = 3ᵏ + 1，恰好与 k+1 时的猜想形式一致。
Such problems test your ability to manipulate indices and substitute correctly. The base case must match the given starting term exactly. Sometimes the recurrence involves two previous terms, which requires a stronger form of induction (strong induction) where you assume the statement holds for all values up to k, not just for k itself. This variant, though less common in standard A‑Level, is useful background knowledge.
这类题目考查你灵活处理指数和正确代入的能力。奠基步骤必须与所给初值精确匹配。有时递推关系涉及前两项，这就需要更强的归纳形式（强归纳法），即假设命题对所有小于等于 k 的值成立，而非仅对 k 本身。这种变体尽管在常规 A‑Level 中较少见，但可作为有益的拓展知识。
8. Common Pitfalls and How to Avoid Them | 常见错误及避免方法
ake systematic errors in induction proofs. A frequent mistake is writing the assumption as ‘ t is being assumed, or confusing the assumption with the statement to prove. Always write: ‘Assume true for n=k, i.e. … clearly showing where the induction hypothesis is used, leading to a loss of method marks.
许多学生在归纳证明中会犯系统性错误。常见错误是把假设写作“令 n=k”而不说明假设的是什么，或将假设与待证命题混淆。务必写出：“假设 n=k 时成立，即……”，并写出具体表达式。另一个陷阱是在处理 k+1 表达式时，未明确表明哪里用到了归纳假设就进行代数变形，导致步骤分丢失。
ark. For summations, sloppy algebra when combining fractions or expanding brackets can derail the proof. Checking the base case with n=0 or n=1 must be done precisely; a value that does not belong to the domain can invalidate the entire proof.
在整除题中，忘记说明 m 是整数，或最后未能提取出除数因子，往往会丢掉最终准确分。对于求和题，通分或展开括号时的草率计算会毁掉整个证明。精确检验奠基步骤，取值是否属于定义域；错误的起始值会使整个证明无效。
9. Edexcel Exam Technique and Mark Schemes | Edexcel 考试技巧与评分方案
Edexcel typically awards 4 to 6 marks for an induction question, allocated for the basis, assumption, inductive step, and conclusion. The conclusion mark is often independent – you simply need to write a concluding sentence like ‘Hence, by the principle of mathematical induction, P(n) is true for all n ∈ ℕ.’ Many candidates lose this easy mark by forgetting it amid the algebra.
Edexcel 通常给归纳题 4 至 6 分，分别分配给奠基、假设、递推和结论。结论分通常是独立的——只需写一句“因此，根据数学归纳法原理，P(n) 对所有自然数 n 成立”就可拿到。很多考生因沉浸在代数运算中而忘记这一步，白白失去这宝贵的分数。
The inductive step must display a clear logical progression. Using arrows or linking words like ‘then’, ‘hence’, or ‘so’ helps the examiner follow your reasoning. Always present the assumption explicitly and, when substituting, show the algebraic manipulation step by step. Avoid skipping lines, especially when factorising. If the expression becomes complicated, work on the side but present a neat, logical derivation on the page.
递推步骤必须展现清晰的逻辑推进。使用箭头或“则”“因此”等连接词有助于考官跟上你的思路。始终明示假设，并在代入时分步展示代数操作。尤其在进行因式分解时，切勿跳行。如果表达式变得复杂，可以在草稿上运算，但在卷面上呈现整洁、合乎逻辑的推导过程。
ase aligns with the conjectured result. Sometimes the question will guide you by asking to ‘prove by induction that … for all n ≥ 2,’ so pay close attention to the starting index.
时间管理同样关键；如果一道题要求先猜想公式，再用归纳法证明，务必确保奠基步骤与猜想结果吻合。有时题目会引导你“用归纳法证明对所有 n ≥ 2 ……”，因此要仔细关注起始下标。
10. Worked Example – Divisibility by 9 | 完整例题——被 9 整除的证明
Let’s walk through a complete exam‑style solution. Prove that 4ⁿ + 6n – 1 is divisible by 9 for all n ∈ ℕ.
我们完整演算一道考试风格的例题。证明对所有 n ∈ ℕ，4ⁿ + 6n – 1 能被 9 整除。
Basis: For n=1, 4¹ + 6(1) – 1 = 4 + 6 – 1 = 9, which is divisible by 9. ✓
奠基：当 n=1 时，4¹ + 6(1) – 1 = 9，能被 9 整除。✓
Assumption: Assume true for n=k, i.e. 4ᵏ + 6k – 1 = 9m for some integer m.
假设：设 n=k 时成立，即存在整数 m 使得 4ᵏ + 6k – 1 = 9m。
Inductive step: Consider n=k+1: 4ᵏ⁺¹ + 6(k+1) – 1 = 4 × 4ᵏ + 6k + 6 – 1 = 4(9m – 6k + 1) + 6k + 5 = 36m – 24k + 4 + 6k + 5 = 36m – 18k + 9 = 9(4m – 2k + 1). Since 4m – 2k + 1 is an integer, the expression is divisible by 9.
递推步骤：考虑 n=k+1 时的表达式：4ᵏ⁺¹ + 6(k+1) – 1 = 4 × 4ᵏ + 6k + 5 = 4(9m – 6k + 1) + 6k + 5 = 36m – 24k + 4 + 6k + 5 = 36m – 18k + 9 = 9(4m – 2k + 1)。由于 4m – 2k + 1 是整数，该表达式能被 9 整除。
Conclusion: Hence, by the principle of mathematical induction, 4ⁿ + 6n – 1 is divisible by 9 for all natural numbers n.
结论：因此，根据数学归纳法原理，4ⁿ + 6n – 1 对所有自然数 n 都能被 9 整除。
Notice how the inductive step isolated the assumption term, substituted, and finally factorised 9. This explicit structure ticks all the Edexcel mark‑scheme requirements.
注意递推步骤如何分离出假设对应项、代入并最终提出因子 9。这种清晰的结构完全符合 Edexcel 评分方案的所有要求。
11. Extending to Further Topics | 延伸到更广的主题
s that a matrix raised to power n takes a specific form. For example, proving that [[1,1],[0,1]]ⁿ = [[1,n],[0,1]] for all n ∈ ℕ follows the same four‑ proved by induction for positive integers, forming the backbone of complex number theory.
归纳法并不局限于求和与整除。在 Edexcel 进阶数学中，你将使用归纳法证明矩阵的性质，例如证明 [[1,1],[0,1]]ⁿ = [[1,n],[0,1]] 对所有 n ∈ ℕ 成立，其四步结构完全相同。此外，棣莫弗定理 (cosθ + i sinθ)ⁿ = cos nθ + i sin nθ 就借助归纳法证明正整数情形，成为复数理论的基础。
Another extension is the proof of the Binomial Theorem for positive integer exponents, which relies on induction and Pascal’s rule for combinations. Recognizing how the inductive method underpins so many key results helps you see its power beyond the routine exam question.
另一扩展是正整数指数情形下二项式定理的证明，这一证明依赖归纳法以及组合数的帕斯卡法则。认识到归纳法如何支撑如此多的重要结论，有助于你在常规考题之外领会其威力。
12. Summary and Final Tips | 总结与最后提示
Mastering proof by induction requires both a solid understanding of the underlying logic and plenty of practice with the specific manipulations demanded by Edexcel. Always start by writing the statement P(n) clearly. Work through the four steps methodically: basis, assumption, inductive step, and conclusion. Never skip the concluding sentence, and ensure your algebra clearly references the assumption.
掌握数学归纳法证明既需要深刻理解其底层逻辑，也需要大量练习 Edexcel 所要求的具体代数操作。始终先明确写出命题 P(n)。有条不紊地执行四个步骤：奠基、假设、递推和结论。绝不要漏掉结论句，并确保代数运算中明确引用了归纳假设。
Use the language of the examination: ‘assume true for n=k’, ‘then for n=k+1’, ‘ lity, and inequalities. With consistent effort, this topic can become one of the most reliable sources of marks on your Pure Mathematics paper.
使用考试中的规范用语：“假设 n=k 时成立”“那么对于 n=k+1”“因此由归纳法得证”。务必利用 Pearson Edexcel 官网上的历年真题进行练习，重点覆盖三大类型：求和、整除和不等式。持之以恒的努力将使这一专题成为你纯数学试卷中最稳定的得分来源之一。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图