Metraipolis › archive › dc_5e030baa990a

Combination — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Combination
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T12:23:19.999Z
SHA-256 of the archived text
73aa9aedf47c118ff1bc52e58ed8f2d992bd81fe5eb17dbe76dd4254875de6da
Stable URL of this page
https://metraipolis.com/documento/dc_5e030baa990a

How to cite

Combination — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Combination (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_5e030baa990a (Metraipolis archive dc_5e030baa990a, sha256 73aa9aedf47c118ff1bc52e58ed8f2d992bd81fe5eb17dbe76dd4254875de6da)
BibTeX
@misc{dc5e030baa990a,
  title = {Combination — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Combination},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_5e030baa990a; sha256 73aa9aedf47c118ff1bc52e58ed8f2d992bd81fe5eb17dbe76dd4254875de6da},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Combination. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 ) {\displaystyle C(n,k)} or C k n {\displaystyle C_{k}^{n}} , is equal to the binomial coefficient: ( n k ) = n ( n − 1 ) ⋯ ( n − k + 1 ) k ( k − 1 ) ⋯ 1 , {\displaystyle {\binom {n}{k}}={\frac {n(n-1)\dotsb (n-k+1)}{k(k-1)\dotsb 1}},} which using factorial notation can be compactly expressed as ( n k ) = n ! k ! ( n − k ) ! {\displaystyle {\binom {n}{k}}={\frac {n!}{k!(n-k)!}}} whenever n ≥ k ≥ 0 {\displaystyle 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 ! {\displaystyle k!} permutations so P k n = C k n × k ! {\displaystyle P_{k}^{n}=C_{k}^{n}\times k!} or C k n = P k n / k ! {\displaystyle C_{k}^{n}=P_{k}^{n}/k!} . The set of all k-combinations of a set S is often denoted by ( S k ) {\displaystyle \textstyle {\binom {S}{k}}} . 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. If, in the above example, it were possible to have two of any one kind of fruit there would be 3 more 2-selections: one with two apples, one with two oranges, and one with two pears. Although the set of three fruits was small enough to write a complete list of combinations, this becomes impractical as the size of the set increases. 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.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Combinatorics»).
Fonte: Wikipedia in inglese, voce «Combination» — https://en.wikipedia.org/wiki/Combination
Wikidata Q202805: «multiinsieme di k elementi che appartengono all'insieme» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q202805
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Combination?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1366053287, consultata il 2026-10-06T10:39:13.107Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 91db67b6600b957ecb2225f4b3cc241e64fedb4f6835f3b9a02c712abf1e0086