Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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

Let us suppose to have a set of $N$ elements and to choose $m$ elements out of the set. I know I can do it in $ N \choose m $ ways; but I want to know how many of these combinations contain $k$ predefined elements (say $1,2,...,k$).

share|cite|improve this question
up vote 7 down vote accepted

If you fix k elements, you are left with m-k elements to choose among N-k elements, which can be done in $N-k \choose m-k$ ways.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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