Combinations without repetition

The combinations without repetition of n elements taken k in k are the different groups of k elements that can be formed by these n elements, so that two groups differ only if they have different elements (that is to say, the order does not matter). They are represented as Cn,k.

For example,

Example

Let's consider the set A={a,b,c,d,e} of 5 elements. Let's observe first of all that, for example, the groups abc and cba are considered to be equal, since as has been said the order does not matter while the elements are the same.

We are going to see what the different combinations without repetition of these 5 elements are:

  • Combinations without repetition of 5 elements taken 1 at a time: a, b, c, d and e.
  • Combinations without repetition of 5 elements taken 2 at a time: ab, ac, ad, ae, bc, bd, be, cd, ce and de.
  • Combinations without repetition of 5 elements taken 3 at a time: abc, abd, abe, acd, ace, ade, bcd, bce, bde and cde.
  • Combinations without repetition of 5 elements taken 4 at a time: abcd, abce, abde, acde and bcde.
  • Combinations without repetition of 5 elements taken 5 at a time: The only group of 5 elements that it is possible to form from the elements of A is abcde.

In this example all of the combinations could have been written. However, if A had had many more elements, this would have been much more complicated.

The following formula allows us to know how many combinations without repetition of n elements taken k in k there are: Cn,k=(nk)=n!k!(nk)!

Example

In the previous example, n=5. Now, if we want to know how many combinations of 5 elements, taken 3 at a time there are, we use the formula and we obtain: C5,3=(53)=5!3!(53)!=10 We can check in the previous list that there are 10 sets of 3 elements, indeed.