Simple combinatorics help including boxes and objects

How many ways are there to distribute $k$ balls into $n$ distinct boxes ($k < n$) with at most one ball in any box if

(a) The balls are distinct?
(b) The balls are identical?

My initial response to this question's part (a) is $\binom n k$ but I have a small feeling this is incorrect, so I was wondering if someone could clear this first part up so I can start working on part (b) without having a false foundation to work with.

• That's the answer to (b): we choose the $k$ boxes that will be occupied. – André Nicolas Oct 28 '13 at 23:46
• Dividing your answer in (a) by $k!$ should give you answer in (b) – Alex Oct 29 '13 at 0:47

For the first ball you have $n$ choices, for the second $n-1$ and so on. So the total number of choices for $k$ balls is $(n-k+1)!$
As a small exercise to sharpen your problem solving skills, I'd suggest you try it out for small $n, k$ on paper. Start with, say $n = 3, k = 2$ or $n = 4, k = 3$. You should quickly see how the dynamics work in both situations.