We see that if we have a size of a hash table, n, that's comparable to the number of objects, m, it would be really cool if all of the lists had a length that was basically constant; therefore we had our constant time operations. 