Permutations without Repetition Calculator

About the Permutations without Repetition Calculator

Permutations without repetition count the number of ordered arrangements of r items selected from n distinct items, where each item can be used at most once. The formula P(n, r) = n!/(n−r)! calculates how many ways you can fill r ordered positions from a pool of n unique items.

This calculator computes P(n, r) with a step-by-step breakdown showing how the available choices decrease at each position. It also compares with combinations C(n, r) and permutations with repetition n^r, illustrating how order and replacement affect the count.

Common applications include race finishing orders (first/second/third from n runners), assigning ranked prizes to contestants, seating arrangements at a table, phone number permutations (no digit reuse), and any scenario where both selection and order matter. That makes it useful when you need to explain why ranking problems grow much faster than simple combinations. It also gives a concrete bridge from classroom counting rules to real ordered outcomes.

When This Page Helps

The step-by-step position-filling breakdown makes the counting logic transparent. The comparison table shows exactly how P(n,r), C(n,r), and n^r relate, clearing up the most common source of confusion in combinatorics. Full enumeration for small cases lets you verify the count concretely. It is useful when you need to show why order matters instead of only reporting the final number.

How to Use the Inputs

1. Enter n (total pool of items) and r (number to select and order).
2. Or click a preset for races, assignments, seating, etc.
3. Review P(n,r) and the step-by-step position filling.
4. Compare with C(n,r) and n^r in the comparison table.
5. For small cases, see all enumerated permutations.
6. Use the reference table for nearby P(n,r) values.
7. Check the probability of any specific permutation.

Example Calculation

Tips & Best Practices

• The falling factorial n × (n−1) × ... × (n−r+1) makes the counting intuitive: each position has one fewer option.
• P(n, r) = C(n, r) × r! — permutations = combinations × arrangements per combination.
• P(n, n) = n! is the total number of ways to arrange all n items (complete permutation).
• P(n, r) ≤ n^r, with equality only when r = 1. The restriction of no repetition reduces the count.
• For verification: P(n, 2) = n(n−1), P(n, 3) = n(n−1)(n−2) — easy to check by hand.
• When r = n, P(n, n) = n! grows extremely fast: 10! = 3,628,800 and 20! ≈ 2.4 × 10^18.

The Counting Principle in Action

P(n,r) directly applies the multiplication principle with decreasing options at each step. Position 1: n options. Position 2: n−1 options (one item used). Position 3: n−2 options. This sequential elimination captures the "without repetition" constraint naturally.

Derangements: When No Item Stays in Place

A special class of permutations is derangements — where no element appears in its original position. The number of derangements of n items is approximately n!/e (where e ≈ 2.718). For 5 items: D₅ = 44 out of 5! = 120 total permutations.

Computational Considerations

For large n and r, computing P(n,r) risks integer overflow. Use iterative multiplication (multiply n × (n−1) × ...) rather than computing full factorials and dividing. For extremely large values, use logarithms: log P(n,r) = Σᵢ₌₀ʳ⁻¹ log(n−i), then exponentiate if needed.

Frequently Asked Questions

• What is the difference between P(n,r) and C(n,r)?

  P(n,r) counts ordered selections (ABC ≠ CAB). C(n,r) counts unordered subsets ({A,B,C} = {C,A,B}). P(n,r) = C(n,r) × r! because each combination of r items can be arranged in r! ways.

• When should I use permutations vs combinations?

  Use permutations when order matters: race results (1st, 2nd, 3rd), ranked awards, sequential arrangements. Use combinations when order doesn't matter: committee selection, lottery numbers, card hands.

• Can r equal n?

  Yes. P(n,n) = n!, the number of ways to arrange all n items in order. This is a full permutation or rearrangement — like finding all orderings of a deck of cards (52! ≈ 8 × 10^67).

• What about permutations of identical objects?

  When some objects are identical, divide by the factorial of each repeated group. For "MISSISSIPPI": 11!/(4!4!2!) = 34,650, since S appears 4 times, I appears 4 times, and P appears twice.

• Why does P(n,r) grow so fast?

  Because it involves a product of r consecutive integers starting from n. P(20,10) = 20×19×18×...×11 ≈ 6.7 × 10^12. The factorial nature means even moderate n and r produce astronomical numbers.

• How are permutations used in probability?

  The probability of a specific ordered outcome from equally likely options is 1/P(n,r). The probability that a specific set of items is selected (in any order) is r!/P(n,r) = 1/C(n,r).