I feel like I\'m way overthinking this problem, but here goes anyway...
I have a hash table with M slots in its internal array. I need to insert N elements into the
You'll find the answer here: Quora.com. The expected number of collisions for m buckets and n inserts is
n - m * (1 - ((m-1)/m)^n).
n - m * (1 - ((m-1)/m)^n)