Binomial Coefficient Examples: 44 Problems with Answers

Worked examples of Binomial Coefficient to try before you open each solution, then practice problems with answers.

Worked Examples

Example 1

medium
Calculate (62) using the formula (nk)=n!k!(n−k)!, and verify by listing all combinations of 2 items from {A,B,C,D,E,F}.
Show solution

Answer

(62)=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

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

SetupKey insightWhy it worksCommon pitfallConnection

Free: full solutions on 3 topics a day. No card.

Every topic, every day: the Family plan

Example 2

hard
A fair coin is flipped 5 times. Using P(X=k)=(nk)pk(1−p)n−k, find P(X=3) (exactly 3 heads).

Example 3

medium
Calculate (83) and explain what it counts.

Example 4

medium
Use Pascal's identity (nk)=(n−1k−1)+(n−1k) to compute (63) from (52) and (53).

Example 5

medium
Find the coefficient of x3 in the expansion of (1+x)7.

Example 6

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

Example 7

hard
Find the coefficient of x4 in the expansion of (2+x)7.

Example 8

hard
In (x+y)6, find the term containing x4y2.

Example 9

hard
A fair coin is flipped 6 times. Find the probability of exactly 4 heads.

Example 10

challenge
Find ∑k=010(10k) and identify the closed form for any n.

Practice Problems

Try each one, then open the solution to compare your method.

Example 1

easy
Calculate: (a) (40), (b) (44), (c) (41).

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).

Example 4

easy
Compute (60).

Example 5

easy
Compute (77).

Example 6

easy
Compute (41).

Example 7

easy
Use symmetry: (86) equals which simpler coefficient, and what is its value?

Example 8

easy
Compute (53).

Example 9

easy
What is the coefficient of x2 in the expansion of (1+x)4?

Example 10

easy
Why does (25) equal 0 (or is undefined as a count)?

Example 11

medium
Compute (103).

Example 12

medium
A team of 4 is chosen from 9 players. How many possible teams?

Example 13

medium
Compute (62)+(63) and identify which single coefficient it equals via Pascal's rule.

Example 14

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

Example 15

medium
Sum the row: (40)+(41)+(42)+(43)+(44). What is the total and why?

Example 16

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

Example 17

medium
A coin is flipped 5 times. How many outcome sequences have exactly 2 heads?

Example 18

medium
Compute (122) and (1210); explain why they are equal.

Example 19

medium
Compute (83).

Example 20

challenge
Prove the symmetry identity (nk)=(nn−k) from the factorial formula.

Example 21

challenge
Prove Pascal's identity (nk)=(n−1k−1)+(n−1k) by a counting argument.

Example 22

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

Example 23

easy
Compute (61).

Example 24

easy
Compute (102).

Example 25

easy
Compute (90)+(99).

Example 26

easy
Compute (72).

Example 27

easy
Compute (121).

Example 28

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

Example 29

medium
How many 5-card hands can be dealt from a standard 52-card deck?

Example 30

medium
A team of 4 is chosen from 7 students. How many possible teams exist?

Example 31

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

Example 32

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

Example 33

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

Example 34

hard
From 15 books on a shelf, how many ways to choose a set of 5?

What to focus on

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

Common stuck point: The procedure for binomial coefficient is the easy part; the trap is using (nk) when order matters. Asking "Am I counting selections of k from n 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.

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

Concept recap

The binomial coefficient (nk) counts the number of ways to choose k items from n distinct items without regard to order. It equals n!k!(n−k)!.

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).

Read the full lesson on Binomial Coefficient

Background knowledge

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

combinationfactorial