Combination aus Wikipedia.

Zum Beitrag
Combination - Wikipedia, the free encyclopedia
a.new,#quickbar a.new{color:#ba0000}
/* cache key: enwiki:resourceloader:filter:minify-css:5:f2a9127573a22335c2a9102b208c73e7 */

Combination
From Wikipedia, the free encyclopedia
Jump to: ,
"Combin" redirects here. For the mountain massif, see

Grand Combin.
For other uses, see

Combination (disambiguation).
In

mathematics a combination is a way of selecting several things out of a larger group, where (unlike

permutations) order does not matter. In smaller cases it is possible to count the number of combinations. For example given three fruit, an apple, orange and pear say, 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. If the set has n elements the number of k-combinations is equal to the

binomial coefficient
which can be written using

factorials as whenever , and which is zero when k > n. The set of all k-combinations of a set S is sometimes denoted by
.
Combinations can consider the combination of n things taken k at a time without or with repetitions. In the above example repetitions were not allowed. If however it was possible to have two of any one kind of fruit there would be 3 more combinations: one with two apples, one with two oranges, and one with two pears.
With large sets, it becomes necessary to use mathematics to find the number of combinations. For example, a

poker hand can be described as a 5-combination (k = 5) of cards from a 52 card deck (n = 52). The 5 cards of the hand are all distinct, and the order of cards in the hand does not matter. There are 2,598,960 such combinations, and the chance of drawing any one hand at random is 1 / 2,598,960.

## Contents

## Number of k-combinations

3-element subsets of a 5-element set
Main article:

Binomial coefficient
The

number of k-combinations from a given set S of n elements is often denoted in elementary combinatorics texts by C(n, k), or by a variation such as , nCk, nCk or even (the latter form is standard in French and Polish texts). The same number however occurs in many other mathematical contexts, where it is denoted by ; notably it occurs as coefficient in the

binomial formula, hence its name binomial coefficient. One can define for all natural numbers k at once by the relation
from which it is clear that and for k > n. To see that these coefficients count k-combinations from S, one can first consider a collection of n distinct variables Xs labeled by the elements s ...

mehrCombination aus Wikipedia.

Zum Beitrag