Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Possible Duplicate:
Combinatorics: Number of subsets with cardinality k with 1 element.

A set n has elements $\{1,2,3,\dots,n\}$. How many subsets does it have of cardinality $k$ and that contains element $1$?

share|cite|improve this question

marked as duplicate by Brian M. Scott, Mike Spivey, David Mitra, Thomas Andrews, Graphth Dec 11 '12 at 0:03

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

up vote 2 down vote accepted

Hint: After you put $1$ in each possible set, you then have to fill in the remaining $k-1$ spaces from the other $n-1$ elements. How many ways can you do this?

share|cite|improve this answer

Not the answer you're looking for? Browse other questions tagged or ask your own question.