Pascal's Triangle: Patterns Hidden in a Simple Construction

Start with the number 1. Below it, write two 1s side by side. Below that, write 1, 2, 1 (the middle 2 is the sum of the two 1s above). Continue: each new row starts and ends with 1, and every interior entry is the sum of the two entries directly above it.

You’ve just constructed Pascal’s triangle, named for Blaise Pascal (1623–1662), who studied it systematically in 1654. The triangle was actually known to Persian, Chinese, and Indian mathematicians centuries earlier — but Pascal’s treatise is what made it famous in the West.

The construction is so simple a child can extend it. The patterns inside are some of the most surprising in mathematics.

The triangle, drawn

The rule is simple: $\binom{n}{k} = \binom{n-1}{k-1} + \binom{n-1}{k}$. Or, in pictures: each entry equals the sum of the two entries above it.

Binomial coefficients

The first major discovery: the entries of Pascal’s triangle are the binomial coefficients. The $k$-th entry in row $n$ (counting from 0) is

$\binom{n}{k} = \frac{n!}{k!(n-k)!}.$

This is the number of ways to choose $k$ objects from $n$. So for example, the row 1, 4, 6, 4, 1 tells you: there is 1 way to choose 0 objects from 4, 4 ways to choose 1, 6 ways to choose 2, 4 ways to choose 3, 1 way to choose 4.

The connection to algebra is the binomial theorem:

$(x + y)^n = \sum_{k=0}^{n} \binom{n}{k} x^{n-k} y^k.$

So the row of Pascal’s triangle is exactly the coefficients in $(x+y)^n$. Row 4 says $(x+y)^4 = x^4 + 4x^3 y + 6 x^2 y^2 + 4 x y^3 + y^4$.

This is one of the cleanest connections in elementary mathematics: a counting question (how many subsets) and an algebraic question (what’s $(x+y)^n$) have the same answer, and that answer is in the triangle.

Hidden patterns

Beyond binomial coefficients, the triangle contains an extraordinary number of other patterns.

Powers of 2: the sum of each row is $2^n$. Row 0: 1. Row 1: 2. Row 2: 4. Row 3: 8. And so on.

Fibonacci numbers: the sums along the shallow diagonals give Fibonacci numbers! Specifically:

The Fibonacci sequence (see our Fibonacci post) is hidden in the triangle’s shallow diagonals — a connection that nobody could have predicted from the simple recursive rule.

The Sierpinski triangle: shade in the odd entries of Pascal’s triangle. The pattern that emerges is the Sierpinski triangle — a famous fractal:

This is one of the most striking patterns in mathematics. A simple combinatorial rule (entries are sums of two above) plus a number-theoretic question (which entries are odd) produces a fractal that mathematicians studied for entirely different reasons. (See our fractals piece for the broader fractal context.)

The pattern works for any prime, not just 2. Color the entries by their residue mod 3, and you get a different self-similar pattern. Lucas’s theorem (1878) explains the mathematical reason: $\binom{n}{k} \mod p$ depends in a precise way on the base-$p$ representations of $n$ and $k$.

Other patterns and identities

Pascal’s triangle hides many additional identities and patterns:

Hockey stick identity: pick any entry; the sum of entries on the diagonal going up-right is the entry one row down and one column right of the chosen entry. Drawing it out gives a hockey-stick shape.

Triangular numbers: the third diagonal (1, 3, 6, 10, 15, 21, …) is the triangular numbers. The fourth diagonal (1, 4, 10, 20, 35, …) is the tetrahedral numbers.

Catalan numbers: hidden combinations of binomial coefficients give the Catalan numbers (1, 1, 2, 5, 14, 42, …), which count many combinatorial structures: Dyck paths, valid parenthesizations, triangulations of polygons.

Combinatorial identities: the sum of squares of entries in row $n$ equals the central entry of row $2n$, i.e., $\sum_k \binom{n}{k}^2 = \binom{2n}{n}$. (Vandermonde’s identity.)

Probability: row $n$ is the probability distribution of binomial outcomes ($n$ coin flips). Divide each entry by $2^n$ to get probabilities. Lots of statistics is encoded in the triangle.

The list goes on. Pascal’s triangle is one of those mathematical structures where the more you look, the more you find.

Where it appears

Beyond pure mathematics, Pascal’s triangle (and the binomial coefficients it tabulates) appears in:

Combinatorics: any counting problem involving “choose $k$ from $n$” uses these numbers. Lottery probabilities, card hands, sampling design — all binomial coefficient computations.

Probability and statistics: the binomial distribution describes the number of successes in $n$ independent trials. Its probability mass function is a row of the triangle (scaled).

Algorithm analysis: bounds in computer science often involve $\binom{n}{k}$. The number of $k$-subsets of an $n$-element set is fundamental to many computational problems.

Bioinformatics: counting alignments, paths in graphs, structural arrangements.

Computer graphics: Bézier curves of degree $n$ have $n+1$ control points and weights given by row $n$ of Pascal’s triangle. (See our Bézier curves piece.)

Networking: the probability of $k$ packet losses in $n$ transmissions is a binomial coefficient calculation.

What Pascal’s triangle teaches

The deepest lesson of Pascal’s triangle is that simple rules can encode profound structure. A trivial recursive construction (each entry = sum of two above) generates an object that contains, hidden inside, the binomial theorem, the Fibonacci sequence, the Sierpinski fractal, and countless combinatorial identities.

This is one of the recurring patterns of mathematics: short rules, infinite consequences. The same lesson appears in cellular automata, in chaos theory, in the Mandelbrot set — anywhere simple iterative rules produce complex output.

For students of mathematics, Pascal’s triangle is one of the most welcoming entry points into deeper structure. Anyone can extend the triangle. Anyone can spot the patterns. The connections to combinatorics and the binomial theorem follow naturally. The Sierpinski-fractal connection is a delightful surprise. Each insight is accessible without heavy prerequisites.

For working mathematicians, the triangle is a constant source of identities and connections. New patterns are still being found. Lucas’s theorem on $\binom{n}{k} \mod p$ has 21st-century generalizations. The Catalan number connection underlies an entire branch of algebraic combinatorics. The binomial coefficients connect to representation theory, special functions, and number theory.

A construction simple enough for a child to extend turns out to contain content that mathematicians at every level of expertise can study. That gap — accessibility plus depth — is rare and valuable. Pascal’s triangle is one of the cleanest examples of it. Pascal popularized it; the patterns inside have outlived him by 370 years and counting.

Frequently asked

Did Pascal really discover the triangle?

He didn't — the triangle was known to Persian, Chinese, and Indian mathematicians long before Pascal. Yang Hui (China, 13th century) and Al-Karaji (Persia, 11th century) both wrote about it. Halayudha in India described it around 950 CE. Pascal's 1654 'Treatise on the Arithmetical Triangle' was the first systematic Western treatment, so the European-language tradition named it after him.

Why does the triangle have so many patterns?

Because the simple recursive rule (each entry = sum of two above) intersects with so many other mathematical structures: binomial expansions, combinatorial counting, Fibonacci-like recurrences, divisibility patterns, fractal self-similarity. Each connection arose for independent reasons; the triangle just happens to be where they all meet.

Are there higher-dimensional analogs?

Yes. Pascal's tetrahedron extends to 3 dimensions: each face of layer n+1 is the corresponding face of Pascal's triangle, and entries inside come from trinomial coefficients. Higher-dimensional Pascal's simplices generalize further, and they're connected to multinomial coefficients.

Continue reading

Formula

The Binomial Theorem

A closed-form expansion of (a + b)^n — the identity that underlies combinatorics, probability, and the algebra of polynomials.

Read →Blog

The Birthday Paradox: Why 23 People Is All You Need

In a room of 23 people, the chance two share a birthday is greater than 50%. A closer look at one of the most counterintuitive results in elementary probability.

Read →Blog

The Pigeonhole Principle: One Idea, Endless Consequences

If you put 13 socks into 12 drawers, at least one drawer must contain at least 2 socks. The principle is obvious — and yet it proves theorems no other technique can reach.

Read →