📚 The Binomial Theorem: An Alternative Proof | 二项式定理：一种替代证明
The binomial theorem is a cornerstone of algebra that expands expressions of the form (a + b)ⁿ into a sum of terms involving powers of a and b with binomial coefficients. In your IB Mathematics course, the standard proof relies on a combinatorial interpretation of choosing a certain number of a's and b's. However, another rigorous and insightful proof uses mathematical induction, demonstrating the theorem's validity through a different logical structure. This article presents that alternative inductive proof step by step, highlighting the key manipulations and the role of Pascal's identity.
二项式定理是代数的基石，它将 (a + b)ⁿ 形式的表达式展开为包含 a 和 b 的幂次与二项式系数乘积的求和。在你的 IB 数学课程中，标准证明依赖于选择一定数量 a 和 b 的组合解释。然而，另一种严谨且富有洞察力的证明使用数学归纳法，通过不同的逻辑结构展示定理的有效性。本文逐步呈现这种替代的归纳证明，突出关键操作和帕斯卡恒等式的作用。
1. Introducing the Binomial Theorem | 二项式定理简介
ive integer n, the binomial theorem states that for any real numbers a and b, (a + b)ⁿ = Σr=0n C(n, r) an−r br, where the binomial coefficient C(n, r) — also written as ⁿCᵣ or (n choose r) — equals n! / [r!(n−r)!]. These coefficients appear in Pascal's triangle and count the number of ways to choose r items from n.
对于正整数 n，二项式定理指出对任意实数 a 和 b，(a + b)ⁿ = Σr=0n C(n, r) an−r br，其中二项式系数 C(n, r) —— 也写作 ⁿCᵣ 或 “n 选 r” —— 等于 n! / [r!(n−r)!]。这些系数出现在帕斯卡三角形中，并计算从 n 个元素中选择 r 个元素的方法数。
2. The Standard Combinatorial Proof | 标准组合证明
The usual proof sees (a + b)ⁿ as the product of n identical factors (a + b)(a + b)⋯(a + b). To obtain the term an−r br, you must choose b from exactly r of the factors and a from the remaining n−r factors. The number of such choices is C(n, r), giving the desired coefficient. This argument is elegant and firmly rooted in counting principles.
通常的证明将 (a + b)ⁿ 视为 n 个相同因式 (a + b)(a + b)⋯(a + b) 的乘积。为了得到 an−r br 这一项，你必须恰从其中的 r 个因式中选 b，从其余 n−r 个因式中选 a。此类选法的数目是 C(n, r)，从而给出所需系数。这一论证十分精妙，且深深植根于计数原理。
3. Why Seek an Alternative Proof? | 为何寻求替代证明？
While the combinatorial proof is the standard in IB Mathematics: analysis and approaches, exploring an inductive proof deepens our understanding of proof techniques and highlights connections with sequences, series, and algebraic manipulation. Mathematical induction is a foundational tool in the IB syllabus, and applying it to the binomial theorem showcases its power in verifying algebraic identities.
虽然组合证明是 IB 数学：分析与方法中的标准，但探索归纳证明可以加深我们对证明技巧的理解，并凸显与数列、级数以及代数运算的联系。数学归纳法是 IB 课程大纲中的一个基础工具，将其应用于二项式定理可以展示它在验证代数恒等式方面的威力。
4. The Principle of Mathematical Induction | 数学归纳法原理
Mathematical induction proves a statement P(n) for all positive integers n by checking the base case P(1) and then showing that if P(k) is true (the inductive hypothesis), then P(k+1) must also be true. The domino effect then guarantees P(n) for every n. This method is particularly well-suited to sum formulas and identities with factorial-based coefficients.
数学归纳法通过验证基础情况 P(1)，然后证明若 P(k) 为真（归纳假设），则 P(k+1) 必然也为真，从而证明对全体正整数 n 命题 P(n) 成立。多米诺效应随之确保对每个 n 成立 P(n)。这一方法特别适用于求和公式以及基于阶乘系数的恒等式。
5. Stating the Theorem as an Inductive Proposition | 将定理表述为归纳命题
We take P(n) as the statement: For any real numbers a and b, (a + b)ⁿ = Σr=0n C(n, r) an−r br. The goal is to prove P(n) for all n ∈ ℕ lds for n = 0 if we define C(0,0)=1, starting at n = 1 suffices for the standard IB scope.
我们将 P(n) 取作命题：对任意实数 a 和 b，(a + b)ⁿ = Σr=0n C(n, r) an−r br。目标是对所有 n ∈ ℕ，n ≥ 1 证明 P(n)。尽管若定义 C(0,0)=1 定理在 n=0 时也成立，但从 n=1 开始已满足标准 IB 范围。
6. Base Case: n = 1 | 基础情况：n = 1
For n = 1, the left-hand side is simply (a + b)¹ = a + b. The right-hand side gives Σr=01 C(1, r) a1−r br = C(1,0) a¹ b⁰ + C(1,1) a⁰ b¹ = 1·a + 1·b = a + b. Thus P(1) holds true.
当 n = 1 时，左边简化为 (a + b)¹ = a + b。右边给出 Σr=01 C(1, r) a1−r br = C(1,0)a¹b⁰ + C(1,1)a⁰b¹ = 1·a + 1·b = a + b。因此 P(1) 成立。
7. Inductive Hypothesis | 归纳假设
sume that P(k) is true for some arbitrary positive integer k ≥ 1. That is, suppose (a + b)k = Σr=0k C(k, r) ak−r br. This assumption will be used to prove the statement for n = k + 1.
假设对某个任意正整数 k ≥ 1，P(k) 为真。即假设 (a + b)k = Σr=0k C(k, r) ak−r br。这一假设将被用于证明 n = k + 1 的命题。
8. Inductive Step: Multiplying by (a + b) | 归纳步骤：乘以 (a + b)
We consider (a + b)k+1 = (a + b)(a + b)k. Using the inductive hypothesis, this becomes (a + b) Σr=0k C(k, r) ak−r br. Distribute a and b across the sum.
我们考虑 (a + b)k+1 = (a + b)(a + b)k。利用归纳假设，上式变为 (a + b) Σr=0k C(k, r) ak−r br。将 a 和 b 分配到求和式中。
Multiplying by a shifts the exponent of a: Σr=0k C(k, r) ak+1−r br. Multiplying by b gives Σr=0k C(k, r) ak−r br+1. So we have the sum of two series.
乘以 a 会使 a 的指数移位：Σr=0k C(k, r) ak+1−r br。乘以 b 则给出 Σr=0k C(k, r) ak−r br+1。于是我们得到两个级数之和。
combine them, re-index the second series by setting s = r + 1, so r = s − 1. It becomes Σs=1k+1 C(k, s−1) ak+1−s bs.
为了合并它们，对第二个级数重新索引：令 s = r + 1，则 r = s − 1。级数变为 Σs=1k+1 C(k, s−1) ak+1−s bs。
first sum can be written with index r from 0 to k, but we can split into r=0 term and r=1… terms. Alternatively, add the missing boundary terms: for r=0 the first sum gives C(k,0) ak+1 b⁰, and for r=k+1 the second sum gives C(k,k) a⁰ bk+1.
现在写出完整表达式，同时使第一个和也展示相同的幂次结构。第一个和可以表示为指标 r 从 0 到 k，但我们将其拆分为 r=0 项和 r=1…k 项。或者，加上缺失的边界项：对 r=0 第一个和给出 C(k,0) ak+1 b⁰，对 r=k+1 第二个和给出 C(k,k) a⁰ bk+1。
9. Grouping Like Terms and Using Pascal's Identity | 合并同类项且运用帕斯卡恒等式
The coefficient of ak+1−r br for 1 ≤ r ≤ k comes from the two contributing series: from the a‑multiplication we have C(k, r), and from the re-indexed b‑multiplication we have C(k, r−1). Their sum is C(k, r) + C(k, r−1).
对于 1 ≤ r ≤ k，ak+1−r br 的系数来自两个贡献的级数：来自 a 相乘部分我们得到 C(k, r)，来自重新索引后的 b 相乘部分我们得到 C(k, r−1)。它们的和为 C(k, r) + C(k, r−1)。
Pascal's rule (or Pascal' ental property of binomial coefficients can be verified algebraically using the factorial definition.
帕斯卡法则（或帕斯卡恒等式）恰好指出 C(k, r−1) + C(k, r) = C(k+1, r)。二项式系数的这一基本性质可以使用阶乘定义进行代数验证。
becomes C(k+1, r). The edge terms are C(k,0) = 1 = C(k+1,0) and C(k,k) = 1 = C(k+1, k+1).
因此，对于内部项 1 ≤ r ≤ k，系数变为 C(k+1, r)。边缘项 C(k,0) = 1 = C(k+1,0) 且 C(k,k) = 1 = C(k+1, k+1)。
10. Completing the Inductive Argument | 完成归纳论证
Collecting all terms, we obtain (a + b)k+1 = C(k+1,0) ak+1 b⁰ + Σr=1k C(k+1, r) ak+1−r br + C(k+1, k+1) a⁰ bk+1, which is precisely Σr=0k+1 C(k+1, r) ak+1−r br. Thus P(k+1) is true whenever P(k) is true.
合并所有项，我们得到 (a + b)k+1 = C(k+1,0) ak+1 b⁰ + Σr=1k C(k+1, r) ak+1−r br + C(k+1, k+1) a⁰ bk+1，这恰好是 Σr=0k+1 C(k+1, r) ak+1−r br。因此只要 P(k) 为真，P(k+1) 就为真。
Since P(1) holds and P(k) ⇒ P(k+1), by the principle of mathematical induction P(n) is true for all positive integers n, completing the alternative proof of the binomial theorem.
由于 P(1) 成立且 P(k) ⇒ P(k+1)，根据数学归纳法原理，P(n) 对所有正整数 n 成立，从而完成二项式定理的替代证明。
11. Comparing Induction with the Combinatorial Proof | 归纳法与组合证明之比较
The combinatorial proof offers an immediate conceptual understanding: each coefficient counts pathways of choice. The inductive proof, while more algebraic, reinforces how identities like Pascal's rule emerge naturally from the recursive structure. Both methods satisfy the rigour expected in IB examinations, but mastering both enriches your mathematical toolkit and prepares you for more complex proofs in further mathematics.
组合证明提供了直接的概念理解：每个系数计算的是选择的路径数。而归纳证明虽然更具代数性质，却强化了像帕斯卡法则这样的恒等式如何从递归结构中自然产生。两种方法都满足 IB 考试所期望的严谨性，但掌握两者可以丰富你的数学工具包，并为进一步数学中更复杂的证明做好准备。
The inductive proof also highlights a broader theme: expansions of (a + b)ⁿ are intimately linked to the additive recurrence of binomial coefficients. When you later explore the binomial series for rational exponents, the pattern of coefficients re-emerges in a more generalised form.
归纳证明还突显出一个更广泛的主题：(a + b)ⁿ 的展开与二项式系数的加法递推紧密相关。当你随后探究有理指数情形的二项式级数时，系数的模式将以更一般化的形式重新出现。
12. Extensions and Final Thoughts | 扩展与最终思考
Although this proof assumes n is a positive integer, the binomial coefficient notation and properties can be extended to real n using generalised binomial coefficients, which leads to the infinite binomial series. The inductive framework, however, only works for natural exponents and thus forms a vital bridge between discrete counting and algebraic manipulation.
尽管该证明假定 n 为正整数，但二项式系数符号及性质可使用广义二项式系数推广到实数 n，从而引出无穷二项式级数。然而，归纳框架只对自然指数有效，从而构成了离散计数与代数运算之间的重要桥梁。
As an IB learner, practising both proofs not only secures your understanding of the binomial theorem but also sharpens your ability to choose appropriate proof strategies in exams and internal assessments. The inductive approach, with its neat use of Pascal's rule, remains a favourite alternative in many textbooks.
作为 IB 学习者，练习两种证明不仅能巩固你对二项式定理的理解，还能提升你在考试和内部评估中选择恰当证明策略的能力。归纳法凭借其对帕斯卡法则的巧妙运用，始终是许多教材中备受青睐的替代方案。
Published by TutorHao | IB Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图