Permutations Calculator computes P(n, r) for any valid n and r, listing the outcome directly for small cases and showing the full factorial expansion for larger ones. The underlying formula, n! / (n − r)!, counts ordered arrangements of r items chosen from n without repetition.
Compute permutations for small and large inputs
For small n and r, Permutations Calculator can enumerate the logic behind the count directly: arranging 4 books on a shelf 2 at a time gives P(4, 2) = 4 × 3 = 12, since there are 4 choices for the first spot and 3 remaining choices for the second.
For larger inputs, such as P(20, 5), direct listing is impractical, so the tool relies on the factorial ratio: 20! / 15!, which cancels to 20 × 19 × 18 × 17 × 16, equal to 1,860,480.
Expand the factorial ratio for any size
The factorial ratio n! / (n − r)! always reduces to the product of the r largest factors in n!, since everything from (n − r)! downward cancels between numerator and denominator.
This means Permutations Calculator never needs to compute a full factorial for large n; it only multiplies r terms together, which keeps the arithmetic manageable even when n reaches into the hundreds.
Track how permutations grow with r
Holding n fixed and increasing r grows the permutation count quickly, since each additional position multiplies in one more shrinking factor. P(10, 1) = 10, P(10, 2) = 90, P(10, 3) = 720, and P(10, 4) = 5,040. The growth rate slows once r approaches n, because the remaining factors available to multiply shrink toward 1.
Use permutations for sequencing and scheduling
Permutations answer questions phrased around sequence, rank, or schedule. Arranging 6 songs into a 6-song playlist order is P(6, 6) = 6! = 720 total orderings. Scheduling 3 of 8 available time slots for 3 distinct meetings, where which meeting occupies which slot matters, is P(8, 3) = 336.
Recognizing the sequencing language in a word problem is the signal to reach for a permutation rather than a combination.
Avoid this common mistake
Applying a permutation formula to a problem that does not actually distinguish order overcounts the true number of outcomes. If 3 team members are chosen to attend a conference together, with no distinction between who attends in what "order," the correct count is a combination, C(8, 3) = 56, not P(8, 3) = 336.
The permutation count is exactly 3! = 6 times too large in this case, because it treats every reordering of the same 3 people as a separate outcome when the problem does not.
Work through a code-assignment example
Assigning 3 different access codes to 3 of 12 employees, where each employee receives a specific, distinct code, is P(12, 3) = 12 × 11 × 10 = 1,320.
Permutations Calculator lays out the three descending factors starting at 12, mirroring the direct counting argument: 12 choices for the first code, 11 remaining for the second, 10 remaining for the third, since each code goes to a different employee and none repeat.
Understand the role of the "without repetition" condition
Every permutation computed by this formula assumes each of the n items can be used at most once across the r positions, which is why the multiplying factors count down rather than staying constant.
A problem that instead allows the same item to fill more than one position, such as a PIN code where digits can repeat, needs the separate with-replacement formula n^r rather than n! / (n − r)!, since the pool of remaining options no longer shrinks with each pick.
Frequently asked questions
How do you calculate permutations for large numbers?
To calculate permutations for large numbers, expand n! / (n − r)! by canceling the shared factorial tail, leaving only the product of the r largest factors of n. P(20, 5) reduces to 20 × 19 × 18 × 17 × 16 rather than requiring the full 20! to be computed.
What is P(4, 2)?
P(4, 2) equals 12, since there are 4 choices for the first position and 3 remaining choices for the second: 4 × 3 = 12.
Why do permutations grow faster than combinations?
Permutations grow faster than combinations because they count every ordering of the chosen items separately, while combinations divide that count by r! to treat all orderings as one outcome. The gap between the two widens as r grows, since r! grows quickly.
What is the largest r can be in a permutation?
The largest r can be in a permutation without repetition is n itself, giving P(n, n) = n!. Any r beyond n has no valid arrangement, since there would not be enough distinct items to fill every position.
Are permutations used in scheduling problems?
Permutations are used in scheduling problems whenever the assignment of a specific item to a specific time slot or position matters, such as assigning 3 distinct meetings to 3 of 8 available rooms in a way that tracks which meeting goes where.
How many arrangements are there for 6 distinct songs in a playlist?
There are 720 arrangements for 6 distinct songs in a playlist, since P(6, 6) = 6! = 720, using every song exactly once in a specific order.
What is P(12, 3)?
P(12, 3) equals 12 × 11 × 10, which is 1,320, counting ordered assignments of 3 distinct items among 12 available options with none repeating.
Does a permutation allow the same item to be chosen more than once?
An ordinary permutation, computed as n! / (n − r)!, does not allow the same item to be chosen more than once; a problem that allows repeats needs the separate with-replacement formula n^r instead.
Summary
Permutations Calculator computes P(n, r) = n! / (n − r)! for any valid n and r, reducing the factorial ratio to a product of r terms so large permutations stay computable.
Use it whenever a problem tracks the order, rank, or specific assignment of the chosen items, and expect it to grow faster than the matching combination count by a factor of r!.