The Binomial Theorem: Proofs and Typical Applications | 二项式定理:证明与典型应用

📚 The Binomial Theorem: Proofs and Typical Applications | 二项式定理:证明与典型应用

The binomial theorem is one of the most elegant and widely used results in algebra. It provides a systematic way to expand powers of sums, such as (a + b)ⁿ, without performing repeated multiplication. This article presents two classical proofs of the theorem and explores its typical applications in IB Mathematics, from finding specific terms to proving identities.

二项式定理是代数中最优雅、应用最广泛的结果之一。它提供了一种系统展开和式幂次(如 (a + b)ⁿ)的方法,而无需进行重复乘法。本文将展示该定理的两种经典证明,并探讨其在 IB 数学中的典型应用,包括求特定项和证明恒等式。


1. Statement of the Binomial Theorem | 二项式定理的表述

For any positive integer n, the binomial theorem states that:

(a + b)ⁿ = Σₖ₌₀ⁿ C(n, k) aⁿ⁻ᵏ bᵏ

where C(n, k) = n! / (k!(n−k)!) is the binomial coefficient, also written as ⁿCₖ or (ⁿₖ). The sum runs from k = 0 to k = n, giving n + 1 terms in total.

对于任意正整数 n,二项式定理表述为:

(a + b)ⁿ = Σₖ₌₀ⁿ C(n, k) aⁿ⁻ᵏ bᵏ

其中 C(n, k) = n! / (k!(n−k)!) 是二项式系数,也写作 ⁿCₖ 或 (ⁿₖ)。求和从 k = 0 到 k = n,总共有 n + 1 项。


2. Combinatorial Interpretation | 组合解释

Before proving the theorem, it is helpful to understand the combinatorial meaning of each coefficient. The term aⁿ⁻ᵏ bᵏ arises when we choose b from exactly k of the n factors (a + b)(a + b)…(a + b), and choose a from the remaining n − k factors.

在证明定理之前,理解每个系数的组合意义很有帮助。项 aⁿ⁻ᵏ bᵏ 出现在我们从 n 个因子 (a + b)(a + b)…(a + b) 中恰好选择 k 个因子取 b,其余 n − k 个因子取 a 时。

The number of ways to choose which k factors contribute b is C(n, k). Hence the coefficient of aⁿ⁻ᵏ bᵏ is exactly C(n, k). This is the essence of the combinatorial proof.

选择哪 k 个因子贡献 b 的方式数为 C(n, k)。因此 aⁿ⁻ᵏ bᵏ 的系数恰好是 C(n, k)。这就是组合证明的本质。


3. Proof by Mathematical Induction | 数学归纳法证明

We prove the theorem for all positive integers n by induction. The base case n = 1 is immediate: (a + b)¹ = a + b = C(1,0)a¹b⁰ + C(1,1)a⁰b¹.

我们用数学归纳法对所有正整数 n 证明该定理。基础情况 n = 1 显然成立:(a + b)¹ = a + b = C(1,0)a¹b⁰ + C(1,1)a⁰b¹。

Assume the theorem holds for n = m. Then:

(a + b)ᵐ⁺¹ = (a + b)ᵐ(a + b) = (a + b) Σₖ₌₀ᵐ C(m, k) aᵐ⁻ᵏ bᵏ

Multiplying out and collecting terms with the same power of b, the coefficient of bᵏ comes from two sources: C(m, k−1) from the b-part and C(m, k) from the a-part. Using Pascal’s identity C(m, k−1) + C(m, k) = C(m+1, k), the theorem follows for n = m + 1.

假设定理对 n = m 成立。则:

(a + b)ᵐ⁺¹ = (a + b)ᵐ(a + b) = (a + b) Σₖ₌₀ᵐ C(m, k) aᵐ⁻ᵏ bᵏ

展开并合并 b 的同幂次项,bᵏ 的系数来自两部分:含 b 的部分贡献 C(m, k−1),含 a 的部分贡献 C(m, k)。利用帕斯卡恒等式 C(m, k−1) + C(m, k) = C(m+1, k),即可推出定理对 n = m + 1 成立。


4. Combinatorial Proof | 组合证明

A more direct proof avoids induction. Consider expanding (a + b)ⁿ as a sum of products where each factor contributes either a or b. A typical product has n factors, and if k of them are b, the product equals aⁿ⁻ᵏ bᵏ.

一种更直接的证明避免了归纳法。考虑将 (a + b)ⁿ 展开为若干乘积之和,每个因子贡献 a 或 b。一个典型乘积有 n 个因子,如果其中 k 个是 b,则乘积等于 aⁿ⁻ᵏ bᵏ。

The number of such products is C(n, k), because we simply choose which k positions contain b. Therefore, adding over all k from 0 to n gives the binomial expansion. This proof is short and intuitively convincing.

此类乘积的数量为 C(n, k),因为我们只需选择哪 k 个位置包含 b。因此,对所有 k 从 0 到 n 求和即可得到二项展开。这个证明简短且直观有力。


5. Pascal’s Triangle and Coefficient Relations | 杨辉三角与系数关系

The binomial coefficients C(n, k) can be arranged in Pascal’s triangle. Each entry is the sum of the two entries directly above it, which is precisely Pascal’s identity: C(n, k) = C(n−1, k−1) + C(n−1, k).

二项式系数 C(n, k) 可以排列成杨辉三角。每个数是其正上方两个数之和,这正是帕斯卡恒等式:C(n, k) = C(n−1, k−1) + C(n−1, k)。

This triangular structure leads to several useful properties. For example, C(n, 0) = C(n, n) = 1, and the row for n has n + 1 entries. In IB problems, Pascal’s triangle can quickly expand (a + b)ⁿ for small n.

这种三角形结构引出了若干有用性质。例如,C(n, 0) = C(n, n) = 1,且第 n 行有 n + 1 个条目。在 IB 题目中,杨辉三角可用于快速展开较小的 n 的 (a + b)ⁿ。


6. General Term and Binomial Expansion | 通项与二项展开

The general term of the expansion (a + b)ⁿ is:

T(k+1) = C(n, k) aⁿ⁻ᵏ bᵏ, k = 0, 1, 2, …, n

This term is often numbered as the (k + 1)-th term, not the k-th term. In IB examinations, students are frequently asked to find the coefficient of a particular power of x after substituting specific values such as a = 1 or b = 2x.

展开式 (a + b)ⁿ 的通项为:

T(k+1) = C(n, k) aⁿ⁻ᵏ bᵏ, k = 0, 1, 2, …, n

这一项通常被称为第 (k + 1) 项,而不是第 k 项。在 IB 考试中,学生常被要求代入特定值(如 a = 1 或 b = 2x)后,求某一特定 x 幂次的系数。


7. Finding a Specific Term or Coefficient | 求特定项或系数

To find the coefficient of xᵐ in (1 + cx)ⁿ, write the general term as C(n, k) (cx)ᵏ = C(n, k) cᵏ xᵏ. Set k = m and read off the coefficient. For more complicated brackets such as (2x − 3)⁵, first identify a and b before applying the formula.

要求 (1 + cx)ⁿ 中 xᵐ 的系数,将通项写作 C(n, k) (cx)ᵏ = C(n, k) cᵏ xᵏ。令 k = m,即可读出系数。对于更复杂的括号如 (2x − 3)⁵,先识别 a 和 b,再套用公式。

Example: Find the coefficient of x³ in (1 + 2x)⁶. Here k = 3, so coefficient = C(6,3) × 2³ = 20 × 8 = 160.

示例:求 (1 + 2x)⁶ 中 x³ 的系数。这里 k = 3,所以系数 = C(6,3) × 2³ = 20 × 8 = 160。


8. Using the Binomial Theorem for Approximations | 用二项式定理进行近似计算

For small values of x, higher powers of x become negligible. The binomial expansion can therefore provide polynomial approximations. For example, (1 + x)ⁿ ≈ 1 + nx for very small x, which is the linear approximation.

当 x 很小时,x 的高次幂变得可以忽略。因此二项展开可以提供多项式近似。例如,对于非常小的 x,(1 + x)ⁿ ≈ 1 + nx,这即线性近似。

IB students may be asked to approximate expressions such as (1.02)¹⁰ by writing it as (1 + 0.02)¹⁰ and using the first few terms. This method is especially useful when calculators are not permitted.

IB 学生可能会被要求通过将 (1.02)¹⁰ 写成 (1 + 0.02)¹⁰ 并利用前几项来近似计算。当不允许使用计算器时,这种方法尤其有用。


9. Proving Identities with the Binomial Theorem | 利用二项式定理证明恒等式

Many summation identities follow by substituting special values into the binomial theorem. For instance, setting a = 1 and b = 1 gives:

2ⁿ = Σₖ₌₀ⁿ C(n, k)

This says that the total number of subsets of an n-element set is 2ⁿ. Setting a = 1 and b = −1 yields Σₖ₌₀ⁿ (−1)ᵏ C(n, k) = 0, reflecting that the number of even-sized subsets equals the number of odd-sized subsets.

许多求和恒等式可以通过向二项式定理代入特殊值得到。例如,令 a = 1 且 b = 1,得到:

2ⁿ = Σₖ₌₀ⁿ C(n, k)

这说明 n 元集合的子集总数为 2ⁿ。令 a = 1 且 b = −1,得到 Σₖ₌₀ⁿ (−1)ᵏ C(n, k) = 0,反映了偶数大小子集的数量等于奇数大小子集的数量。


10. Generalized Binomial Theorem | 广义二项式定理

The binomial theorem can be extended to real or rational exponents. For |x| < 1 and any real r,

(1 + x)ʳ = 1 + r x + r(r−1) x² / 2! + r(r−1)(r−2) x³ / 3! + …

This infinite series is called the binomial series. In IB HL, this version is used to derive series expansions for functions such as 1/(1+x) or √(1+x) and to approximate values within the interval of convergence.

二项式定理可以推广到实数指数或分数指数。当 |x| < 1 且 r 为任意实数时,

(1 + x)ʳ = 1 + r x + r(r−1) x² / 2! + r(r−1)(r−2) x³ / 3! + …

这个无穷级数称为二项级数。在 IB HL 中,该版本用于推导诸如 1/(1+x) 或 √(1+x) 等函数的级数展开,并在收敛区间内进行数值近似。


11. Typical IB Exam Questions | 典型 IB 考题

IB exams often combine the binomial theorem with other topics. A common question type is: “Find the term independent of x in the expansion of (2x − 1/x)⁶.” The independent term occurs when the power of x is zero.

IB 考试常将二项式定理与其他知识结合。常见题型是:”求 (2x − 1/x)⁶ 展开式中不含 x 的常数项。”当 x 的幂次为零时即为常数项。

Another frequent problem involves expanding (1 + x)ⁿ(1 − ax)ᵐ up to a given power. This requires multiplying two binomial expansions and collecting like terms. Mastery of the general term is essential for these questions.

另一类常见问题涉及将 (1 + x)ⁿ(1 − ax)ᵐ 展开到指定幂次。这需要将两个二项展开相乘并合并同类项。掌握通项公式对解答这些问题至关重要。


12. Summary and Revision Tips | 总结与复习建议

The binomial theorem is a cornerstone of IB Mathematics. You should be able to state it, prove it using either induction or combinatorics, and apply it to find coefficients, evaluate sums, and approximate values. Practice writing the general term clearly and always double-check the power of each factor.

二项式定理是 IB 数学的基石。你应该能够陈述它、用归纳法或组合方法证明它,并应用它来求系数、计算求和以及近似值。练习时务必清晰写出通项,并仔细检查每个因子的幂次。

For revision, make a table of Pascal’s triangle up to n = 10, memorise the general term formula, and work through past exam questions on expansions. Solid understanding of the binomial theorem will benefit many other topics, including probability and series.

复习时,请列出 n = 10 以内的杨辉三角,牢记通项公式,并练习历年考题中的展开问题。扎实理解二项式定理将对许多其他主题(包括概率和级数)大有裨益。


Published by TutorHao | Mathematics Revision Series | aleveler.com

更多咨询请联系16621398022(同微信)

Comments

屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导,国外大学本科硕士研究生博士课程论文辅导

This site uses Akismet to reduce spam. Learn how your comment data is processed.

Discover more from aleveler.com

Subscribe now to keep reading and get access to the full archive.

Continue reading