A-Level Maths: Pascal's Triangle and Binomial Coefficients | A-Level 数学：帕斯卡三角形与组合数

📚 A-Level Maths: Pascal’s Triangle and Binomial Coefficients | A-Level 数学：帕斯卡三角形与组合数

Pascal’s Triangle is one of the most elegant and versatile mathematical structures studied in A-Level Mathematics. It provides a systematic way to calculate binomial coefficients and is deeply connected to binomial expansions, combinatorics, and probability theory.

帕斯卡三角形是 A-Level 数学中最优雅且用途广泛的数学结构之一。它提供了一种系统化的方法来计算组合数，并与二项式展开、组合数学以及概率论有着深刻的联系。

1. Construction of Pascal’s Triangle | 帕斯卡三角形的构造

Pascal’s Triangle is constructed by starting with a 1 at the top, then each subsequent row is formed by adding the two numbers directly above it. The first row is designated as row 0, containing a single number: 1.

帕斯卡三角形的构造方法是：顶端为 1，自顶向下，每一行的每个数等于其左上方与右上方两个数之和。我们通常将第一行记为第 0 行，其中只包含一个数字 1。

For example, the first five rows of Pascal’s Triangle are:

例如，帕斯卡三角形的前五行如下：

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

Notice that each interior entry (such as 2 in row 2) is the sum of the two entries above it (1 + 1). This recursive construction is known as the Pascal’s rule.

请注意，每一个内部项（例如第 2 行的 2）是其上方的两个项之和（1 + 1）。这种递归构造方法被称为帕斯卡法则。

Each row is symmetric: reading left to right gives the same sequence as reading right to left.
每一行都是对称的：从左到右读与从右到左读得到的序列相同。
The leftmost and rightmost entries of every row are always 1.
每一行最左边和最右边的项始终为 1。
The sum of the numbers in row n is 2ⁿ.
第 n 行所有数字之和为 2ⁿ。

2. Connection to Binomial Coefficients | 与组合数的联系

The entries in Pascal’s Triangle are exactly the binomial coefficients C(n, r), which count the number of ways to choose r objects from a set of n distinct objects. The entry in row n and position r is denoted as C(n, r) or ⁿCᵣ.

帕斯卡三角形中的每一项恰好就是组合数 C(n, r)，它表示从 n 个不同物体中选取 r 个物体的方法总数。第 n 行第 r 个位置上的项记作 C(n, r) 或 ⁿCᵣ。

C(n, r) = n! / (r! × (n − r)!)

For example, C(4, 2) = 4! / (2! × 2!) = 24 / (2 × 2) = 6, which matches the third entry in row 4 of Pascal’s Triangle.

例如，C(4, 2) = 4! / (2! × 2!) = 24 / (2 × 2) = 6，与帕斯卡三角形第 4 行第 3 个位置上的数字 6 完全一致。

The row number n corresponds to the upper index of the binomial coefficient.
行号 n 对应组合数的上标。
The position r within the row corresponds to the lower index, starting from r = 0.
行内的位置 r 对应组合数的下标，从 r = 0 开始计数。
The first entry of each row corresponds to C(n, 0) = 1.
每行的第一个项对应 C(n, 0) = 1。

3. Pascal’s Rule and Recursion | 帕斯卡法则与递归关系

Pascal’s rule states that any interior entry in Pascal’s Triangle can be expressed as the sum of the two entries diagonally above it. In terms of binomial coefficients, this takes the form:

帕斯卡法则指出，帕斯卡三角形中的任意内部项都可以表示为它斜上方两个项之和。用组合数表示即为：

C(n, r) = C(n−1, r−1) + C(n−1, r)

This identity forms the basis of many combinatorial proofs and is extremely useful for computing binomial coefficients recursively without factorials.

这一恒等式是许多组合证明的基础，对于无需阶乘而递归计算组合数非常有用。

For instance, C(5, 2) = C(4, 1) + C(4, 2) = 4 + 6 = 10. This can be verified directly from Pascal’s Triangle.

例如，C(5, 2) = C(4, 1) + C(4, 2) = 4 + 6 = 10。这可以直接从帕斯卡三角形中验证。

Pascal’s rule is a central tool for proving combinatorial identities.
帕斯卡法则是证明组合恒等式的核心工具。
It allows us to compute C(n, r) for large n and r using addition rather than multiplication.
它允许我们用加法而非乘法来计算较大的 n 和 r 对应的 C(n, r)。

4. Binomial Theorem and Pascal’s Triangle | 二项式定理与帕斯卡三角形

The binomial theorem states that for any positive integer n and any real numbers a and b:

二项式定理指出，对于任意正整数 n 以及任意实数 a 和 b：

(a + b)ⁿ = Σ₀ⁿ C(n, r) × aⁿ⁻ʳ × bʳ

The coefficients C(n, 0), C(n, 1), …, C(n, n) appearing in this expansion are precisely the entries in row n of Pascal’s Triangle. This is why Pascal’s Triangle is sometimes called the “coefficient triangle” for binomial expansions.

展开式中出现的系数 C(n, 0), C(n, 1), …, C(n, n) 恰好就是帕斯卡三角形第 n 行的各项。这就是为什么帕斯卡三角形有时也被称为二项式展开的”系数三角形”。

The binomial theorem provides a fast method for expanding powers of binomials.
二项式定理提供了展开二项式幂次的快速方法。
For (a + b)⁴, the coefficients 1, 4, 6, 4, 1 match row 4 of Pascal’s Triangle.
对于 (a + b)⁴，其系数 1, 4, 6, 4, 1 与帕斯卡三角形第 4 行完全对应。

5. Properties of Binomial Coefficients | 组合数的性质

Several important properties of binomial coefficients can be observed directly from Pascal’s Triangle. These properties are frequently tested in A-Level examinations.

组合数的几个重要性质可以直接从帕斯卡三角形中观察得到。这些性质在 A-Level 考试中经常出现。

Symmetry property: C(n, r) = C(n, n−r), since choosing r items is equivalent to leaving out n−r items.

对称性：C(n, r) = C(n, n−r)，因为选取 r 个物品等同于排除 n−r 个物品。

Sum of a row: The sum of all entries in row n equals 2ⁿ.

整行之和：第 n 行所有项之和等于 2ⁿ。

Σ₀ⁿ C(n, r) = 2ⁿ

Alternating sum: The alternating sum of entries in any row equals 0, i.e., Σ₀ⁿ (−1)ʳ × C(n, r) = 0.

交错求和：任意一行的交错项之和为 0，即 Σ₀ⁿ (−1)ʳ × C(n, r) = 0。

These properties are useful for solving problems involving sums of coefficients.
这些性质对于处理系数求和问题非常有用。
They also play a role in combinatorial counting arguments.
它们也在组合计数论证中发挥作用。

6. Pascal’s Triangle in Probability | 帕斯卡三角形在概率中的应用

Pascal’s Triangle is intimately linked to probability theory, particularly in the context of the binomial distribution. If a trial has two possible outcomes (success with probability p and failure with probability 1−p), then the probability of obtaining exactly r successes in n independent trials is:

帕斯卡三角形与概率论密切相关，尤其是在二项分布的背景下。如果一次试验有两种可能结果（成功概率为 p，失败概率为 1−p），那么在 n 次独立试验中恰好获得 r 次成功的概率为：

P(X = r) = C(n, r) × pʳ × (1−p)ⁿ⁻ʳ

The coefficients C(n, r) in this formula are exactly the entries of row n in Pascal’s Triangle.

此公式中的系数 C(n, r) 恰好就是帕斯卡三角形中第 n 行的各项。

For example, tossing a fair coin 3 times: the probabilities of obtaining 0, 1, 2, or 3 heads involve the entries 1, 3, 3, 1 from row 3.
例如，抛 3 次均匀硬币：得到 0、1、2 或 3 次正面的概率分别涉及第 3 行的项 1、3、3、1。
Entries from Pascal’s Triangle also appear in the hypergeometric distribution and other combinatorial probability problems.
帕斯卡三角形中的项也出现在超几何分布和其他组合概率问题中。

7. Applications in Combinatorics | 在组合数学中的应用

Pascal’s Triangle provides a quick reference for solving counting problems. The entry C(n, r) gives the number of ways to choose r objects from n objects. Common applications include:

帕斯卡三角形为解决计数问题提供了快速参考。C(n, r) 给出了从 n 个物体中选取 r 个物体的方法数。常见的应用包括：

Selecting a committee of r people from a group of n candidates.

从 n 位候选人中选取 r 人组成委员会。
Counting the number of paths in a grid from the top-left corner to the bottom-right corner, where each step is either right or down.

统计网格中从左上角到右下角的路径数，其中每一步只能向右或向下。
Expanding (x + y)ⁿ in algebraic expressions.

在代数表达式中展开 (x + y)ⁿ。

Another classical application is the “travel through lattice” problem. The number of routes from the top of Pascal’s Triangle to any given entry equals the value of that entry itself.

另一个经典应用是”格点路径”问题。从帕斯卡三角形顶端到达任意给定项的路线的数量恰好等于该项本身的值。

8. The Hockey Stick Identity | 曲棍球棒恒等式

One of the most fascinating identities derived from Pascal’s Triangle is the hockey stick identity. It states that the sum of the entries along a diagonal from the left edge down to any point equals the entry below and to the right of that point.

从帕斯卡三角形中得出的最奇妙恒等式之一是曲棍球棒恒等式。它指出，从左侧边缘出发沿对角线向下到某一点的各项之和，等于该点右下方的那一项。

Σ C(i, k) = C(n+1, k+1) for i = k to n

For example, in Pascal’s Triangle, 1 + 2 + 3 + 4 + 5 = 15, which appears one row below and one position to the right of the 5.

例如，在帕斯卡三角形中，1 + 2 + 3 + 4 + 5 = 15，而 15 恰好位于 5 的下一行偏右一个位置。

This identity is named because the summands resemble the shape of a hockey stick.
该恒等式因其被加项的排列形状酷似曲棍球棒而得名。
It is useful for evaluating sums of consecutive binomial coefficients.
它在计算连续组合数之和时非常有用。

9. Fibonacci Numbers in Pascal’s Triangle | 帕斯卡三角形中的斐波那契数列

When you sum the entries along the diagonals of Pascal’s Triangle, you obtain the Fibonacci numbers. Each diagonal from top-right to bottom-left, when summed, produces the sequence 1, 1, 2, 3, 5, 8, 13, …

如果你将帕斯卡三角形沿对角线上的项相加，就能得到斐波那契数列。从右上到左下的每条对角线，其各项之和依次为 1、1、2、3、5、8、13……

For instance, 1 = 1; 1 = 1; 1+1 = 2; 1+2 = 3; 1+3+1 = 5; 1+4+3 = 8; and so on.

例如：1 = 1；1 = 1；1+1 = 2；1+2 = 3；1+3+1 = 5；1+4+3 = 8；依此类推。

This connection between Pascal’s Triangle and the Fibonacci sequence highlights the deep hidden structure within this seemingly simple array of numbers.

帕斯卡三角形与斐波那契数列之间的这种联系揭示了这一看似简单的数字排列背后深刻的隐藏结构。

The Fibonacci connection often appears as a challenge question in A-Level further mathematics.
斐波那契联系经常作为 A-Level 进阶数学中的挑战题出现。
It helps students appreciate the unifying power of mathematics.
它帮助学生领略数学的统一性与美感。

10. Pascal’s Triangle in Exam Context | 帕斯卡三角形在考试中的应用

In A-Level examinations, Pascal’s Triangle and binomial coefficients appear in a variety of question formats. Common types include:

在 A-Level 考试中，帕斯卡三角形与组合数会以多种题型出现。常见题型包括：

Expanding (a + b)ⁿ using the binomial theorem and extracting specific coefficients.

利用二项式定理展开 (a + b)ⁿ 并提取特定项的系数。
Finding the coefficient of a given power of x in an expansion.

在展开式中寻找指定 x 次幂的系数。
Using Pascal’s Triangle to determine C(n, r) without a calculator.

不使用计算器，利用帕斯卡三角形确定 C(n, r) 的值。
Solving probability problems involving binomial distributions.

解决涉及二项分布的概率问题。

One typical exam style question: “Find the coefficient of x³ in the expansion of (1 + 2x)⁷.”

一道典型的考试题：”求 (1 + 2x)⁷ 展开式中 x³ 项的系数。”

Solution: The general term is C(7, r) × (2x)ʳ. For the x³ term, set r = 3, giving C(7, 3) × 2³ = 35 × 8 = 280.

解答：通项为 C(7, r) × (2x)ʳ。对于 x³ 项，令 r = 3，得 C(7, 3) × 2³ = 35 × 8 = 280。

11. Extensions and Other Applications | 延伸与应用拓展

Beyond the A-Level syllabus, Pascal’s Triangle has applications in many areas of mathematics. It appears in calculus through binomial series, in number theory through properties of primes, and in algebra through symmetric polynomials.

在 A-Level 大纲之外，帕斯卡三角形的应用遍及数学的许多领域。它通过二项级数出现在微积分中，通过素数性质出现在数论中，通过对称多项式出现在代数中。

Negative indices: The binomial theorem can be extended to negative and fractional indices, leading to the binomial series for |x| < 1.

负指数：二项式定理可以推广到负指数和分数指数，从而导出 |x| < 1 时的二项级数。
Multinomial coefficients: Pascal’s triangle generalizes to Pascal’s simplex in higher dimensions.

多项式系数：帕斯卡三角形在更高维度中推广为帕斯卡单纯形。
Computational mathematics: Dynamic programming algorithms often use Pascal’s rule to compute combinations efficiently.

计算数学：动态规划算法常常利用帕斯卡法则来高效地计算组合数。

Understanding Pascal’s Triangle deeply provides students with a strong foundation for higher mathematics and unlocks a vast array of problem-solving strategies.

深入理解帕斯卡三角形为学生学习高等数学奠定了坚实基础，并打开了广阔的解题策略空间。

Published by TutorHao | Mathematics Revision Series | aleveler.com

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

A-Level Maths: Pascal’s Triangle and Binomial Coefficients | A-Level 数学：帕斯卡三角形与组合数