If you are watching an Olympic race with 10 runners and want to calculate how many possible ways the Gold, Silver, and Bronze medals can be awarded, you are doing combinatorics math. In this scenario, two specific rules apply: the specific order the runners cross the finish line matters completely, and a runner cannot win both Gold and Silver. In mathematics, this is known as a Permutation Without Repetition.
Our free online Permutation Without Repetition Calculator instantly solves this massive algebraic equation. Also known as an “nPr Calculator”, this tool quickly evaluates your total pool of items and how many you are sequentially choosing, outputting the exact number of possible unique arrangements that can be formed.
Understanding the nPr Formula
To calculate a permutation where repetition is forbidden, the calculator uses the standard nPr Formula: P(n,r) = n! / (n - r)!. Because this formula uses factorials (the exclamation point), doing the math by hand can be incredibly tedious. Here is exactly what those variables mean.
| Equation Variable | Statistical Definition | Real-World Example (An Olympic Race) |
|---|---|---|
| The n Variable | The Total Pool Size | The total number of items you have available to pick from. In a 10-man footrace, the n variable is exactly 10. |
| The r Variable | The Number Chosen | How many items are physically being placed into a sequence. If we are only awarding Gold, Silver, and Bronze, the r variable is exactly 3. |
| The ! Symbol | The Factorial | This tells the calculator to multiply the number by every integer below it (e.g., 5! = 5 × 4 × 3 × 2 × 1). This is what creates the massive mathematical sequences. |
Permutations vs. Combinations (The Order Rule)
The most common mistake students make is using a Permutation formula when they actually need a Combination formula. The entire difference boils down to a single question: Does the specific sequence matter?
| Mathematical Concept | Does Order Matter? | Real-World Example |
|---|---|---|
| Permutation | YES | Entering a PIN code. The numbers 1-2-3-4 will unlock your phone, but the numbers 4-3-2-1 will not. The specific order is strictly enforced. |
| Combination | NO | Making a fruit salad. If you pick Apples, Bananas, and Grapes, it does not matter what order you chop them in. It is the exact same salad. |
If the order of your items does not matter at all (like choosing a poker hand), you must switch to our Combination Without Repetition Calculator. If you are entering a code where you are allowed to reuse the same number twice, use our Permutation With Repetition Calculator.
Frequently Asked Questions (FAQ)
What does “Without Repetition” mean?
It means that once an item is placed into the sequence, it cannot be reused. In a footrace, the same runner cannot win both 1st Place and 2nd Place at the same time. The pool size (n) shrinks by 1 after every single spot is filled.
Is a combination lock actually a permutation lock?
Yes! This is the most famous joke among mathematicians. Because the order of a combination lock strictly matters (e.g., 30-15-05 will open the lock, but 05-30-15 will not), it is mathematically a Permutation. The English language completely botched the terminology.
Why are Permutation numbers always larger than Combination numbers?
Because permutations care about sequence! In a permutation, the group “A-B-C” and the group “C-B-A” are counted as two completely different, unique results. In a combination, they contain the exact same three letters, so they are grouped together and only counted as one single result. This drastically inflates the final permutation number.