4
$\begingroup$

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$).

$\endgroup$

1 Answer 1

7
$\begingroup$

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.

$\endgroup$

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .