📚 Exercise B.1: Mastering Mathematical Induction | 练习 B.1：掌握数学归纳法
In many IB Mathematics textbooks, Exercise B.1 is the first deliberate dive into the world of rigorous proof. It is the gateway to mathematical induction, a powerful technique that transforms intuitive patterns into logically sound statements. This article unpacks the structure, common pitfalls, and typical exam-style problems found in such an exercise, allowing you to move from uncertainty to confidence when tackling any inductive argument.
在许多 IB 数学教材中，练习 B.1 是首次深入严谨证明世界的入口。它是通往数学归纳法的大门，一种将直观规律转化为逻辑严密陈述的强大工具。本文将剖析这类练习中常见的结构、常见错误以及典型的考试题型，帮助你从充满不确定性走向满怀信心地处理任何归纳论证。
1. What Is Exercise B.1? | 什么是练习 B.1？
An 'Exercise B.1' typically appears in the Proofs and Reasoning chapter of IB Analysis and Approaches (AA) or occasionally in the Discrete Mathematics options. It is carefully designed as the first set of problems on mathematical induction, often moving from very straightforward summation identities to divisibility and inequalities. The numbering 'B.1' indicates a building-block exercise — foundational work that must be mastered before moving deeper into more abstract proofs.
“练习 B.1”通常出现在 IB 分析与方法（AA）的“证明与推理”章节中，偶尔也出现在离散数学选修部分。它被精心设计为数学归纳法的第一套练习题，往往从非常简单的求和恒等式开始，逐步过渡到整除性和不等式证明。编号“B.1”表明这是一项基石练习——在深入更抽象的证明之前必须掌握的基础训练。
The exercise often embraces problems such as proving that the sum of the first n positive integers is n(n+1)/2, or that 7ⁿ − 1 is divisible by 6 for all positive integers n. These may seem modest, but they encode the entire logical architecture of induction.
这套练习通常包含这样的问题：证明前 n 个正整数的和为 n(n+1)/2，或证明对所有正整数 n，7ⁿ − 1 能被 6 整除。这些问题看似简单，却蕴含了归纳法的全部逻辑架构。
2. The Principle of Mathematical Induction | 数学归纳法原理
Mathematical induction is not an empirical guessing game; it is a deductive proof technique. The principle states that if a statement P(n) satisfies two conditions — (i) P(1) is true, and (ii) whenever P(k) is true for some positive integer k, P(k+1) is also true — then P(n) is true for all positive integers n. This two-step engine guarantees infinite coverage from a finite amount of work.
数学归纳法不是一种经验性的猜测游戏，而是一种演绎证明技术。其原理是：如果一个命题 P(n) 满足两个条件——(i) P(1) 为真，且 (ii) 只要对某个正整数 k，P(k) 为真，则 P(k+1) 也为真——那么 P(n) 对所有正整数 n 都成立。这种两步引擎用有限的工作量确保了无限覆盖。
Think of it like falling dominoes: if the first domino falls (base case), and every domino knocks over the next one (inductive step), then all dominoes will eventually fall. This analogy is helpful but must be treated with care because the logical step requires a precise algebraic manipulation, not physical force.
可以把它想象成倒下的多米诺骨牌：如果第一张骨牌倒下（基础情形），且每一张骨牌都会推倒下一张（归纳步骤），那么所有骨牌最终都会倒下。这个类比很有帮助，但需要谨慎对待，因为逻辑步骤需要精确的代数操作，而非物理力量。
3. Base Case Verification | 基础情形的验证
[n(n+1)/2]², the base case becomes LHS = 1³ = 1, RHS = (1×2/2)² = 1, which confirms P(1).
基础情形，通常是 n = 1，是证明的锚点。在练习 B.1 中，你经常需要证明给定的命题对最小的允许整数成立。对于求和恒等式如 ∑ᵢ₌₁ⁿ i³ = [n(n+1)/2]²，基础情形变为 LHS = 1³ = 1，RHS = (1×2/2)² = 1，这就确认了 P(1)。
n the domain is natural numbers including zero. Always read the problem carefully because an incorrect base case invalidates the entire proof, even if the algebra later is flawless.
有些练习要求验证 n = 0 或 n = 2，特别是当命题包含 n ≥ 2 的条件或定义域包含零的自然数时。一定要仔细读题，因为错误的基础情形会使整个证明失效，即使后面的代数操作完美无瑕。
4. Inductive Hypothesis | 归纳假设
of knowledge but a strategic tool. For example, you might assume that ∑ᵢ₌₁ᵏ (2i − 1) = k².
在基础情形之后，你假设命题 P(k) 对某个任意的正整数 k 为真。这称为归纳假设。在练习 B.1 的问题中，这一假设不是一种知识断言，而是一个策略工具。例如，你可能假设 ∑ᵢ₌₁ᵏ (2i − 1) = k²。
ny students blur the distinction, leading to circular reasoning. A crisp statement such as 'Assume that for some k ≥ 1, 32k − 1 is divisible by 8' sets the stage for the algebraic manipulation to come.
清晰地写下假设并将其与基础情形区分开来至关重要。许多学生混淆了这种区别，导致循环推理。一句干脆的陈述，如“假设对某个 k ≥ 1，32k − 1 能被 8 整除”，为接下来的代数操作搭建了舞台。
5. Inductive Step | 归纳步骤
Replacing the sum with the hypothesis k² gives k² + 2k + 1 = (k+1)², completing the step.
这是练习 B.1 的核心，也是最费力的部分。你必须证明 P(k+1) 能从 P(k) 推出。假设你需要证明 ∑ᵢ₌₁ᵏ⁺¹ (2i − 1) = (k+1)²。你会写出 LHS = ∑ᵢ₌₁ᵏ (2i − 1) + [2(k+1) − 1]。用归纳假设 k² 替换求和部分，得到 k² + 2k + 1 = (k+1)²，从而完成这一步骤。
. This rewriting skill is sharpened through the repeated practice offered by Exercise B.1.
在整除性证明中，归纳步骤通常涉及巧妙的改写。例如，要证明 7ᵏ⁺¹ − 1 是 6 的倍数，利用假设 7ᵏ − 1 = 6m 后，可写 7ᵏ⁺¹ − 1 = 7·7ᵏ − 1 = 7(6m + 1) − 1。展开得到 42m + 6 = 6(7m + 1)，显然能被 6 整除。这种改写技巧正是通过练习 B.1 的反复训练得以磨练的。
6. Common Pitfalls and How to Avoid Them | 常见错误与避免方法
One frequent mistake is forgetting to explicitly state the conclusion. After the inductive step, you must write 'Thus P(k+1) holds whenever P(k) is true. By the principle of mathematical induction, P(n) is true for all positive integers n.' Omitting this final wrap-up loses marks even if the algebra is correct.
一个常见错误是忘记明确陈述结论。在归纳步骤之后，你必须写下：“因此，只要 P(k) 为真，P(k+1) 就成立。根据数学归纳法原理，P(n) 对所有正整数 n 都成立。”即使代数运算正确，省略这一最后收尾也会丢分。
Another pitfall is manipulating the wrong side of the equation. In proving identities, always start with one side of P(k+1) and transform it using the hypothesis to reach the other side. Avoid starting from the equality you want to prove; that leads to invalid 'proofs' that assume the result. Exercise B.1 trains you to work rigorously in a forward direction.
另一个陷阱是弄错等式操作的方向。在证明恒等式时，总是从 P(k+1) 的一侧出发，利用归纳假设变换它从而到达另一侧。避免从你想证明的等式开始；那样会导致假设结果的无效“证明”。练习 B.1 会训练你严谨地正向推导。
7. Example 1: Sum of First n Natural Numbers | 示例 1：前 n 个自然数的和
+2)/2. This matches the RHS formula for n = k+1. Conclusion: the statement holds for all n ∈ ℕ.
证明 1 + 2 + 3 + ... + n = n(n+1)/2。基础情形(n=1)：LHS = 1，RHS = 1×2/2 = 1。假设 n = k 时成立：1 + ... + k = k(k+1)/2。则对于 n = k+1，LHS = (1+...+k) + (k+1) = k(k+1)/2 + (k+1)。提取因式 (k+1)：(k+1)(k/2 + 1) = (k+1)((k+2)/2) = (k+1)(k+2)/2。这与 n = k+1 时的 RHS 公式一致。结论：该陈述对所有 n ∈ ℕ 成立。
∑ᵢ₌₁ⁿ i = ½ n(n+1)
8. Example 2: Proving Divisibility | 示例 2：证明整除性
Show that 32n − 1 is divisible by 8 for all n ≥ 1. Base case n=1: 3² − 1 = 8, which is 8×1. Assume 32k − 1 = 8m. For n=k+1, 32k+2 − 1 = 9·32k − 1. Rewrite 9·32k es 72m + 9 − 1 = 72m + 8 = 8(9m + 1), which is a multiple of 8. The induction is complete.
证明对所有 n ≥ 1，32n − 1 能被 8 整除。基础情形 n=1：3² − 1 = 8，即为 8×1。假设 32k − 1 = 8m。对于 n=k+1，32k+2 − 1 = 9·32k − 1。将 9·32k 改写为 9(8m+1) = 72m + 9，于是表达式变为 72m + 9 − 1 = 72m + 8 = 8(9m + 1)，它是 8 的倍数。归纳完成。
此类问题在练习 B.1 中频繁出现，因为它能很好地衡量学生处理指数运算和因式分解的能力。关键的洞察在于从指数中分离出一个因子，并策略性地应用归纳假设。
9. Example 3: Inequality Proof | 示例 3：不等式证明
(k−1)² − 2. For k ≥ 5, (k−1)² − 2 ≥ 16 − 2 = 14 > 0, so 2k² > (k+1)². Hence 2ᵏ⁺¹ > (k+1)².
证明当 n ≥ 5 时，2ⁿ > n²。基础情形 n=5：2⁵ = 32，5² = 25，故 32 > 25 成立。假设对某个 k ≥ 5，2ᵏ > k²。需证 2ᵏ⁺¹ > (k+1)²。注意到 2ᵏ⁺¹ = 2·2ᵏ > 2k²（根据假设）。比较 2k² 与 (k+1)²：2k² − (k+1)² = 2k² − (k² + 2k + 1) = k² − 2k − 1 = (k−1)² − 2。对于 k ≥ 5，(k−1)² − 2 ≥ 16 − 2 = 14 > 0，因此 2k² > (k+1)²。从而 2ᵏ⁺¹ > (k+1)²。
不等式归纳往往需要一个额外的辅助不等式。练习 B.1 中这类问题教会你如何寻找桥梁，比如这里的 2k² > (k+1)²，这正是让证明运转起来的关键。
10. Strong Induction and Variations | 强归纳法与变体
Although standard mathematical induction dominates Exercise B.1, you may encounter problems that require strong induction, where you assume P(1), P(2), ..., P(k) are all true to prove P(k+1). This is typical in sequences defined by recurrence, such as proving that the Fibonacci numbers satisfy a certain identity. In IB, these often appear in slightly later exercises, but a well-designed 'B.1' can include a gentle introduction.
虽然标准数学归纳法在练习 B.1 中占主导地位，但你可能会遇到需要强归纳法的问题，即假设 P(1), P(2), ..., P(k) 都成立来证明 P(k+1)。这在由递推关系定义的序列中很典型，例如证明斐波那契数满足某个恒等式。在 IB 中，这些通常出现在稍后的练习中，但设计良好的“B.1”可以包含温和的引入。
uld need to use the truth for two previous indices, not just k. Recognizing when a proof requires this stronger assumption is a sophistication that Exercise B.1 begins to nurture.
例如，给定 a₁ = 1，a₂ = 2，且 aₙ = aₙ₋₁ + aₙ₋₂，要证明 aₙ < 2ⁿ，你就需要使用前两个下标的真值，而不只是 k。识别出何时需要这种更强的假设，正是练习 B.1 开始培养的精密思维。
11. Tips for IB Exam Success | IB 考试成功技巧
When sitting an IB exam, present your induction proof with crystal clarity. Label 'Base case', 'Inductive hypothesis', and 'Inductive step' explicitly. Use correct notation: ℕ, ℤ⁺, ∑, ⇒ ners look for rigorous structure; a chaotic layout can obscure a perfectly valid argument.
在参加 IB 考试时，要以极其清晰的方式呈现你的归纳证明。明确标注“基础情形”“归纳假设”和“归纳步骤”。使用正确的记号：ℕ、ℤ⁺、∑、⇒，并对齐你的等式。考官看重严谨的结构；混乱的排版可能会掩盖一个完全有效的论证。
Also, when proving divisibility, always conclude by stating the factor. For instance, 'Thus 5ⁿ − 1 = 4q, therefore divisible by 4.' or is not obvious, factor it out explicitly. And never skip the final induction conclusion — it is an essential part of the proof framework.
此外，在证明整除性时，一定要通过指出因式来作结。例如，“因此 5ⁿ − 1 = 4q，故能被 4 整除。”当因式不明显时，要明确地将其提取出来。而且绝不要省略最后的归纳结论——这是证明框架中必不可少的部分。
12. Summary: Making Exercise B.1 Your Launchpad | 总结：让练习 B.1 成为你的跳板
Exercise B.1 is not just a list of problems; it is a carefully sequenced training ground for logical reasoning. Mastering its contents means you can handle the base case confidently, use the inductive hypothesis with precision, and manipulate algebra to bridge from k to k+1. These skills transcend the exercise and become the backbone of higher-level proof writing in topics like complex numbers, matrices, and further calculus.
练习 B.1 不仅仅是一份习题列表；它是一个精心排序的逻辑推理训练场。掌握其内容意味着你能自信地处理基础情形，精准地使用归纳假设，并通过代数操作从 k 过渡到 k+1。这些技能超越了练习本身，成为复数、矩阵和进阶微积分等主题中更高层次证明写作的支柱。
Revisit the exercise routinely, not just to solve, but to deconstruct the reasoning. Each time, ask yourself: why did this rewriting work? How could the base case have been different? Soon you will develop an instinct for induction that makes any B.1-style question feel like a familiar friend.
定期重温这套练习，不只是去解题，而是去解构其中的推理。每次问自己：这个改写为什么有效？基础情形可能会有何不同？很快你就会发展出对归纳法的直觉，让任何 B.1 风格的问题都变得像一位熟悉的老朋友。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图