Permutations Calculator
This Permutations Calculator counts how many ways there are to choose r items from n and put them in order, and shows the working line by line. It puts n and r into the permutations formula, cancels the factorial on the bottom, and multiplies what is left. Giving out first, second and third place to 10 runners is a permutation problem, written nPr, because the order of the places matters.
Step-by-step method
- Set up the problem.
- Write the formula.
- Put n and r into the formula.
- Cancel the factorial on the bottom.
- Multiply what is left.
Formula: Permutations Formula
This formula counts how many ways there are to choose r items from n when the order matters. Put in n and r, then work out the factorials.
Required knowledge
- How to multiply 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 factorial on the bottom.
- Multiply what is left.
Formula
Formula: Permutations Formula
This formula counts how many ways there are to choose r items from n when the order matters. 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 in order. Choosing the same items in a different order counts as a different arrangement.
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 factorial on the bottom.
In this problem: Write \(5!\) as \(5 \times 4 \times 3!\), so \(3!\) is on the top and the bottom and cancels.
Step 5
Step 5 - Multiply what is left.
In this problem: Multiply: \(5 \times 4 = 20\). So there are \(20\) ways to arrange \(2\) items chosen 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 factorial on the bottom.
- Multiply what is left.
Formula
Formula: Permutations Formula
This formula counts how many ways there are to choose r items from n when the order matters. 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 in order. Choosing the same items in a different order counts as a different arrangement.
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 factorial on the bottom.
In this problem: 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 - Multiply what is left.
In this problem: Multiply: \(8 \times 7 \times 6 = 336\). So there are \(336\) ways to arrange \(3\) items chosen 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.