📚 Investigation 1 - Sequences, Series, and Induction | 探究1 - 序列、级数与数学归纳法
This investigation explores the essential concepts of sequences and series, with particular emphasis on arithmetic and geometric progressions. It examines methods for summing both finite and infinite series, and establishes mathematical induction as a rigorous technique to prove formulas, inequalities, and patterns that can be observed in sequences. By linking algebraic manipulation with logical reasoning, the article demonstrates how induction transforms empirical guessing into formal mathematical truth.
本探究围绕序列与级数的核心概念展开，重点覆盖等差数列与等比数列。文章将研究有限和无穷级数的求和方法，并将数学归纳法确立为一种严格的证明技术，用以验证序列中观察到的公式、不等式和模式。通过把代数运算与逻辑推理相结合，本文展示了归纳法如何将经验性的猜测转变为正式的数学真理。
1. Understanding Sequences and Series | 理解序列与级数
uences and series allows us to model growth, compound interest, and many natural patterns.
序列是一组有序的数字列表，可以通过第 n 项的显式公式或递推关系来定义。例如，偶数序列 2, 4, 6, 8, ... 可以写作 uₙ = 2n。级数是序列各项的和，常记为 Sₙ = u₁ + u₂ + ... + uₙ。研究序列与级数有助于我们对增长、复利以及许多自然模式进行建模。
In IB Mathematics, we distinguish between finite sequences, which have a last term, and infinite sequences, which continue indefinitely. The behaviour of infinite sequences leads to the concept of limits and convergence, which is particularly relevant when we sum infinitely many terms.
在 IB 数学中，我们区分有最后一项的有限序列和无限延续的无穷序列。无穷序列的性态引出了极限与收敛性的概念，这在求无穷多项之和时显得尤为重要。
2. Arithmetic Sequences: Patterns and Formulas | 等差数列：模式与公式
his linear formula describes a steady increase or decrease, making arithmetic sequences ideal for representing simple linear growth, such as weekly savings or the number of seats in successive rows of an auditorium.
等差数列的特点是相邻两项之差恒为常数 d。若首项为 u₁，则第 n 项为 uₙ = u₁ + (n − 1)d。这一线性公式描述了一种稳定的增减，因此等差数列非常适合表示简单的线性增长，例如每周储蓄或礼堂各排座位数。
= 5 + 19 × 4 = 81. Recognising the common difference enables quick generation of any term.
序列 5, 9, 13, 17, ... 的公差 d = 4，首项 u₁ = 5，因此第 20 项为 u₂₀ = 5 + 19 × 4 = 81。识别出公差便能快速生成任意一项。
3. Summing an Arithmetic Series | 等差数列求和
The sum of the first n terms of an arithmetic sequence, Sₙ, can be found by pairing terms from the beginning and the end. Each pair has the same total (u₁ + uₙ), and there are n/2 such pairs. Therefore,
Sₙ = n/2 (u₁ + uₙ) = n/2 [2u₁ + (n − 1)d].
等差数列前 n 项和 Sₙ 可以通过将首尾项配对来求得。每一对之和均为 (u₁ + uₙ)，共有 n/2 对。因此，
Sₙ = n/2 (u₁ + uₙ) = n/2 [2u₁ + (n − 1)d]。
oundational for problems involving total distance, total earnings, or accumulated savings.
对于级数 3 + 7 + 11 + ...（d = 4, u₁ = 3），前 15 项之和为 S₁₅ = 15/2 [2×3 + 14×4] = 15/2 (6 + 56) = 15/2 × 62 = 465。该公式是解决总距离、总收入或累计储蓄问题的基础。
4. Geometric Sequences and Their Sums | 等比数列及其求和
nces model exponential growth or decay, such as population growth, radioactive decay, or compound interest. The sum of the first n terms, when r ≠ 1, is obtained by subtracting rSₙ from Sₙ:
Sₙ = u₁ (1 − rⁿ) / (1 − r).
等比数列的相邻两项之比恒为常数 r。第 n 项为 uₙ = u₁ rⁿ⁻¹。这类数列可以对指数增长或衰减进行建模，例如人口增长、放射性衰变或复利计算。当 r ≠ 1 时，前 n 项和可通过 Sₙ − rSₙ 的方法求得：
Sₙ = u₁ (1 − rⁿ) / (1 − r)。
728. Geometric series often appear in financial mathematics when calculating the future value of annuities.
对于序列 2, 6, 18, 54, ...（u₁ = 2, r = 3），前 6 项之和为 S₆ = 2(1 − 3⁶) / (1 − 3) = 2(1 − 729) / (−2) = 728。等比级数常出现在金融数学中，用于计算年金的终值。
5. Infinite Geometric Series and Convergence | 无穷等比级数与收敛性
When |r| < 1, the terms of a geometric sequence become arbitrarily small, and the infinite sum converges to a finite limit. The formula is:
S∞ = u₁ / (1 − r), for |r| < 1.
当 |r| < 1 时，等比数列的各项会变得任意小，无穷项之和收敛到一个有限值。其公式为：
S∞ = u₁ / (1 − r)，其中 |r| < 1。
erived by letting n approach infinity in the finite sum formula; since rⁿ → 0 as n → ∞ for |r| only a finite distance, and they form the basis of present value calculations in finance.
这一结果可通过在有限和公式中令 n 趋于无穷来推导；当 |r| < 1 时，n → ∞ 时 rⁿ → 0，因此 (1 − rⁿ) 趋向于 1。此类收敛级数解释了为何一个无限反弹的球体仅覆盖有限距离，同时也构成了金融中现值计算的基础。
6. Introducing Mathematical Induction | 引入数学归纳法
P(k + 1) must also be true. If both steps succeed, the principle of mathematical induction guarantees that P(n) is true for all n ≥ k.
数学归纳法是一种证明技术，用于确立命题 P(n) 对所有自然数 n ≥ k 成立。它包含两个基本步骤：基础情形，验证 P(k) 为真；以及归纳递推，假设 P(k) 对某个任意 n = k 成立，然后证明 P(k + 1) 也必然成立。若两步均完成，数学归纳法原理便保证了 P(n) 对所有 n ≥ k 成立。
Induction is particularly powerful for proving formulas involving sums, inequalities, and divisibility that arise from sequences. It bridges the gap between observing a pattern for a few terms and proving that the pattern persists forever.
归纳法对于证明涉及序列的求和、不等式和整除性公式尤为有力。它弥合了为少数几项观察出模式与证明该模式恒久成立之间的鸿沟。
7. Proving the Arithmetic Sum Formula | 证明等差数列求和公式
Inductive hypothesis: assume the formula holds for n = k, i.e., Sₖ = k/2 [2u₁ + (k − 1)d].
我们通过归纳法证明 Sₙ = n/2 [2u₁ + (n − 1)d]。基础情形 n = 1：S₁ = 1/2 [2u₁ + 0] = u₁，与第一项之和相符。归纳假设：设公式对 n = k 成立，即 Sₖ = k/2 [2u₁ + (k − 1)d]。
1, we write Sₖ₊₁ = Sₖ + uₖ₊₁. Using the hypothesis and the fact uₖ₊₁ = u₁ + kd, we obtain:
Sₖ₊₁ = k/2 [2u₁ + (k − 1)d] + (u₁ + kd).
ch is exactly the formula for n = k + 1. Hence, by induction, the formula holds for all n.
对于 n = k + 1，我们有 Sₖ₊₁ = Sₖ + uₖ₊₁。利用归纳假设以及 uₖ₊₁ = u₁ + kd，可得：
Sₖ₊₁ = k/2 [2u₁ + (k − 1)d] + (u₁ + kd)。
化简得 /2) [2ku₁ + k(k − 1)d + 2u₁ + 2kd] = (1/2) [2u₁(k + 1) + k(k + 1)d] = (k + 1)/2 [2u₁ + kd]，这正是 n = k + 1 时的公式。因此，由归纳法原理，公式对所有 n 成立。
8. Proving the Geometric Sum Formula | 证明等比数列求和公式
(1 − r)/(1 − r) = u₁, which is true. Inductive hypothesis: assume Sₖ = u₁(1 − rᵏ)/(1 − r).
等比数列求和公式 Sₙ = u₁(1 − rⁿ)/(1 − r)（r ≠ 1）也可用归纳法证明。基础情形 n = 1：S₁ = u₁(1 − r)/(1 − r) = u₁，成立。归纳假设：设 Sₖ = u₁(1 − rᵏ)/(1 − r)。
Then for n = k + 1, Sₖ₊₁ = Sₖ + uₖ₊₁. Since uₖ₊₁ = u₁ rᵏ, we substitute:
₊₁ = u₁(1 − rᵏ)/(1 − r) + u₁ rᵏ = u₁[(1 − rᵏ) + rᵏ(1 − r)]/(1 − r) = u₁(1 − rᵏ⁺¹)/(1 − r).
hus, the proof is complete. Induction provides an elegant verification of this important summation identity without relying on the trick of expanding and cancelling terms.
那么对于 n = k + 1，Sₖ₊₁ = Sₖ + uₖ₊₁。因为 uₖ₊₁ = u₁ rᵏ，代入得：
ₖ₊₁ = u₁(1 − rᵏ)/(1 − r) + u₁ rᵏ = u₁[(1 − rᵏ) + rᵏ(1 − r)]/(1 − r) = u₁(1 − rᵏ⁺¹)/(1 − r)。
这与 n = k + 1 的公式吻合。由此，证明完成。归纳法为这个重要的求和恒等式提供了优美的验证，而无需依赖展开相消的技巧。
9. Induction in Recursive Sequences: Fibonacci | 递归序列中的归纳法：斐波那契数列
of the first n Fibonacci numbers equals Fₙ₊₂ − 1. That is, F₁ + F₂ + ... + Fₙ = Fₙ₊₂ − 1.
斐波那契数列由递推定义：F₁ = 1，F₂ = 1，且对于 n ≥ 3，Fₙ = Fₙ₋₁ + Fₙ₋₂。归纳法可用于证明其性质，例如前 n 个斐波那契数之和等于 Fₙ₊₂ − 1，即 F₁ + F₂ + ... + Fₙ = Fₙ₊₂ − 1。
currence, Fₖ₊₂ + Fₖ₊₁ = Fₖ₊₃, so sum = Fₖ₊₃ − 1, which matches F₍ₖ₊₁₎₊₂ − 1. Hence proven.
基础：n = 1，F₁ = 1，而 F₃ − 1 = 2 − 1 = 1，成立。归纳递推：假设对 n = k 成立，即和为 Fₖ₊₂ − 1。对于 n = k + 1，和变为 (Fₖ₊₂ − 1) + Fₖ₊₁。利用递推关系 Fₖ₊₂ + Fₖ₊₁ = Fₖ₊₃，得到和为 Fₖ₊₃ − 1，与 F₍ₖ₊₁₎₊₂ − 1 一致。得证。
This shows that induction works seamlessly with recursively defined sequences, allowing us to establish identities that would be cumbersome to prove by direct manipulation.
这表明归纳法能够与递归定义的序列无缝配合，使我们得以建立那些通过直接运算难以证明的恒等式。
10. Applying Induction to Inequalities | 归纳法在不等式中的应用
ion is frequently used to prove inequalities involving natural numbers. Consider Bernoulli's inequality: (1 + x)ⁿ ≥ 1 + nx for x > −1 and n ∈ ℕ (1 + x)ᵏ ≥ 1 + kx. Multiply both sides by (1 + x), which is positive if x > −1, to obtain
(1 + x)ᵏ⁺¹ ≥ (1 + kx)(1 + x) = 1 + (k + 1)x + kx² ≥ 1 + (k + 1)x.
Thus the inequality holds for n = k + 1, completing the inductive proof.
归纳法常被用于证明涉及自然数的不等式。考虑伯努利不等式：对于 x > −1 且 n ∈ ℕ，有 (1 + x)ⁿ ≥ 1 + nx。基础情形 n = 1 是等式。假设对 n = k 成立：(1 + x)ᵏ ≥ 1 + kx。两边同乘正数 (1 + x)（因为 x > −1），得到
(1 + x)ᵏ⁺¹ ≥ (1 + kx)(1 + x) = 1 + (k + 1)x + kx² ≥ 1 + (k + 1)x。
因此不等式对 n = k + 1 成立，完成了归纳证明。
Such arguments highlight the importance of manipulatively linking the (k + 1)-case back to the k-case, a technique that is central to many IB-style proof questions.
此类论证强调了将 (k + 1) 情形与 k 情形进行代数关联的重要性，这一技巧是诸多 IB 风格证明题的核心。
11. The Binomial Theorem via Induction | 用归纳法证明二项式定理
omial theorem states that for any natural number n, (a + b)ⁿ = Σ (from r = 0 to n) ⁿCᵣ aⁿ⁻ʳ bʳ, where ⁿCᵣ = n! / [r! (n − r)! = a + b, which matches the sum. Inductive hypothesis: assume the theorem holds for n = k.
二项式定理指出，对任何自然数 n，有 (a + b)ⁿ = Σ（r = 0 到 n）ⁿCᵣ aⁿ⁻ʳ bʳ，其中 ⁿCᵣ = n! / [r! (n − r)!]。归纳法可对此进行证明：基础情形 n = 1 得 (a + b)¹ = a + b，与求和式一致。归纳假设：假定定理对 n = k 成立。
the hypothesis, expand (a + b)ᵏ, multiply by (a + b), and collect like terms. Using Pascal's identity ⁿCᵣ₋₁ + ⁿCᵣ = ⁿ⁺¹Cᵣ, the coefficient of aᵏ⁺¹⁻ʳ bʳ + 1. This elegant application of induction unifies combinatorial and algebraic reasoning.
那么对于 n = k + 1，写出 (a + b)ᵏ⁺¹ = (a + b)ᵏ (a + b)。由归纳假设展开 (a + b)ᵏ，乘以 (a + b) 并合并同类项。利用帕斯卡恒等式 ⁿCᵣ₋₁ + ⁿCᵣ = ⁿ⁺¹Cᵣ，可得 aᵏ⁺¹⁻ʳ bʳ 的系数为 ᵏ⁺¹Cᵣ。因此展开式符合要求，定理延拓至 n = k + 1。这一归纳法应用巧妙地将组合推理与代数推理统一起来。
12. Extension: Strong Induction and Further Applications | 拓展：强归纳法及其应用
arlier cases. For example, proving that every integer greater than 1 is either prime or a product of primes uses strong induction, and many recurrence relations with more than one preceding term require strong induction to establish closed forms.
强归纳法与普通归纳法的不同之处在于：归纳假设假定命题对所有直到 k 的数均成立，而不仅仅对 k 成立。这在 n = k + 1 的真实性依赖于多个较早情形时尤为有用。例如，证明每个大于 1 的整数要么是素数要么是素数之积就使用了强归纳法，而许多含有多项前驱动项的递推关系也需要强归纳法来建立闭式。
In the context of sequences, strong induction can prove that the Fibonacci sequence's Binet formula Fₙ = [φⁿ − (−φ)⁻ⁿ]/√5 holds for all n, and it verifies properties of sequences defined by second‑order linear recurrences. Exploring these advanced proof structures deepens our appreciation of how induction underpins an entire edifice of mathematical reasoning built on sequences and series.
在序列的语境中，强归纳法可以证明斐波那契数列的比内公式 Fₙ = [φⁿ − (−φ)⁻ⁿ]/√5 对所有 n 成立，它还能验证由二阶线性递推所定义的序列的性质。探究这些高级证明结构能加深我们对归纳法如何支撑起整个建立在序列与级数之上的数学推理体系的理解。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图