Combination Formula

A combination is an unordered selection of objects — the number of ways to choose r items from n distinct items is C(n,r) = n!/(r!(n-r)!).

The Formula

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

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

Quick example

Choose 2 from A, B, C: {A,B}, {A,C}, {B,C} =3 ways.

Notation

C(n,r), nCr, or (nr) all denote combinations of r items from n

What this formula means

A combination is an unordered selection of objects — the number of ways to choose r items from n distinct items is C(n,r)=n!r!(n−r)!.

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.

Formal view

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

Worked examples

Example 1

easy
A committee of 3 is to be chosen from 8 people. How many different committees are possible?
Show solution

Answer

(83)=56

First step

1.
Recall the combination formula for unordered selections: (nr)=n!r!(n−r)!, with n=8, r=3.

Full solution

  1. 2.
    Cancel common factorial terms: (83)=8!3!⋅5!=8×7×63×2×1
  2. 3.
    Calculate: 3366=56
Combinations count selections where order does not matter. Choosing members A, B, C for a committee is the same as choosing C, B, A.

Example 2

medium
From a group of 6 men and 4 women, how many committees of 5 can be formed that include exactly 3 men and 2 women?

Example 3

easy
A jar holds 5 different fruits. How many distinct fruit salads of 3 different fruits can be made? (Order does not matter inside a salad.)

Common mistakes

  • Forgetting to divide by r! — that leaves a permutation count, which overcounts the orderings.
  • Using a combination when order matters — assignments and rankings need a permutation.
  • Mixing up r and n−r — note C(n,r)=C(n,n−r), so choosing 3 to keep equals choosing the others to drop.

Why this formula 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.

Frequently asked questions

What is the Combination formula?

A combination is an unordered selection of objects — the number of ways to choose r items from n distinct items is C(n,r)=n!r!(n−r)!.

How do you use the Combination formula?

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.

What do the symbols mean in the Combination formula?

C(n,r), nCr, or (nr) all denote combinations of r items from n

Why is the Combination formula important in Math?

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.

What do students get wrong about Combination?

The procedure for combination is the easy part; the trap is forgetting to divide by r!. Asking "Does rearranging the chosen items leave it the same selection?" first is what keeps a correct-looking calculation from being attached to the wrong concept.

What should I learn before the Combination formula?

Before studying the Combination formula, you should understand: permutation, factorial.