Permutation & Combination Calculator Formula & How It Works
- Permutation (nPr): ordered arrangement (order matters)
- Combination (nCr): unordered selection (order doesn't matter)
- n! = n × (n−1) × … × 2 × 1
- C(n,r) = P(n,r) / r! (divide by r! to remove order)
Use permutations when order matters (race finishers, PIN codes, anagrams). Use combinations when order doesn't matter (lottery, team selection, card hands). C(n,r) is always ≤ P(n,r) because combination groups are the same as P(n,r)/r! ordered arrangements. C(52,5) = 2,598,960 possible poker hands.