combination

In combinatorial mathematics, a combination is an un-ordered collection of distinct elements, usually of a prescribed size and taken from a given set. (An ordered collection of distinct elements would sometimes be called a permutation, but that term is ambiguous; it can also mean "reordering of all terms", among other related notions.) Given such a set S, a combination of elements of S is just a subset of S, where, as always for (sub)sets the order of the elements is not taken into account (two lists with the same elements in different orders are considered to be the same combination). Also, as always for (sub)sets, no elements can be repeated more than once in a combination; this is often referred to as a "collection without repetition". For instance, {1,1,2} is not a combination of three digits; as a set this is the same as {1,2,1} or {2,1,1} or even {1,2}. On the contrary, a poker hand can be described as a combination of 5 cards from a 52-card deck: the order of the cards doesn't matter, and there can be no identical cards among the 5.

A k-combination (or k-subset) is a subset with k elements.

The set of k-combinations of a set X may be denoted by .

Number of k-combinations from a set

The number of k-combinations (each of size k) from a set S with n elements (size n) is the binomial coefficient (also known as the "choose function"):

where n is the number of objects from which you can choose and k is the number to be chosen, and n! denotes the factorial.

The definition can be understood by considering a list of n elements; the list can be ordered n! ways, and for each possible ordering can be partitioned into the first k elements followed by the remaining n − k elements. The first partition is then a selection of k elements from the original list and all those partitions from every ordering cover all such selections. The complete permutation of the original list produces duplicate selections, however; some permutations result in a permuted but identical set for the first partition, and so we divide by k! to remove these, and other permutations result in permuted second partitions, and so we divide by (n − k)! to remove these.

The use of the definition in calculation is not always straightforward. For example, the number of five-card hands possible from a standard fifty-two card deck is:

Since it is impractical to calculate n! if the value of n is very large, a more efficient algorithm is

which gives

This method of calculation can be seen immediately from the recursive definition of the choose function:

with a base case of . It can be argued that is a more natural base case but the former follows easily from the latter anyway.

This second definition can be understood as stating that when adding an element to the selection, there are n − k elements to choose from, and so this increases the number of possible selections by that much, but doing this to all selections produces duplicates (e.g. { B, U } ∪ { R } = {G, E} ∪ { R }) and so we divide by the size of the selection since that is the number of possibilities for the last element added.

Since as explained above a combination is a special case of a partition of a set; specifically, a partition into two sets of size k and n − k, you get the same number of combinations if you substitute k with n − k. Therefore, when k is more than half of n, it may be easier to compute the binomial coefficient using n − k in place of k.

Number of combinations with repetition

The number of combinations with repetition can be calculated as:

For example, if you have ten types of donuts (n) on a menu to choose from and you want three donuts (k) the number of ways to choose can be calculated as (see also multiset):

There is an easy way to understand the above result. Imagine we have n + k identical boxes arranged on a line. From these boxes (except the first one), we arbitrarily choose k of them and mark the chosen boxes as empty. The rest of the boxes can be filled by the n elements in the set S. For each non-empty box, if it is followed by M successive empty boxes, we choose the corresponding element in the non-empty box M times. As a result, each arrangement of choosing empty boxes corresponds to a way of choosing k out of the n elements with repetition. The total number is therefore the number of combinations with repetition, which equals

Example 2

Another explanation may be helpful. Imagine you have slots (or boxes) for 4 types of fruits (apple, orange, pear, banana), all next to one another at the grocery store. That means n=4. If you choose a type of fruit you mark that box, so you put a '1' into that slot. You want to choose 12 pieces of fruit, and you can choose one type of fruit more than once. Therefore, altogether you'll put 12 '1's into the fruit slots. That means k=12. Now imagine that each separator of a slot is marked by a '0'. For the 4 boxes you will have 4-1=3 separators.

If you want to choose 2 apples from the first slot, 3 oranges from the second, 5 pears from the third, and 2 bananas from the fourth, that would be denoted by 11 0 111 0 11111 0 11 . The total number of ways we can choose 12 fruits from the 4 boxes (or slots) is simply the number of ways we can put 12 '1's and 3 '0's into order. Thus the total number of ways is the permutation of 12 '1's and 3 '0's. Expressed with k and n:

k = 12; n = 4;

See also

References

External links

• Many Common types of permutation and combination math problems, with detailed solutions
• The Unknown Formula For combinations when choices can be repeated and order does NOT matter
• Web-based calculator of permutations and combinations