Binomial Coefficients: Computation and Properties | 二项式系数的计算与性质

📚 Binomial Coefficients: Computation and Properties | 二项式系数的计算与性质

The binomial coefficient \(\binom{n}{k}\) — written here as C(n,k) — is one of the most fundamental tools in IB Mathematics, appearing in combinations, the binomial theorem, and probability. But beyond simple “n choose k,” a deep understanding of its computation and algebraic properties is essential for exam success.

二项式系数 C(n,k) —— 即“组合数” —— 是IB数学中最基础的工具之一，出现在组合计数、二项式定理和概率中。然而，除了“n选k”的表面理解之外，深入掌握其计算方法和代数性质，对于考试取得高分至关重要。

1. Definition and Factorial Notation | 定义与阶乘记号

For non-negative integers n and k with 0 ≤ k ≤ n, the binomial coefficient is defined as the number of ways to choose k objects from n distinct objects without regard to order. In factorial form:

对于满足 0 ≤ k ≤ n 的非负整数 n 和 k，二项式系数定义为从 n 个不同物体中不计顺序地选取 k 个物体的方法数。其阶乘形式为：

C(n,k) = n! / [k!(n-k)!]

For example, C(5,2) = 5! / [2!3!] = 120 / (2 × 6) = 10. This represents the 10 distinct pairs that can be formed from a set of 5 objects.

例如，C(5,2) = 5! / [2!3!] = 120 / (2 × 6) = 10。这表示从5个物体中能组成10个不同的二元组合。

2. Computation Using Pascal’s Triangle | 用帕斯卡三角计算

Pascal’s triangle provides a recursive, arithmetic-only method for computing binomial coefficients. Each interior entry is the sum of the two entries directly above it.

帕斯卡三角提供了一种仅用加法的递推计算方法。每一个内部数字等于其正上方两个数字之和。

Row 0: 1
Row 1: 1 1
Row 2: 1 2 1
Row 3: 1 3 3 1
Row 4: 1 4 6 4 1
Row 5: 1 5 10 10 5 1

Thus C(5,3) = 10, read directly from row 5, position 3. The row number n begins at 0, and the position k also begins at 0.

因此 C(5,3) = 10，直接从第5行第3位读取。行号 n 从0开始，位置 k 也从0开始。

3. Symmetry Property: C(n,k) = C(n,n-k) | 对称性质

The binomial coefficient is symmetric: choosing k objects to keep is equivalent to choosing n-k objects to discard. Formally:

二项式系数具有对称性：选取k个物体保留，等价于选取n-k个物体丢弃。形式化地：

C(n,k) = C(n,n-k)

This follows directly from the factorial definition: n! / [k!(n-k)!] = n! / [(n-k)!k!]. In Pascal’s triangle, this is visible as the left-right symmetry of each row. On the TI-84 or in exams, this property is useful for computing C(100,98) as C(100,2) = 4950 instead of expanding 98!.

这直接由阶乘定义推出：n! / [k!(n-k)!] = n! / [(n-k)!k!]。在帕斯卡三角中，这体现为每一行的左右对称。在TI-84计算器或考试中，这一性质使 C(100,98) 可转化为 C(100,2) = 4950，而不必展开98!。

4. Pascal’s Identity | 帕斯卡恒等式

One of the most tested identities in IB is Pascal’s Identity, which formalizes the rule used to build Pascal’s triangle:

IB考试中最常考的恒等式之一是帕斯卡恒等式，它形式化地描述了构造帕斯卡三角的规则：

C(n,k) + C(n,k+1) = C(n+1,k+1)

The combinatorial proof is elegant: to choose k+1 items from n+1 items, fix one special item. If it is included, we choose the remaining k items from n items (C(n,k) ways). If it is excluded, we choose all k+1 items from n items (C(n,k+1) ways). These two cases are disjoint and cover all possibilities.

该恒等式的组合证明非常精巧：要从 n+1 个物体中选取 k+1 个，先固定一个特殊物体。若包含它，则从其余 n 个中选 k 个，有 C(n,k) 种方式；若不包含它，则从 n 个中选 k+1 个，有 C(n,k+1) 种方式。两种情形互不相交且覆盖所有可能。

5. The Binomial Theorem | 二项式定理

The binomial theorem expresses the expansion of (a+b)ⁿ as a sum of binomial coefficient terms:

二项式定理将 (a+b)ⁿ 的展开式表示为二项式系数项之和：

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

For example, (2x+1)⁵ = C(5,0)(2x)⁵ + C(5,1)(2x)⁴(1) + C(5,2)(2x)³(1)² + C(5,3)(2x)²(1)³ + C(5,4)(2x)(1)⁴ + C(5,5)(1)⁵ = 32x⁵ + 80x⁴ + 80x³ + 40x² + 10x + 1.

例如，(2x+1)⁵ = C(5,0)(2x)⁵ + C(5,1)(2x)⁴(1) + C(5,2)(2x)³(1)² + C(5,3)(2x)²(1)³ + C(5,4)(2x)(1)⁴ + C(5,5)(1)⁵ = 32x⁵ + 80x⁴ + 80x³ + 40x² + 10x + 1。

6. The General Term Formula | 通项公式

In IB exam questions, students are often asked to find a specific term in an expansion. The general term in (a+b)ⁿ is:

在IB考题中，学生经常需要找到展开式中的某一特定项。(a+b)ⁿ 展开式中的通项为：

T(k+1) = C(n,k) · aⁿ⁻ᵏ · bᵏ

Be careful: the (k+1)-th term corresponds to the coefficient C(n,k). For instance, the 5th term in (x + 2)¹⁰ is T₅ = C(10,4)x⁶(2)⁴ = 210 × x⁶ × 16 = 3360x⁶. A common student error is using C(10,5) — always check whether the problem asks for the term number or the power of x.

特别注意：第 (k+1) 项对应系数 C(n,k)。例如，(x+2)¹⁰ 的第5项是 T₅ = C(10,4)x⁶(2)⁴ = 210 × x⁶ × 16 = 3360x⁶。常见错误是误用 C(10,5)——务必确认题目问的是项数还是 x 的幂次。

7. Sum of Coefficients | 系数之和

Substituting a = 1 and b = 1 into the binomial theorem gives the sum of all binomial coefficients in a row:

在二项式定理中令 a = 1、b = 1，可得一行中所有二项式系数之和：

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

This identity is heavily tested in IB papers. For example, the sum of all coefficients in (3x-2)⁷ is obtained by substituting x = 1: (3-2)⁷ = 1. Similarly, the sum of coefficients of even powers often involves substituting x = 1 and x = -1 to isolate even and odd contributions.

该恒等式是IB试卷中的高频考点。例如，(3x-2)⁷ 所有系数之和通过代入 x = 1 得到：(3-2)⁷ = 1。类似地，偶次幂系数之和通常通过同时代入 x = 1 和 x = -1 来分离偶次与奇次贡献。

8. The Binomial Coefficient Table | 二项式系数速查表

For quick reference in timed exams, the following table of coefficients is useful:

在限时考试中，以下系数速查表非常实用：

n\k	0	1	2	3	4	5	6
0	1
1	1	1
2	1	2	1
3	1	3	3	1
4	1	4	6	4	1
5	1	5	10	10	5	1
6	1	6	15	20	15	6	1

9. Coefficient of a Specific Power of x | 指定x幂次的系数

A classic IB question asks: “Find the coefficient of x⁵ in (x² + 3/x)⁸.” The general term is:

经典IB题：“求 (x² + 3/x)⁸ 中 x⁵ 的系数。”通项为：

T(k+1) = C(8,k) (x²)⁸⁻ᵏ (3/x)ᵏ = C(8,k) 3ᵏ x¹⁶⁻²ᵏ⁻ᵏ = C(8,k) 3ᵏ x¹⁶⁻³ᵏ

Setting 16-3k = 5 gives k = 11/3, which is not an integer. Thus there is no x⁵ term. If the question instead asks for x⁴, then 16-3k = 4 gives k = 4, and the coefficient is C(8,4) · 3⁴ = 70 × 81 = 5670. Always verify k is an integer in the valid range 0 to n.

令 16-3k = 5，得 k = 11/3，不是整数。因此不存在 x⁵ 项。若题目改为求 x⁴，则 16-3k = 4 得 k = 4，系数为 C(8,4) · 3⁴ = 70 × 81 = 5670。务必验证 k 是在0到n范围内的整数。

10. Ratio of Consecutive Coefficients | 相邻系数之比

In extended-response questions, students may be asked to determine the greatest coefficient. The ratio of the (k+1)-th coefficient to the k-th coefficient in (a+b)ⁿ provides a powerful tool:

在拓展题中，学生常被要求确定最大系数。(a+b)ⁿ 中第(k+1)项系数与第k项系数之比是一个强大工具：

T(k+1)/T(k) = [(n-k+1)/k] · (b/a)

For (1+2x)¹², the ratio is T(k+1)/T(k) = (12-k+1)/k × 2. Solving T(k+1) ≥ T(k) gives k ≤ 26/3, so the greatest term occurs at k = 8, giving the term C(12,8)(2)⁸x⁸ = 126720x⁸. This ratio method avoids computing all 13 coefficients individually.

对于 (1+2x)¹²，比值为 T(k+1)/T(k) = (12-k+1)/k × 2。解 T(k+1) ≥ T(k) 得 k ≤ 26/3，故最大项出现在 k = 8，即 C(12,8)(2)⁸x⁸ = 126720x⁸。此法避免逐一计算全部13个系数。

11. Sigma Notation and Divisibility | 求和记号与整除性

Binomial coefficients appear frequently in sigma notation problems. For example, to evaluate Σₖ₌₁ⁿ 2ᵏ C(n,k), the binomial theorem gives:

二项式系数经常出现在求和记号题目中。例如，计算 Σₖ₌₁ⁿ 2ᵏ C(n,k) 可利用二项式定理：

Σₖ₌₁ⁿ 2ᵏ C(n,k) = (1+2)ⁿ − C(n,0) = 3ⁿ − 1

In number theory questions, note that 3ⁿ = (1+2)ⁿ always leaves a remainder of 1 when divided by 2, confirming that 3ⁿ − 1 is divisible by 2. More generally, the binomial theorem underpins many divisibility proofs in IB HL number theory optional topics.

在数论题中，注意 3ⁿ = (1+2)ⁿ 除以2时余数恒为1，从而确认 3ⁿ − 1 能被2整除。更一般地，二项式定理是IB HL数论选修中许多整除性证明的基础。

12. Common Exam Pitfalls and Final Tips | 常见错误与最终建议

Confusing k and k+1: The first term uses k=0. The 5th term uses k=4. Always double-check.
Confusing k and k+1：首项对应 k=0；第5项对应 k=4。务必反复检查。
Forgetting the coefficient of the inner expression: In (2x+3)ⁿ, each term contributes 2ᵏ and 3ⁿ⁻ᵏ, not just xᵏ.
漏掉内层表达式的系数：在 (2x+3)ⁿ 中，每项包含 2ᵏ 和 3ⁿ⁻ᵏ，而不仅仅包含 xᵏ。
Misapplying the symmetry property: C(n,k) = C(n,n-k) only when the second argument is n minus the first; C(n,k) ≠ C(n,k-1).
错误套用对称性质：C(n,k) = C(n,n-k) 仅当第二个参数等于 n 减去第一个参数时成立；C(n,k) ≠ C(n,k-1)。
Forgetting that k must be an integer in [0,n]: When solving for k from a power of x, reject non-integer solutions immediately.
忘记 k 必须是 [0,n] 中的整数：当通过 x 的幂次解 k 时，立即舍去非整数解。

Master these computational skills and identities, and binomial coefficient questions will become some of the most reliable marks in your IB exam.

掌握这些计算技巧与恒等式，二项式系数题将成为你IB考试中最稳定的得分点之一。

Published by TutorHao | Mathematics Revision Series | aleveler.com

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

Binomial Coefficients: Computation and Properties | 二项式系数的计算与性质