Permutation Calculator - Free Online nPr & Arrangement Tool

What's Inside

Understanding Permutation Calculator

A track coach selects 4 runners out of a 10-person squad to run a 4×100m relay, where running position (1st leg, 2nd leg, 3rd leg, anchor) is critical: calculating total distinct team lineups requires evaluating ₁₀P₄ = 10! / (10 - 4)! = 5,040 arrangements. A security engineer evaluates 4-digit PIN code combinations where digits can repeat: 10⁴ = 10,000 possible passwords. An event coordinator seating 8 delegates around a circular banquet table calculates distinct relative seating arrangements: (8 - 1)! = 7! = 5,040.

A permutation is an arrangement of a set of items where the order of selection matters. Reordering the same subset of items produces a distinct permutation (for example, the code 1-2-3 is distinct from 3-2-1).

The primary formula for selecting r items from a total pool of n distinct items without replacement is nPr = n! / (n - r)!. When replacement is allowed, the formula is n^r. When arranging indistinguishable items (multisets), the formula divides total factorials by group factorials. This tool calculates permutations across all four modes using BigInt precision. The following sections explain permutation formulas, circular symmetry reductions, and practical applications in security, sports, and logistics.

How Permutation Calculator Works

When inputs are submitted, the engine executes exact BigInt factorial arithmetic, ensuring zero floating-point rounding errors regardless of result magnitude.

The Math Behind It

1. Standard Permutations Without Repetition (nPr):
nPr = n! / (n - r)! = n × (n - 1) × (n - 2) × ... × (n - r + 1)
Constraint: 0 ≤ r ≤ n.

2. Permutations With Repetition Allowed:
Each of the r selection slots has n available choices:
Total = n × n × ... × n (r times) = n^r

3. Circular Permutations:
For n distinct objects arranged in a closed loop or round table, rotating the circle by 1 position yields equivalent relative orderings. Dividing by n rotations gives:
Circular = n! / n = (n - 1)!

4. Multiset / Indistinguishable Items Permutations:
For a total of N = n₁ + n₂ + ... + n_k items where group 1 contains n₁ identical items, group 2 contains n₂ identical items, etc.:
Multiset = N! / (n₁! × n₂! × ... × n_k!)
Classic example: Arranging the letters of "MISSISSIPPI" (N=11: 1 M, 4 I, 4 S, 2 P) yields 11! / (1! × 4! × 4! × 2!) = 34,650 distinct words.

Practical Uses for Permutations

Password and PIN security analysis. Cybersecurity analysts calculate total password space size N^L for alphanumeric character sets to measure brute-force cracking resistance.

Sports lineups and race finishing order. Race officials calculate total podium finish combinations (1st, 2nd, 3rd place) among 20 marathon runners: ₂₀P₃ = 20 × 19 × 18 = 6,840.

DNA sequence alignments and genetics. Bioinformaticians compute distinct nucleotide sequence permutations (A, C, G, T) to model genetic mutation spaces.

Logistics and traveling salesperson routes. Logistics planners evaluate route sequencing options for delivery trucks visiting n customer stops.

Getting the Most Out of Permutation Calculator

Remember: If order does NOT matter (e.g. choosing a 4-person committee where all members have equal status), use our Combination Calculator (nCr) instead.

For multiset word anagrams (like "MISSISSIPPI"), select Mode 4 and enter the counts of each repeated letter separated by commas (e.g. 1, 4, 4, 2).

For single factorials ($n!$), pair this tool with our Factorial Calculator. For basic event likelihoods, use our Probability Calculator.

Permutation Technical Specifications

The calculation engine operates client-side in JavaScript using BigInt specifications. Permutation ₁₀₀P₅₀ evaluates in under 1 millisecond.

Feature	This Tool	Hand Factorials	Scientific Calculator
Max n Limit	n = 1000 (BigInt)	n = 10 practical	n = 99 (Float overflow)
Order Matters	Yes (nPr)	Yes	nPr key
Repetition Allowed	Yes (n^r mode)	Manual power	x^y key
Circular Mode	Yes ((n-1)! mode)	Manual subtraction	Not listed
Multiset Mode	Yes (N! / ∏n_i!)	Manual factorials	Not listed
Privacy	Client-side browser	Paper	Local device
Cost	Free	Free	Free

Frequently Asked Questions

What is the difference between nPr and nCr?

In permutations (nPr), order matters (e.g. 123 ≠ 321). In combinations (nCr), order does not matter (e.g. {1,2,3} = {3,2,1}). Consequently, nPr is always greater than or equal to nCr.

Why does 0! equal 1 in permutation formulas?

When selecting all n items (r = n), nPn = n! / (n - n)! = n! / 0! = n! / 1 = n!. Setting 0! = 1 ensures formula consistency.

How many distinct 4-digit PINs are possible with digits 0-9?

Since digits can repeat, the total count is 10⁴ = 10,000 PIN codes (0000 through 9999).

Related Math & Education Tools

Combination Calculator — Calculates nCr combinations where order does not matter.

Probability Calculator — Computes single, independent, and conditional event probabilities.

Factorial Calculator — Evaluates exact BigInt factorials and Stirling approximations.