What is Pascal's triangle?

Pascal's triangle is a triangular array of integers where row n contains the binomial coefficients n choose 0 through n choose n. Each interior entry is the sum of the two entries directly above it, and the edges are all 1. It encodes binomial coefficients, the expansion of a plus b to the n, and many counting identities.

What is Pascal's identity?

Pascal's identity states that the binomial coefficient n choose r equals n minus 1 choose r minus 1 plus n minus 1 choose r. Every interior cell of Pascal's triangle is the sum of the two cells directly above it, which gives a way to build the triangle row by row without computing factorials.

What is the hockey-stick identity?

The hockey-stick identity says that summing a diagonal in Pascal's triangle starting at column r and ending at row n equals the cell one row below and one column to the right. Formally, the sum from i equals r to n of i choose r equals n plus 1 choose r plus 1. The shape of the diagonal plus the result cell resembles a hockey stick.

Why do the rows of Pascal's triangle sum to powers of 2?

Row n of Pascal's triangle contains the counts of subsets of an n-element set grouped by size. Summing across all sizes counts every subset, and there are 2 to the n subsets since each element is independently included or excluded. So row n sums to 2 to the n.

What is the connection between Pascal's triangle and the binomial theorem?

The coefficients in the expansion of a plus b to the n are exactly the binomial coefficients n choose r for r from 0 to n. These are precisely the values in row n of Pascal's triangle. So the triangle is a lookup table for binomial expansions: row 4 gives the coefficients 1, 4, 6, 4, 1 for a plus b to the 4.

Pascal's Triangle: Binomial Coefficients

Key Terms

Pascal's triangle — a triangular array of integers where row

n

contains the binomial coefficients

\binom{n}{0}, \binom{n}{1}, \dots, \binom{n}{n}

. Each interior entry equals the sum of the two entries directly above it; the edges are all

1

.

Binomial coefficient — the number of ways to choose

r

items from

n

distinct items without order. Equivalently the coefficient of

a^{n-r} b^r

in the expansion of

(a + b)^n

. Computed as

\binom{n}{r} = n! / (r! \cdot (n-r)!)

.

Pascal's identity — the recurrence that builds the triangle:

\binom{n}{r} = \binom{n-1}{r-1} + \binom{n-1}{r}

. Every interior cell is the sum of the two cells above it.

Hockey-stick identity — a diagonal sum:

\sum_{i=r}^{n} \binom{i}{r} = \binom{n+1}{r+1}

. The starting diagonal cells form the stick; the cell below-and-across is the puck.

Row sum — the cells in row n sum to 2ⁿ, counting the total number of subsets of an

n

-element set across all sizes.

Symmetry — within each row,

\binom{n}{r} = \binom{n}{n-r}

. Choosing

r

items to include is the same as choosing

n - r

items to exclude.

Focus — the cell currently selected by clicking. The four modes highlight different relatives of the focus cell.

Getting Started

The tool opens with

N = 6

(rows

0

through

6

) and the cell

\binom{4}{2} = 6

already focused under Pascal's identity mode. The scene splits into four areas:

• The triangle — clickable cells arranged in rows

0

through

N

. The focused cell is filled in accent blue; its relatives (depending on mode) appear with amber or green outlines.

• A polynomial banner below the triangle showing the focused row's expansion of

(a + b)^n

. The triangle's row values are the polynomial's coefficients.

• A mode group in the control bar with four buttons: Pascal's identity, Hockey stick, Row sum, Symmetry.

• A right info panel showing the factorial breakdown

\binom{n}{r} = n! / (r! \cdot (n-r)!)

for the focused cell, plus an identity-specific arithmetic block.

To explore:

• Click any cell to focus it. The triangle re-highlights and the right panel updates with the factorial breakdown and the active identity's specific arithmetic for that cell.

• Switch modes to see the same focused cell through a different identity.

• Adjust N to add or remove rows.

• Clear selection to return to an unfocused view.

Unlike the ten counting scenes in this section, nothing here animates. The triangle is a static object to be interrogated: the four lenses are questions you ask of a cell, not steps a build passes through — which is why the tool opens already focused rather than waiting for a Play button.

That makes the reading order yours to choose. A useful circuit is to keep one cell selected and cycle all four modes: the identity shows where the number came from, the hockey stick where it accumulates, the row sum what its neighbours total, and symmetry which other cell says the same thing.

Clicking Cells and Focus

DemoFocus, N, clear

Step 0 of 5

Every cell in the triangle is clickable. Clicking a cell sets it as the focus — the anchor for whichever identity mode is currently active.

The focused cell renders in solid accent blue with white text, and its label

C(n, r)

appears just below it. The right panel immediately shows:

• The selected coefficient — *Selected:

C(n, r) = v

*.

• The factorial breakdown —

C(n, r) = n!/(r! \cdot (n-r)!) = v

, fully expanded.

• A short interpretation reminder — *

C(n, r)

counts the number of ways to choose

r

items from a set of

n

distinct items*.

• The current mode's identity, applied to this cell.

If you reduce

N

below the focused cell's row, the focus clears automatically. Press Clear selection in the control bar to clear focus manually; the cells return to their default outlined state and the right panel shows a hint to click any cell.

The polynomial banner always shows the row of the focused cell (or row

0

when nothing is focused).

No selection, frozen

Every cell in its dashed neutral outline, no connectors, the banner fallen back to row 0 — the triangle as a plain table of values.

The frozen frame above is the triangle with nothing selected: every cell in its dashed neutral outline, no connectors, and the banner fallen back to row

0

— the bare

(a + b)^0 = 1

.

Worth a moment before clicking anything: unfocused, the triangle is just a table of

\binom{n}{r}

values, and its numbers are already meaningful — every entry counts subsets of some size. The lenses add nothing to the numbers; they only draw the relationships that were always there between them.

Mode 1 — Pascal's Identity

DemoEdges, apex, interior

Step 0 of 4

Pascal's identity says every interior cell is the sum of the two cells immediately above it:

\binom{n}{r} = \binom{n-1}{r-1} + \binom{n-1}{r}

In this mode, the focused cell is connected to its two parents by dashed accent lines, and both parents are outlined in amber as related cells. The right panel shows the concrete arithmetic — for example, with focus on

\binom{4}{2}

:

\binom{4}{2} = \binom{3}{1} + \binom{3}{2} = 3 + 3 = 6

.

Edge cases:

• Apex

\binom{0}{0} = 1

has no parents — by convention.

• Left edge

\binom{n}{0}

has only one parent

\binom{n-1}{0}

, which is always

1

, so left edges are all

1

.

• Right edge

\binom{n}{n}

has only one parent

\binom{n-1}{n-1}

, also

1

, so right edges are all

1

.

This identity is what builds the triangle — knowing the top row, you can construct every subsequent row by addition alone, without ever computing factorials.

Pascal’s identity on C(4, 2), frozen

The focus in accent blue with its two parents in amber and dashed lines running down into it: 3 + 3 = 6, drawn rather than computed.

The frozen frame above is exactly the worked example:

\binom{4}{2}

in accent blue, its two parents

\binom{3}{1}

and

\binom{3}{2}

in amber, and dashed lines running down from each into the focus. Three plus three, drawn.

The identity's combinatorial proof is worth carrying alongside the picture: single out one of the

n

items. Subsets of size

r

either contain it — leaving

\binom{n-1}{r-1}

ways to fill the rest — or they don't, leaving

\binom{n-1}{r}

. Two dashed lines, two cases, no arithmetic required. That argument recurs across the other identities.

Mode 2 — Hockey Stick

DemoStick and puck

Step 0 of 4

The hockey-stick identity says a diagonal of cells starting from a column-

r

entry sums to the cell one row below and one column to the right:

\sum_{i=r}^{n} \binom{i}{r} = \binom{n+1}{r+1}

In this mode, treat the focused cell as the puck — the cell where all the action ends up. The triangle highlights the diagonal stick (cells one column to the left, running from the puck's row back up to the row matching that column) and draws an amber path connecting them down to the puck.

For example, focusing on

\binom{5}{2} = 10

:

\binom{1}{1} + \binom{2}{1} + \binom{3}{1} + \binom{4}{1} = 1 + 2 + 3 + 4 = 10 = \binom{5}{2}

.

The right panel shows the full chain of column-

1

cells summing to the puck.

The mode reveals why the formula for triangular numbers

1 + 2 + \dots + n = \binom{n+1}{2}

holds — it's just the column-

1

hockey stick.

If the focused cell is in column

0

, no valid stick exists; the right panel shows a hint to pick a cell with column ≥

1

.

Hockey stick on C(5, 2), frozen

The amber path runs up column 1 through 1, 2, 3, 4 and hooks right into the puck — the bend that gives the identity its name.

The frozen frame above is the worked example drawn: the amber path runs up column

1

through

1, 2, 3, 4

and then hooks right into the puck

\binom{5}{2} = 10

. The bend at the end is where the identity gets its name.

The proof mirrors the shape. To choose

2

items from

\{1, \dots, 5\}

, ask what the larger item is: if it is

i

, the smaller one has

i - 1

choices below it. Summing

1 + 2 + 3 + 4

over the possible maxima gives every pair exactly once — which is also why the triangular numbers live along this diagonal, as the identities section notes.

Mode 3 — Row Sum

DemoRow sum and symmetry

Step 0 of 5

The row-sum identity says the cells in row

n

add up to

2^n

:

\sum_{r=0}^{n} \binom{n}{r} = 2^n

In this mode, every cell in the focused row (other than the focus itself) is outlined in amber as related. A label appears on the right edge of the row showing *sum =

2^n

*. The right panel lists the full sum:

For row

4

:

\binom{4}{0} + \binom{4}{1} + \binom{4}{2} + \binom{4}{3} + \binom{4}{4} = 1 + 4 + 6 + 4 + 1 = 16 = 2^4

.

Combinatorial interpretation: each binomial coefficient

\binom{n}{r}

counts subsets of size

r

from an

n

-element set. Summing across all sizes counts all subsets, of which there are

2^n

(each of the

n

elements is independently in or out).

This identity is the source of many later results — for example, the expected size of a random subset of

\{1, \dots, n\}

is

n/2

because the row sum decomposition is symmetric around

r = n/2

.

Row sum on row 4, frozen

The whole row lit end to end with the right-edge label reading sum = 16 = 2⁴: every cell participates, the focus is just where you clicked.

The frozen frame above shows row

4

lit end to end with the right-edge label reading *sum = 16 = 2⁴*. Every cell of the row participates; the focus is merely where you clicked.

The doubling is visible in the geometry too: each row is built from the one above by Pascal's rule, and since every entry above contributes to exactly two entries below, each row total is twice its predecessor. Powers of two are what repeated pairwise addition inevitably produces.

Mode 4 — Symmetry

The symmetry identity says each row is a palindrome:

\binom{n}{r} = \binom{n}{n - r}

In this mode, the focused cell and its mirror across the row's center are both highlighted, and a curved green arc connects them through the row label above.

For example, focusing on

\binom{7}{2} = 21

:

\binom{7}{2} = \binom{7}{5} = 21

.

Combinatorial reading: choosing

r

items to include in a selection is the same as choosing

n - r

items to leave out. The two selections describe identical events from opposite sides.

Special case — the center of an even-length row maps to itself. Focusing on

\binom{4}{2}

when

n - r = r

gives a self-symmetry; the right panel notes this and skips the arc since the focus and the mirror coincide.

This identity is why the triangle is left-right symmetric and why so many identities have dual forms — you can always swap

r

with

n - r

to get an equivalent statement.

Symmetry on C(7, 2), frozen

The focus in blue, its mirror C(7, 5) in green, and a green arc arching between them — the same 21 read from either end of the row.

The frozen frame above is that example with the triangle extended to row

7

:

\binom{7}{2}

in blue, its mirror

\binom{7}{5}

in green, and the arc arching between them over the row.

Symmetry is the identity that most often saves work in practice. Faced with

\binom{100}{97}

, nobody expands

97!

— they read it as

\binom{100}{3}

and multiply three numbers. Whenever

r

exceeds half of

n

, the mirror cell is the easier computation, and the arc above says the two are the same number seen from opposite ends of the row.

The Polynomial Banner

Below the triangle sits a banner labeled *ROW n = COEFFICIENTS OF (a + b)^n*, showing the full expansion of the focused row's polynomial.

For row

4

:

(a + b)^4 = a^4 + 4 a^3 b + 6 a^2 b^2 + 4 a b^3 + b^4

This is the binomial theorem: the coefficient of

a^{n-r} b^r

is exactly

\binom{n}{r}

. The triangle's row values are the polynomial's coefficients, in order.

The banner updates whenever you focus a cell in a different row, making it easy to see why each row of Pascal's triangle answers two questions at once:

• How many subsets of size

r

exist in an

n

-element set?

• What is the coefficient of

a^{n-r} b^r

when you multiply

(a + b)

by itself

n

times?

For higher

n

the polynomial is rendered at a smaller font to fit; the actual values remain accurate. The banner color matches the formula card styling used elsewhere in the tool.

What Are Binomial Coefficients

The binomial coefficient

\binom{n}{r}

— read n choose r — is one of the most important numbers in combinatorics. It admits several equivalent definitions:

Counting subsets.

\binom{n}{r}

is the number of

r

-element subsets of an

n

-element set.

Polynomial coefficient.

\binom{n}{r}

is the coefficient of

a^{n-r} b^r

in

(a + b)^n

. This is the binomial theorem:

(a + b)^n = \sum_{r=0}^{n} \binom{n}{r} a^{n-r} b^r

Factorial formula.

\binom{n}{r} = \dfrac{n!}{r! \, (n - r)!}

.

Recursive definition. Pascal's rule

\binom{n}{r} = \binom{n-1}{r-1} + \binom{n-1}{r}

with edge values

\binom{n}{0} = \binom{n}{n} = 1

.

Examples:

•

\binom{5}{2} = 10

: there are

10

ways to choose

2

items from

5

, the coefficient of

a^3 b^2

in

(a+b)^5

— and the hockey-stick puck at the end of the column-1 diagonal.

•

\binom{52}{5} = 2{,}598{,}960

: the number of

5

-card poker hands from a standard deck.

•

\binom{10}{5} = 252

: middle term of

(a+b)^{10}

, and the maximum entry of row

10

.

For deeper coverage including identities, generating functions, and applications, see the binomial coefficients section on the combinations theory page.

Why These Identities Matter

The four identities highlighted in this tool aren't isolated curiosities — they're the workhorses of combinatorial proofs and probability calculations. Each has its own lens: Pascal's identity, hockey stick, row sum, and symmetry.

Pascal's identity is the recursive backbone. It lets you compute any

\binom{n}{r}

from smaller ones without ever multiplying or dividing factorials. It also gives a combinatorial proof: pick a specific element; either you include it (giving

\binom{n-1}{r-1}

) or you don't (giving

\binom{n-1}{r}

).

Hockey-stick appears in counting problems where you fix the maximum element of a subset. The number of subsets of

\{1, \dots, n+1\}

with

r+1

elements is

\binom{n+1}{r+1}

, and grouping by the max element gives the diagonal sum.

Row sum $2^n$ is the source of countless probability results — it underlies binomial distribution normalization, the cardinality of power sets, and the fact that

n

-bit binary strings number

2^n

.

Symmetry is invoked whenever a problem becomes easier from the complementary viewpoint — for example, computing

\binom{100}{97}

as

\binom{100}{3} = 161{,}700

rather than evaluating

97!

directly.

Together, these four are sufficient to derive most other binomial identities by combination and induction.

Related Concepts

Simple combination — the no-repetition unordered selection. Formula

\binom{n}{r}

exactly; the triangle is the lookup table for all such values.

Binomial theorem —

(a + b)^n = \sum_{r=0}^{n} \binom{n}{r} a^{n-r} b^r

. The triangle visualizes this expansion row by row, as the banner shows.

Multinomial coefficient — generalizes the binomial to more than two parts:

\binom{n}{n_1, n_2, \dots, n_k} = n! / (n_1! \cdots n_k!)

. The binomial is the

k = 2

case.

Combination with repetition — counts multisets,

\binom{n + r - 1}{r}

. Different formula, different position in the triangle.

Permutation — ordered selections,

n!/(n-r)!

. Related but distinct from the unordered combinations shown here.

Catalan numbers — appear in Pascal's triangle along a specific diagonal:

C_n = \binom{2n}{n} / (n + 1)

.

Vandermonde's identity —

\binom{m + n}{r} = \sum_{k} \binom{m}{k} \binom{n}{r-k}

. Another classical binomial identity expressible through the triangle.

Lucas's theorem — for prime

p

,

\binom{m}{n} \bmod p

is computable digit-by-digit in base

p

. Reveals fractal structures (Sierpiński patterns) when the triangle is reduced modulo a prime.

Binomial coefficient calculator — to compute

\binom{n}{r}

for larger

n

, see the n choose r calculator.