Drexel dragonThe Math ForumDonate to the Math Forum

The Math Forum Internet Mathematics Library

A Formula for C(n,k)

_____________________________________
Library Home || Full Table of Contents || Suggest a Link || Library Help
_____________________________________

Visit this site: http://www-math.cudenver.edu/~wcherowi/jcorn4.html
Author:Jay's Corner
Description: 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 (6-8), High School (9-12), College
Languages: English
Resource Types: Problems/Puzzles
Math Topics: Permutations/Combinations

[Privacy Policy] [Terms of Use]

_____________________________________
Home || The Math Library || Quick Reference || Search || Help
_____________________________________

© 1994-2008 Drexel University. All rights reserved.
http://mathforum.org/
 The Math Forum is a research and educational enterprise of the Drexel School of Education.The Math Forum is a research and educational enterprise of the Drexel School of Education.