Pascal's Triangle: Construction and Patterns
You'll learn how to build Pascal's Triangle row by row and recognize the fundamental symmetry, sum, and diagonal patterns hidden within it.
What Is Pascal's Triangle?
Pascal's Triangle is a triangular array of numbers where each entry is the sum of the two numbers directly above it. It's named after mathematician Blaise Pascal, though it was studied centuries earlier in other cultures. This structure elegantly organizes binomial coefficients—the very combination values C(n,r) you've been working with.
Building the Triangle
Start with a single 1 at the top (row 0). Each new row begins and ends with 1. Every interior number is the sum of the two numbers above-left and above-right:
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
Notice that row n contains the values C(n,0), C(n,1), C(n,2), ..., C(n,n). For example, row 4 gives you 1, 4, 6, 4, 1, which are exactly C(4,0) through C(4,4).
Key Patterns
Symmetry: Each row is symmetric—C(n,r) = C(n,n-r). The triangle mirrors itself down the middle.
Row Sums: Add all numbers in row n, and you get 2ⁿ. For instance, row 3 sums to 1+3+3+1 = 8 = 2³. This follows from the binomial theorem.
Diagonals: The outermost diagonals are all 1's. The second diagonal contains the natural numbers 1, 2, 3, 4, ... The third diagonal holds triangular numbers 1, 3, 6, 10, ..., and deeper diagonals reveal even more sequences.
Think of Pascal's Triangle as a map of combinations—every path-counting, selection, or binomial expansion problem connects back to this elegant structure.
Key Takeaway: Pascal's Triangle visually organizes binomial coefficients C(n,r), revealing symmetry, row sums of 2ⁿ, and rich diagonal patterns that unify counting problems across combinatorics.