Combinations Calculator
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
- Set up the problem.
- Write the formula.
- Put n and r into the formula.
- Cancel the biggest factorial.
- Work out the top and the bottom.
- 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.
Required knowledge
- How to multiply and divide whole numbers. A factorial such as 4! is just the whole numbers from 4 down to 1 multiplied together.
The worked examples below go through the same pattern from start to finish, so you can compare every step with your own working. For more practice, the notes page goes further with extra worked examples and fuller explanations of the ideas behind each step. Use them together to check your answers and to understand why each step works.
See Example 1 Hide Example 1
Problem
Approach
Step-by-step method
- Set up the problem.
- Write the formula.
- Put n and r into the formula.
- Cancel the biggest factorial.
- Work out the top and the bottom.
- 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.
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.
Step 2
Step 2 - Write the formula.
In this problem: \(n!\) means multiplying every whole number from \(n\) down to \(1\), and \(0! = 1\).
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\).
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.
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\).
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\).
Final Answer
See Example 2 Hide Example 2
Problem
Approach
Step-by-step method
- Set up the problem.
- Write the formula.
- Put n and r into the formula.
- Cancel the biggest factorial.
- Work out the top and the bottom.
- 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.
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.
Step 2
Step 2 - Write the formula.
In this problem: \(n!\) means multiplying every whole number from \(n\) down to \(1\), and \(0! = 1\).
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\).
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.
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\).
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\).
Final Answer
Login and upgrade to Plus to unlock the full step solution.
Example Problems
Click one to load it into the box and solve it.