Mo logo [home] [lexicon] [problems] [tests] [courses] [auxiliaries] [notes] [staff] german flag
Mathematics-Online course: Basic Mathematics - Combinatorics

Picking of Subsets

[previous page] [next page] [table of contents][page overview]
The following table shows the number of possibilities to select $ k$ elements from a set containing $ n$ elements. To this end, it is essential to distinguish whether the order is to be taken into account or not (that is whether one considers ordered or unordered combinations) as well as whether repetitions are allowed or not (that is whether one element can be picked several times).

  ordered unordered
with repetitions $ n^k$ $ \displaystyle \binom{n+k-1}{k}$
without repetitions $ n(n-1)\cdots(n-k+1)$ $ \displaystyle \binom{n}{k}$
(Authors: Höllig/Knesch/Abele)

(temporary unavailable)

(temporary unavailable)
[previous page] [next page] [table of contents][page overview]
  automatically generated 10/31/2008