Permutation & Combination Calculator

Permutation & Combination Calculator - Counting Arrangements and Selections

Permutations and combinations answer one of the most common questions in probability and statistics: in how many ways can you choose or arrange items from a larger group? The key distinction between them comes down to a single question - does the order of selection matter? Permutations count arrangements where order matters, while combinations count selections where it doesn't.

A Simple Way to Tell Them Apart

Ask yourself: if I swap the order of two chosen items, is the result considered different? Ranking runners in 1st, 2nd, and 3rd place is a permutation problem - swapping who gets 1st and 2nd creates a genuinely different outcome. But selecting 3 people to serve on a committee is a combination problem - it doesn't matter which order they were chosen in, the resulting committee is the same group either way.

Understanding Factorials

Both formulas rely on the factorial function, written as n!, which means multiplying every whole number from n down to 1. For example, 4! = 4 × 3 × 2 × 1 = 24. Factorials grow extremely quickly - 5! is 120, but 10! is already over 3.6 million, and 20! is a 19-digit number. This rapid growth is exactly why the number of possible arrangements or selections can become enormous even with a relatively small starting group.

Why Permutations Are Always Larger Than Combinations

For the same values of n and r, there will always be more permutations than combinations (unless r is 0 or 1). This is because every single combination of r items can itself be rearranged in r! different orders, and each of those rearrangements counts as a separate permutation. The formula nPr = nCr × r! captures this relationship directly - permutations are always r! times more numerous than combinations of the same items.

Real-World Applications

• Combinations: Lottery number selections, choosing a committee or team, selecting a subset of features for a survey, or counting possible card hands in poker (where the order you're dealt cards doesn't matter).
• Permutations: Ranking contestants in a competition, arranging books on a shelf, assigning distinct roles (like president, secretary, treasurer) to a group of candidates, or generating possible passwords with fixed positions.
• Probability calculations: Both permutations and combinations are foundational to calculating probabilities in card games, genetics, quality control sampling, and many areas of statistics.

A Note on Large Numbers

Because factorials grow so quickly, calculating nPr or nCr by hand for large values of n becomes impractical very fast - by the time n reaches 20 or 30, the intermediate factorial values are astronomically large, even though the final nCr or nPr answer may be much smaller after the division. This calculator handles the full computation instantly, regardless of how large n and r are, as long as the result stays within standard numeric precision.