Let n be the number of elements in the table, m is the size of the table.

Assume uniform hashing (each sequence is equally likely).