Binomial Coefficient Examples in Math

Start with the recap, study the fully worked examples, then use the practice problems to check your understanding of Binomial Coefficient.

This page combines explanation, solved examples, and follow-up practice so you can move from recognition to confident problem-solving in Math.

Concept Recap

The binomial coefficient (nk)\binom{n}{k} counts the number of ways to choose kk items from nn distinct items without regard to order. It equals n!k!(nโˆ’k)!\frac{n!}{k!(n-k)!}.

Same as combination count, but now viewed as a coefficient in algebraic expansions.

Read the full concept explanation โ†’

How to Use These Examples

  • Read the first worked example with the solution open so the structure is clear.
  • Try the practice problems before revealing each solution.
  • Use the related concepts and background knowledge badges if you feel stuck.

What to Focus On

Core idea: The binomial coefficient (nk)\binom{n}{k} counts how many ways to pick kk items from nn when order doesn't matter.

Common stuck point: The procedure for binomial coefficient is the easy part; the trap is using (nk)\binom{n}{k} when order matters. Asking "Am I counting selections of kk from nn where order doesn't matter (or the matching expansion coefficient)?" first is what keeps a correct-looking calculation from being attached to the wrong concept.

Sense of Study hint: Ask: Am I counting selections of kk from nn where order doesn't matter (or the matching expansion coefficient)?

Worked Examples

Example 1

medium
Calculate (62)\binom{6}{2} using the formula (nk)=n!k!(nโˆ’k)!\binom{n}{k} = \frac{n!}{k!(n-k)!}, and verify by listing all combinations of 2 items from {A,B,C,D,E,F}\{A, B, C, D, E, F\}.

Answer

(62)=15\binom{6}{2} = 15. Verified by listing all 15 two-item combinations.

First step

1
Apply formula: (62)=6!2!(6โˆ’2)!=6!2!โ‹…4!=6ร—5ร—4!2ร—1ร—4!=302=15\binom{6}{2} = \frac{6!}{2!(6-2)!} = \frac{6!}{2! \cdot 4!} = \frac{6 \times 5 \times 4!}{2 \times 1 \times 4!} = \frac{30}{2} = 15

See the full worked solution + why-it-works coaching

SetupKey insightWhy it worksCommon pitfallConnection

Unlock answer keys One Family plan โ€” every worked solution, all subjects

Example 2

hard
A fair coin is flipped 5 times. Using P(X=k)=(nk)pk(1โˆ’p)nโˆ’kP(X=k) = \binom{n}{k}p^k(1-p)^{n-k}, find P(X=3)P(X=3) (exactly 3 heads).

Example 3

medium
Calculate (83)\binom{8}{3} and explain what it counts.

Example 4

medium
Use Pascal's identity (nk)=(nโˆ’1kโˆ’1)+(nโˆ’1k)\binom{n}{k}=\binom{n-1}{k-1}+\binom{n-1}{k} to compute (63)\binom{6}{3} from (52)\binom{5}{2} and (53)\binom{5}{3}.

Example 5

medium
Find the coefficient of x3x^3 in the expansion of (1+x)7(1+x)^7.

Example 6

medium
In a binomial probability with n=4n=4 trials and p=0.5p=0.5, find P(X=2)P(X = 2) where XX counts successes.

Example 7

hard
Find the coefficient of x4x^4 in the expansion of (2+x)7(2+x)^7.

Example 8

hard
In (x+y)6(x+y)^6, find the term containing x4y2x^4 y^2.

Example 9

hard
A fair coin is flipped 66 times. Find the probability of exactly 44 heads.

Example 10

challenge
Find โˆ‘k=010(10k)\sum_{k=0}^{10} \binom{10}{k} and identify the closed form for any nn.

Practice Problems

Try these problems on your own first, then open the solution to compare your method.

Example 1

easy
Calculate: (a) (40)\binom{4}{0}, (b) (44)\binom{4}{4}, (c) (41)\binom{4}{1}.

Example 2

hard
A committee of 3 is chosen from 8 people. How many possible committees exist? If one specific pair (Alice and Bob) must both be included, how many committees include both?

Example 3

easy
Compute (52)\binom{5}{2}.

Example 4

easy
Compute (60)\binom{6}{0}.

Example 5

easy
Compute (77)\binom{7}{7}.

Example 6

easy
Compute (41)\binom{4}{1}.

Example 7

easy
Use symmetry: (86)\binom{8}{6} equals which simpler coefficient, and what is its value?

Example 8

easy
Compute (53)\binom{5}{3}.

Example 9

easy
What is the coefficient of x2x^2 in the expansion of (1+x)4(1+x)^4?

Example 10

easy
Why does (25)\binom{2}{5} equal 00 (or is undefined as a count)?

Example 11

medium
Compute (103)\binom{10}{3}.

Example 12

medium
A team of 44 is chosen from 99 players. How many possible teams?

Example 13

medium
Compute (62)+(63)\binom{6}{2} + \binom{6}{3} and identify which single coefficient it equals via Pascal's rule.

Example 14

medium
How many ways to choose a 55-card hand from a 5252-card deck? Express as a binomial coefficient and give its value.

Example 15

medium
Sum the row: (40)+(41)+(42)+(43)+(44)\binom{4}{0}+\binom{4}{1}+\binom{4}{2}+\binom{4}{3}+\binom{4}{4}. What is the total and why?

Example 16

medium
In how many ways can 33 identical prizes be given to 33 of 77 contestants (each at most one prize)?

Example 17

medium
A coin is flipped 55 times. How many outcome sequences have exactly 22 heads?

Example 18

medium
Compute (122)\binom{12}{2} and (1210)\binom{12}{10}; explain why they are equal.

Example 19

medium
Compute (83)\binom{8}{3}.

Example 20

challenge
Prove the symmetry identity (nk)=(nnโˆ’k)\binom{n}{k} = \binom{n}{n-k} from the factorial formula.

Example 21

challenge
Prove Pascal's identity (nk)=(nโˆ’1kโˆ’1)+(nโˆ’1k)\binom{n}{k} = \binom{n-1}{k-1} + \binom{n-1}{k} by a counting argument.

Example 22

challenge
Show that the number of lattice paths from (0,0)(0,0) to (m,n)(m,n) using only unit right/up steps is (m+nm)\binom{m+n}{m}, and compute it for (3,2)(3,2).

Example 23

easy
Compute (61)\binom{6}{1}.

Example 24

easy
Compute (102)\binom{10}{2}.

Example 25

easy
Compute (90)+(99)\binom{9}{0} + \binom{9}{9}.

Example 26

easy
Compute (72)\binom{7}{2}.

Example 27

easy
Compute (121)\binom{12}{1}.

Example 28

medium
A pizza shop offers 88 toppings. How many 33-topping pizzas can you make if order doesn't matter and toppings are distinct?

Example 29

medium
How many 55-card hands can be dealt from a standard 5252-card deck?

Example 30

medium
A team of 44 is chosen from 77 students. How many possible teams exist?

Example 31

medium
A code is a 44-letter subset of {A,B,C,D,E,F,G,H}\{A,B,C,D,E,F,G,H\} where order doesn't matter. How many such codes exist?

Example 32

hard
A class of 2020 students must elect 55 to a committee, with one student (Alice) automatically included. How many committees are possible?

Example 33

hard
From 1212 people, how many ways to form a committee of 55 that excludes a specific pair (Bob and Carol)?

Example 34

hard
From 1515 books on a shelf, how many ways to choose a set of 55?

Background Knowledge

These ideas may be useful before you work through the harder examples.

combinationfactorial