Permutation Calculator

Understanding Permutations

Permutations represent the number of ways to arrange a subset of items from a larger set where the order of arrangement matters. The notation nPr (read as "n permute r" or "P(n,r)") calculates how many different ordered sequences you can create by selecting r items from a total of n items. For example, if you have 10 athletes competing for gold, silver, and bronze medals, you're looking at 10P3 = 720 different possible podium arrangements because the order — who gets which medal — is significant.

The fundamental difference between permutations and combinations lies in whether order matters. When arranging books on a shelf, selecting race winners, or entering passwords, the sequence is crucial, making these permutation problems. When selecting a committee from a group where roles don't differ, order doesn't matter, making it a combination problem.

How to Use the Permutation Calculator

The calculator requires two numbers:

1. n (total items): The size of the set you're choosing from. This must be a positive integer.
2. r (items chosen): The number of items you're selecting and arranging. This must be a non-negative integer no larger than n.

The calculator returns nPr, which is the count of distinct ordered arrangements. It also shows the intermediate factorial values so you can see the calculation steps.

Important constraints:

• n must be at least 1
• r must be between 0 and n inclusive
• nP0 = 1 (there is exactly one way to arrange zero items — the empty arrangement)
• nPn = n! (arranging all n items uses n factorial)

For permutations with repetition allowed (like combinations lock codes where digits can repeat), use the formula nʳ instead, since each of the r positions has n independent choices.

Frequently Asked Questions

What is the difference between nPr and nCr? nPr (permutations) counts ordered arrangements — where (A, B, C) is different from (C, A, B). nCr (combinations) counts unordered selections — where {A, B, C} and {C, A, B} count as the same group. The relationship is nPr = nCr × r!. Use permutations when order matters (race positions, passwords, schedules) and combinations when it doesn't (lottery tickets, committees, selections).

What does nP0 equal? nP0 = 1 for any n. There is exactly one way to arrange zero items from n: choose nothing and arrange nothing. The formula confirms this: nP0 = n! / (n−0)! = n! / n! = 1.

What does nPn equal? nPn = n!, the total number of ways to arrange all n items. The formula gives nPn = n! / (n−n)! = n! / 0! = n! / 1 = n!.

How large can permutation numbers get? They grow very quickly. Even 20P10 = 20!/10! = approximately 670 billion. For n > 20 or so, exact integer calculations require arbitrary-precision arithmetic because the numbers exceed standard 64-bit integer limits. Logarithms are used in practice when only the magnitude matters rather than the exact count.

Why do permutations use factorials? Because counting ordered arrangements naturally involves multiplying decreasing sequences. Filling position 1 from n items, position 2 from the remaining n−1 items, position 3 from n−2 items, and so on generates the product n × (n−1) × (n−2) × ... = n! (for all positions) or n!/(n−r)! (for r positions). The factorial is simply a compact notation for this decreasing product.

When should I use permutations with repetition instead of standard permutations? Use n^r (permutation with repetition) when items can be reused across positions. Examples: generating PIN codes where digits repeat, counting possible outcomes of rolling a die multiple times, forming letter sequences where letters can repeat. Use the standard nPr formula when each item can only appear once across the arrangement — like assigning distinct prizes to distinct winners.

Can nPr be larger than nCr? Yes, always (for r ≥ 2). Since nPr = nCr × r!, and r! ≥ 2 for r ≥ 2, permutations are always at least as large as combinations for the same n and r. For r = 0 or r = 1, they're equal (since 0! = 1! = 1). This makes intuitive sense: permutations count more outcomes because they distinguish between orderings that combinations treat as identical.

How the Permutation Formula Works

The permutation formula is:

nPr = n! / (n − r)!

This formula counts ordered arrangements by starting from n choices for the first position, then n−1 for the second (since one item is used), then n−2 for the third, and so on for r total positions.

nPr = n × (n−1) × (n−2) × ... × (n−r+1)

The division by (n−r)! cancels the factorial terms you don't need. For 10P3:

• Full numerator: 10! = 3,628,800
• Denominator: 7! = 5,040
• Result: 3,628,800 / 5,040 = 720

Or more efficiently: 10 × 9 × 8 = 720 (just the first 3 descending terms starting from 10).

Permutations vs Combinations

The critical distinction between permutations and combinations determines which formula to use.

Permutations: Order matters. Selecting the same items in different orders counts as different outcomes.

• Choosing president, VP, and treasurer from 10 people: nPr (three distinct roles)
• Arranging 5 books on a shelf: 5P5 = 120 arrangements
• Determining race finishing order for top 3 from 8 runners: 8P3 = 336

Combinations: Order doesn't matter. Selecting the same items in any order counts as one outcome.

• Choosing 3 people from 10 for a committee with no specific roles: nCr (10C3 = 120)
• Selecting 5 lottery numbers from 50: combinations (order irrelevant to whether you win)

The mathematical relationship is: nPr = nCr × r!

This shows that permutations equal combinations multiplied by the number of ways to order the selected items. For every combination of 3 people (nCr = 120), there are 3! = 6 ways to assign them to the three officer positions, giving 120 × 6 = 720 = 10P3.

Quick rule: Ask "does swapping two selected items give a different result?" If yes — use permutations. If no — use combinations.

Real-World Applications

Cryptography and Password Security

Password strength depends directly on permutations. A password using 26 lowercase letters with no repetition and length 6 has 26P6 = 165,765,600 possible combinations. Adding uppercase letters, numbers, and symbols dramatically increases this count, which is why longer and more varied character sets create stronger passwords.

Security professionals use permutation analysis to estimate brute-force attack resistance. If a system can test 1 million passwords per second and there are 10^15 possible passwords, a brute-force attack would take on average 500 billion seconds — far beyond practical reach.

Combination locks use permutations in their name, though they're technically sequential-selection problems. A standard combination lock with numbers 0-39 and 3 positions has approximately 59,000 distinct combinations (fewer than 40³ because adjacent identical numbers often don't count).

Scheduling and Operations Research

Conference scheduling: If 8 speakers must be arranged into an afternoon schedule of 4 time slots, there are 8P4 = 1,680 different orderings to consider when optimizing for audience flow, speaker availability, and topic progression.

Job sequencing in manufacturing: Determining the most efficient order to process 6 jobs on a single machine involves evaluating permutations. With 6 jobs, there are 6! = 720 possible sequences. Operations researchers use dynamic programming algorithms to find the optimal sequence without evaluating all 720 explicitly.

Route planning: A delivery truck visiting 7 stops has 7! = 5,040 possible routes to evaluate in a naive brute-force approach. Even for moderate problem sizes, this factorial growth is what makes the Traveling Salesman Problem computationally challenging.

Genetics and Molecular Biology

DNA sequences use permutations of the four nucleotide bases (A, T, G, C). A sequence of length n has at most 4^n distinct arrangements (with repetition). The human genome contains approximately 3.2 billion base pairs, creating an astronomical number of theoretically possible genetic sequences.

Protein synthesis arranges amino acids in specific sequences to create functional proteins. The order matters enormously — the same 20 amino acids arranged differently create completely different proteins with different functions. Permutation analysis helps researchers understand sequence space and mutation impact.

Sports and Competitions

Olympic medal ceremonies: With 10 athletes in a final, there are 10P3 = 720 possible gold-silver-bronze outcomes.

Baseball batting order: A manager selecting 9 players from a 25-man roster and arranging them in batting order faces a problem of 25P9 ≈ 741 billion possible lineups. In practice, positional constraints and strategy reduce this to a much more manageable decision space.

Tournament seeding: Determining the seeding order for 16 teams in a single-elimination tournament has 16! = over 20 trillion possible arrangements, which is why seeding rules and committee judgments are needed rather than exhaustive comparison.

Card Games and Probability

A standard 52-card deck can be arranged in 52! ways — a number so vast it's near certain that no two shuffled decks in history have ever been in exactly the same order. When dealing 5 cards from 52 where order matters (as in some poker variants), there are 52P5 = 311,875,200 ordered hands.

Factorial Foundations

The factorial function, denoted by the exclamation mark (!), is the building block of permutation calculations. The factorial of a number n equals the product of all positive integers from 1 to n.

• 1! = 1
• 2! = 2
• 3! = 6
• 4! = 24
• 5! = 120
• 10! = 3,628,800
• 20! ≈ 2.43 × 10¹⁸

Factorials grow explosively fast. 20! exceeds 2.4 quintillion, and 52! (the number of ways to shuffle a standard deck of cards) is larger than the number of atoms in the observable universe. This explosive growth reflects how quickly the number of possible arrangements increases as you add more items.

By convention, 0! = 1. This might seem counterintuitive, but it's defined this way to make formulas consistent — there is exactly one way to arrange zero objects (do nothing), and the permutation formulas require this convention to work correctly.

Permutations With and Without Repetition

Without Repetition (Standard Permutations)

The standard nPr formula assumes no item can be used twice. Once an item fills a position, it's removed from consideration for subsequent positions. This applies to:

• Medal assignments (one athlete per medal)
• Anagram counting with distinct letters
• Seat assignments at a table

With Repetition Allowed

When items can be reused, each of the r positions has n independent choices, giving n^r total arrangements.

For a 4-digit PIN using digits 0-9 with repetition: 10⁴ = 10,000 possible codes. Without repetition: 10P4 = 10 × 9 × 8 × 7 = 5,040 possible codes.

The distinction matters significantly for security analysis. Allowing digits to repeat nearly doubles the number of possible PIN codes.

Permutations of Non-Distinct Items

When some items are identical, fewer distinct arrangements exist. For a word with repeated letters, divide by the factorial of each repeated letter count.

The word "MISSISSIPPI" has 11 letters with I appearing 4 times, S appearing 4 times, and P appearing 2 times: Distinct arrangements = 11! / (4! × 4! × 2!) = 39,916,800 / (24 × 24 × 2) = 34,650