Permutation Calculation Steps and Formula

A permutation calculation finds how many ways you can arrange a chosen number of distinct items when order matters. Enter the total number of items, n, and the number of positions to fill, r; the calculator returns the number of possible ordered arrangements.

Formula

For choosing and arranging r items from n distinct items without reusing any item, the permutation formula is:

P(n, r) = n! / (n − r)! = n × (n − 1) × … × (n − r + 1)

• n is the total number of distinct available items, a count.
• r is the number of positions being filled, a count, with 0 ≤ r ≤ n.
• ! means factorial: for a positive whole number, multiply it by every positive whole number below it; by definition, 0! = 1.
• P(n, r) is the number of ordered arrangements. It is a count, so it has no physical unit.

The calculator also shows combinations, C(n, r) = n! / (r!(n − r)!), as a comparison. Combinations count selections in which order does not matter; they are not the permutation answer when positions or sequence matter.

Worked Example

With the default values, there are five distinct items and three positions. For example, the items might be A, B, C, D, and E, with each arrangement using three different letters.

1. For the first position, there are 5 choices.
2. After using one item, 4 choices remain for the second position.
3. After using two items, 3 choices remain for the third position.
4. Multiply the choices: 5 × 4 × 3 = 60 permutations.

Using the factorial form gives the same result: P(5, 3) = 5! / (5 − 3)! = 120 / 2 = 60. For comparison, the number of unordered groups is C(5, 3) = 10.

Permutation Calculation Steps

To calculate a permutation by hand, follow these steps:

1. Decide what counts as one distinct item. Treat two items as distinct only when the problem considers them different.
2. Count all available items and call that number n.
3. Count how many ordered positions, places, or stages must be filled and call that number r.
4. Check whether an item can be used more than once. The standard formula above assumes no repetition.
5. Check whether order matters. If swapping two selected items creates a different outcome, use permutations.
6. Multiply n choices for the first position by n − 1 for the second, continuing until r positions are filled. Or use n! / (n − r)!.

For instance, assigning gold, silver, and bronze places among eight runners has 8 × 7 × 6 = 336 possible outcomes. A runner cannot occupy two places, and swapping first and second place changes the result, so the no-repetition permutation formula fits.

When to Use Each Formula

Use permutations when the order or role of each selected item changes the outcome. Examples include ordering books on a shelf, assigning distinct jobs to people, or determining the possible sequences of letters when no letter repeats. Use combinations when you only care which items are selected, such as choosing three people for an undifferentiated committee.

• Order matters, no repetition: P(n, r) = n! / (n − r)!
• Order does not matter, no repetition: C(n, r) = n! / (r!(n − r)!).
• Order matters, repetition allowed: n^r, when each of r positions can independently take any of n choices.

These models answer different questions. For a three-character code using digits 0–9, where digits can repeat, there are 10³ = 1,000 possible codes. If digits cannot repeat, there are 10 × 9 × 8 = 720. A code is ordered: 123 and 321 are different.

Factorials and Practical Calculation

Factorials grow quickly: 5! = 120, while 10! = 3,628,800. In the permutation formula, calculating only the r factors is often simpler than finding both full factorials. For example, P(20, 3) = 20 × 19 × 18 = 6,840. This avoids writing out 20! and 17! separately.

For large n and r, a calculator or software can evaluate the falling product directly. If using factorial values, avoid rounding intermediate results: premature rounding can change the final integer or create an inaccurate approximation. A permutation count should be a whole number when n and r are valid whole-number counts.

Common Mistakes and Limits

• Ignoring order: Ask whether swapping two selected items creates a new outcome. If not, combinations may be the right model.
• Using the wrong r: r is the number of positions filled, not the number left over.
• Allowing repeats by accident: The standard permutation formula removes each used item from the remaining choices. If reuse is allowed, the count may instead be n^r.
• Entering impossible counts: The ordinary formula requires whole numbers with 0 ≤ r ≤ n. You cannot fill more distinct positions than there are available items if repetition is forbidden.
• Overlooking identical items: The basic formula treats every item as distinct. For arrangements of repeated items, such as letters in a word with repeated letters, divide the total factorial by the factorials of the repeat counts.

For example, the letters in LEVEL include two Ls and two Es. The number of distinct full arrangements is 5! / (2! × 2!) = 30, not 120, because swapping identical copies does not create a new visible arrangement. This adjustment applies to arranging all items with repeats; other repeated-item problems may need a model tailored to their rules.

Frequently Asked Questions

What is the simplest way to calculate a permutation?
Multiply the descending choices for each position: n × (n − 1) × … until you have multiplied r factors. This is usually quicker than calculating two factorials.

What does nPr mean?
nPr is shorthand for the number of ways to choose and arrange r items from n distinct items without repetition. It equals n! / (n − r)!.

How do I know whether to use permutations or combinations?
Use permutations if changing the order changes the result, such as ranking winners. Use combinations if only the selected group matters, such as picking members for a team with no assigned roles.

Can r be greater than n?
Not for a permutation without repetition: there are not enough distinct items to fill the positions. If items can be reused, use a repetition-allowed model instead.

What is a permutation when r equals zero?
There is exactly one way to arrange zero selected items: choose nothing. Accordingly, P(n, 0) = 1, including when n is zero.

Related

• Exponential Growth Rate Calculator and Formula
• Journal Impact Factor Calculation Explained
• Weight Percentage: Formula and Worked Example

in n | Total distinct items | - | 5 | 0
in r | Positions to fill | - | 3 | 0
out permutations | Permutations | arrangements | npr(n,r) | 0
out combinations | Combinations for comparison | groups | ncr(n,r) | 0