Permutation Calculator: Find the Number of Arrangements Instantly

One of the most common sources of confusion in probability and statistics is knowing whether a problem calls for a permutation or a combination. A permutation calculator solves this problem instantly by working out exactly how many ways a set of items can be arranged, when the order of arrangement matters.

Permutation Calculator

🔢 Permutation Calculator

Enter Your Details

n
r

Keep n and r ≤ 20 for a clean, readable result — larger values grow astronomically fast.

Your Results

Highlighted items show one possible arrangement

0
Total Permutations
nPr = n! / (n-r)!
Permutations
—
Combinations
—
n! (Factorial)
—
(n-r)!
—

Permutations vs Combinations Growth

How the count grows as r increases, for your chosen n

Permutations (nPr)
Combinations (nCr)

How permutation calculator works

Income tax calculator showing old vs new tax regime comparison results

A permutation calculator finds how many ways you can arrange r items out of a total of n, where the order matters. It uses the formula nPr = n! / (n − r)! to give the count of possible arrangements.

Things to keep in mind

  • Order of items matters, unlike combinations
  • r cannot be greater than n
  • Results grow very large as n increases (factorials)
  • Assumes items are distinct unless stated otherwise

What is a Permutation Calculator?

A permutation calculator is a tool that determines the number of ways to arrange r items chosen from a set of n distinct items, where the order of selection matters. It can also handle permutations with repetition, where items can be reused within an arrangement.

Permutation vs. combination — what’s the difference?

A permutation counts arrangements where order matters — “AB” and “BA” are counted as two different outcomes. A combination counts selections where order does not matter — “AB” and “BA” are treated as the same outcome. Choosing the wrong one is the single most common mistake in this area of math, so it’s worth confirming which one your problem actually needs before calculating.

Two problems with the same numbers of items can have very different answers depending on whether the arrangement’s order matters — a race with 1st, 2nd, and 3rd place needs a permutation, while picking a 3-person committee needs a combination.


Why Use a Permutation Calculator?

Using a permutation calculator instead of working it out by hand saves time and reduces errors in several practical ways:

  • Avoid factorial errors — factorials grow extremely fast, and manual multiplication is easy to get wrong
  • Handle large values instantly — calculating 10P4 or 15P6 by hand is slow and error-prone
  • Distinguish order-matters problems from order-doesn’t-matter problems — get the right formula for the right question
  • Support repetition cases — some problems allow items to repeat, others don’t
  • Check homework or exam answers — verify your manual working quickly
  • Solve real-world problems — passwords, seating arrangements, race rankings, and scheduling all rely on permutations
  • Save time on statistics and probability coursework — skip the repetitive factorial arithmetic

How Does the Calculator Work?

Webequa’s calculator uses two simple inputs to compute the number of permutations. Here’s what you’ll need:

  • n (total number of items) – the size of the full set you’re choosing from
  • r (number of items selected/arranged) – how many items are being arranged at a time
  • Repetition (yes/no) – whether an item can be used more than once in a single arrangement

Once entered, the calculator applies the appropriate permutation formula and returns the total number of possible arrangements.


Formula

Webequa’s calculator uses the standard Permutation Formula used in statistics, probability, and combinatorics worldwide.

Step 1: Permutations Without Repetition

 
nPr = n! ÷ (n − r)!

Where n! (“n factorial”) means multiplying every whole number from n down to 1:

 
n! = n × (n − 1) × (n − 2) × ... × 2 × 1

Step 2: Permutations With Repetition

 
When items can repeat within an arrangement:

nPr (with repetition) = n^r

Step 3: Special Case — Arranging All n Items

 
When r = n (arranging the entire set), the formula simplifies to:

nPn = n!

Variable explanations:

  • n — the total number of distinct items available to choose from
  • r — the number of items being selected and arranged at a time
  • n! — the factorial of n, the product of all positive integers up to n
  • Repetition — whether the same item can appear more than once within a single arrangement

Assumptions:

  • Items in the base set (n) are treated as distinct unless stated otherwise
  • “Without repetition” assumes each item can only be used once per arrangement
  • 0! is defined as 1, a standard convention used throughout combinatorics
  • r must be a whole number no greater than n when repetition is not allowed

Note: If your problem doesn’t care about order — for example, choosing a group of people rather than ranking them — you need a combination, not a permutation. Using the wrong formula is the most common error in this topic.


How to Use This Calculator

  1. Enter n, the total number of items in your set.
  2. Enter r, the number of items to arrange.
  3. Select whether repetition is allowed.
  4. Click Calculate.
  5. Review the total number of permutations, along with the formula used.

Tip: Before calculating, ask yourself: “Does the order of the outcome matter?” If yes, it’s a permutation. If no, it’s a combination.


Example Calculations

Example 1: Race Rankings (Without Repetition)

Scenario: 8 runners are competing in a race. In how many ways can 1st, 2nd, and 3rd place be awarded?

ValueAmount
n (total runners)8
r (places awarded)3
RepetitionNo

Step 1: Apply the formula:

 
8P3 = 8! ÷ (8 − 3)! = 8! ÷ 5!

Step 2: Expand and simplify:

 
8! ÷ 5! = (8 × 7 × 6 × 5!) ÷ 5! = 8 × 7 × 6 = 336

Result: There are 336 possible ways to award 1st, 2nd, and 3rd place.


Example 2: 4-Digit PIN Code (With Repetition)

Scenario: How many 4-digit PIN codes can be created using the digits 0–9, if digits can repeat?

ValueAmount
n (digits available)10
r (digits in the PIN)4
RepetitionYes

Step 1: Apply the repetition formula:

 
nPr (with repetition) = n^r = 10^4

Step 2: Calculate:

 
10 × 10 × 10 × 10 = 10,000

Result: There are 10,000 possible 4-digit PIN codes.


Permutation Reference Chart

Common nPr Values (Without Repetition)

nrnPr
5220
63120
83336
1045,040
12595,040

Permutation vs. Combination — Quick Reference

Question TypeOrder Matters?Use
Race rankings (1st, 2nd, 3rd)YesPermutation
Selecting a committeeNoCombination
Arranging books on a shelfYesPermutation
Choosing lottery numbersNoCombination
Setting a phone unlock codeYesPermutation
Picking a team from a squadNoCombination

Understanding Your Results

  • nPr result — the total number of distinct ordered arrangements possible
  • Formula used — whether the with-repetition or without-repetition formula was applied, based on your inputs
  • n! and (n−r)! — the intermediate factorial values used in the calculation, useful for showing your working
  • Repetition status — confirms whether items were allowed to repeat within an arrangement

If your result seems unexpectedly large, double-check whether repetition should really be allowed — permutations with repetition grow far faster than those without.


Factors That Affect the Result

Several factors change how a permutation problem should be set up:

  • Whether order matters — the single biggest factor in choosing the right formula
  • Whether repetition is allowed — repetition dramatically increases the number of possible outcomes
  • Distinct vs. identical items — if some items in the set are indistinguishable, a different formula (permutations of a multiset) is required
  • Size of n and r — larger values grow extremely quickly due to the nature of factorials
  • Constraints on the arrangement — some problems restrict certain items to certain positions, requiring a modified approach

Benefits of Using a Permutation Calculator

  1. Free and instant results
  2. Eliminates manual factorial errors
  3. Handles both repetition and non-repetition cases
  4. Shows the formula and intermediate steps used
  5. Useful for statistics, probability, and combinatorics coursework
  6. Saves time on large factorial calculations
  7. Helps distinguish permutation problems from combination problems
  8. Useful for real-world applications like passwords and scheduling
  9. Supports quick homework and exam verification
  10. Free to use as often as needed with no registration

Limitations

  • Assumes items in the base set are distinct — sets with repeated/identical items need a different (multiset) formula
  • Does not solve combination problems — use a dedicated combination calculator when order doesn’t matter
  • Very large factorials may be approximated — extremely large values of n can produce results that exceed standard numeric precision
  • Does not handle constrained arrangements — special restrictions (e.g., two items must always be adjacent) require manual adjustment
  • r cannot exceed n without repetition — without repetition, you cannot arrange more items than exist in the set

Disclaimer: Results are based on standard permutation formulas. Always confirm whether your specific problem calls for a permutation or a combination before relying on the result.


Common Mistakes

  1. Using a permutation formula when the problem actually requires a combination
  2. Forgetting to check whether repetition is allowed
  3. Mixing up n and r in the formula
  4. Trying to calculate nPr when r is greater than n without allowing repetition
  5. Forgetting that 0! equals 1, not 0
  6. Miscounting the total set size (n) by excluding or duplicating an item
  7. Not recognizing multiset problems (arrangements with identical items)
  8. Assuming every “arrangement” problem is a straightforward permutation without checking for constraints
  9. Rounding intermediate factorial values instead of calculating exactly
  10. Confusing “number of arrangements” with “number of selections”

Tips for Accurate Results

  1. Always ask first whether order matters — this decides permutation vs. combination
  2. Confirm whether repetition is allowed before choosing a formula
  3. Double-check your value of n includes every item in the original set
  4. Write out the formula before plugging in numbers to avoid mixing up n and r
  5. For small values, it can help to list out a few example arrangements manually to sanity-check your answer
  6. Remember that permutations with repetition grow much faster than those without
  7. If items in your set are identical, look up the multiset permutation formula instead
  8. Use the calculator’s step breakdown to check your manual working
  9. For exam prep, practice identifying permutation vs. combination wording in word problems
  10. When r equals n, remember the shortcut: nPn = n!

Why Trust Webequa?

  • ✔ Accurate, formula-verified calculations
  • ✔ Expert-reviewed information
  • ✔ Privacy-first — no data stored
  • ✔ No registration required
  • ✔ Mobile-friendly design
  • ✔ Fast loading, no clutter
  • ✔ Free forever
  • ✔ Regularly updated content
  • ✔ Accessible worldwide

Related Calculators


Scientific and Trade References


Conclusion

Getting permutations right saves time, avoids exam mistakes, and gives you confidence when working through probability and statistics problems. A permutation calculator gives you a fast, accurate way to find the number of possible arrangements for any set of items — with or without repetition. Webequa’s calculator handles all the factorial math automatically so you can focus on understanding the problem rather than the arithmetic.

Try Webequa’s free permutation calculator today and get an accurate nPr result in seconds.

FAQs

Permutation Calculator – Frequently Asked Questions
Note: Results are based on standard permutation formulas. Always confirm whether your specific problem calls for a permutation or a combination before relying on the result.
Scroll to Top