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- The Math Forum at NCTM. All rights reserved.