What is the difference between a permutation and a combination?

A permutation counts ordered arrangements, where the sequence of items matters — choosing a 1st, 2nd, and 3rd place winner is a permutation. A combination counts unordered selections, where only which items are chosen matters, not their order — choosing 3 people for a committee with no distinct roles is a combination. Permutations are always equal to or larger than combinations for the same n and r, because each combination can be arranged in multiple orders.

How do you calculate nPr by hand?

Use the formula nPr = n! / (n−r)!. For example, to find 6P2: calculate 6! / (6−2)! = 6! / 4! = (6×5×4×3×2×1) / (4×3×2×1) = 720/24 = 30. A shortcut is to multiply r consecutive descending integers starting from n: 6 × 5 = 30, which avoids computing the full factorials.

What does nPr mean in statistics?

nPr denotes the number of permutations of n items taken r at a time — that is, the number of ways to select and arrange r items, in order, from a total pool of n distinct items. It's a standard notation used across probability, statistics, and combinatorics textbooks and calculators.

Can r be equal to n in a permutation?

Yes. When r equals n, you are arranging every item in the full set, and the formula simplifies to nPr = n! because (n−n)! = 0! = 1. For example, 5P5 = 5! = 120, representing all possible orderings of 5 distinct items.

How many permutations are there for the letters in a word?

For a word with all distinct letters of length n, the number of arrangements is simply n!. If letters repeat, divide by the factorial of the count of each repeated letter to eliminate duplicate arrangements. For example, 'CAT' (3 distinct letters) has 3! = 6 arrangements, while 'ANNA' (4 letters, with 'A' and 'N' each repeated twice) has 4!/(2!×2!) = 6 distinct arrangements.

Why do permutation numbers get so large so quickly?

Because permutations rely on factorials, which multiply together every integer from n down to 1 (or down to n−r+1 for partial permutations). Each additional item multiplies the count rather than adding to it, so the total grows exponentially. 10 items arranged fully already produces 3,628,800 possible orders, and 20 items produce more than 2.4 quintillion.

Permutation

Other Tools

Calculate permutations and combinations

n (total)

r (choose)

Mode

Permutations answer a deceptively simple question: in how many different orders can you arrange a set of items? The answer grows so quickly that intuition fails almost immediately. Arranging just 8 books on a shelf produces 40,320 possible orders — not 8, not 64, but over forty thousand. This explosive growth is exactly why a permutation calculator is essential rather than optional whenever the numbers get past single digits.

A permutation is an ordered arrangement of a subset of items selected from a larger group, where the sequence matters. This distinguishes permutations from combinations, where order is irrelevant. Choosing 3 medal winners (gold, silver, bronze) from 10 racers is a permutation, because swapping who gets gold versus bronze creates a genuinely different outcome. Choosing any 3 people to sit on a committee, with no distinct roles, is a combination instead.

Our permutation calculator computes nPr — the number of ways to arrange r items chosen from a set of n — instantly, showing the full factorial breakdown so you understand exactly how the result was derived. It's built for students working through probability and statistics coursework, as well as anyone who needs to quantify arrangements for scheduling, cryptography, or combinatorics problems.

Why Permutation Matters

Permutations show up constantly in statistics courses, standardized tests, computer science, and real-world planning problems, making a reliable calculator genuinely useful rather than a novelty:

Academic coursework: Permutations and combinations form the foundation of introductory probability theory. Nearly every statistics or discrete math course includes problems on arranging letters, seating people, or ordering race finishers — and getting the factorial arithmetic right by hand is error-prone.

Password and security analysis: Understanding how many unique orderings exist for a given set of characters helps explain why longer, more varied passwords are exponentially harder to crack through brute force.

Scheduling and logistics: Determining how many distinct sequences exist for tasks, deliveries, or event lineups relies directly on permutation math, especially when order-of-operations affects the outcome.

Game and lottery odds: Many games (rankings, brackets, draft orders) depend on ordered outcomes, and permutation calculations let you quantify exactly how rare a specific ordering is.

Cryptography and combinatorics: Computer scientists rely on permutation counts to reason about the search space of encryption keys, cipher arrangements, and algorithmic complexity, since brute-force attacks must effectively try every possible ordering.

Probability problems: Many classic probability questions — the birthday problem, card-shuffling puzzles, seating arrangement riddles — reduce directly to a permutation calculation once you identify what counts as an 'ordered outcome' in the scenario.

The Permutation Formula, Explained

nPr = n! / (n − r)!

Where: n = total number of distinct items available, r = number of items being selected and arranged, and ! denotes factorial (the product of all positive integers up to that number, e.g., 5! = 5×4×3×2×1 = 120).

The formula works by counting the number of ways to fill r positions in sequence: there are n choices for the first position, (n−1) choices for the second (since one item is now used), (n−2) for the third, and so on down to (n−r+1) for the last position. Multiplying these together gives the same result as n! / (n−r)!, because the division by (n−r)! cancels out the unused tail of the factorial.

When r = n (arranging every item in the full set), the formula simplifies to nPr = n!, since (n−n)! = 0! = 1. This is the classic 'arrange everything' case, like ordering an entire deck of cards or a full shelf of books.

It helps to contrast this with the combination formula, nCr = n! / (r!(n−r)!), which divides out the r! ways each group of r items could itself be ordered. That extra division is precisely why combinations are always smaller than or equal to permutations for the same n and r — combinations collapse every possible ordering of a given group into a single count, while permutations treat each ordering as distinct.

Another useful way to think about the formula is as a sequence of shrinking choices: the first position can be filled n ways, the next (n−1) ways, and so on, until you've filled all r positions. Multiplying these r descending numbers together gives the same result as the factorial ratio, and it's often the faster mental shortcut for smaller values of r.

How to Use the Permutation: Step by Step

Identify your total set size (n)
Count the total number of distinct items available to choose from — for example, 10 runners in a race or 8 books on a shelf.
Identify how many you're arranging (r)
Determine how many items you are selecting and putting in order — for example, the top 3 finishers or 5 books chosen for a display.
Enter both values into the calculator
Input n and r into the permutation calculator. The tool automatically validates that r does not exceed n, since you cannot arrange more items than exist.
Review the calculated result
The calculator returns nPr instantly, along with the factorial expansion (n! / (n−r)!) so you can see exactly how the number was derived.
Compare against combinations if needed
If order doesn't actually matter for your problem, check the equivalent combination (nCr) value instead — it will always be smaller than or equal to the permutation.

Permutation Examples: Real-World Scenarios

Race Medal Order — Top 3 Finishers

A race has 10 competitors. A sports announcer wants to know how many different ways the gold, silver, and bronze medals could be awarded among them.

Total items (n):10

Items arranged (r):3

Calculation

nPr = 10! / (10−3)! = 10! / 7! = 10 × 9 × 8 = 720

Result

There are 720 distinct ways the top three medal positions could be filled among the 10 racers.

Arranging Books on a Display Shelf

A bookstore has 8 different bestselling titles and wants to feature 5 of them in a specific left-to-right order on a display shelf. How many distinct arrangements are possible?

Total items (n):8

Items arranged (r):5

Calculation

nPr = 8! / (8−5)! = 8! / 3! = 8 × 7 × 6 × 5 × 4 = 6,720

Result

There are 6,720 possible ordered arrangements of 5 books chosen from the 8 available titles.

Full Arrangement — Every Item Included

A teacher wants to know how many ways all 8 students in a small class could be lined up for a class photo, using every student (r = n).

Total items (n):8

Items arranged (r):8

Calculation

nPr = 8! / (8−8)! = 8! / 0! = 40,320 / 1

Result

There are 40,320 possible ways to line up all 8 students, since 0! = 1 and the full factorial applies.

Common Mistakes to Avoid

Confusing permutations with combinations — use permutations only when order matters (rankings, sequences, arrangements); use combinations when only the group membership matters (committees, hands of cards).
Forgetting that 0! = 1, not 0 — this trips up calculations where r = n, since (n−n)! = 0! must equal 1 for the formula to work correctly.
Selecting r greater than n — you cannot arrange more items than exist in the original set; the calculator will flag this as invalid.
Manually multiplying large factorials and making arithmetic errors — factorials grow extremely fast (13! is already over 6 billion), so always verify with a calculator rather than by hand for n above 10.

Tips & Tricks

If repetition is allowed (the same item can be reused in different positions), the formula changes to n^r instead of n!/(n−r)! — make sure you're using the right model for your problem.
Permutations of a set with duplicate items (like the letters in 'MISSISSIPPI') require dividing by the factorial of each repeated group to avoid overcounting identical arrangements.
For quick sanity checks, remember nPr is always greater than or equal to nCr for the same n and r, since permutations count every unique order while combinations group them together.

Permutations quantify how many distinct ordered outcomes are possible, and because factorials grow so explosively, doing this math by hand becomes impractical almost immediately. This calculator gives you the exact nPr value along with the underlying factorial breakdown, whether you're solving a textbook probability problem, estimating password strength, or working out scheduling possibilities. Once you're comfortable with permutations, the natural next step is learning when to switch to combinations instead — any time the order of your selected items stops mattering. For deeper theory on permutations and combinations, resources like Khan Academy and Wikipedia's combinatorics articles offer thorough, accessible explanations that pair well with hands-on practice using this calculator.

Permutation — Frequently Asked Questions

Related Calculators

Factorial Calculator

calculate the factorials behind every permutation

Standard Deviation Calculator

explore more statistics and probability tools

Mean & Median Calculator

analyze data sets alongside your permutation results

GCF & LCM Calculator

solve related number theory problems

Percentage Calculator

convert probabilities into percentages

Authoritative References

Khan Academy — Permutations

khanacademy.org — Free lessons on permutations and combinations fundamentals

Wikipedia — Permutation

wikipedia.org — Comprehensive mathematical reference on permutations

NIST — Combinatorics Reference

nist.gov — Authoritative mathematical reference on combinatorial functions

External links open in a new tab. OmniCalc.us is not affiliated with these organisations.

Related Calculators

Tip Splitter

Other Tools

Letter Grade

Other Tools

Percentage Change Calculator

Other Tools

Ratio Calculator

Other Tools

Proportion Calculator

Other Tools

GCF & LCM

Other Tools