Binomial Coefficients

students, imagine you are helping run a school club event 🎉. You need to choose a team, count possible sandwiches, or decide how many ways to answer a multiple-choice quiz. In all of these situations, counting matters. Binomial coefficients are one of the most important tools in discrete mathematics for counting selections when order does not matter. They connect directly to combinations, the binomial theorem, and many counting problems in real life.

By the end of this lesson, you should be able to:

explain what binomial coefficients mean and why they are important,
use standard notation such as $\binom{n}{k}$ correctly,
apply counting reasoning to compute binomial coefficients,
connect binomial coefficients to combinations and other counting ideas in Counting I,
recognize how binomial coefficients appear in algebra, probability, and problem solving.

What Is a Binomial Coefficient?

A binomial coefficient is written as $\binom{n}{k}$ and is read as “$n$ choose $k$.” It counts the number of ways to choose $k$ objects from a set of $n$ different objects when order does not matter.

For example, if a class has $5$ students and a teacher wants to choose $2$ class representatives, then the number of possible pairs is $\binom{5}{2}$. The pair of Alex and Maria is the same as Maria and Alex, so order is not important. That is exactly the kind of situation binomial coefficients count.

The notation comes from algebra and combinatorics, especially because these numbers appear in the expansion of expressions like $(x+y)^n.$ That is why they are called “binomial” coefficients: they are the coefficients that show up when expanding a binomial expression, which has two terms.

The general formula is

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

where $n!$ means factorial, so $n! = n(n-1)(n-2)\cdots 2\cdot 1$, and by definition $0! = 1$.

This formula works only when $0 \le k \le n$. If $k>n$, then $\binom{n}{k}=0$ because you cannot choose more items than you have.

How to Understand $\binom{n}{k}$

The factorial formula can look complicated at first, but the meaning is simple. students, think of choosing a group in two steps:

Count the number of ways to arrange $k$ chosen objects out of $n$.
Remove the extra counting caused by order.

Suppose you want to choose $k$ people from $n$ people. If order mattered, you would use permutations. The number of ordered arrangements is

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

But a chosen group of $k$ people can be arranged in $k!$ different orders. Since a combination ignores order, divide by $k!$:

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

This shows how binomial coefficients connect directly to earlier counting topics such as permutations and combinations. They are not separate from those ideas; they are the standard numerical form of combinations.

Example: Choosing a Pizza Topping Set 🍕

A pizza shop has $6$ toppings, and you want to choose $3$ of them. If the toppings are pepperoni, mushrooms, olives, onions, peppers, and sausage, how many different topping sets are possible?

Since the order of toppings does not matter, the answer is

$$\binom{6}{3}=\frac{6!}{3!3!}=\frac{720}{6\cdot 6}=20.$$

So there are $20$ possible topping combinations.

Notice what is not counted separately. Choosing pepperoni, mushrooms, and olives is the same as choosing olives, pepperoni, and mushrooms. Binomial coefficients count the set, not the order.

Fundamental Properties of Binomial Coefficients

Binomial coefficients have several useful properties that make counting easier.

1. Symmetry

A very important identity is

$$\binom{n}{k}=\binom{n}{n-k}.$$

This makes sense because choosing $k$ items to include is the same as choosing $n-k$ items to leave out.

For example,

$$\binom{8}{3}=\binom{8}{5}.$$

If you are choosing $3$ students to form a committee from $8$ students, that is the same as choosing which $5$ students are not on the committee.

2. Boundary Values

Some values are especially easy:

$$\binom{n}{0}=1, \qquad \binom{n}{n}=1.$$

There is exactly one way to choose nothing, and exactly one way to choose all $n$ objects.

Also,

$$\binom{n}{1}=n.$$

There are $n$ ways to choose one item from $n$ items.

3. Pascal’s Rule

Another key rule is

$$\binom{n}{k}=\binom{n-1}{k-1}+\binom{n-1}{k}.$$

This is called Pascal’s rule. It can be explained by thinking about one special item in a set of $n$ objects.

Suppose you are choosing $k$ people from a group of $n$. Pick one person, say Sam. Any valid group of $k$ people either:

includes Sam, or
does not include Sam.

If the group includes Sam, then you still need $k-1$ people from the remaining $n-1$ people, which gives $\binom{n-1}{k-1}$. If the group does not include Sam, then you choose all $k$ people from the remaining $n-1$, which gives $\binom{n-1}{k}$. Adding these cases gives Pascal’s rule.

This rule is the foundation of Pascal’s triangle, a triangular pattern of binomial coefficients.

Pascal’s Triangle and Patterns

Pascal’s triangle is built by starting with $1$ at the top, then placing $1$’s on the sides, and filling each middle position by adding the two numbers above it.

The first few rows are:

$\begin{array}{ccccccc}$

&&&&1&&\\

&&&1&&1&&\\

&&1&&2&&1&&\\

&1&&3&&3&&1&\\

1&&4&&6&&4&&1

$\end{array}$

Each row gives the coefficients of $(x+y)^n$. For example, the row $1,3,3,1$ corresponds to $$(x+y)^3=x^3+3x^2y+3xy^2+y^3.$

This is one of the most famous uses of binomial coefficients. The coefficients tell how many times each term appears when expanding the power.

Example: Expanding a Small Binomial

Expand $$(a+b)^2.$$

Using binomial coefficients,

$$(a+b)^2=\binom{2}{0}a^2b^0+\binom{2}{1}a^1b^1+\binom{2}{2}a^0b^2.$$

Since $\binom{2}{0}=1$, $\binom{2}{1}=2$, and $\binom{2}{2}=1$, we get

$$(a+b)^2=a^2+2ab+b^2.$$

The middle term has coefficient $2$ because there are two ways to choose one $b$ from two factors.

Binomial Coefficients in Counting Problems

Binomial coefficients appear whenever a counting problem asks for a group of items with no order. Here are some common situations.

Choosing a Committee

If a club has $12$ members and needs a $4$-person committee, then the number of committees is

$$\binom{12}{4}=\frac{12!}{4!8!}=495.$$

This is a classic combination problem.

Selecting Answers on a Test

If a student answers $5$ questions out of $10$ by guessing which ones to attempt, the number of ways to choose the questions is

$$\binom{10}{5}=252.$$

This counts the selection of questions, not the actual answer choices.

Counting Binary Strings

How many binary strings of length $n$ have exactly $k$ ones? The answer is

$$\binom{n}{k}.$$

Why? Because you choose which $k$ positions will contain $1$’s, and the remaining positions must be $0$’s.

For example, the number of binary strings of length $5$ with exactly $2$ ones is

$$\binom{5}{2}=10.$$

One such string is $10100$.

How Binomial Coefficients Fit into Counting I

students, binomial coefficients bring together many counting ideas from the broader topic of Counting I.

The sum rule helps when a problem breaks into separate cases.
The product rule helps when choices happen in stages.
Permutations count ordered arrangements.
Combinations count unordered selections.
Binomial coefficients are the standard notation and formulas for combinations.

So binomial coefficients are not isolated facts. They are the numerical language of combinations and a bridge to algebra through the binomial theorem.

They also help with reasoning by cases. Pascal’s rule is a perfect example: a counting problem is split into two cases, then the results are added. That is a direct use of the sum rule.

Binomial coefficients also help in probability. If each outcome is equally likely, the number of favorable choices is often a binomial coefficient. This is especially important in problems involving exactly $k$ successes out of $n$ trials.

Conclusion

Binomial coefficients are one of the central tools in discrete mathematics because they count selections where order does not matter. The notation $\binom{n}{k}$ means “$n$ choose $k$,” and it can be computed using

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

You have seen important properties such as symmetry, boundary values, and Pascal’s rule. You have also seen how binomial coefficients appear in real counting problems, binary strings, and expansions like $$(x+y)^n.$$

Understanding binomial coefficients strengthens your skills in Counting I because it connects permutations, combinations, the sum and product rules, and algebraic patterns into one powerful idea. students, when you see a counting problem that asks for a selection with no order, think of $\binom{n}{k}$ first. ✅

Study Notes

$\binom{n}{k}$ is read as “$n$ choose $k$” and counts unordered selections.
The formula is $\binom{n}{k}=\frac{n!}{k!(n-k)!}$.
Binomial coefficients are used for combinations, not permutations.
Symmetry: $\binom{n}{k}=\binom{n}{n-k}$.
Boundary values: $\binom{n}{0}=1$ and $\binom{n}{n}=1$.
Pascal’s rule: $\binom{n}{k}=\binom{n-1}{k-1}+\binom{n-1}{k}$.
Pascal’s triangle lists binomial coefficients row by row.
The coefficients in the expansion of $(x+y)^n$ are binomial coefficients.
In counting problems, choose binomial coefficients when order does not matter.
In binary strings of length $n$ with exactly $k$ ones, the count is $\binom{n}{k}$.