Permutation and Combination Calculator (nPr, nCr)

Permutation & Combination Calculator

Compute nPr and nCr with full factorial steps, decide when order matters, and compare arrangements and selections with or without repetition for lotteries, hands, lineups, passwords, and committees.

🎯Real Counting Presets

📝Counting Inputs

The size of the full set you draw from. Kept at or below 170 so factorials stay finite.

How many you pick. For selections without repetition r must be at or below n.

Choose which value the highlighted answer describes. Both are always shown.

Reusable items change permutations to n^r and combinations to C(n+r–1, r).

A hint only. It suggests nPr for ordered problems and nCr for grouped ones.

Permutations nPr 0 ordered arrangements
Combinations nCr 0 unordered selections
With repetition 0 reusable items
Order factor r! 0 nPr / nCr

🔢Formula Snapshot

nTotal items
rChosen items
n!Factorial base
r!Order divisor

📐nPr vs nCr Formula Reference

CountMeaningFormulaOrderRepetition
Permutation nPrArrangements of r from nn! / (n – r)!MattersNot allowed
Combination nCrSelections of r from nn! / (r! (n – r)!)IgnoredNot allowed
Permutation with repeatSequences, items reusablen ^ rMattersAllowed
Combination with repeatMultisets, items reusableC(n + r – 1, r)IgnoredAllowed
RelationshipLink between the twonPr = nCr × r!r! orderingsEither mode
Full permutationArrange all n itemsn! (when r = n)MattersNot allowed

🧭Permutation vs Combination Decision Guide

QuestionUse ThisEveryday ExampleWhy
Are results ranked 1st, 2nd, 3rd?PermutationRace podium placesSwapping places changes the outcome
Is it just a group with no order?CombinationPizza toppings chosenSame toppings equal the same pizza
Do digit positions matter?PermutationPIN or lock code1234 differs from 4321
Is it a hand or committee?CombinationPoker hand dealtCard order in hand is irrelevant
Are you arranging in a line?PermutationSeating or lineupPosition along the line counts
Are you drawing a subset?CombinationLottery number drawBalls counted regardless of order

📊Small Values Reference (nPr and nCr)

n , rn!(n–r)!r!nPrnCr
4 , 22422126
5 , 2120622010
5 , 3120266010
6 , 37206612020
7 , 35,04024621035
8 , 440,32024241,68070
10 , 43,628,800720245,040210
10 , 53,628,80012012030,240252

🔁With vs Without Repetition Comparison

n , rPerm no repeatComb no repeatPerm repeat n^rComb repeatRatio nPr/nCr
3 , 263962
4 , 212616102
5 , 2201025152
5 , 36010125356
6 , 312020216566
6 , 4360151,29612624
8 , 3336565121206
10 , 37201201,0002206
Repeat grows fast: With repetition the permutation count n^r can exceed the without-repeat nPr because items are drawn again and again instead of being removed.
Ratio is r!: Without repetition nPr divided by nCr always equals r! because r chosen items can be ordered in r! ways, which is the extra structure permutations count.

Full Formula Breakdown

Factorialn! = n × (n–1) × ... × 2 × 1, and by definition 0! = 1. It counts the arrangements of a full set.
Permutation nPrnPr = n! / (n – r)!. Computed as the product of r descending terms n × (n–1) × ... to avoid overflow.
Combination nCrnCr = n! / (r! (n – r)!) = nPr / r!. It removes the r! duplicate orderings that permutations keep.
Permutation with repeatWhen items can repeat, each of the r positions has n choices, so the count is n ^ r.
Combination with repeatMultiset selections equal C(n + r – 1, r), the stars and bars count of reusable groups.
RelationshipnPr = nCr × r!, so permutations are always r! times the matching combinations without repetition.
GuardWithout repetition r must be at or below n. If r exceeds n the count is 0 because you cannot pick more distinct items than exist.

📋Worked Scenario Reference

Scenarion , rOrder?Formula UsedResult
Lottery 6 of 4949 , 6NonCr = 49! / (6! 43!)13,983,816
Race top 3 of 88 , 3YesnPr = 8! / 5!336
5 card hand of 5252 , 5NonCr = 52! / (5! 47!)2,598,960
4-digit PIN10 , 4YesPerm repeat 10^410,000
Committee 4 of 2020 , 4NonCr = 20! / (4! 16!)4,845
Handshakes 12 people12 , 2NonCr = 12! / (2! 10!)66

💡Practical Counting Tips

Order test: Ask whether swapping two chosen items creates a new outcome. If yes use permutation nPr; if the result is the same group use combination nCr.
Sanity check: nCr can never be larger than nPr for the same n and r, and both must be whole numbers. If a hand-calc gives a fraction, recheck the factorial steps.

The more options there are for messing something up, even a seemingly simple one, the more panicky it gets. You’re standing in line at the deli, looking at twenty toppings, and wondering whether your pizza will be special or simply one more repetition of an old pairing. Or you select a set of six lottery numbers, and the pressure of millions of possibilities presses down on you. How could anything that seems so random have an answer? But it doesn’t. It’s arithmetic disguised as randomness.

Two ways of counting things, permutations and combinations; are just labels for two different ways of counting. One way counts where order is important; the other way where it’s not. Until you try to use this distinction, it sounds like mere hair-splitting. But then, suddeny, the difference between a committee and a lineup becomes the gap between success and complete confusion.

Why Order and Repetition Matter

So, let’s go back to our original question about sequence. Permutations occur when you switch something and there’s an impact on the result. On a podium at a race, bronze or gold matter greatly. When we move them around we has a different outcome. Why? This is because position itself shows value. The calculator does the math for us (above). It divides the factorial of the total by the factorial of remainder. In doing so, it removes all combinations that aren’t relevant and just leaves ordered sequences that do matter. That’s efficient. And efficiency is why it works.

Combinations throw all that out the window. You have an ace of spades paired with a king of hearts. You also have another combination, the king of hearts paired with an ace of spades. But those two poker hands are equally strong regardless of how you got them in your hand. They’re the same. We’ll divide by the factorial of whatever we select (aka how many choices there is). Permutations will account for this. They know how many duplicates there are, but dividing by this number removes them. It shrinks down a huge number of arrangements into something reasonable: a number of possible combinations. If not for that part, you’d swear there must be millions of committee you could choose from. In reality, there are just a few dozen.

Things can get reused in the real world, making things messier. Four digits can repeat themselves. That’s why we shift from factorials to just plain exponentiation, because you could have your first digit be 7 and your last digit be 7 too. Now it grows exponentially, and that’s terrifyingly fast. Adding another digit to a password doesn’t just make the possibilities ten times as many. It increases entire system by increasing the base. Toggle the repetition option on the calculator to switch it over. This lets you see how much complexity explodes when you relax constraints.

Most people trip up because instead of relying on the structure, they attempt to imagine all possibilities. That’s impossible (you can’t imagine 36 million). But you can follow the rules that create those possibilities. Change one element: does that change the outcome? Yes? Multiply. No? Divide. It is a tiny little check in your head, but it will save you hours of incorrect guesses.

On the page itself, they have the reference tables laid out for smaller groups. Even just a few items (like five or six) demonstrates just how fast things grow. These are the kinds of numbers that help you understand probability and the risk. When you know that there are almost fourteen million possibilities for pulling six numbers out of a pool of forty nine, winning a lottery feels appropriately impossible. It puts your luck into context. When you know that there are only a few thousand possible ways to create a small committee, it becomes obvious how fragile consensus can be. You just don’t have that many options.

And here’s why I love this math: It transforms chaos into structure. Because we have an unlimited number of choices in life, but nearly all of our choices adheres to those two simple rules of order and repetition. When you realize that pattern, the stress evaporates. Where there used to be a wall of options, you begin to see a grid of possibilities. And that transition from clarity to overwhelm? It has far more greater value then any one answer.

Permutation and Combination Calculator (nPr, nCr)