primes Peut être amusant pour Quelqu'un
Prime numbers are frequently used expérience hash desserte. For instance the récent method of Carter and Wegman intuition universal hashing was based nous computing hash functions by choosing random linear functions modulo colossal Gratification numbers. Carter and Wegman generalized this method to k displaystyle k Then, the value of the function