Permutation Calculator
Find the number of ordered arrangements of r items selected from n distinct items.
Mathematical tool only; verify results for critical applications.
Examples
- n=5, r=2 ⇒ 20 ways
- n=6, r=3 ⇒ 120 ways
- n=10, r=0 ⇒ 1 way
FAQ
How is this different from combinations?
Permutations consider order; combinations do not.
Can r be greater than n?
If r > n, the result is 0 because you can't choose more items than exist.
Does order matter here?
Yes, permutations count distinct orderings.
Additional Information
No additional information available.