On this concept: Formula

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

Math · Statistics & Probability · Grade 9-12

Combination

A combination counts unordered selections of r items from n distinct items, $C(n,r)=\frac{n!

C(n,r)=n!r!(n−r)!

Quick Answer

A combination counts unordered selections of r items from n distinct items, C(n,r)=n!r!(n−r)!. Use it when you only care which items are chosen, not their order: a team, a committee, the toppings on a pizza, a hand of cards, the numbers on a lottery ticket. Count the ordered lists with a permutation, then divide by r!, the number of ways each group could be listed. When the chosen items get different roles, such as president and treasurer, order matters and you need a permutation.

Why This Matters

Combinations count groups far too many to list: a 5-card hand can be any of (525)=2,598,960 hands, which is how card-game odds are found. The same numbers are the coefficients of (a+b)n and the counts in binomial probability. Count a group as if order mattered and you overcount by r!, a factor of 120 for those 5-card hands.

Intuitive Explanation

A pizza comes with 2 toppings chosen from mushroom, onion and pepper. Listing ordered pairs gives 6: MO, OM, MP, PM, OP, PO. But mushroom-then-onion is the same pizza as onion-then-mushroom, so every pizza was listed twice. There are 62=3 different pizzas: MO, MP and OP.

That is the whole idea of the formula. C(n,r)=n!r!(n−r)! is the permutation count n!(n−r)! divided by r!, the number of orders each chosen group can be listed in. To choose 4 students from 7 for a project group: P(7,4)=7×6×5×4=840 ordered lists, each group appears 4!=24 times, so there are 84024=35 groups. Choosing 4 to include is the same as choosing 3 to leave out, which is why (74)=(73)=35.

Choosing a president and a vice-president from the same 7 students looks like choosing 2 people, but now Ana as president with Ben as vice-president differs from the reverse. The roles make order matter, so the count is P(7,2)=42, not C(7,2)=21. A group whose members get labels is a permutation; a group without labels is a combination.

Think of it like this. A combination is a handful of items scooped into a bag: once they are inside, there is no first or last, only which items are in the bag. Count the ways to pick them one at a time, then divide by the number of orders in which you could have picked that same handful.

Core idea. A combination counts the ways to pick r items from n when rearranging the picked items doesn't make a new selection.


When to Use

Use a combination when you choose a group and the order inside it does not matter: a committee, a team with no positions, a hand of cards, pizza toppings, lottery numbers. Words like select, pick or choose, with no ranks or roles mentioned, point here. If the chosen items get different jobs or places, use a permutation; if an item can be chosen more than once, a different counting method is needed.

Tip. Ask: Does rearranging the chosen items leave it the same selection?

How to Recognize It

Before using C(n,r), check whether the chosen items end up as a plain group and whether each item can be chosen only once.

  1. Do the chosen items get different jobs, ranks or seats?

    If yes, order matters and you need a permutation, which is r! times larger. If they simply belong to the same group, such as 4 players picked for a team with no positions, a combination counts the choices.

  2. Can the same item be picked more than once, as with three scoops that may all be chocolate?

    If yes, C(n,r) undercounts, because it uses each item at most once: 3 scoops from 5 flavors with repeats allowed gives (73)=35 choices, not (53)=10. Without repeats, the combination formula is right.

  3. Is the selection made in stages, such as 2 boys from 6 and 3 girls from 8?

    If yes, find a combination for each stage and multiply: (62)×(83)=15×56=840 committees. That last step is the counting principle working on top of combinations.

  4. Is the question about the coefficients in an expansion such as (a+b)5, rather than about choosing people or objects?

    If yes, the same numbers appear as binomial coefficients: the coefficient of a2b3 is (52)=10, because each such term picks a from 2 of the 5 brackets.

Combination compared with Permutation, Counting principle, and Binomial coefficient

Combinations, permutations, the counting principle and binomial coefficients share the same factorial arithmetic, and two of them are literally the same numbers. Ask whether order inside the choice matters, whether repeats are allowed, and whether you are counting selections or reading coefficients in an expanded power.

Combination

Meaning
Use this when you are selecting a group where the order of the chosen items does not matter.
Key test
Does rearranging the chosen items leave it the same selection?
Formula
C(n,r)=n!r!(n−r)!
Example
How many 3-person committees can be formed from 6 people?

Permutation

Meaning
Counts ordered arrangements, so order creates distinct outcomes.
Key test
Use when positions or ranks distinguish the choices.
Formula
P(n,r)=n!(n−r)!
Example
Assigning 1st, 2nd, 3rd place

Counting principle

Meaning
Multiplies independent choices, allowing repeats and order.
Key test
Use when each pick is a separate slot that can repeat.
Formula
m×n
Example
Outfits from shirts and pants

Binomial coefficient

Meaning
The same value (nr) used as coefficients in (a+b)n.
Key test
Use when expanding a binomial power, not counting selections.
Formula
(nr)
Example
Coefficient of x2 in (x+1)4

Formula & Notation

C(n,r)=n!r!(n−r)!
(nr)=n!r!(n−r)! for 0≤r≤n, with (nr)=(nn−r)

How to read it: C(n,r), nCr, or (nr) all denote combinations of r items from n

Worked Examples

Example 1 — Pick a committee

Easy

How many 3-person committees can be formed from 6 people?
Show the steps and the answer
  1. Decide that order does not matter: Ana, Ben and Cal form the same committee however you list them.

    Committee members have no ranks, so rearranging them gives the same committee.

  2. Count ordered lists first: 6×5×4=120.

    This is P(6,3), which counts each committee once for every order its members could be listed in.

  3. Divide by the orders of 3 people: 3!=6, so 1206=20.

    Every committee appears exactly 6 times among the 120 lists.

  4. Check with the formula: C(6,3)=6!3! 3!=72036=20.

    The factorial form gives the same count.

Answer: 20

Takeaway: For an unordered group, count the ordered lists and divide by r!.

Example 2 — Order suddenly matters

Standard

From 6 people, how many ways to choose a president and a treasurer?
Show the steps and the answer
  1. Check whether order matters: Ana as president with Ben as treasurer differs from Ben as president with Ana as treasurer.

    The two roles are different jobs, so swapping the people changes the result.

  2. Count role by role: 6 choices for president, then 5 for treasurer.

    The president cannot also be the treasurer.

  3. Multiply: 6×5=30, which is P(6,2).

    Each choice of president pairs with each remaining choice of treasurer.

  4. Compare with unordered pairs: C(6,2)=15, exactly half.

    Each pair of people can fill the two roles in 2!=2 ways, so a combination would miss half the outcomes.

Answer: P(6,2)=30

Takeaway: When the chosen items get different roles, use a permutation; the combination count is smaller by a factor of r!.

Example 3 — Find the mistake: counting each handshake twice

Application

At a party of 10 people, everyone shakes hands with everyone else exactly once. Omar writes: "There are 10 choices for the first person and 9 for the second, so there are 10×9=90 handshakes." Find the mistake and correct it.
Show the steps and the answer
  1. Look at one handshake: Ana shaking Ben's hand is the same handshake as Ben shaking Ana's.

    A handshake has no first or second person, so order does not matter.

  2. See what Omar counted: ordered pairs, so every handshake appears twice in his 90.

    Each pair of people can be listed in 2!=2 orders.

  3. Divide: 902=45, which is C(10,2)=10×92.

    Removing the double count leaves one count per pair of people.

  4. Check another way: each person shakes 9 hands, giving 10×9=90 hand-ends, and each handshake uses 2.

    902=45 again, so the answer holds.

Answer: C(10,2)=45 handshakes

Takeaway: An unordered pair is counted twice by an ordered count; divide by 2!, or by r! for groups of r.

Where You'll See It

  • Odds of a royal flush in poker

    A 5-card hand from a 52-card deck is one of (525)=2,598,960 hands. Only 4 of them are royal flushes, one per suit, so the chance of being dealt one is 42,598,960, about 1 in 650,000.

  • Counting pizzas on a menu

    A pizzeria with 12 toppings that puts exactly 3 on each pizza can make (123)=220 different pizzas. Order does not matter on a pizza, which is why the answer is not 12×11×10=1320, six times too many.

  • Scheduling a round-robin league

    In a league of 8 teams where every team plays every other team once, each game is an unordered pair of teams, so there are (82)=28 games to schedule. Adding a ninth team adds 8 more games, for 36.

Common Mistakes

  1. The slip: Forgetting to divide by r!

    Instead: that leaves a permutation count, which overcounts the orderings.

  2. The slip: Using a combination when order matters

    Instead: assignments and rankings need a permutation.

  3. The slip: Mixing up r and n−r

    Instead: note C(n,r)=C(n,n−r), so choosing 3 to keep equals choosing the others to drop.


Mini Practice

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

  1. A pizza shop offers 7 toppings. How many ways can you choose 2 different toppings?

    Hint: Mushroom-then-olive is the same pizza as olive-then-mushroom.

  2. How many 4-member teams can be chosen from 9 students?

    Hint: Use C(9,4) and cancel before multiplying.

  3. A committee needs 2 boys chosen from 6 and 2 girls chosen from 5. How many committees are possible?

    Hint: Count the boy choices and girl choices separately, then combine.

  4. On a 10-question test you must answer any 7. How many choices do you have? How many if question 1 must be one of them?

    Hint: For the second part, question 1 is already chosen. How many more do you pick, and from how many?

  5. A pizza shop asks how many 3-topping pizzas can be made from 8 toppings. Combination or permutation?

    Hint: Does the order you name the toppings change the pizza?

  6. To choose 3 flavors from 5 for a sampler cup, Leo writes "5×4×3=60 ways." Correct his work.

    Hint: His count treats each order of the same three flavors as different.

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

If 20 people each shake hands with everyone else once, how many handshakes are there?

Each handshake is a pair of people, and Ana shaking Ben's hand is the same handshake as Ben shaking Ana's, so it is a combination: (202)=20×192=190\binom{20}{2} = \frac{20 \times 19}{2} = 190. Another way to see it: each of the 20 people shakes 19 hands, giving 380, but that counts every handshake twice, once from each person. Dividing by 2 is the same as dividing by 2!2! in the formula.

What are my chances of winning a lottery where I pick 6 numbers from 49?

Only the set of numbers matters, not the order they are drawn in, so there are (496)=13,983,816\binom{49}{6} = 13{,}983{,}816 possible tickets. One ticket wins the jackpot with probability about 1 in 14 million. Buying 10 tickets gives 10 chances in 14 million, still less than 1 in a million. A lottery that counted order would have P(49,6)P(49, 6), about 10 billion, possible tickets.

Why do the numbers in Pascal's triangle count combinations?

Each entry is the sum of the two above it, and combinations obey the same rule. To choose 3 people from 6, fix one person, say Sam: either Sam is chosen and you pick 2 more from the other 5, or Sam is not and you pick all 3 from the other 5. So (63)=(52)+(53)=10+10=20\binom{6}{3} = \binom{5}{2} + \binom{5}{3} = 10 + 10 = 20. Row nn of the triangle lists (n0)\binom{n}{0} through (nn)\binom{n}{n}.

Learning Path

Combination

You are here

You need Permutation, to count ordered lists, and Factorial, for the r! you divide by. Combination adds the count of unordered groups, C(n,r)=n!r!(n−r)!. Next, the Binomial Coefficient reads the same numbers (nr) as the coefficients of (a+b)n and as the counts behind binomial probabilities, such as the chance of exactly 3 heads in 5 flips.

See Also