1.3.3 problem 27

For each of the $k$ names, we sample a memory location from $1$ to $n$ with equal probability, with replacement. This is exactly the setup of the birthday problem. Hence, the probability that at least one memory location has more than $1$ value is

Also, $P\left(A\right)=1$ if $n<k$.