On this concept: Formula

Not sure which lesson to do first? Find your level and get a plan →

Math · Statistics & Probability · Grade 9-12

Binomial Coefficient

The binomial coefficient (nk) counts the number of ways to choose k items from n distinct items ignoring order, and it's also the coefficient of an−kbk in the expansion of (a+b)n.

C(n,k)=n!k!(n−k)!
Venn diagram of Event A and Event BA two-event view of binomial coefficient.ABA ∩ B
A: Event A
B: Event B
A two-event view of binomial coefficient.

Quick Answer

The binomial coefficient (nk) counts the number of ways to choose k items from n distinct items ignoring order, and it's also the coefficient of an−kbk in the expansion of (a+b)n. Use it to count committees, pizza toppings, lottery tickets or card hands, or to expand a power like (x+2)5 without multiplying it out. Compute it as n!k!(n−k)! by canceling factorials, or read it from row n of Pascal's triangle.

Why This Matters

Listing works for 10 possibilities and fails for 10 million. (nk) counts selections of any size at once: a 6-from-49 lottery has (496)=13,983,816 possible tickets, which is why one ticket almost never wins. The same numbers are the coefficients of every (a+b)n and the counting factor inside the binomial probability formula, so an error here spreads into algebra and probability.

Intuitive Explanation

Choose 2 of the 4 friends Ana, Ben, Cy and Dee to come to a concert. List the pairs: AB, AC, AD, BC, BD, CD, so 6 ways. Now count another way: 4 choices for the first ticket and 3 for the second give 4×3=12 ordered picks, but every pair shows up twice (AB and BA), so 122=6. Dividing out the orderings is the whole idea of (nk)=n!k!(n−k)!: n!(n−k)! counts ordered picks, and dividing by k! removes the repeats.

Choosing who comes is the same as choosing who stays home, so (nk)=(nn−k). Picking 3 of 10 to come leaves 7 behind, and (103)=(107). Compute with the smaller number and cancel instead of multiplying out 10!: (103)=10⋅9⋅83⋅2⋅1=120.

The same numbers appear in algebra. In (a+b)3=(a+b)(a+b)(a+b), each term of the expansion takes a or b from each bracket. The term ab2 comes from choosing which 2 of the 3 brackets supply b, which can happen in (32)=3 ways, so (a+b)3=a3+3a2b+3ab2+b3.

When order matters, the count is bigger and (nk) is the wrong tool. A president and a vice-president from those 4 friends gives 4×3=12 outcomes, because "Ana president, Ben vice" differs from the reverse. If swapping two chosen items gives a different outcome, use a permutation.

Think of it like this. Picture n light switches in a row: choosing k items means flipping exactly k of them on. (nk) counts the possible on/off patterns. A pattern doesn't record the order you flipped the switches in, so order doesn't matter, and turning k on leaves n−k off, so (nk)=(nn−k).

Core idea. The binomial coefficient (nk) counts how many ways to pick k items from n when order doesn't matter.


When to Use

Use (nk) when you choose k items from n distinct ones and order doesn't matter: committees, teams, card hands, sets of toppings. It also gives the coefficient of an−kbk in (a+b)n. If positions or ranks matter (first place, president), use a permutation, n!(n−k)!. If items may be chosen more than once, or you need the probability of k successes, you need a different count or the binomial distribution.

Tip. Ask: Am I counting selections of k from n where order doesn't matter (or the matching expansion coefficient)?

How to Recognize It

Check whether the items are distinct, whether an item can be picked twice, and whether swapping two chosen items would give a different outcome.

  1. If you swap two of the chosen items, do you get the same outcome?

    Yes means order does not matter, so count with (nk): a committee of Ana and Ben is the same as Ben and Ana. No, as with president and vice-president, means order matters and you need a permutation, k! times larger.

  2. Is each item used at most once?

    Yes keeps you with (nk). If repeats are allowed, like choosing 3 scoops from 5 flavors where scoops can match, the count is (n+k−1k), which is (73)=35 here instead of (53)=10.

  3. Are you arranging all n items rather than choosing some of them?

    Yes means a factorial, n!: 5 books on a shelf can be ordered in 5!=120 ways. A binomial coefficient chooses a subset, and choosing all n gives (nn)=1, a single way.

  4. Does each trial or item come with a probability, so that the question wants a chance rather than a count?

    Yes means (nk) is only one factor; multiply it by pk(1−p)n−k as in the binomial distribution. A pure counting question stops at (nk).

Binomial Coefficient compared with Permutation, Binomial distribution, and Factorial

Every row counts, or uses, ways of picking items from a set. Ask two things: does order matter (permutation, or a factorial when every item is arranged), and is the answer a count or a probability (binomial distribution)?

Binomial Coefficient

Meaning
Use this when you must count order-free selections of k from n, or read off a coefficient in a binomial expansion.
Key test
Am I counting selections of k from n where order doesn't matter (or the matching expansion coefficient)?
Formula
C(n,k)=n!k!(n−k)!
Example
How many 2-person committees can be formed from 6 people?

Permutation

Meaning
Counts ordered arrangements, so order DOES matter.
Key test
Use when the arrangement or sequence matters, like ranking or seating.
Formula
P(n,k)=n!(n−k)!
Example
Gold/silver/bronze from 8 runners

Binomial distribution

Meaning
Uses (nk) inside a probability, not a bare count.
Key test
Use when each of k successes has a probability p and you want P(X=k).
Formula
(nk)pk(1−p)n−k
Example
Probability of exactly 3 heads in 5 flips

Factorial

Meaning
Counts arrangements of ALL items; a building block of (nk).
Key test
Use when arranging every item, not choosing a subset.
Formula
n!
Example
Orderings of all 5 books

Formula & Notation

C(n,k)=n!k!(n−k)!
(nk)=n!k!(n−k)! for 0≤k≤n; satisfies (nk)=(n−1k−1)+(n−1k) (Pascal's rule)

How to read it: (nk) reads 'n choose k'; also written C(n,k) or nCk

Worked Examples

Example 1 — Count the committees

Easy

How many 2-person committees can be formed from 6 people?
Show the steps and the answer
  1. Decide whether order matters: the committee {Ana, Ben} is the same as {Ben, Ana}.

    Committee members have no ranks, so each pair should be counted once; that calls for (62).

  2. Count ordered picks first: 6×5=30.

    There are 6 choices for the first member and 5 for the second.

  3. Divide by the 2!=2 orders of each pair: 302=15.

    Each committee appeared twice in the ordered count. This is (62)=6!2! 4! with the 4! canceled.

Answer: 15 committees

Takeaway: (nk) is the ordered count divided by k!, because each group of k appears in k! orders.

Example 2 — Order matters

Standard

From the same 6 people, how many ways to pick a president and a vice-president?
Show the steps and the answer
  1. Check whether swapping changes the outcome: Ana as president with Ben as vice differs from Ben as president with Ana as vice.

    The two seats have different roles, so order matters and (62) would undercount.

  2. Count seat by seat: 6 choices for president, then 5 for vice-president.

    Once the president is chosen, 5 people remain for the second role.

  3. Multiply: 6×5=30, which equals 2!×(62)=2×15.

    Each of the 15 committees can hand out its two roles in 2 ways.

Answer: P(6,2)=6×5=30

Takeaway: When roles or positions make the picks different, use a permutation; it is k! times the binomial coefficient.

Example 3 — Find the mistake: dividing by k instead of k factorial

Application

A pizza shop offers 12 toppings. How many different pizzas have exactly 10 toppings? Kim writes: "(1210)=12×11×⋯×310=23,950,080 pizzas." Find the mistake and correct it.
Show the steps and the answer
  1. Find the error in the denominator: Kim divided by 10, but the 10 chosen toppings can be listed in 10!=3,628,800 orders.

    To remove orderings you divide by k!, not by k; that is why her answer is absurdly large for a 12-item menu.

  2. Use the symmetry (1210)=(122).

    Choosing the 10 toppings to put on is the same as choosing the 2 to leave off.

  3. Cancel down to two factors on top: (122)=12×112×1=66.

    With the smaller k, only two factors remain on top and the cancellation is easy.

  4. Check by the long route: 12×11×⋯×310!=239,500,8003,628,800=66.

    Both routes agree, so the shortcut is safe.

Answer: 66 pizzas

Takeaway: Divide by k!, and compute with the smaller of k and n−k: (1210)=(122)=66.

Where You'll See It

  • Lottery odds

    A 6-from-49 lottery has (496)=13,983,816 possible tickets, since the order in which the balls are drawn doesn't matter. One ticket's chance at the jackpot is therefore about 1 in 14 million.

  • Scheduling a round-robin tournament

    When every player meets every other player once, each game is a pair, so the number of games is (n2). Twelve chess players need (122)=66 games; a 20-team league in which each pair meets once needs (202)=190.

  • Picking a starting five

    A coach with 12 players can field (125)=792 different starting fives if positions are ignored. Requiring, say, 2 guards from 5 and 3 others from 7 splits the count into a product of smaller coefficients, (52)(73)=10×35=350.

Common Mistakes

  1. The slip: Using (nk) when order matters

    Instead: if arrangement counts, use a permutation, which is k! times bigger.

  2. The slip: Computing all of n! instead of canceling

    Instead: (nk)=n!k!(n−k)! cancels most factors; never multiply out giant factorials.

  3. The slip: Forgetting (nk)=(nn−k)

    Instead: choosing which k to keep equals choosing which n−k to leave; use the smaller k to compute.


Mini Practice

Try these on your own. Tap Reveal when you want to check.

  1. Compute (83) by canceling before you multiply.

    Hint: Write it as 8×7×63×2×1.

  2. Find the coefficient of x2 in the expansion of (1+x)5.

    Hint: The coefficient of xk in (1+x)n is (nk).

  3. How many paths go from (0,0) to (5,2) on a grid if each step moves one unit right or one unit up?

    Hint: Every path has 7 steps. Which of them are the up steps?

  4. Row 6 of Pascal's triangle is 1,6,15,20,15,6,1. Use it to find (73).

    Hint: Each entry is the sum of the two entries above it.

  5. In a league of 8 teams, every pair of teams plays once. Is the number of games a binomial coefficient or a permutation?

    Hint: Is "Team A plays Team B" a different game from "Team B plays Team A"?

  6. Ivy writes: "(1513) is too big to work out without multiplying out 15!, which is about 1.3 trillion." Correct her.

    Hint: Choosing 13 to keep is the same as choosing how many to leave out?

Want the full set?

50 practice questions for this concept — free to try, every one with a complete worked solution showing the why, not just the answer.

Frequently Asked Questions

Why is (n0)=1 and not 0?

Because there is exactly one way to choose nothing: take no items. The formula agrees, since (n0)=n!0! n!=1\binom{n}{0}=\frac{n!}{0!\,n!}=1 once you use 0!=10!=1. That value of 0!0! is chosen for exactly this reason, so that formulas like this one and Pascal's triangle keep working at the edges, where every row starts and ends with 1.

Why does each number in Pascal's triangle equal the sum of the two above it?

Pick one particular person, say Ana, out of the nn. Every group of kk either includes Ana or does not. Groups with her need k−1k-1 more from the other n−1n-1 people, and groups without her need all kk from those n−1n-1. So (nk)=(n−1k−1)+(n−1k)\binom{n}{k}=\binom{n-1}{k-1}+\binom{n-1}{k}, the rule that builds each row of the triangle from the one above.

How many different tickets are there in a lottery where you pick 6 numbers from 1 to 49?

There are (496)=13,983,816\binom{49}{6}=13{,}983{,}816, about 14 million, since the order you pick the numbers in does not matter. So one ticket has about a 1 in 14 million chance of matching all six. If order did matter, the count would be 6!=7206!=720 times larger, around 10 billion, which shows how much the order question changes a count.

Why does each row of Pascal's triangle add up to a power of 2?

Row nn lists (n0),(n1),…,(nn)\binom{n}{0},\binom{n}{1},\ldots,\binom{n}{n}, the number of subsets of each size from a set of nn items, so the row's sum counts all subsets of every size. Another way to count them is to go through the items one at a time and decide in or out, 2 choices each, giving 2n2^n. For n=4n=4: 1+4+6+4+1=16=241+4+6+4+1=16=2^4.

Learning Path

Binomial Coefficient

You are here

You need Combinations (order-free selections) and Factorials first. The binomial coefficient gives those counts one formula, n!k!(n−k)!, plus the symmetry (nk)=(nn−k) and a place in Pascal's triangle. Next, the Binomial Theorem uses these numbers as the coefficients of (a+b)n, and the Binomial Distribution uses them to count the ways k successes can occur in n trials.

See Also