Pascal's Triangle: Patterns and Applications | 帕斯卡三角形的规律与应用

📚 Pascal’s Triangle: Patterns and Applications | 帕斯卡三角形的规律与应用

Pascal’s triangle is one of the most elegant and surprising structures in mathematics. It is a triangular array of numbers in which each entry is the sum of the two numbers directly above it. Although named after the French mathematician Blaise Pascal, this triangle was known to Chinese, Persian, and Indian mathematicians long before his time. In China, it is traditionally called Yang Hui’s triangle.

帕斯卡三角形是数学中最优美且最令人惊叹的结构之一。它是一个三角形的数字阵列，其中每一项都等于其正上方两个数字之和。虽然以法国数学家布莱兹·帕斯卡命名，但早在帕斯卡之前，中国、波斯和印度的数学家们就已经知道了这个三角形。在中国，它传统上被称为“杨辉三角”。

1. Construction of the Triangle | 三角形的构造

The simplest way to build Pascal’s triangle is to start with a 1 at the top. Each new row begins and ends with 1, and every interior number is obtained by adding the two numbers directly above it. For example, the third row is 1 2 1 because 1+1=2; the fourth row is 1 3 3 1 because 1+2=3 and 2+1=3.

构造帕斯卡三角形最简单的方法是从顶部的一个 1 开始。每一行以 1 开始并以 1 结束，中间的每个数都等于其正上方两个数之和。例如，第三行是 1 2 1，因为 1+1=2；第四行是 1 3 3 1，因为 1+2=3，2+1=3。

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

This recursive construction allows us to generate as many rows as needed without memorising any values.

这种递推构造让我们无需记忆任何数值，就能生成任意多行。

2. Binomial Coefficients | 二项式系数

Each entry in Pascal’s triangle is exactly a binomial coefficient C(n, r), where n is the row number and r is the position within that row, both starting from 0. For example, the third entry of row 5 is C(5, 2) = 10.

帕斯卡三角形中的每一项都恰好是一个二项式系数 C(n, r)，其中 n 是行号，r 是该行中的位置，二者都从 0 开始计数。例如，第 5 行的第 3 项是 C(5, 2) = 10。

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

This formula connects the triangle to algebra, since C(n, r) is also the coefficient of the term aⁿ⁻ʳbʳ in the expansion of (a + b)ⁿ.

这个公式将三角形与代数联系起来，因为 C(n, r) 也是 (a + b)ⁿ 展开式中 aⁿ⁻ʳbʳ 项的系数。

3. Symmetry of Each Row | 每一行的对称性

Every row in Pascal’s triangle reads the same forwards and backwards. This symmetry is expressed by the identity C(n, r) = C(n, n − r). For instance, in row 6 (1 6 15 20 15 6 1), the pair 6 and 6, and 15 and 15, demonstrate this property.

帕斯卡三角形中每一行从前往后读和从后往前读完全相同。这种对称性用恒等式表达为 C(n, r) = C(n, n − r)。例如，在第 6 行 (1 6 15 20 15 6 1) 中，6 和 6，15 和 15 就体现了这一性质。

This occurs because choosing r items from n items leaves n − r items unchosen; the two processes are equivalent.

这是因为从 n 个物品中选出 r 个，相当于留下 n − r 个未选，两种过程是等价的。

4. Sum of the Numbers in Each Row | 每行数字之和

The sum of the numbers in row n is 2ⁿ. For example, row 3 (1 3 3 1) sums to 8 = 2³, and row 5 sums to 32 = 2⁵.

第 n 行所有数字之和等于 2ⁿ。例如，第 3 行 (1 3 3 1) 的和为 8 = 2³，第 5 行的和为 32 = 2⁵。

C(n, 0) + C(n, 1) + C(n, 2) + … + C(n, n) = 2ⁿ

This identity reflects the fact that a set with n elements has exactly 2ⁿ subsets. Each subset corresponds to choosing a certain number of elements, and the triangle counts those choices.

这个恒等式反映了一个事实：有 n 个元素的集合恰好有 2ⁿ 个子集。每个子集对应选择一定数量的元素，而三角形正好对这些选择进行计数。

5. Diagonal Sums and Fibonacci Numbers | 斜线之和与斐波那契数

If we sum the numbers along the shallow diagonals of Pascal’s triangle, we obtain the Fibonacci sequence: 1, 1, 2, 3, 5, 8, 13, … The first few such sums are 1, 1, 1+1=2, 1+2=3, 1+3+1=5, and so on.

如果我们沿着帕斯卡三角形的浅斜线方向将数字相加，会得到斐波那契数列：1, 1, 2, 3, 5, 8, 13, … 最初的几个这样的和分别是 1, 1, 1+1=2, 1+2=3, 1+3+1=5，依此类推。

F₁ = 1, F₂ = 1, Fₙ = Fₙ₋₁ + Fₙ₋₂

This surprising connection reveals how deeply the Fibonacci numbers are embedded in combinatorial structures. The formula can be written using binomial coefficients as a sum over the same diagonals.

这一惊人联系揭示了斐波那契数如何深嵌于组合结构之中。该公式可以用二项式系数沿相同斜线求和的形式来表达。

6. Combinatorial Identities | 组合恒等式

Pascal’s triangle is a source of many important identities. The most basic one is Pascal’s rule, which is exactly the construction rule of the triangle.

帕斯卡三角形是许多重要恒等式的来源。最基本的是帕斯卡法则，它正是三角形的构造规则。

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

Another famous identity is the hockey-stick identity: the sum of a diagonal is equal to the entry just below the end of that diagonal.

另一个著名恒等式是曲棍球棒恒等式：沿一条斜线求和，结果等于该斜线末端下方紧邻的那个数。

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

Such identities are often proved by counting the same set in two different ways, a technique called double counting.

这类恒等式通常通过用两种不同方式计数同一个集合来证明，这种技巧称为“双重计数”。

7. Applications in Probability | 在概率中的应用

Pascal’s triangle appears naturally when calculating probabilities in repeated independent trials. When a fair coin is tossed n times, the number of ways to get exactly r heads is C(n, r).

计算重复独立试验中的概率时，帕斯卡三角形会自然地出现。当一枚均匀硬币被抛掷 n 次时，恰好出现 r 次正面的方式数为 C(n, r)。

For example, if a coin is tossed 4 times, the probabilities of getting 0, 1, 2, 3, or 4 heads are proportional to row 4 of the triangle: 1, 4, 6, 4, 1. Dividing by 16 gives the actual probabilities.

例如，如果一枚硬币被抛掷 4 次，得到 0、1、2、3 或 4 次正面的概率与三角形第 4 行成正比：1, 4, 6, 4, 1。除以 16 即得到实际概率。

Heads 正面数	0	1	2	3	4
Probability 概率	1/16	4/16	6/16	4/16	1/16

This distribution is known as the binomial distribution, one of the foundations of statistics.

这种分布被称为二项分布，是统计学的基础之一。

8. Counting Paths on a Grid | 网格上的路径计数

Pascal’s triangle can also solve grid-path problems. Suppose you start at the top-left corner of a grid and can only move right or down. The number of different shortest paths to a given point equals the corresponding entry in Pascal’s triangle.

帕斯卡三角形还可以解决网格路径问题。假设你从网格的左上角出发，只能向右或向下移动。到达某个点的最短路径条数，等于帕斯卡三角形中对应的数字。

For a 3 × 3 grid, the number of paths to each intersection forms a small Pascal triangle. More generally, the number of paths from one corner to another is C(m + n, m), where m and n are the number of steps in each direction.

对于一个 3 × 3 的网格，到达每个交叉点的路径条数会形成一个小帕斯卡三角形。更一般地，从一个角到另一个角的路径数为 C(m + n, m)，其中 m 和 n 分别是两个方向上的步数。

Number of paths = C(m + n, m) = (m + n)! / (m! × n!)

This idea extends to many real-world problems involving routes, scheduling, and network reliability.

这一思想可推广到许多涉及路线、调度和网络可靠性的实际问题中。

9. Binomial Expansion and Powers | 二项式展开与幂

Pascal’s triangle provides a fast way to expand powers of binomials. The coefficients of (a + b)ⁿ are exactly the entries of row n of the triangle.

帕斯卡三角形为二项式幂的展开提供了快速方法。(a + b)ⁿ 的系数恰好是三角形第 n 行的各项。

(a + b)⁵ = a⁵ + 5a⁴b + 10a³b² + 10a²b³ + 5ab⁴ + b⁵

The exponents on a decrease from n to 0, while the exponents on b increase from 0 to n. This pattern allows students to write expansions quickly and accurately without performing lengthy multiplication.

a 的指数从 n 递减到 0，b 的指数从 0 递增到 n。这种模式使学生无需进行冗长的乘法，就能快速准确地写出展开式。

10. Interesting Patterns | 其他有趣规律

Beyond the basic properties, Pascal’s triangle contains many fascinating visual and number-theoretic patterns.

除了基本性质外，帕斯卡三角形还包含许多迷人的视觉和数论规律。

The diagonals of the triangle alternate between different sequences: the first diagonal is all 1s, the second is the natural numbers 1, 2, 3, 4, …, the third is the triangular numbers 1, 3, 6, 10, …, and the fourth is the tetrahedral numbers.
三角形的各条斜线包含不同序列：第一条斜线全是 1，第二条是自然数 1, 2, 3, 4, …，第三条是三角形数 1, 3, 6, 10, …，第四条是四面体数。
If all odd numbers are shaded, a fractal-like pattern called the Sierpiński triangle emerges. This self-similar pattern appears in many areas of art and nature.
如果将所有奇数涂黑，会出现一个类似分形的图案，称为谢尔宾斯基三角形。这种自相似模式出现在艺术和自然的许多领域。
Each row of Pascal’s triangle corresponds to the powers of 11: row 0 is 11⁰ = 1, row 1 is 11¹ = 11, row 2 is 11² = 121, and row 3 is 11³ = 1331. When the numbers in a row are two-digit, carrying must be applied.
帕斯卡三角形的每一行对应 11 的幂：第 0 行是 11⁰ = 1，第 1 行是 11¹ = 11，第 2 行是 11² = 121，第 3 行是 11³ = 1331。当一行中的数字变成两位数时，需要应用进位。

11. Conclusion | 总结

Pascal’s triangle is far more than a neat arrangement of numbers. It links together algebra, combinatorics, probability, and geometry in ways that reveal the underlying unity of mathematics. By understanding its patterns, students can solve problems more efficiently and appreciate the beauty of mathematical structure.

帕斯卡三角形远不止是一种整齐的数字排列。它以揭示数学内在统一性的方式，将代数、组合学、概率论和几何学联系在一起。通过理解其中的规律，学生可以更高效地解决问题，并欣赏数学结构之美。

Whether you are expanding a polynomial, counting paths, or calculating probabilities, Pascal’s triangle offers a simple and powerful tool. Mastering it is an essential step in any mathematics journey.

无论是展开多项式、计数路径还是计算概率，帕斯卡三角形都提供了一个简单而强大的工具。掌握它是任何数学学习旅程中必不可少的一步。

Published by TutorHao | Mathematics Revision Series | aleveler.com

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

Pascal’s Triangle: Patterns and Applications | 帕斯卡三角形的规律与应用