Combination
From Free net encyclopedia
- For other senses of this term, see combination (disambiguation).
In combinatorial mathematics, a combination is an un-ordered collection of unique elements. Given S, the set of all possible unique elements, a combination is a subset of the elements of S. The order of the elements in a combination is not important (two lists with the same elements in different orders are considered to be the same combination). Also, the elements cannot be repeated in a combination (every element appears uniquely once). A k-combination (or k-subset) is a subset with k elements. The number of k-combinations (each of size k) from a set S with n elements (size n) is the binomial coefficient.
See also
de:Kombinatorik#Kombination ohne Zurücklegen fr:Combinaison ko:조합 it:Combinazione nl:Combinatie (wiskunde) ja:組合せ (数学) pl:Kombinacja pt:Combinação ru:Сочетание sr:Комбинација fi:Kombinaatio sv:Kombination (matematik) zh:組合