# Difference between revisions of "Combination"

m (→Formulas/Identities) |
Pi is 3.14 (talk | contribs) (→Video) |
||

(18 intermediate revisions by 9 users not shown) | |||

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> | |

+ | |||

− | |||

+ | ==Video== | ||

+ | This video is a great introduction to permutations, combinations, and constructive counting: | ||

+ | https://www.youtube.com/watch?v=t6a4uHEwQnM& | ||

== Notation == | == Notation == | ||

Line 19: | Line 22: | ||

== Derivation == | == Derivation == | ||

− | Consider the set of letters A, B, and C. There are <math>3!</math> 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 <math>{r}</math> objects from <math>{n}</math> elements <math>P(n,r)</math> | + | Consider the set of letters A, B, and C. There are <math>3!</math> different [[permutations]] of those letters. Since order doesn't matter with combinations, there is only one combination of those three.(<math>ABC,ACB,BAC,BCA,CAB,CBA</math> are all equivalent in combination but different in permutation.) |

+ | |||

+ | In general, since for every permutation of <math>{r}</math> objects from <math>{n}</math> elements <math>P(n,r)</math> which is <math>\frac{n!}{n-r!}</math>.Now since in permutation the order of arrangement matters(<math>ABC</math> is not same as <math>ACB</math>) but in combinations the order of arrangement does not matter(<math>ABC</math> is equivalent to <math>ACB</math>).For its derivation see this [http://www.artofproblemsolving.com/Videos/external.php?video_id=181 video]. | ||

+ | |||

+ | Suppose <math>r</math> elements are selected out.For permutation <math>r</math> elements can be arranged in <math>r!</math> ways.We have overcounted the number of combinations by <math>r!</math> times.So We have <math>{r}!{C}({n},{r})=P(n,r)</math>, or <math>{{n}\choose {r}} = \frac {n!} {r!(n-r)!}</math>. | ||

==Formulas/Identities== | ==Formulas/Identities== | ||

Line 28: | Line 35: | ||

* <math>\sum_{x=0}^{n} \binom{n}{x} = 2^n</math> | * <math>\sum_{x=0}^{n} \binom{n}{x} = 2^n</math> | ||

− | One of the many proofs is by first inserting <math>a = b = 1</math> into the [[binomial theorem]]. Because the combinations are the coefficients of <math>2^n</math>, and a and b | + | One of the many proofs is by first inserting <math>a = b = 1</math> into the [[binomial theorem]]. Because the combinations are the coefficients of <math>2^n</math>, and a and b disappear because they are 1, the sum is <math>2^n</math>. |

* <math>\sum_{i=0}^{k}\binom{m}{i}\binom{n}{k-i}=\binom{m+n}{k}</math> | * <math>\sum_{i=0}^{k}\binom{m}{i}\binom{n}{k-i}=\binom{m+n}{k}</math> | ||

Line 35: | Line 42: | ||

We can prove this by putting the combinations in their algebraic form. | We can prove this by putting the combinations in their algebraic form. | ||

− | <math>\binom{n}{n-r}=\frac{n!}{(n-r)!(n-(n-r)!}</math>. As we can see, <math>(n-(n-r)!=(n-n+r)=r!</math>. By the [[commutative property]], <math>\frac{n!}{(n-r)!r!}=\frac{n!}{r!(n-r)!}</math>. Because <math>\frac{n!}{r!(n-r)!}=\binom{n}{r}</math>, by the [[transitive property]], we can conclude that this is true for all non-negative integers n and r where n is greater than or equal to r. Another reason this is true is because that choosing what you don't want is the same as choosing what you do want, because by choosing what you don't want, you imply that you choose the rest. This identity is also the reason why [[Pascal's Triangle]] is symmetrical. | + | <math>\binom{n}{n-r}=\frac{n!}{(n-r)!(n-(n-r))!}</math>. As we can see, <math>(n-(n-r))!=(n-n+r)=r!</math>. By the [[commutative property]], <math>\frac{n!}{(n-r)!r!}=\frac{n!}{r!(n-r)!}</math>. Because <math>\frac{n!}{r!(n-r)!}=\binom{n}{r}</math>, by the [[transitive property]], we can conclude that this is true for all non-negative integers n and r where n is greater than or equal to r. Another reason this is true is because that choosing what you don't want is the same as choosing what you do want, because by choosing what you don't want, you imply that you choose the rest. This identity is also the reason why [[Pascal's Triangle]] is symmetrical. |

== Examples == | == Examples == | ||

* [[2005_AIME_II_Problems/Problem_1 | 2005 AIME II Problem 1]] | * [[2005_AIME_II_Problems/Problem_1 | 2005 AIME II Problem 1]] | ||

− | |||

− | |||

− | |||

== See also == | == See also == | ||

* [[Combinatorics]] | * [[Combinatorics]] | ||

− | * [[ | + | * [[Combinatorial identity]] |

* [[Permutations]] | * [[Permutations]] | ||

* [[Pascal's Triangle]] | * [[Pascal's Triangle]] | ||

− | * [[ | + | * [[Generating function]] |

+ | |||

+ | [[Category:Combinatorics]] | ||

+ | [[Category:Definition]] |

## Latest revision as of 19:27, 21 June 2020

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

## Video

This video is a great introduction to permutations, combinations, and constructive counting: https://www.youtube.com/watch?v=t6a4uHEwQnM&

## 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.( are all equivalent in combination but different in permutation.)

In general, since for every permutation of objects from elements which is .Now since in permutation the order of arrangement matters( is not same as ) but in combinations the order of arrangement does not matter( is equivalent to ).For its derivation see this video.

Suppose elements are selected out.For permutation elements can be arranged in ways.We have overcounted the number of combinations by times.So We have , or .

## Formulas/Identities

One of the many proofs is by first inserting into the binomial theorem. Because the combinations are the coefficients of , and a and b disappear because they are 1, the sum is .

We can prove this by putting the combinations in their algebraic form. . As we can see, . By the commutative property, . Because , by the transitive property, we can conclude that this is true for all non-negative integers n and r where n is greater than or equal to r. Another reason this is true is because that choosing what you don't want is the same as choosing what you do want, because by choosing what you don't want, you imply that you choose the rest. This identity is also the reason why Pascal's Triangle is symmetrical.