Lesson plan

Combination

In mathematics, a combination is a selection of items from a set that has distinct members, such that the order of selection does not matter (unlike permutations). For example, given three fruits, say an apple, an orange and a pear, there are three combinations of two that can be drawn from this set: an apple and a pear; an apple and an orange; or a pear and an orange. More formally, a k-combination of a set S is a subset 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 C(n,k) or C^n_k , is equal to the binomial coefficient: \binom nk = \frac{n(n-1)\dotsb(n-k+1)}{k(k-1)\dotsb1}, which using factorial notation can be compactly expressed as \binom{n}{k} = \frac{n!}{k! (n-k)!} whenever n \geq k \geq 0 . This formula can be derived from the fact that each k-combination of a set S of n members has k! permutations so P^n_k = C^n_k \times k! or C^n_k = P^n_k / k! . The set of all k-combinations of a set S is often denoted by \textstyle\binom Sk . A combination is a selection of n things taken k at a time without repetition. To refer to combinations in which repetition is allowed, the terms k-combination with repetition, k-multiset, or k-selection, are often used.…

Back to article

Article summary

In mathematics, a combination is a selection of items from a set that has distinct members, such that the order of selection does not matter (unlike permutations). For example, given three fruits, say an apple, an orange and a pear, there are three combinations of two that can be drawn from this set: an apple and a pear; an apple and an orange; or a pear and an orange. More formally, a k-combination of a set S is a subset 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 C(n,k) or C^n_k , is equal to the binomial coefficient: \binom nk = \frac{n(n-1)\dotsb(n-k+1)}{k(k-1)\dotsb1}, which using factorial notation can be compactly expressed as \binom{n}{k} = \frac{n!}{k! (n-k)!} whenever n \geq k \geq 0 . This formula can be derived from the fact that each k-combination of a set S of n members has k! permutations so P^n_k = C^n_k \times k! or C^n_k = P^n_k / k! . The set of all k-combinations of a set S is often denoted by \textstyle\binom Sk . A combination is a selection of n things taken k at a time without repetition. To refer to combinations in which repetition is allowed, the terms k-combination with repetition, k-multiset, or k-selection, are often used.…

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.