IB Mathematics: An Alternative Proof of the Binomial Theorem | IB数学：二项式定理的另类证明

📚 IB Mathematics: An Alternative Proof of the Binomial Theorem | IB数学：二项式定理的另类证明

The binomial theorem is one of the most familiar results in the IB Mathematics curriculum. It gives a compact way to expand powers of a binomial: (x + y)ⁿ. Most textbooks prove it by mathematical induction. That proof is elegant, but it does not always show why the binomial coefficients appear. This article presents an alternative proof based on counting. This combinatorial proof is more visual, more intuitive, and deeply connected to the meaning of “n choose k”.

二项式定理是 IB 数学课程中最熟悉的结果之一。它给出了展开二项式幂 (x + y)ⁿ 的简洁方法。大多数教材用数学归纳法证明，这种方法很优雅，却未必能展现二项式系数为什么会出现。本文介绍一种基于计数的另类证明。这种组合证明更直观、更形象，也与“n 选 k”的含义紧密相连。

1. The Formula to Prove | 要证明的公式

Let n be a non-negative integer, and let x and y be real numbers. The binomial theorem states that:

设 n 为非负整数，x 与 y 为实数。二项式定理断言：

(x + y)ⁿ = ∑ C(n,k) xᵏ yⁿ⁻ᵏ, k = 0, 1, …, n

where the binomial coefficient C(n,k) counts the number of ways to choose k objects from a set of n objects, and is defined by:

其中二项式系数 C(n,k) 表示从 n 个物体中选出 k 个物体的方式数，定义为：

C(n,k) = n! / (k!(n − k)!)

This formula is used constantly in expansion, probability, and series work. But where does it actually come from?

这个公式在展开、概率和级数中频繁使用。但它究竟从何而来？

2. The Standard Proof by Induction | 标准归纳证明简述

The usual proof of the binomial theorem uses mathematical induction. One assumes the result is true for n, then multiplies both sides by (x + y). By collecting the coefficient of xᵏyⁿ⁺¹⁻ᵏ and using Pascal’s identity, the result follows for n + 1.

二项式定理的常规证明使用数学归纳法。先假设结论对 n 成立，然后两边同乘 (x + y)。通过合并 xᵏyⁿ⁺¹⁻ᵏ 的系数并运用帕斯卡恒等式，即可推出 n + 1 的情形。

This proof is rigorous and short. However, it is algebraic in nature. Many students can follow the steps yet still wonder: why should the coefficient be exactly C(n,k)? The combinatorial proof answers that question directly.

这个证明严谨而简短。然而，它本质上是代数化的。许多学生能跟上步骤，却仍会疑惑：为什么系数恰好是 C(n,k)？组合证明能直接回答这个问题。

3. The Combinatorial Insight | 组合洞察

Write (x + y)ⁿ as a product of n identical factors:

把 (x + y)ⁿ 写成 n 个相同因式的乘积：

(x + y)ⁿ = (x + y)(x + y)⋯(x + y)

When we expand this product, every term is formed by choosing exactly one letter, either x or y, from each factor. Since there are n factors and 2 choices per factor, there are 2ⁿ raw terms before any like terms are collected.

展开这个乘积时，每一项都由从每个因式中恰好选择一个字母 x 或 y 得到。由于有 n 个因式，每个因式有 2 种选择，因此在合并同类项之前共有 2ⁿ 个原始项。

For example, when n = 2,

例如，当 n = 2 时，

(x + y)² = xx + xy + yx + yy

Here the term xy and the term yx are different raw terms. Only after collecting them do we see 2xy.

这里 xy 与 yx 是两个不同原始项。只有在合并后才会出现 2xy。

4. The Counting Argument | 计数论证

Now fix a particular value of k. A raw term will equal xᵏyⁿ⁻ᵏ exactly when we choose x from exactly k factors and y from the remaining n − k factors.

现在固定某个 k 值。当且仅当从恰好 k 个因式中选择 x，并从其余 n − k 个因式中选择 y 时，原始项才等于 xᵏyⁿ⁻ᵏ。

The number of ways to choose which k factors contribute an x is the number of k-element subsets of an n-element set. This number is exactly C(n,k). Therefore the coefficient of xᵏyⁿ⁻ᵏ must be C(n,k).

选择哪 k 个因式贡献 x 的方式数，就是 n 元集合中 k 元子集的个数。这个数目正是 C(n,k)。因此 xᵏyⁿ⁻ᵏ 的系数必然是 C(n,k)。

This is the entire alternative proof in one sentence: the coefficient counts choices, and the number of choices is the binomial coefficient.

整个另类证明可以用一句话概括：系数计数选择，而选择数就是二项式系数。

5. A Formal Step-by-Step Proof | 逐步形式化证明

We can arrange the argument as a clear sequence of steps.

我们可以把这个论证整理为清晰的步骤序列。

Expand the product (x + y)ⁿ without collecting like terms. There are 2ⁿ raw terms.

先展开 (x + y)ⁿ，但不合并同类项。共有 2ⁿ 个原始项。
Every raw term has the form xᵏyⁿ⁻ᵏ for some integer k satisfying 0 ≤ k ≤ n.

每一个原始项都具有 xᵏyⁿ⁻ᵏ 的形式，其中 k 是满足 0 ≤ k ≤ n 的整数。
For a fixed k, a raw term equals xᵏyⁿ⁻ᵏ precisely when the k selected factors are the ones that contribute x.

固定 k 时，原始项等于 xᵏyⁿ⁻ᵏ，当且仅当恰好选中的 k 个因式贡献 x。
The number of ways to choose those k factors is C(n,k).

选择这 k 个因式的方式数是 C(n,k)。
Therefore, after collecting like terms, the coefficient of xᵏyⁿ⁻ᵏ is C(n,k).

因此，合并同类项后，xᵏyⁿ⁻ᵏ 的系数是 C(n,k)。

Summing over all k gives exactly the binomial theorem.

对所有 k 求和，便得到二项式定理。

6. Example: n = 3 | 实例：n = 3

Let us see the counting proof in action for (x + y)³.

我们以 (x + y)³ 为例，看看计数证明如何运作。

k	Factors chosen for x	Term	Count
0	∅	y³	1
1	{1}, {2}, {3}	xy²	3
2	{1,2}, {1,3}, {2,3}	x²y	3
3	{1,2,3}	x³	1

Published by TutorHao | IB Mathematics Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）

IB Mathematics: An Alternative Proof of the Binomial Theorem | IB数学：二项式定理的另类证明