Permutation Calculator computes P(n, r), the number of ordered arrangements of r objects chosen from n distinct objects, with no object reused. The formula n! / (n − r)! reduces to a short product of consecutive integers, which the tool shows expanded.
Order matters in a permutation
A permutation counts an arrangement, so choosing the same objects in a different sequence produces a distinct result. Selecting a president, vice president, and treasurer from 9 committee members is a permutation problem, since the same three people arranged into different roles count as different outcomes. Enter n = 9, r = 3 to compute P(9, 3).
Compute P(9, 3) step by step
P(9, 3) = 9! / (9 − 3)! = 9! / 6!. Every factor from 6 downward appears in both the numerator and denominator, so it cancels, leaving 9 × 8 × 7, which equals 504.
Permutation Calculator writes out this cancellation explicitly, showing why only the top r factors of n! survive rather than requiring the full factorial to be computed and then divided.
Read the countdown-multiplication shortcut
An equivalent way to compute a permutation without factorial notation is to multiply n by each integer below it, r times total. For P(9, 3): start at 9, multiply by 8 (one less), then by 7 (one less again), and stop after 3 factors.
This shortcut matches the direct counting logic: 9 choices for the first role, 8 remaining choices for the second, 7 remaining choices for the third.
Handle the edge cases
P(n, 0) always equals 1, since there is exactly one way to arrange zero items: doing nothing. P(n, n) always equals n!, since every item gets placed and none are left over.
Permutation Calculator returns an out-of-range error whenever r exceeds n, because there are not enough distinct objects to fill more than n ordered positions without allowing repeats.
Avoid this common mistake
Confusing a permutation with a combination undercounts the true number of outcomes whenever the problem actually cares about order. Choosing 3 people to serve on a committee together, with no distinct roles, is a combination, C(9, 3) = 84.
Assigning 3 distinct roles to 3 of those same people is a permutation, P(9, 3) = 504, six times larger because each group of 3 can be arranged into roles in 3! = 6 different ways.
Work through a second example
Consider ranking the top 4 finishers out of 10 runners in a race, where 1st, 2nd, 3rd, and 4th place are all distinct outcomes. This is P(10, 4) = 10! / 6! = 10 × 9 × 8 × 7 = 5,040.
Permutation Calculator lays out each of the four descending factors so the multiplication chain from 10 down to 7 is visible before the final product appears. Notice that r = 4 factors are multiplied, matching the four ranked positions being filled.
Connect permutations to real sequencing problems
Permutations show up whenever a fixed number of distinct slots must each receive a different item from a larger pool: assigning batting order to players picked from a roster, scheduling a subset of tasks into ordered time slots, or issuing serial numbers where each digit position must be unique.
The recurring test is whether swapping two chosen items into different slots changes the outcome. If it does, the count needs P(n, r); if swapping the slots makes no difference, the problem instead needs C(n, r).
Frequently asked questions
What is the formula for a permutation?
The formula for a permutation is P(n, r) = n! / (n − r)!, where n is the total number of distinct items available and r is the number arranged in order.
How do you calculate P(9, 3)?
To calculate P(9, 3), divide 9! by 6!, which cancels to 9 × 8 × 7, equal to 504.
What does it mean when order matters in a permutation?
Order mattering in a permutation means that arranging the same set of chosen items differently produces a distinct, separately counted outcome. Assigning "Alex first, Sam second" is different from "Sam first, Alex second," even though the same two people were chosen.
What is P(n, n)?
P(n, n) equals n! exactly, because arranging all n available items uses every one of them with no items excluded. P(5, 5) = 5! = 120.
Can r be larger than n in a permutation?
R cannot be larger than n in a permutation without repetition, since there are not enough distinct items to occupy more than n positions. Permutation Calculator flags this case as out of range rather than returning zero.
How is a permutation different from a combination?
A permutation counts ordered arrangements and is always r! times larger than the corresponding combination, which counts the same selections without regard to order. Use a permutation whenever distinct roles, ranks, or positions are assigned to the chosen items.
What is P(10, 4)?
P(10, 4) equals 10! / 6!, which simplifies to 10 × 9 × 8 × 7, equal to 5,040 ordered arrangements of 4 items chosen from 10.
Does the order of entering n and r matter in the calculator?
Yes, n must always be the total pool size and r the number of positions filled; entering them in the wrong order changes the equation being solved and, unless n equals r, produces a different and incorrect result.
Why does a permutation problem often mention distinct roles or ranks?
A permutation problem often mentions distinct roles or ranks because that language is exactly what signals order matters; without a distinguishing feature like a role, rank, or position label attached to each selection, the problem is more likely asking for a combination instead.
Summary
Permutation Calculator computes P(n, r) = n! / (n − r)! for ordered selections of r distinct items from n available ones, expanding the factorial ratio into a short product of r consecutive integers.
Enter n and r to get the exact count, and remember that assigning distinct roles or ranks to the chosen items is the signal that a permutation, not a combination, is the correct formula.