Permutation Calculator
Count how many ordered arrangements of r items can be made from a set of n items, where a different order counts as a different outcome.
| Permutations P(n, r) | 5,040 |
|---|---|
| Permutations with repetition (nʳ) | 10,000 |
| Combinations C(n, r) for comparison | 210 |
Link to this calculation – copied!
Formula
With repetition: nr
| Symbol | Meaning |
|---|---|
| n | Total number of items available |
| r | Number of positions to fill |
| ! | Factorial |
How to Use This Calculator
- Enter the Total items (n).
- Enter the Items arranged (r).
- Press Calculate. Results also update automatically as you type.
Worked Example
Using the values pre-filled in the calculator above:
| Total items (n) | 10 |
|---|---|
| Items arranged (r) | 4 |
| Permutations P(n, r) | 5,040 |
|---|---|
| Permutations with repetition (nʳ) | 10,000 |
| Combinations C(n, r) for comparison | 210 |
About This Calculation
A permutation is an arrangement in which order matters. Awarding first, second and third place among 10 runners can be done in P(10, 3) = 10 × 9 × 8 = 720 ways, because the same three people in a different finishing order is a different result. In general there are n choices for the first position, n − 1 for the second, and so on for r positions.
When items can be reused, the count becomes nr. A 4-digit PIN uses the digits 0–9 with repetition allowed, giving 104 = 10,000 possibilities; if no digit could repeat there would be only P(10, 4) = 5,040. This difference is why password and code strength calculations normally use the repetition formula.
Permutations grow extremely quickly. Arranging all 52 cards in a deck gives 52!, a number with 68 digits, so every well-shuffled deck is almost certainly in an order never seen before. If you only care about which items are chosen and not their order, divide by r! to get the number of combinations; this calculator shows both so you can compare.
Frequently Asked Questions
- How many ways can I arrange n different objects?
- Arranging all n objects is P(n, n) = n!. For example, 5 books can be lined up on a shelf in 5! = 120 ways.
- What if some items are identical?
- Divide n! by the factorial of each group of identical items. The letters of BOOK can be arranged in 4! ÷ 2! = 12 distinct ways because the two Os are interchangeable.