Permutation Calculator

A permutation refers to the arrangement of distinct items in a specific, sequential order. The mathematical formula for finding the number of permutations when choosing r items from a total set of n items without repetition is expressed as P(n, r) = n! / (n - r)!, where the exclamation mark denotes a factorial (the product of all positive integers up to that number). When repetition is allowed, the formula simplifies to P(n, r) = n^r. This calculator computes these exact mathematical relationships instantly, converting large outputs into manageable mantissa and exponent formats for extreme values.

Imagine you are managing a race with 8 runners, and you need to calculate how many different ways the first, second, and third-place podium spots can be awarded. Here, our total set size (n) is 8, and the number of selection positions (r) is 3. Applying the standard permutation formula: P(8, 3) = 8! / (8 - 3)! = 8! / 5!. Expanding the factorials gives us (8 × 7 × 6 × 5!) / 5!. Canceling out the 5! from the numerator and denominator leaves us with 8 × 7 × 6, which equals 336 unique podium arrangements.

Always determine whether order matters before you begin your calculations. If rearranging your items creates a completely unique outcome (such as a lock combination or a racing podium), you are working with permutations. If the order of selection has zero impact on the final result (such as choosing members for a committee), you should use combinations instead. Additionally, be mindful of whether your scenario permits item repetition, as allowing duplicates will drastically increase your total possible outcomes.