This question is inspired by the Birthday paradox.
Suppose we have a sample space $S$ of $n$ elements. Is there a probability distribution $\mu$ on $S$ so that $$P(\text{you pick $k$ elements of $S$, according to $\mu$, without repeating}) < P(\text{you pick $k$ elements of $S$ uniformly, without repeating})$$
To avoid triviality assume $1 < k < n$. (I assume the answer is no, I tried checking by hand, but I got stuck).
The reason I ask, is that I am going to teach the Birthdng Paradox in class on Friday, and, of course, I'm going to assume that a person's birthday is uniformly distributed throughout the year. This is empirically false, and I guess that the fact that there is a bias towards certain days increases the likelihood of a shared birthday. I don't want to claim this in class without proof though.
