 For instance the original method of Carter and Wegman for universal hashing was based on computing hash functions by choosing random linear functions modulo large prime numbers.Carter and Wegman generalized this method to formula_70-independent hashing by using higher-degree polynomials, again modulo large primes.As well as in the hash function, prime numbers are used for the hash table size in quadratic probing based hash tables to ensure that the probe sequence covers the whole table.