1.Previous
3.Next

of k distinct elements of S. So, two combinations are identical if and only if each combination has the same members. (The arrangement of the members in each set does not matter.) If the set has n elements, the number of k-combinations, denoted by or , is equal to the binomial coefficient:

which using factorial notation can be compactly expressed as

whenever . This formula can be derived from the fact that

1.Previous
3.Next