CZ
CalcyZone
Mathematics CalcyZone Calculator

Permutation Calculator

Calculate nPr permutations where item order matters.

Calculation Solution
100P150 = 0
Permutations (Order Matters)

Mathematical Formula

nPr = n! / (n - r)!

Overview & Explanation

A permutation is an arrangement of items where the order of selection strictly matters.

How It Works

  • Compute n factorial divided by (n - r) factorial.

Practical Applications

  • Combination lock pin codes.
  • Race finishing positions (1st, 2nd, 3rd).

Permutations with repetition

The nPr formula assumes each item is used at most once. When items may repeat, as with the digits of a PIN, each of the r positions has n choices, so the count is n^r. A 4-digit PIN made from 10 digits has 10^4 = 10,000 possibilities, while a 4-digit code with no repeated digits has 10P4 = 10 x 9 x 8 x 7 = 5,040.

Arranging letters that include duplicates needs a different adjustment: divide n! by the factorial of each repeat count. The word LEVEL has 5 letters with L twice and E twice, so its distinct arrangements are 5! / (2! x 2!) = 120 / 4 = 30.

Picking the right model first is the main skill. Ask whether order matters, and whether an item can be used again, before choosing a formula.

Permutations: arrangements where order matters

A permutation counts the ordered arrangements of r items chosen from n distinct items: P(n, r) = n! ÷ (n − r)!. Awarding gold, silver and bronze among 10 runners gives P(10, 3) = 10 × 9 × 8 = 720 possible podiums. Arranging all n items is simply n!; five books on a shelf can be arranged in 5! = 120 ways.

Repeated items and repetition

When some items are identical, divide by the factorial of each repeat count. The letters of LEVEL (two Ls, two Es, one V) can be arranged in 5! ÷ (2! × 2!) = 120 ÷ 4 = 30 distinct ways.

If items can be reused, the count is nʳ instead. A 4-digit PIN using digits 0–9 with repetition allowed has 10⁴ = 10,000 possibilities, while a 4-digit code with no repeated digit has P(10, 4) = 5,040.

Choosing the right formula

Order matters and no repeats: P(n, r). Order matters with repeats: nʳ. Order does not matter: combinations, C(n, r) = P(n, r) ÷ r!. Seating problems around a round table use (n − 1)! because rotating everyone gives the same arrangement, so 6 people can sit in 5! = 120 distinct ways.

Worked Example: 5P3

Arrange 3 items out of 5.

1

Apply Formula 5! / (5-3)!

120 / 2

= 60

Frequently Asked Questions

What is the key difference between permutations and combinations?
In permutations order matters; in combinations order does not matter.
Why does 0! equal 1?
So that formulas like P(n, n) = n! ÷ 0! work; there is exactly one way to arrange nothing.
How fast do permutations grow?
Very fast: 10! is 3,628,800 and 20! is about 2.4 × 10¹⁸.