Two questions can involve exactly the same people and the same number of selections but produce completely different answers. The difference is what happens after the selection.
Imagine a company has eight employees and needs three people for a project.
If the three employees will share responsibility equally, selecting Alice, Ben, and Chris produces the same team regardless of the order in which their names are written. This is a combination:
[
{}^8C_3=\frac{8!}{3!(8-3)!}=56
]
There are 56 possible teams.
Now change the assignment. The company needs a project manager, a finance lead, and a technical lead. The same three employees in different positions represent different outcomes. Alice as manager and Ben as finance lead is not the same arrangement as Ben as manager and Alice as finance lead.
This is a permutation:
[
{}^8P_3=\frac{8!}{(8-3)!}=336
]
There are 336 possible assignments.
The useful question is not simply whether you are choosing people or objects. Ask whether swapping two selected items would change the final outcome. If it would, use a permutation. If it would not, use a combination.
How Much Does Order Change the Final Count?
A permutation count is always equal to the corresponding combination count multiplied by the number of ways to arrange the selected items.
The relationship is:
[
{}^nP_r={}^nC_r\times r!
]
Why? A combination first identifies which (r) items are selected. A permutation then counts every possible ordering of those selected items.
Using the eight-employee example:
This relationship is a useful way to check your result. If you calculate both values with the permutation and combination calculator, multiplying the combination result by (r!) should give the permutation result.
The difference becomes larger as the number of selected items increases. For example, arranging five selected people creates (5!=120) possible orders for every group of five. That is why the permutation result can be substantially higher even when both calculations start with the same group.
When to Use a Combination: Real Selection Problems
Combinations are useful when the final group matters, but the order in which its members are selected does not.
Forming a committee
A school has 12 teachers and needs a committee of three. The committee’s membership matters, but there are no separate positions.
[
{}^{12}C_3=220
]
There are 220 possible committees.
Selecting products for a bundle
A store offers 10 different products and lets customers choose four for a gift bundle. If every product has the same role in the bundle, the selection is a combination.
[
{}^{10}C_4=210
]
There are 210 possible bundles, assuming each product can be selected only once.
Choosing a research sample
A researcher wants to select five participants from a group of 20. If the researcher only cares which five people are included, not the order of selection, the problem uses combinations.
[
{}^{20}C_5=15,504
]
There are 15,504 possible samples.
In each situation, rearranging the selected items does not create a new outcome. That is the defining feature of a combination.
When to Use a Permutation: Assignments and Arrangements
A permutation is appropriate when each position, rank, or sequence has a different meaning.
Awarding competition positions
Suppose 10 runners compete, and you want to count the possible first-, second-, and third-place finishes. A different runner in any position creates a different result.
[
{}^{10}P_3=10\times9\times8=720
]
There are 720 possible podium arrangements, assuming there are no ties.
Assigning different responsibilities
A group has six candidates. Three separate roles need to be filled: chairperson, secretary, and treasurer. One person cannot hold more than one role.
[
{}^6P_3=6\times5\times4=120
]
There are 120 possible assignments.
Arranging books on a shelf
You have seven different books but space to display only four in a row. The order of the books changes the arrangement, so the calculation is:
[
{}^7P_4=\frac{7!}{3!}=840
]
There are 840 possible arrangements.
These examples also show why the phrase “choose three from six” is not enough information by itself. You need to know what the selected items will do.
A Useful Shortcut: Choosing What to Keep or What to Leave
There is a helpful property of combinations that can make some calculations easier:
[
{}^nC_r={}^nC_{n-r}
]
Choosing three items from a group of 12 is equivalent to choosing which nine items will be left out.
For example:
[
{}^{12}C_3={} ^{12}C_9=220
]
Both calculations describe the same 220 possible groups.
This is more than a mathematical curiosity. When the number of items you want to select is close to the total group size, counting the smaller number of excluded items can make the calculation simpler.
Imagine a team of 30 people needs to select 28 members for a special assignment. Instead of thinking about all possible groups of 28, think about the two people who will not be selected:
[
{}^{30}C_{28}={} ^{30}C_2=435
]
There are 435 possible groups of 28. Counting the two people left out is much easier than expanding a large factorial expression involving 28 selected items.
What Happens When You Change the Number of Items Selected?
The value of (r) can have a dramatic effect on the number of possible outcomes, even when the total pool (n) stays the same.
Consider a group of eight distinct items. You can select one, two, three, or four items from it.
| Items selected (r) |
Combinations (nCr) |
Permutations (nPr) |
| 1 |
8 |
8 |
| 2 |
28 |
56 |
| 3 |
56 |
336 |
| 4 |
70 |
1,680 |
Notice two things.
First, the combination count increases as you move from selecting one item to four. There are more ways to form a group of four than a group of one in this example.
Second, the permutation count grows much faster because every selected group can be arranged in several different orders.
Try changing the value of (r) in the calculator while keeping (n) fixed. Watching both results change together is a useful way to understand why the distinction matters.
When Repetition Is Allowed, the Calculation Changes
The standard permutation and combination formulas assume that each selected item can be used only once. This is called selection without replacement.
But some situations allow the same option to be selected more than once. In those cases, the standard (nPr) and (nCr) formulas do not describe the complete problem.
Consider a shop offering five ice cream flavours. A customer wants three scoops and can choose the same flavour more than once.
If the order of scoops does not matter, the number of possible selections is a combination with repetition:
[
\binom{n+r-1}{r}
]
For five flavours and three scoops:
[
\binom{5+3-1}{3}=\binom{7}{3}=35
]
There are 35 possible flavour selections.
Now imagine a three-position code where each position can contain any of five symbols, and symbols may repeat. Here, order matters and repetition is allowed:
[
5^3=125
]
There are 125 possible codes.
These are different counting problems from the standard permutation and combination calculations provided by this calculator. If your scenario allows repeated selections, make sure you use the appropriate formula rather than treating it as an ordinary (nPr) or (nCr) problem.
The Four Questions to Ask Before Choosing a Formula
Many counting problems become easier when you identify their conditions before doing any arithmetic. Instead of immediately looking for a factorial formula, work through these questions:
1. Does the order of selection change the outcome?
If selecting A, B, and C is the same result as C, B, and A, order does not matter. If the positions are different, order matters.
2. Can an item be selected more than once?
Selecting a person for a committee normally means that person cannot be selected again. Choosing a digit for a code may allow repetition, depending on the rules.
3. Are all selected items performing the same role?
A group of three committee members usually has no internal ranking. A president, vice president, and treasurer have distinct roles, even if they are selected from the same group.
4. Are you counting selections or complete arrangements?
A problem may first ask you to select a group and then arrange its members. In that case, you may need both calculations or the relationship between them.
For the standard calculator inputs, the assumptions are that you have (n) distinct available items, choose (r) of them, and do not select an item more than once. The calculator then shows both possible counts: one where order matters and one where it does not.
How Permutations and Combinations Are Used in Probability
Counting possible outcomes is often the first step in solving a probability problem. Permutations and combinations help determine how many outcomes are possible before you calculate the likelihood of a particular event.
For example, imagine a lottery draws six different numbers from a pool of 49. If the order of the drawn numbers does not matter, the number of possible tickets is:
[
{}^{49}C_6=13,983,816
]
A ticket containing the same six numbers is still the same selection regardless of the order in which those numbers are drawn.
If every six-number selection is equally likely and one exact selection wins, the probability of matching all six numbers with one ticket is:
[
\frac{1}{13,983,816}
]
The combination count provides the total number of possible selections. The probability calculation then compares the number of favourable outcomes with the total number of equally likely outcomes.
This distinction is important: a permutation or combination calculator counts possibilities. It does not, by itself, determine whether an event is likely, whether outcomes are equally likely, or how a real-world probability should be modelled.
Common Mistakes When Calculating Permutations and Combinations
Using a permutation when order does not matter
Counting every possible ordering of the same committee members inflates the answer. If the final group is all that matters, use combinations.
Using a combination when positions are different
Selecting three people for three separate jobs is not the same as forming a three-person team. Different assignments produce different outcomes, so permutations are needed.
Forgetting that repetition is not included in the standard formulas
The usual (nPr) and (nCr) calculations assume selection without replacement. Passwords, codes, and repeated product choices may need different counting rules.
Entering more selected items than the total available
For the standard formulas, (r) cannot exceed (n). You cannot select seven distinct items from a pool containing only five.
Confusing the total pool with the selected group
The value of (n) is the number of available distinct items. The value of (r) is how many of those items are selected. Reversing them changes the problem.
Assuming a larger permutation result means more possible groups
A permutation count includes different arrangements of the same selected items. It does not mean there are more distinct groups; it means there are more ordered outcomes.
