The entire difference comes down to one question: does the order of selection change the outcome?
Both permutations and combinations count the number of ways to choose r items from a set of n — the difference is entirely about whether order matters. A permutation counts arrangements where order matters: picking A-then-B is a different outcome from B-then-A. A combination counts selections where order doesn't matter: {A, B} is the same group regardless of which one was picked first. Because every ordered arrangement can be unwound into the same unordered group in r! ways, permutations always outnumber combinations for the same n and r, by exactly a factor of r!.
The two formulas aren't independent — combinations are derived directly from permutations. Start from P(n,r) = n!/(n−r)!, which counts every ordered arrangement of r items from n. Now notice that every group of r items, once selected, can be internally reordered in r! different ways, and all of those r! orderings were counted as separate permutations even though they represent the exact same underlying group. To get the count of distinct groups rather than distinct arrangements, divide out that overcounting: C(n,r) = P(n,r) / r! = n! / [r!(n−r)!]. That single division by r! is the entire mathematical relationship between the two concepts — everything else about the formulas is identical.
No — both permutations and combinations involve selecting multiple items; that alone tells you nothing about which formula applies. The word "combination" in casual English (a "combination" lock, a "combination" of ingredients) is actually misleading mathematically — a padlock "combination" like 14-27-9 is really a permutation, because entering 27-14-9 opens a different lock or fails entirely; the order is essential to the outcome. The only question that determines which formula to use is whether swapping the order of any two selected items changes what you're counting. If yes — a ranking, a sequence, an assignment of distinct roles, an ordered code — use permutations. If no — a committee, a hand of cards, a batch pulled for sampling, a subset with no internal roles — use combinations. Don't let the everyday meaning of the word "combination" substitute for actually asking that question.
Explains the real distinguishing feature between permutations and combinations — whether the order of selection changes the outcome — with a worked example showing how choosing 2 of 3 people produces 6 permutations but only 3 combinations, and how the combination formula is derived directly from the permutation formula.
Both permutations and combinations involve choosing r items out of a set of n, and everyday language does not help: a padlock "combination" is actually order-dependent (a permutation in the mathematical sense), which trains people to associate the word "combination" with the wrong concept. The only question that actually distinguishes the two is whether swapping the order of any two selected items produces a different outcome. If it does, the problem is a permutation; if it doesn't, it is a combination.
The permutation formula P(n,r) = n!/(n−r)! counts the number of ways to arrange r items selected from n distinct items, where order matters. The combination formula C(n,r) = n!/[r!(n−r)!] counts the number of ways to select r items from n where order does not matter. Combinations are derived directly from permutations: since each unordered group of r items can be internally arranged in r! different ways, and each of those r! arrangements was counted separately in P(n,r), dividing P(n,r) by r! removes that overcounting and leaves the count of distinct groups — C(n,r) = P(n,r)/r!.
Permutations show up wherever sequence or assignment matters: scheduling job operations on a production line (different orderings can produce different cycle times or feasibility due to precedence constraints), assigning distinct roles to team members, or generating test-case orderings in software verification. Combinations show up wherever only the makeup of a group matters, not the order it was assembled in: selecting a sample of units for statistical quality control (acceptance sampling plans like ANSI/ASQ Z1.4 rely on combinatorics to compute the probability of accepting or rejecting a lot based on a sample), choosing a subset of components for a reliability analysis, or counting the number of possible parallel-redundant configurations in a system with n available modules choosing r for the design.
Combinations always have the extra r! because they collapse the r! duplicate orderings of each group down into a single count. Permutations, which count each ordering separately, do not divide by r! — so C(n,r) is always P(n,r) divided by r!, and C(n,r) ≤ P(n,r) for any r > 1.
5! (read "5 factorial") means 5 × 4 × 3 × 2 × 1 = 120 — the number of ways to arrange 5 distinct items in a row. Factorials appear in both the permutation and combination formulas because arranging or selecting from a set fundamentally involves counting sequences of shrinking choices (5 options, then 4 remaining, then 3, and so on).
Yes, whenever r ≥ 2 — permutations are always exactly r! times larger than combinations for the same n and r, since permutations count every internal ordering of each group separately while combinations count each group exactly once. When r = 0 or r = 1, they are equal, since there is only one way to order 0 or 1 item.
A combination, as long as every committee member has the same role. If the "committee" actually assigns distinct roles (chair, secretary, treasurer) to different people, then the order/role assignment matters and it becomes a permutation problem instead — this is a common source of exam mistakes.
Yes — both formulas above assume selection without repetition. With repetition allowed, permutations with repetition use n^r (n choices independently made r times), and combinations with repetition use the "stars and bars" formula C(n+r−1, r). Always confirm whether a problem allows repeated selections before applying the standard formulas.
Try our STEM Learning Studio
More calculators, simulators, and guides for this discipline.
STEM Fundamentals Handbook (Full Access)
✨ Premium ContentA zoomable interactive reader — free preview, then unlock the full set.