Combinations Notes

Published on: November 18, 2026

This Combinations Calculator counts how many ways there are to choose r items from n when the order does not matter, and shows the working line by line. It puts n and r into the combinations formula, cancels the biggest factorial so only a few numbers are left to multiply, and then divides. Choosing a team of 3 from 10 people or a hand of 5 cards from 52 are both combination problems, written nCr.

Step-by-step method

  1. Set up the problem.
  2. Write the formula.
  3. Put n and r into the formula.
  4. Cancel the biggest factorial.
  5. Work out the top and the bottom.
  6. Divide.

Formula: Combinations Formula

This formula counts how many ways there are to choose r items from n when the order doesn't matter. Put in n and r, then work out the factorials.

\({}^{n}C_{r} = \frac{n!}{r! \times (n - r)!}\)
See Example 1 Hide Example 1

Problem

\({}^{5}C_{2}\)

Approach

Step-by-step method

  1. Set up the problem.
  2. Write the formula.
  3. Put n and r into the formula.
  4. Cancel the biggest factorial.
  5. Work out the top and the bottom.
  6. Divide.

Formula

Formula: Combinations Formula

This formula counts how many ways there are to choose r items from n when the order doesn't matter. Put in n and r, then work out the factorials.

\({}^{n}C_{r} = \frac{n!}{r! \times (n - r)!}\)

Step 1

Step 1 - Set up the problem.

In this problem: There are \(n = 5\) items and \(r = 2\) of them are chosen. The order they are chosen in doesn't matter.

\(n = 5,\; r = 2\)

Step 2

Step 2 - Write the formula.

In this problem: \(n!\) means multiplying every whole number from \(n\) down to \(1\), and \(0! = 1\).

\({}^{n}C_{r} = \frac{n!}{r! \times (n - r)!}\)

Step 3

Step 3 - Put n and r into the formula.

In this problem: Put \(n = 5\) and \(r = 2\) into the formula. \(n - r = 5 - 2 = 3\).

\({}^{5}C_{2} = \frac{5!}{2! \times 3!}\)

Step 4

Step 4 - Cancel the biggest factorial.

In this problem: The bigger factorial on the bottom is \(3!\). Write \(5!\) as \(5 \times 4 \times 3!\), so \(3!\) is on the top and the bottom and cancels.

\(\frac{5 \times 4 \times \cancel{3!}}{2! \times \cancel{3!}} = \frac{5 \times 4}{2!}\)

Step 5

Step 5 - Work out the top and the bottom.

In this problem: Multiply the top: \(5 \times 4 = 20\). Work out the bottom: \(2! = 2 \times 1 = 2\).

\(\frac{5 \times 4}{2!} = \frac{20}{2}\)

Step 6

Step 6 - Divide.

In this problem: Divide the top by the bottom: \(20 \div 2 = 10\). So there are \(10\) ways to choose \(2\) items from \(5\).

\({}^{5}C_{2} = \frac{20}{2} = 10\)

Final Answer

\({}^{5}C_{2} = {}^{5}C_{2} = 10\)
See Example 2 Hide Example 2

Problem

\({}^{8}C_{3}\)

Approach

Step-by-step method

  1. Set up the problem.
  2. Write the formula.
  3. Put n and r into the formula.
  4. Cancel the biggest factorial.
  5. Work out the top and the bottom.
  6. Divide.

Formula

Formula: Combinations Formula

This formula counts how many ways there are to choose r items from n when the order doesn't matter. Put in n and r, then work out the factorials.

\({}^{n}C_{r} = \frac{n!}{r! \times (n - r)!}\)

Step 1

Step 1 - Set up the problem.

In this problem: There are \(n = 8\) items and \(r = 3\) of them are chosen. The order they are chosen in doesn't matter.

\(n = 8,\; r = 3\)

Step 2

Step 2 - Write the formula.

In this problem: \(n!\) means multiplying every whole number from \(n\) down to \(1\), and \(0! = 1\).

\({}^{n}C_{r} = \frac{n!}{r! \times (n - r)!}\)

Step 3

Step 3 - Put n and r into the formula.

In this problem: Put \(n = 8\) and \(r = 3\) into the formula. \(n - r = 8 - 3 = 5\).

\({}^{8}C_{3} = \frac{8!}{3! \times 5!}\)

Step 4

Step 4 - Cancel the biggest factorial.

In this problem: The bigger factorial on the bottom is \(5!\). Write \(8!\) as \(8 \times 7 \times 6 \times 5!\), so \(5!\) is on the top and the bottom and cancels.

\(\frac{8 \times 7 \times 6 \times \cancel{5!}}{3! \times \cancel{5!}} = \frac{8 \times 7 \times 6}{3!}\)

Step 5

Step 5 - Work out the top and the bottom.

In this problem: Multiply the top: \(8 \times 7 \times 6 = 336\). Work out the bottom: \(3! = 3 \times 2 \times 1 = 6\).

\(\frac{8 \times 7 \times 6}{3!} = \frac{336}{6}\)

Step 6

Step 6 - Divide.

In this problem: Divide the top by the bottom: \(336 \div 6 = 56\). So there are \(56\) ways to choose \(3\) items from \(8\).

\({}^{8}C_{3} = \frac{336}{6} = 56\)

Final Answer

\({}^{8}C_{3} = {}^{8}C_{3} = 56\)
See Example 3 Hide Example 3

Problem

\({}^{10}C_{4}\)

Approach

Step-by-step method

  1. Set up the problem.
  2. Write the formula.
  3. Put n and r into the formula.
  4. Cancel the biggest factorial.
  5. Work out the top and the bottom.
  6. Divide.

Formula

Formula: Combinations Formula

This formula counts how many ways there are to choose r items from n when the order doesn't matter. Put in n and r, then work out the factorials.

\({}^{n}C_{r} = \frac{n!}{r! \times (n - r)!}\)

Step 1

Step 1 - Set up the problem.

In this problem: There are \(n = 10\) items and \(r = 4\) of them are chosen. The order they are chosen in doesn't matter.

\(n = 10,\; r = 4\)

Step 2

Step 2 - Write the formula.

In this problem: \(n!\) means multiplying every whole number from \(n\) down to \(1\), and \(0! = 1\).

\({}^{n}C_{r} = \frac{n!}{r! \times (n - r)!}\)

Step 3

Step 3 - Put n and r into the formula.

In this problem: Put \(n = 10\) and \(r = 4\) into the formula. \(n - r = 10 - 4 = 6\).

\({}^{10}C_{4} = \frac{10!}{4! \times 6!}\)

Step 4

Step 4 - Cancel the biggest factorial.

In this problem: The bigger factorial on the bottom is \(6!\). Write \(10!\) as \(10 \times 9 \times 8 \times 7 \times 6!\), so \(6!\) is on the top and the bottom and cancels.

\(\frac{10 \times 9 \times 8 \times 7 \times \cancel{6!}}{4! \times \cancel{6!}} = \frac{10 \times 9 \times 8 \times 7}{4!}\)

Step 5

Step 5 - Work out the top and the bottom.

In this problem: Multiply the top: \(10 \times 9 \times 8 \times 7 = 5040\). Work out the bottom: \(4! = 4 \times 3 \times 2 \times 1 = 24\).

\(\frac{10 \times 9 \times 8 \times 7}{4!} = \frac{5040}{24}\)

Step 6

Step 6 - Divide.

In this problem: Divide the top by the bottom: \(5040 \div 24 = 210\). So there are \(210\) ways to choose \(4\) items from \(10\).

\({}^{10}C_{4} = \frac{5040}{24} = 210\)

Final Answer

\({}^{10}C_{4} = {}^{10}C_{4} = 210\)
See Example 4 Hide Example 4

Problem

\({}^{6}C_{6}\)

Approach

Step-by-step method

  1. Set up the problem.
  2. Write the formula.
  3. Put n and r into the formula.
  4. Cancel the biggest factorial.
  5. Work out the top and the bottom.
  6. Divide.

Formula

Formula: Combinations Formula

This formula counts how many ways there are to choose r items from n when the order doesn't matter. Put in n and r, then work out the factorials.

\({}^{n}C_{r} = \frac{n!}{r! \times (n - r)!}\)

Step 1

Step 1 - Set up the problem.

In this problem: There are \(n = 6\) items and \(r = 6\) of them are chosen. The order they are chosen in doesn't matter.

\(n = 6,\; r = 6\)

Step 2

Step 2 - Write the formula.

In this problem: \(n!\) means multiplying every whole number from \(n\) down to \(1\), and \(0! = 1\).

\({}^{n}C_{r} = \frac{n!}{r! \times (n - r)!}\)

Step 3

Step 3 - Put n and r into the formula.

In this problem: Put \(n = 6\) and \(r = 6\) into the formula. \(n - r = 6 - 6 = 0\).

\({}^{6}C_{6} = \frac{6!}{6! \times 0!}\)

Step 4

Step 4 - Cancel the biggest factorial.

In this problem: \(6!\) is on the top and the bottom, so it cancels and leaves \(1\) on the top.

\(\frac{\cancel{6!}}{0! \times \cancel{6!}} = \frac{1}{0!}\)

Step 5

Step 5 - Work out the top and the bottom.

In this problem: The top is just \(1\). Work out the bottom: \(0! = 1\).

\(\frac{1}{0!} = \frac{1}{1}\)

Step 6

Step 6 - Divide.

In this problem: Divide the top by the bottom: \(1 \div 1 = 1\). So there is \(1\) way to choose \(6\) items from \(6\).

\({}^{6}C_{6} = \frac{1}{1} = 1\)

Final Answer

\({}^{6}C_{6} = {}^{6}C_{6} = 1\)