📚 Investigation 2 - The Binomial Coefficient | 研究二：二项式系数
The binomial coefficient is a powerful idea that bridges counting, algebra, and probability. Whether you are choosing a team from a squad, expanding (x + y)n, or analysing patterns in Pascal's triangle, the binomial coefficient provides the underlying structure. This investigation guides you through its definition, key properties, surprising identities, and applications, encouraging you to discover connections for yourself.
二项式系数是一个强大的概念，它将计数、代数和概率连接起来。无论是从队伍中挑选队员、展开 (x + y)n，还是分析帕斯卡三角形中的模式，二项式系数都提供了底层结构。本次探究将引导你了解它的定义、关键性质、令人惊奇的恒等式和应用，鼓励你自己发现其中的联系。
1. Introduction to Binomial Coefficients | 二项式系数引言
The binomial coefficient appears whenever we count selections without regard to order. It is commonly written as C(n, k) or read as 'n choose k'. The symbol itself encodes a combinatorial question: from n distinct items, in how many ways can we choose exactly k of them? This number is fundamental to the binomial theorem, which expresses powers of a binomial as a sum of terms involving binomial coefficients. In this investigation, we will unpack the meaning of C(n, k), link it to Pascal's triangle, prove algebraic identities, and explore patterns that reveal deeper mathematical structure.
每当我们进行不计顺序的选取计数时，二项式系数就会出现。它通常写作 C(n, k) 或读作“n 选 k”。这个符号本身蕴含着一个组合问题：从 n 个不同物品中，我们能够选出恰好 k 个的方法有多少种？这个数字是二项式定理的基础，该定理将二项式的幂表示为包含二项式系数的各项之和。在本次探究中，我们将解开 C(n, k) 的含义，将其与帕斯卡三角形联系起来，证明代数恒等式，并探索那些揭示更深层数学结构的模式。
2. Combinatorial Definition | 组合定义
The binomial coefficient C(n, k) is defined for integers n and k with 0 ≤ k ≤ n as:
C(n, k) = n! / (k! (n − k)!)
where n! (n factorial) is the product of all positive integers up to n, with 0! defined as 1. For example, C(5, 2) = 5! / (2! 3! / (2 × 6) = 10. This tells us there are 10 ways to choose 2 elements from a set of 5. When k = 0 or k = n, the formula gives C(n, 0) = C(n, n 1, which makes sense: there is exactly one way to choose nothing or to choose everything.
二项式系数 C(n, k) 对满足 0 ≤ k ≤ n 的整数 n 和 k 定义为：
C(n, k) = n! / (k! (n − k)!)
其中 n!（n 的阶乘）是所有不超过 n 的正整数的乘积，且 0! 定义为 1。例如，C(5, 2) = 5! / (2! 3!) = 120 / (2 × 6) = 10。这告诉我们从一个含有 5 个元素的集合中选出 2 个有 10 种方式。当 k = 0 或 k = n 时，公式给出 C(n, 0) = C(n, n) = 1，这很合理：什么都不选或全选的选法都只有一种。
3. Pascal's Triangle Connection | 帕斯卡三角形关联
Pascal's triangle is a triangular array where each entry is a binomial coefficient. The top row corresponds to n = 0, and the kth entry in row n is C(n, k). The first five rows look like this:
帕斯卡三角形是一个三角形数组，其中每一项都是二项式系数。最顶行对应 n = 0，第 n 行中的第 k 项为 C(n, k)。前五行如下所示：
| 1 | ||||
| 1 | 1 | |||
| 1 | 2 | 1 | ||
| 1 | 3 | 3 | 1 | |
| 1 | 4 | 6 | 4 | 1 |
Notice that each number (except the 1s at the edges) is the sum of the two numbers directly above it. This visual pattern is one of the most famous properties of binomial coefficients and hints at the addition formula we will prove shortly.
请注意，每个数字（除了边缘的 1）都是它正上方两个数字之和。这一视觉模式是二项式系数最著名的性质之一，也暗示了我们即将证明的加法公式。
4. Symmetry Property | 对称性质
A quick glance at Pascal's triangle reveals a mirror symmetry: row n reads the same from left to right as from right to left. Algebraically, this is expressed as C(n, k) = C(n, n − k). The combinatorial reasoning is simple: choosing k items to include is exactly the same as choosing n − k items to exclude. Using the definition, C(n, n − k) = n! / ((n − k)! (n − (n − k))!) = n! / ((n − k)! k!) = C(n, k). This symmetry is immensely useful for simplifying calculations; for example, C(10, 8) = C(10, 2) = 45.
匆匆一瞥帕斯卡三角形就能发现镜像对称：第 n 行从左到右读与从右到左读完全相同。用代数式表达就是 C(n, k) = C(n, n − k)。组合推理很简单：选出 k 个物品包含在内，等同于选出 n − k 个物品排除在外。利用定义，C(n, n − k) = n! / ((n − k)! (n − (n − k))!) = n! / ((n − k)! k!) = C(n, k)。这种对称对简化计算极为有用；例如，C(10, 8) = C(10, 2) = 45。
5. Addition Formula (Pascal's Rule) | 加法公式（帕斯卡法则）
The rule that generates Pascal's triangle is C(n, k) = C(n − 1, k − 1) + C(n − 1, k ≤ k ≤ n − 1. To prove it, start from the right-hand side and use the factorial definition:
C(n − 1, k − 1) + C(n − 1, k) = (n − 1)! / ((k − 1)! (n − k)!) + (n − 1)! / (k! (n − 1 − k)!)
Combine the two fractions over a common denominator k! (n − k)! to obtain n! / (k! (n − k)!) = C(n, k). Combinatorially, fix one element and consider selections that either include it (leaving k − 1 choices from the remaining n − 1) or exclude it (choosing all k from the remaining n − 1).
生成帕斯卡三角形的法则是 C(n, k) = C(n − 1, k − 1) + C(n − 1, k)，对 1 ≤ k ≤ n − 1 成立。证明时，从右端入手并使用阶乘定义：
C(n − 1, k − 1) + C(n − 1, k) = (n − 1)! / ((k − 1)! (n − k)!) + (n − 1)! / (k! (n − 1 − k)!)
将两个分式以公分母 k! (n − k)! 合并，即得 n! / (k! (n − k)!) = C(n, k)。从组合角度看，固定一个元素，考虑包含它的选取（从剩下的 n − 1 个中选 k − 1 个）或不包含它的选取（从剩下的 n − 1 个中选全部 k 个）。
6. Binomial Theorem Basics | 二项式定理基础
The binomial theorem states that for any non-negative integer n,
(x + y)n = ∑k=0n C(n, k) xn − k yk
Here the sum runs over all possible powers of y from 0 to n, and each term's coefficient is a binomial coefficient. For n = 2 we get (x + y)2 = x2 + 2xy + y2; for n = 3, (x + y)3 = x3 + 3x2y + 3xy2 + y3. The coefficients 1, 3, 3, 1 match the fourth row of Pascal's triangle (counting the top as row 0). This connection shows why binomial coefficients are so named.
二项式定理指出，对于任意非负整数 n，
(x + y)n = ∑k=0n C(n, k) xn − k yk
这里求和遍历所有可能的 y 的幂次，从 0 到 n，每一项的系数都是二项式系数。对 n = 2 我们得到 (x + y)2 = x2 + 2xy + y2；对 n = 3，得到 (x + y)3 = x3 + 3x2y + 3xy2 + y3。系数 1, 3, 3, 1 与帕斯卡三角形的第四行吻合（视顶行为第 0 行）。这一联系说明了二项式系数名称的由来。
7. Special Cases and Identities | 特殊情况与恒等式
Substituting particular values for x and y into the binomial theorem yields a host of identities. If we set x = 1 and y = 1, we obtain (1 + 1)n = 2n = ∑k=0n C(n, k), which tells us the sum of all binomial coefficients in row n. If we set x = 1, y = −1, we get (1 − 1)n = 0 = ∑k=0n (−1)k C(n, k) for n > 0, showing that the alternating sum of coefficients is zero. Similarly, choosing x = 1, y = 2 gives 3n = ∑ C(n, k) 2k, linking binomial coefficients to powers of three. These special cases are not just algebraic curiosities; they form the basis of many counting problems.
将 x 和 y 的特殊值代入二项式定理会产生大量恒等式。若令 x = 1 且 y = 1，我们得到 (1 + 1)n = 2n = ∑k=0n C(n, k)，这告诉我们第 n 行所有二项式系数之和为 2n。若令 x = 1，y = −1，则当 n > 0 时，(1 − 1)n = 0 = ∑k=0n (−1)k C(n, k)，说明系数的交错和为零。类似地，取 x = 1，y = 2 给出 3n = ∑ C(n, k) 2k，将二项式系数与 3 的幂联系起来。这些特殊情况不仅是代数趣题，它们还是许多计数问题的基础。
8. Sum of Binomial Coefficients | 二项式系数之和
The identity ∑k=0n C(n, k) = 2n has a neat combinatorial proof: the left-hand side counts the number of subsets of a set of size n, grouped by size k. The total number of subsets is 2n because each element can either be in or out of a subset. Thus summing all the 'choose' numbers across a row gives the total number of subsets. This identity is used constantly in probability, where sample spaces are often power sets. For example, if you flip a fair coin n times, there are 2n possible outcomes, and the number of outcomes with exactly k heads is C(n, k).
恒等式 ∑k=0n C(n, k) = 2n 有一个简洁的组合证明：左端统计的是含 n 个元素的集合中所有子集的个数，并按子集大小 k 分组。子集的总个数就是 2n，因为每个元素都可以选择在或不在子集中。因此，将一行中所有“选”数相加就得到子集总数。这个恒等式在概率论中不断出现，那里样本空间常常是幂集。例如，若你掷一枚公平硬币 n 次，有 2n 种可能结果，其中恰好出现 k 次正面的结果数为 C(n, k)。
9. Alternating Sum Identity | 交错和恒等式
For n > 0, the alternating sum ∑k=0n (−1)k C(n, k) = 0. This reflects the cancellation between subsets of even and odd sizes. Combin
Published by TutorHao | IB Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图