Difference between revisions of "Combination"
m (changed first example problem to internal link) |
m (removed heading of first section) |
||
| Line 1: | Line 1: | ||
| − | |||
A '''combination''' is a way of choosing <math>r</math> objects from a set of <math>n</math> where the order in which the objects are chosen is irrelevant. We are generally concerned with finding the number of combinations of size <math>r</math> from an original set of size <math>n</math> | A '''combination''' is a way of choosing <math>r</math> objects from a set of <math>n</math> where the order in which the objects are chosen is irrelevant. We are generally concerned with finding the number of combinations of size <math>r</math> from an original set of size <math>n</math> | ||
| + | |||
== Notation == | == Notation == | ||
Revision as of 17:59, 21 July 2006
A combination is a way of choosing 
objects from a set of 
where the order in which the objects are chosen is irrelevant. We are generally concerned with finding the number of combinations of size from an original set of size
Contents
Notation
The common forms of denoting the number of combinations of 
objects from a set of 
objects is:
Formula
Derivation
Consider the set of letters A, B, and C. There are 
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 objects from elements 
, there are 
more ways to permute them than to choose them. We have 
, or .
Examples
