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

Specifically, say I have the integers $1,2,3,\dots,n$ (a set of $n$ integers). I want to select numbers one after another (not at the same time) until I have $k$ distinct numbers. How many ways are there of doing this? Someone told me $nPk$ but I don't understand why. Is there another way to approach it?

share|cite|improve this question
OP $\binom{n}{k}=nPk$ in your notation. – Ali Caglayan Aug 30 '14 at 9:42

For the first integer, you have $n$ possibilities to choose, for the second, $n-1$ and so on. So the number of possibilities is $n(n-1)(n-2)...(n-k+1)$, which is the same as $\frac{n!}{(n-k)!}\ =\ nPk$

share|cite|improve this answer
Thank you !!!!! – Dr Dank Aug 30 '14 at 9:06

From $n$ distinct elements we can choose $k$-elements in $\binom{n}{k}$ ways and after permuting them in $k!$ ways we get that there exists $$\binom{n}{k}k!=\frac{n!}{k!(n-k)!}k!=\frac{n!}{(n-k)!}$$ possibilities

share|cite|improve this answer

Please, someone change tag to combinatorics. Additive combinatorics is not about that.

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.