# $n=\{1,2,3,\dots,n\}$, How many subsets of cardinality $k$ containing element 1 are in $n$? [duplicate]

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$?

-

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

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?