Ideal hash functions it is a simple matter to compute the probability that k random elements z1,..., ZK E z are distinct The first choice Z, is arbitrary; the probability that z2 l=z1 is 1-n, the probability that z3 is distinct from z, and z is 1-2/n, etc we estimate the probability of no collisions to be k-1 k-111 Ideal hash functions • it is a simple matter to compute the probability that k random elements z1 , . . . , zk  Z are distinct. • The first choice z1 is arbitrary; the probability that z2 != z1 is 1 - l/n; the probability that z3 is distinct from z1 and z2 is 1 - 2/n, etc. • we estimate the probability of no collisions to be