Permutation (nPr) Calculator
Use this tool to calculate permutations where order matters. Enter values for n (total items) and r (items chosen).
What is nPr?
In combinatorics, nPr means the number of ways to arrange r items selected from a set of n distinct items. The key idea is that order matters. If you pick A then B, that is different from B then A.
The nPr Formula
The permutation formula is:
nPr = n! / (n - r)!
Here, the exclamation mark means factorial. For example, 5! = 5 × 4 × 3 × 2 × 1 = 120.
Quick Example
Suppose 10 runners compete and you want to count the possible gold-silver-bronze outcomes (top 3 positions). That is 10P3:
10P3 = 10 × 9 × 8 = 720
So there are 720 different ordered podium outcomes.
When Should You Use an nPr Calculator?
- Ranking or assigning positions (1st, 2nd, 3rd)
- Arranging people in specific roles
- Creating ordered codes from unique symbols
- Scheduling where sequence changes the outcome
If sequence changes meaning, nPr is usually the right concept.
nPr vs nCr (Important Difference)
Use nPr when order matters
Example: President, Vice President, Secretary from 8 people. Those positions are different, so use permutations.
Use nCr when order does not matter
Example: choose 3 people from 8 to be on a committee. No roles, no order, so combinations (nCr) are appropriate.
Common Mistakes
- Entering decimal values for n or r (both must be integers)
- Using r > n (not allowed in standard permutations without repetition)
- Using nPr for unordered selections (should be nCr instead)
- Forgetting that 0! = 1
FAQ
Can r be zero?
Yes. nP0 = 1, because there is exactly one way to choose and arrange nothing.
Can n be zero?
Yes, as long as r is also zero. Then 0P0 = 1.
What if I need very large values?
This calculator uses BigInt in JavaScript, so it can handle large integer results better than standard floating-point math.
Final Thought
nPr is one of the most useful tools in probability and discrete math. Once you remember that permutations care about order, you can model many real-world ranking and arrangement problems quickly and accurately.