Would you rather line up 4 friends in every possible photo order, or just pick 2 of them to be in the photo? The first question is about permutations. The second is about combinations. Combinations vs permutations comes down to one simple test: does the order of your picks change the result, and once you answer that, the right formula and the right count follow on their own.
Permutations count arrangements where order matters, like who finishes 1st, 2nd, and 3rd in a race. Combinations count groups where order does not matter, like picking a 2 person team. The permutation formula is nPk = n! / (n-k)!. The combination formula is nCk = n! / (k! x (n-k)!), and for the same n and k it always gives a smaller number.
Combinations vs Permutations: The Core Difference
Combinations vs permutations is really a question about order. A permutation is an arrangement where the order of the items matters. A combination is a selection where the order does not matter at all.
Picture picking 2 friends from a group of 4 to grab coffee. It does not matter who you name “first,” so that is a combination. Now picture awarding 1st place and 2nd place in a race among the same 4 friends. First place and second place are different outcomes, so that is a permutation.
Because a permutation counts every order separately, there are always more permutations than combinations for the same group and the same number of picks. A combination simply groups those matching orders together as one.
- Words like “rank,” “order,” “arrange,” “sequence,” or “1st, 2nd, 3rd” usually point to a permutation.
- Words like “choose,” “select,” “group,” “team,” or “committee” usually point to a combination.
What Is a Factorial? A Quick Refresher
Both formulas below use factorials, so it helps to review them first. A factorial, written with an exclamation point like “n!,” means multiply that whole number by every whole number below it, down to 1.
For example, 4! = 4 x 3 x 2 x 1 = 24. And 2! = 2 x 1 = 2. There is one special rule worth remembering: 0! is defined as 1, not 0.
Factorials grow fast as n gets bigger. That is why even small groups can hide a surprisingly large number of possible orders.
The Permutation Formula: nPk
A permutation counts how many ways you can choose k items from a group of n and arrange them in order. The formula is:
nPk = n! / (n – k)!
Here, n is the total number of items in the group, and k is how many you are choosing and arranging. The formula takes all possible orderings of the full group, n!, and divides out the orderings of the leftover items you did not use.
Reach for nPk whenever position or rank matters, such as awarding medals, assigning a batting lineup, or setting a countdown order.
The Combination Formula: nCk
A combination counts how many ways you can choose k items from a group of n when order does not matter at all. The formula is:
nCk = n! / (k! x (n – k)!)
This formula starts the same way as the permutation formula, then adds one extra step. It divides by k! as well, which cancels out all the different orders of the same chosen group, since those orders should only count once.
Reach for nCk whenever you are simply selecting a group, such as picking committee members, lottery numbers, or pizza toppings.
Same 4 People, Two Different Answers
Numbers make this clearer than words alone. Picture 4 people: A, B, C, and D. Suppose you need to pick 2 of them.
As a combination, order does not matter, so 4C2 = 4! / (2! x 2!) = 24 / (2 x 2) = 24 / 4 = 6. Those 6 possible groups are: AB, AC, AD, BC, BD, and CD.
As a permutation, order matters, say for 1st place and 2nd place, so 4P2 = 4! / 2! = 24 / 2 = 12. Those 12 possible orders include AB and BA as two separate results, along with AC, CA, AD, DA, BC, CB, BD, DB, CD, and DC.
Same 4 people. Same 2 spots to fill. Twice as many outcomes once order starts to count.
| Detail | Combinations (4C2) | Permutations (4P2) |
|---|---|---|
| Does order matter? | No | Yes |
| Formula used | 4! / (2! x 2!) | 4! / 2! |
| Answer | 6 groups | 12 orders |
| Example outputs | AB, AC, AD, BC, BD, CD | AB, BA, AC, CA, AD, DA… |
How the Math Works, Step by Step
It helps to see each formula broken into steps rather than as one dense line. The diagram below walks through both calculations for the same 4-people, choose-2 example.
Notice that both formulas start from the same top number, 4! = 24. The combination formula then divides by one extra piece, 2! = 2, on top of what the permutation formula already divides by.
That single extra division is the entire difference between the two results.
Everyday Examples: Committees vs Race Results
Formulas aside, combinations and permutations show up constantly in daily life. Learning to spot which one applies is the real skill.
- Choosing a 3 person committee from a club: a combination, because the 3 chosen members form a group, not a ranked order.
- Awarding 1st, 2nd, and 3rd place in a race: a permutation, because each place is a separate, distinct position.
- Picking a set of lottery numbers from a drum: a combination, because the numbers just need to match, in any order.
- Setting the letter order in a password: a permutation, because rearranging the same letters changes the password.
Try It Again: A Committee of 3 From 6 People
Practice with new numbers to check that the pattern holds. Suppose a club has 6 members and needs a 3 person committee.
As a combination, 6C3 = 6! / (3! x 3!) = 720 / (6 x 6) = 720 / 36 = 20. There are 20 possible committees, since the order inside each committee does not matter.
Now suppose instead you are ranking the top 3 finishers out of the same 6 people. As a permutation, 6P3 = 6! / 3! = 720 / 6 = 120. There are 120 possible finish orders, six times more than the committee count.
You can check numbers like these instantly with our Combination and Permutation Calculator, which runs both formulas for any n and k you enter.
A Quick Way to Decide Which One You Need
When you are not sure which formula fits, ask one question: does swapping the order create a new, different outcome?
- If swapping the order matters, such as 1st place versus 2nd place, use the permutation formula, nPk.
- If swapping the order does not matter, such as the same team either way, use the combination formula, nCk.
- Count how many items you are choosing from in total; that is n.
- Count how many you are actually choosing; that is k. Then plug both into the matching formula.
Related Probability and Statistics Ideas
Combinations and permutations often sit alongside other probability ideas, but each concept answers a different question.
Once you know how many outcomes are possible, you may also want to know how likely one outcome is, or how that likelihood is written as odds. See Probability vs Odds: What’s the Difference? for that comparison.
If you are weighing outcomes that carry different payoffs or values, our guide to Expected Value Explained covers how probability and value combine.
Ready to skip the manual factorial math? Enter your own n and k into our Combination and Permutation Calculator and get both the combination count and the permutation count instantly.
Frequently Asked Questions About Combinations vs Permutations
What Is the Main Difference Between Combinations and Permutations?
A permutation counts arrangements where order matters, so swapping two items creates a new result. A combination counts selections where order does not matter, so swapping two items gives the same result. Because of this, permutations always produce a number equal to or larger than combinations for the same n and k.
What Is the Formula for Permutations (nPk)?
The permutation formula is nPk = n! / (n-k)!, where n is the total group size and k is how many items you choose and arrange. For example, with n=4 and k=2, nPk = 4! / (4-2)! = 24 / 2 = 12. Use it whenever position or rank matters.
What Is the Formula for Combinations (nCk)?
The combination formula is nCk = n! / (k! x (n-k)!), where n is the total group size and k is how many items you select. For example, with n=4 and k=2, nCk = 4! / (2! x 2!) = 24 / 4 = 6. Use it whenever you are only picking a group, not ranking it.
What Is a Factorial, and Why Do These Formulas Need It?
A factorial, written n!, means multiplying a whole number by every whole number below it down to 1, so 4! = 4 x 3 x 2 x 1 = 24. Both formulas use factorials because they need to count total possible orderings before removing the ones that do not apply. By definition, 0! equals 1.
What Is a Real Life Example of a Permutation?
A race finish order is a classic permutation example. If 4 runners finish a race, who takes 1st, 2nd, and 3rd place matters, so switching two runners’ places creates a completely different result. Assigning ranked medals, seating order, or a countdown list are all permutations too.
What Is a Real Life Example of a Combination?
Picking a committee or team from a larger group is a classic combination example. If you choose 2 people from 4 friends to join a project, it does not matter which one you “picked first,” since the final pair is the same either way. Choosing lottery numbers or pizza toppings works the same way.
Is a Combination Always Smaller Than a Permutation for the Same n and k?
Yes, when k is 2 or more, the combination count is always smaller than or equal to the matching permutation count. That is because the combination formula divides the permutation count by k!, which folds every repeated order into a single group. When k equals 1, the two formulas actually give the same result.
Sources
Authoritative Sources Used in This Article
This article is for general education only. Statistical methods and examples use standard conventions and simplified data, so real-world analysis can be more complex. Reviewed for accuracy by Prof. Dr. Khalil Mudassar, PhD. Last updated September 13, 2026.
Author
Shakeel Muzaffar is the Founder and Editor-in-Chief of MultiCalculators.com, bringing over 15 years of experience in digital publishing, product strategy, and online tool development. He leads the platform's editorial vision, ensuring every calculator meets strict standards for accuracy, usability, and real-world value. Shakeel personally oversees content quality, formula verification workflows, and the platform's commitment to publishing tools that are genuinely useful for students, professionals, and everyday users worldwide.
