Difference between revisions of "Combination"

(Notation)
Line 6: Line 6:
 
The common forms of denoting the number of combinations of <math>{r}</math> objects from a set of <math>{n}</math> objects is:
 
The common forms of denoting the number of combinations of <math>{r}</math> objects from a set of <math>{n}</math> objects is:
  
* <math>{n}\choose {r}</math>
+
* <math>\binom{n}{r}</math>
 
* <math>{C}(n,r)</math>
 
* <math>{C}(n,r)</math>
 
* <math>\,_{n} C_{r}</math>
 
* <math>\,_{n} C_{r}</math>

Revision as of 19:28, 25 September 2007

A combination is a way of choosing $r$ objects from a set of $n$ where the order in which the objects are chosen is irrelevant. We are generally concerned with finding the number of combinations of size $r$ from an original set of size $n$


Notation

The common forms of denoting the number of combinations of ${r}$ objects from a set of ${n}$ objects is:

  • $\binom{n}{r}$
  • ${C}(n,r)$
  • $\,_{n} C_{r}$
  • $C_n^{r}$

Formula

${{n}\choose {r}} = \frac {n!} {r!(n-r)!}$

Derivation

Consider the set of letters A, B, and C. There are $3!$ different permutations of those letters. Since order doesn't matter with combinations, there is only one combination of those three. In general, since for every permutation of ${r}$ objects from ${n}$ elements $P(n,r)$, there are ${r}!$ more ways to permute them than to choose them. We have ${r}!{C}({n},{r})=P(n,r)$, or ${{n}\choose {r}} = \frac {n!} {r!(n-r)!}$.


Examples


See also

Invalid username
Login to AoPS