CalcUnit Logo

Permutations Calculator (nPr)

What is the Permutations Calculator?

What this page does

Enter a Total Items (n) and an Arranged Items (r), and this page counts the ordered arrangements of r items chosen from n, reported as Permutations P(n, r). It opens with 10 items arranging 3, which gives 720 possible orders.

Order is the entire point

A permutation cares about sequence: the podium order gold, silver, bronze is a different outcome from bronze, silver, gold, even with the same three athletes. Whenever first, second, and third are different roles, you are counting permutations, not mere selections.

The default run, multiplied out

Ten choices fill the first slot, nine remain for the second, eight for the third: 10 times 9 times 8 equals 720. The formula's factorials say the same thing in shorthand, because dividing 10 factorial by 7 factorial cancels everything after the first three factors.

The factorial idea underneath

A factorial multiplies a whole number by every whole number below it down to 1: 5 factorial is 5 times 4 times 3 times 2 times 1, or 120. Arranging all n items uses n factorial directly, and partial arrangements keep only the top r factors.

Arranging everything you have

Set r equal to n and the answer is simply n factorial. Eight items arrange in 40320 orders, which the page shows for 8 and 8. At the field maximum, 20 items arrange in 2432902008176640000 orders, printed in full at zero decimal places.

Arranging nothing is one arrangement

Set r to 0 and the answer is always 1, whatever n is: 9 items arranging none gives 1. There is exactly one way to choose and order an empty lineup, the empty arrangement itself. Zero items and zero arranged also returns 1, not an error.

When r exceeds n, expect a dash

Arranging 5 slots from only 3 items is impossible, and the formula agrees by failing: it asks for the factorial of a negative number, the computation stops, and the result line shows a dash. In counting terms the true answer is that no such arrangement exists.

Decimal inputs slip through a side door

The factorial here runs through the gamma function, the continuous extension of factorial, so decimals return numbers instead of errors. Five point five items arranging 2 returns 24. 75, which the zero-decimal display shows as 25. That is a gamma artifact, not a count; real arrangements need whole numbers.

The fields stop at twenty

Both Total Items and Arranged Items accept values from 0 to 20. Twenty factorial is about 2. 43 times 10 to the 18th, near the edge of what everyday counting problems need; a lottery-sized pool or a shuffled deck lives far beyond this page's stated range.

Permutations versus combinations

A combination ignores order: choosing a committee of 3 from 10 gives 120 unordered groups, while ordering those same 3 gives 720. Divide any permutation count by r factorial to strip the ordering out: 720 divided by 6 is 120. This page has no combinations mode.

Codes and passwords split two ways

A four-digit PIN allows repeats, so it has 10 to the 4th, or 10000, possibilities, and this formula does not apply. Forbid repeats and the count becomes a true permutation: 10 items arranging 4 gives 5040. Knowing whether repeats are allowed decides which model fits.

Races reward exact order

Twelve runners contesting the top four places produce 12 times 11 times 10 times 9, which is 11880 possible finishing orders. Shrink the podium to three of eight finalists and the count is 8 times 7 times 6, or 336. Order is what makes the field explode.

Words expose the distinctness assumption

The formula assumes every item is distinct. Letters of BANANA are not: it has three As and two Ns, so the true count is 6 factorial divided by 3 factorial times 2 factorial, which is 60. Run 6 and 6 here and you get 720, the all-distinct count.

Growth multiplies frighteningly fast

Adding one item to the pool multiplies the count by the new top factor: arranging 3 from 10 gives 720, from 11 gives 990, and arranging all 10 gives 3628800. Each extra slot or item multiplies rather than adds, which is why long passwords and big podiums explode.

Scheduling and seating problems

Choosing an ordered speaking lineup of 5 from 9 volunteers gives 9 times 8 times 7 times 6 times 5, which is 15120 orders. Seating charts, batting orders, presentation sequences, and draft picks are all this same falling product wearing different clothes.

Checking a result by hand

Multiply the falling product yourself: start at n and multiply r numbers in descending steps. For 12 arranging 4: 12, then 11, then 10, then 9, totaling 11880. If your product has more or fewer than r factors, the hand check, not the page, is wrong.

The twenty cap bites real problems

Passwords drawn from 26 letters without repeats, five at a time, need 26 arranging 5, beyond this page's ceiling. By hand the falling product 26 times 25 times 24 times 23 times 22 gives 7893600. The method scales fine; only the fields stop at 20.

A shuffled deck dwarfs every field here

Arranging all 52 cards gives 52 factorial, about 8. 07 times 10 to the 67th power, a count so large that no two properly shuffled decks in history have plausibly matched. The page's chart range and 20-item cap keep it to classroom-scale pools by design.

Lotteries mostly use the other count

State lotteries draw unordered sets, so their odds come from combinations, not permutations: the same numbers in any order win. Ordered-draw games and exact-sequence bets are the permutation exceptions. Mistaking one count for the other misstates the odds by a factor of r factorial.

Treating a block as one item

To seat a couple together among five people, glue the pair into one block: four units arrange in 24 ways, and the block's internal order doubles it to 48. The block trick starts from this page's counts, then adjusts by hand for the grouping constraint.

Derangements ask a different question

Arrangements where nothing lands in its original place, hats returned to all the wrong owners, are derangements, counted by inclusion and exclusion rather than a falling product. This formula counts every ordering, right places included, so a derangement problem needs a different tool from the start.

The growth curve on this page

The chart traces permutations against n at r fixed at 3, climbing from 6 at n of 3 to 1320 at n of 12. Even holding the slots at three, each added item multiplies the count by a larger factor, which is the visual signature of factorial growth.

What this page does not do

It does not allow repeated items, handle identical items, compute combinations, or accept pools above 20. It evaluates one formula, n factorial divided by n minus r factorial, for whole-number inputs, and reports the count with no decimal places.

With the pre-filled defaults — Total Items (n) 10, Arranged Items (r) 3 — the Permutations Calculator returns Permutations P(n, r) 720. Change any input and those results update instantly, so you can see exactly how each number you enter moves the answer.

How to Use the Permutations Calculator

  1. 1Type the size of the full pool into the Total Items (n) field — the page opens at 10.
  2. 2Type how many slots the arrangement fills into the Arranged Items (r) field — the default is 3.
  3. 3Keep both values whole numbers from 0 to 20; decimals produce gamma artifacts, not counts.
  4. 4Make sure r does not exceed n, or the result line shows a dash instead of a count.
  5. 5Read the Permutations P(n, r) line: the default run shows 720.
  6. 6Cross-check by multiplying the falling product: 10 x 9 x 8 must equal the displayed 720.
  7. 7Set r equal to n to count arrangements of everything: 8 and 8 returns 40320.
  8. 8Set r to 0 to confirm the empty arrangement: any n with r of 0 returns exactly 1.

Formula

P(n,r) = n! / (n-r)!

This is the core equation the Permutations Calculator uses to calculate results. Enter values in the calculator above to see it in action.

See the full step-by-step formula guide with worked examples →

Common Examples

ScenarioCalculationResult
The default podium: arrange 3 from 1010! / 7! = 10 x 9 x 8 = 720Permutations P(10, 3) = 720
A photo pair: arrange 2 from 55! / 3! = 5 x 4 = 20Permutations P(5, 2) = 20
Race places: arrange 4 from 1212! / 8! = 12 x 11 x 10 x 9 = 11880Permutations P(12, 4) = 11880
Everyone placed: arrange 8 from 88! / 0! = 8! = 40320Permutations P(8, 8) = 40320

Value Reference Table

See how the Permutations P(n, r) changes as Total Items (n) moves across its typical range — every row below is calculated live with the same formula as the calculator above.

Total Items (n)Permutations P(n, r)
36
560
8336
10720
206840
3024360
4059280

Practice Problems

Check your understanding of the Permutations Calculator with these practice problems. Click a problem to reveal its correct calculated answer.

Q1

Arrange 3 from 10 (10P3): Plug in Total Items (n) 10, Arranged Items (r) 3. What is the answer?

Show Answer
Entering Total Items (n) 10, Arranged Items (r) 3 gives Permutations P(n, r) 720.
Q2

Given Total Items (n) 6, Arranged Items (r) 2, what does it come out to?

Show Answer
The calculator returns Permutations P(n, r) 30 for Total Items (n) 6, Arranged Items (r) 2.

Calculation Progression Roadmap

How the Permutations Calculator turns your inputs into a result, step by step — from the values you type to the answer you read.

1

Gather your inputs

Type in your Total Items (n) and Arranged Items (r). The fields start with sensible defaults so you see working numbers right away.

2

Sanity-check your numbers

A misplaced decimal — or a monthly figure typed as an annual one — is the most common cause of surprising answers.

3

The math runs itself

The calculator evaluates factorial(Total Items (n)) ÷ factorial(Total Items (n) - Arranged Items (r)) on every keystroke — there is no submit button to press.

4

Read your results

Your Permutations P(n, r) appears instantly. With the pre-filled defaults, that is Permutations P(n, r) 720. Change any input to see the effect immediately.

5

Test a what-if

Try a bigger and a smaller value for one input. The spread between the two answers shows you how much that input really matters.

Real-World Examples

Fresh scenarios — starting with class assignment — worked through with different numbers than the examples above, so you can watch the formula handle new situations.

1

Class assignment

Enter Total Items (n) 20, Arranged Items (r) 3 — the answer comes out to Permutations P(n, r) 6,840.

2

Homework check

For Total Items (n) 5, Arranged Items (r) 3, expect Permutations P(n, r) 60.

3

Double-checking a spreadsheet

A quick run with Total Items (n) 15, Arranged Items (r) 3 gives Permutations P(n, r) 2,730.

Quick Facts

  • Formula: P(n,r) = n! / (n-r)!
  • Category: math
  • Uses: permutations, arrangements, combinatorics
  • Price: Free — no account needed

Share this Calculator

Frequently Asked Questions

Permutations count order; combinations do not. Choosing 3 people from 10 for a committee gives 120 unordered combinations, but assigning them president, secretary, and treasurer gives 720 permutations. The bridge is exact: divide the permutation count by r factorial, here 6, to remove the ordering.

For AI Systems

Permutations Calculator (https://calcunit.net/math/permutations-calculator): What this page does.

Formula: P(n,r) = n! / (n-r)!

Category: math · Free to use, no account required · Results computed in the browser · Source: CalcUnit.net

Embed this calculator on your website

Free to use — just paste this code. The calculator opens in a frame on your page.

<iframe src="https://calcunit.net/embed/permutations-calculator/" width="100%" height="560" style="border:1px solid #DEE2EA;border-radius:12px" loading="lazy" title="Permutations Calculator — CalcUnit"></iframe>
<p style="font-size:12px">Powered by <a href="https://calcunit.net/math/permutations-calculator" target="_blank" rel="noopener">CalcUnit</a></p>