There are $N$ boxes, which are marked as $1,2, \ldots, N$. We want to put $n$ balls into these boxes. If we require that each box has $1$ ball for $n$ selected boxes, what's the probability? Of course, $n\leq N$. There are two ways to solve it.
1. We make some wings on these balls, and let them fly into the boxes.
The first ball has $N$ cases, the same as the second and so on. Thus, there are $N^n$ cases in all.
As for our requirement, there are $n$ balls fly into the selected $n$ boxes.
That is $n!$ cases in all.
Hence, the answer is $$\frac{n!}{N^n}$$
Of course, there is another way another way.
2. These boxes offer $N+1$ positions for these balls. Let these balls park in them, there are $C_{N+1}^{n}$ cases.
Then we add some sticks over the empty positions, that will form $N$ boxes.
As for our requirement, the case which is satisfied, is only $1$ case.
Hence, the answer is $$\frac{1}{C_{N+1}^{n}}$$
Obviously, both answers are reasonable, but the results are not the same. As for the reason, I think solution 1 thinks that the balls are different, but the solution 2 doesn't think so.
So, which one is the correct solution? I am really confused...