Permutation Calculator

What is a Permutation?

A permutation answers the question: "In how many distinct sequences can I choose and arrange r items from n available objects?" The critical feature is that order matters—selecting items A, B, C in that sequence is different from C, B, A.

Consider a practical example: you have 8 swimmers competing for gold, silver, and bronze medals. The number of ways to award these three medals is a permutation of 8 taken 3 at a time, because finishing first, second, or third produces entirely different outcomes.

Permutations apply whenever:

• Rank or position affects the outcome (leaderboards, hierarchies)
• You're arranging items in a specific order (seating plans, queue sequences)
• Sequential selection matters (drawing cards for a specific hand arrangement)

Permutation Formula

The standard permutation formula calculates arrangements without repetition:

• P(n,r) — Number of permutations of n items taken r at a time
• n — Total count of distinct objects in the set
• r — Number of items you select from the set
• n! — Factorial of n—the product of all positive integers up to n

Permutations with Repetition

When objects can be reused (like choosing digits for a PIN where 1, 1, 1 is allowed), the formula simplifies dramatically:

P(n,r) = n^r

For instance, a 4-digit password using the digits 0–9 (10 possible choices per position) allows 10⁴ = 10,000 different codes. This is far more than the 5,040 permutations without repetition (when each digit can only be used once).

Permutations vs. Combinations

Combinations count selections where order is irrelevant. A committee of 3 people chosen from 10 candidates is a combination—{Alice, Bob, Carol} is the same committee as {Carol, Alice, Bob}. The formula is:

C(n,r) = n! ÷ (r! × (n − r)!)

The relationship is simple: divide permutations by the factorial of r, which eliminates all the orderings of the same group.

Example: from 10 swimmers, selecting 3 for a relay team (order matters) gives 720 permutations. Selecting 3 for a casual training group (order irrelevant) gives only 120 combinations.

Common Pitfalls and Considerations

Avoid these frequent mistakes when calculating permutations:

1. Confusing order with order independence — Always ask: does the sequence matter? If you're forming a queue or assigning positions, order matters and you need permutations. If you're forming a group or subset with no rank, use combinations instead.
2. Forgetting that permutations assume distinct objects — The standard formula assumes all n objects are unique. If three of your objects are identical, the actual number of distinguishable permutations is much lower and requires dividing by the factorial of repeated items.
3. Misidentifying repetition rules — Read the problem carefully. Can you use the same item twice (with repetition), or must each item appear at most once (without repetition)? A phone number allows repetition; drawing balls from an urn without replacement does not.
4. Underestimating factorial growth — Factorials grow explosively. P(20, 10) exceeds 670 billion. For large n and r values, results are often reported in scientific notation, and overflow is a real computational concern.