Binomial coefficients and Pascal’s triangle
The binomial coefficient \(C(n,k)\) (also written \(\binom{n}{k}\)) counts how many ways you can choose
\(k\) objects from \(n\) distinct objects when order does not matter.
For example, if you have \(n=10\) students and you need a committee of \(k=3\), then \(C(10,3)\) is the number of possible committees.
This “counting” meaning explains why \(C(n,k)\) is always a non-negative integer.
Definition and symmetry
A standard formula is
\[
C(n,k)=\frac{n!}{k!(n-k)!}.
\]
While this definition is compact, directly evaluating factorials can become unwieldy for large \(n\).
A useful property is symmetry:
\[
C(n,k)=C(n,n-k).
\]
Intuitively, choosing \(k\) items to include is equivalent to choosing the \(n-k\) items to exclude.
Computationally, this means we can often replace \(k\) with \(\min(k,n-k)\) to reduce work.
Pascal’s triangle and recursion
Binomial coefficients appear in Pascal’s triangle, where each row \(n\) lists the numbers
\(C(n,0),C(n,1),\dots,C(n,n)\).
The triangle is built from a simple recursion:
\[
C(n,k)=C(n-1,k-1)+C(n-1,k), \quad C(n,0)=C(n,n)=1.
\]
This identity is easy to remember: each entry equals the sum of the two entries above it.
It also matches a counting argument: to choose \(k\) items from \(n\), either you include a particular item (then choose \(k-1\) from the remaining \(n-1\))
or you exclude it (then choose \(k\) from the remaining \(n-1\)).
Row sums and the link to \(2^n\)
One of the most important checks is the row-sum identity:
\[
\sum_{k=0}^{n} C(n,k)=2^n.
\]
Why? The left side counts all subsets of an \(n\)-element set by grouping them according to size:
there are \(C(n,0)\) subsets of size 0, \(C(n,1)\) subsets of size 1, and so on.
The right side counts all subsets another way: each element is either “in” or “out,” giving \(2\) choices per element and \(2^n\) total subsets.
This tool computes the row and verifies that the sum matches \(2^n\), which is a strong consistency check.
How to use this tool
Enter a row index \(n\) to generate the full list \(C(n,0)\) through \(C(n,n)\).
If you also enter a specific \(k\), the tool highlights \(C(n,k)\) and reminds you of symmetry with \(C(n,n-k)\).
The interactive canvas visualizes Pascal’s triangle up to a chosen display cap; you can pan and zoom for readability and press Play
to animate the triangle filling row-by-row.
As a next step, these coefficients feed directly into the binomial theorem for expanding \((a+b)^n\).
At a more advanced (university) level, number-theory results like Lucas’s theorem describe \(C(n,k)\) modulo a prime \(p\),
revealing patterns in Pascal’s triangle when you color entries by divisibility.
