A Formula for C(n,k)
Library Home 
Full Table of Contents 
Suggest a Link 
Library Help
http://wwwmath.cudenver.edu/~wcherowi/jcorn4.html  


Jay's Corner  
We would like to obtain a formula to calculate C(n,k) without writing down Pascal's triangle (although, to be honest, it is generally faster to write down Pascal's triangle than it is to use this formula, especially if you need a number of these binomial coefficients). To do this, we will count the number of subsets of size k in a set of size n ...  


Levels:  Middle School (68), High School (912), College 
Languages:  English 
Resource Types:  Problems/Puzzles 
Math Topics:  Permutations/Combinations 
[Privacy Policy] [Terms of Use]
© 19942014 Drexel University. All rights reserved.
http://mathforum.org/
The Math Forum is a research and educational enterprise of the Drexel University School of Education.