Ideal Hash Function for Uniform Hashing  The hash table size should be a prime number that is not too close to a power of 2  31 is a prime number but is too close to a power of 2  97 is a prime number not too close to a power of 2  A good hash function might be: h( k ) = k % 97 5
{}