What Is nPr?
A permutation is an ordered arrangement. The number of permutations of r items chosen from n distinct items is nPr = n! ÷ (n − r)!. Because order matters, picking A then B counts as a different result from picking B then A.
The calculator also shows the relationship nPr = nCr × r!, the number of arrangements when repetition is allowed (nʳ) and the probability that a random ordered pick matches one target arrangement. If order does not matter in your problem, use the nCr or combination calculator instead.
Below you will find the formulas, a variables table, worked examples and answers to common questions such as nPr versus nCr and how many ways to arrange people in a row.
How to Use the nPr Calculator
- Enter n, the number of distinct items available.
- Enter r, how many of them you arrange in order.
- Read P(n, r), and compare with nCr, repetition and circular counts.
- Open the steps to see the product and the check against nCr × r!.
nPr Formula
Permutations
Link with combinations
Permutations with repetition
Circular permutations
With identical items
nPr Variables Explained
| Symbol | Meaning | Notes |
|---|---|---|
| n | Total distinct items | |
| r | Items arranged | 0 ≤ r ≤ n |
| nPr | Number of permutations | n! ÷ (n − r)! |
| nʳ | Arrangements with repetition | Each position can reuse an item |
nPr Worked Example
Using the example values (press “Load example” above to try them):
- Formula: P(n, r) = n! ÷ (n − r)!.
- Cancel: P(10, 4) = 10 × 9 × 8 × 7.
- Result: 5,040.
- With repetition allowed there are n^r = 10^4 = 10,000 arrangements.
Result: P(10, 4) = 10P4 = 5,040.
Types of permutation problems
| Problem type | Formula | Example |
|---|---|---|
| Arrange r of n distinct items, no repeats | n!/(n − r)! | 3 medals among 10 runners: 720 |
| Arrange all n distinct items | n! | 5 books on a shelf: 120 |
| Items can repeat in each position | nʳ | 4-digit PIN: 10⁴ = 10,000 |
| Some items identical | n!/(n₁! n₂! …) | Letters of MISSISSIPPI: 34,650 |
| Around a circle | (n − 1)! | 6 people at a round table: 120 |
Handling restrictions
Many permutation problems add restrictions. To keep two particular items together, treat them as one block, count the arrangements, then multiply by the ways to order inside the block. To keep two items apart, count all arrangements and subtract those where they are together. For “at least one” conditions, use the complement.
Permutations in probability
If every ordered arrangement is equally likely, the chance of a particular arrangement is 1/P(n, r). Guessing a 4-letter code from 26 letters without repeats has a probability of 1/358,800. Permutation counts also appear in the denominators of many card and lottery probabilities when order matters.
Where nPr Is Used
Rankings and podiums
Counting the ways to award first, second and third place.
Passwords and codes
Counting ordered codes with or without repeated characters.
Seating and scheduling
Counting ordered arrangements of people or tasks.
Exam questions
Checking nPr answers and seeing the working.
Common nPr Mistakes to Avoid
- Ask “does swapping two chosen items give a different result?” to choose between nPr and nCr.
- 0! = 1 and P(n, 0) = 1.
- P(n, n) = n!, all arrangements of the full set.
nPr Terms and Definitions
- Factorial
- n! is the product of all whole numbers from 1 to n.
- Circular permutation
- An arrangement around a circle where rotations are considered identical.
nPr FAQs
What is nPr?
The number of ordered arrangements of r items chosen from n distinct items, equal to n!/(n − r)!.
How do I calculate permutations?
Multiply n by the next r − 1 smaller numbers. For P(10, 4): 10 × 9 × 8 × 7 = 5,040.
What is the difference between permutations and combinations?
Permutations count ordered arrangements; combinations count unordered selections. P(n, r) = C(n, r) × r!.
What if items can repeat?
Then the count is n^r, because each of the r positions can independently be any of the n items.
What is a circular permutation?
An arrangement around a circle where rotations are treated as the same, giving (n − 1)! for n distinct items.
How do I handle identical items?
Divide n! by the factorial of each group of identical items, such as 11!/(4!4!2!) for MISSISSIPPI.