PERMUTATIONS AND COMBINATIONS

the various ways in which objects from a set may be selected, generally without replacement, to form subsets. This selection of subsets is called a permutation when the order of selection is a factor, a combination when order is not a factor. By considering the ratio of the number of desired subsets to the number of all possible subsets for many games of chance in the 17th century, Blaise Pascal and Pierre de Fermat gave impetus to the development of combinatorics and probability theory. The concepts of and differences between permutations and combinations can be illustrated by examination of all the different ways in which five distinguishable objects-such as the letters A, B, C, D, and E-can be selected. If both the letters selected and the order of selection are considered, then the following 20 outcomes are possible: Each of these 20 different possible selections is called a permutation. In particular, they are called the permutations of five objects taken two at a time, and the number of such permutations possible is denoted by the symbol 5P2. In general, if there are n objects available from which to select, and permutations are to be formed using k of the objects at a time, the number of different permutations possible is denoted by the symbol nPk. A formula for evaluation of nPk is where the symbol ! indicates that all the consecutive positive integers from 1 up to and including the preceding quantity-n or (n - k)-are to be multiplied together, and where 0! is defined to be equal to 1. For example, using this formula, the number of permutations of five objects taken two at a time is (For k = n, nPk = n! Thus, for 5 objects there are 5! = 120 arrangements.) For combinations, k objects are selected from a set of n objects to produce subsets without ordering. Contrasting the previous permutation example with the corresponding combination, the AB and BA subsets are no longer distinct selections; by eliminating such cases there remain only 10 different possible subsets. The number of such subsets is denoted by nCk, read "n choose k." For combinations, since k objects have k! arrangements, there are k! indistinguishable permutations for each choice of k objects; hence dividing the permutation formula by k! yields the following combination formula: This is the same as the (n, k) binomial coefficient (see binomial theorem). For example, the number of combinations of five objects taken two at a time is The formulas for nPk and nCk are called counting formulas since they can be used to count the number of possible permutations or combinations in a given situation without having to list them all.