Computer Science Level pending

Suppose our hash table has $$10^3$$ slots. Under the simple uniform hashing assumption, what is the expected number of distinct elements that needs to be inserted into the table to get the first hash collision, i.e, a slot with two elements?

This problem is a part of the Hash Crash Series

×