This page was last modified 2010-04-02 18:33:53 by Puchu.Net user Choco. (Show history)

A binomial coefficient indicates how many different combinations of choices can be made from set of choices. This is very frequently used in figuring out probability, by determining first how many possible combinations exist.



So, given n distinct choices, if we choose k times, then the total number of different combinations we can get is:


If k is less than zero, or if k is greater than n, then C^{k}_{n} equals to zero.


If there are r red balls, g green balls, and b blue balls in a bag, and one randomly takes out two balls. What is the chance of getting two balls of the same color?

To answer this question, we first need to understand how many combinations/choices are available when drawing the balls from the bag. The total number of combinations from the two drawings is:


2! equals 2\times1=2. Out of those choices, we have 3 subsets of different colored balls. Drawing same colored ball is the same as drawing from the 3 subsets. Therefore the number of combinations for each color are:




So the probability of two balls of the same color from a bag with 3 different colored balls is:

\frac{C^{2}_{r}+C^{2}_{g}+C^{2}_{b}}{C^{2}_{(r+g+b)}}= \frac{r^2-r+g^2-g+b^2-b}{(r+g+b)(r+g+b-1)}

Other Notes

The equation and example above assumed that choices are not eliminated when chosen (without repetitions). If the same choice can be selected again, then the total number of combinations is:



  1. Wikipedia contributors. Combinatorics. May 23, 2008 <>.
  2. Wikipedia contributors. Binomial coefficient. May 23, 2008 <>.

Document is accessible from © 2002-2010 Sean Yang, Karen Yang, Don Yang and/or respective authors, all rights reserverd.

This material may contain (biased) opinions, inappropriate materials for numerous individuals, work of other authors from the internet, links that refer to other web documents and resources, or origial work that cannot be use for personal or commercial purposes. Please respect the work of original authors.

Creative Commons License
Powered By MediaWiki

© 2002-2010 Sean Yang, all rights reserved.