Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Permutation: $$P(n,r) = \frac{n!}{(n-r)!}$$

Combination: $$C(n,r) = \frac{n!}{(n-r)!r!}$$

Apparently, you use combination when the order doesn't matter. Great. I see how a combination will give you all the possible well, combinations. However, I don't see what exactly does a permutation do then.

share|cite|improve this question
Counts the number of ways of choosing and ordering the choices. – Arturo Magidin Jul 6 '12 at 2:44
up vote 7 down vote accepted

If you see how combinations work then you're most of the way there. Say I want to pick 3 letters out of ABCDE. There are $C(5,3)$ ways of doing this. But if order matters, then several things that I counted as the same are now different. Picking $ABC$ now generates $ABC,ACB,BAC,BCA,CBA,CAB$ as different choices, when they weren't before. How many different choices are there? Well that's the number of ways I can rearrange the $r$ chosen letters, which is $r!$. So if permutations matter:

$$P(n,r)=r!\cdot C(n,r)=\frac{r!n!}{(n-r)!r!}=\frac{n!}{(n-r)!}$$

Permutations are the number of different ordered selections of $r$ elements from a set of $n$.

share|cite|improve this answer

I just want to demonstrate via a figure the difference between permutation and combination. Hope helpful for you.

enter image description here

share|cite|improve this answer

Permutations assume there are no repetition of the same objects. One way to see why the formula holds is as follows:

Say you have $n$ objects and want to choose $r$ from them.

You can choose any of the $n$ for the first one,

You can choose any of the $n-1$ for the second one,




You can choose any of the $n-r+1$ for the $r^{th}$ one.

Multiplying all these altogether gives you the number of possibilities: $$ n(n-1)\cdots (n-r+1)=\frac{n!}{(n-r)!} $$

share|cite|improve this answer

There is some common confusion between these two terms.

The word "permutation" in general refers to one of three things depending on context. It can mean the order (arrangement) of a set as in combinatorics. Or it can refer to an arrangement of a subset of a given size as also in combinatorics. Or it can refer to an OPERATION of REarrangement in a space of such operations as in group theory, which is a very different thing.

"Combination" refers only to the makeup (constituency) of a subset with no concept of order.

The term "combinations" refers to the number of subsets of a given size containing different constituents.

The combinatorial meanings of both of these terms are still valid when applied to sets with duplicate elements. A permutation (arrangement or rearrangement) can apply to a set or subset that contains duplicates. But "combination" usually assumes distinct elements in the subset, though the original set can contain duplicates. Of course, if so indicated, a combination could also contain duplicates. The presence of duplicates affects the combinatorial formulas for all of these.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.