Ideal hash functions If we denote this probability by s, then we can solve for k as a function of n and e If we ignore the term-k, then we estimate k ≈ k(k-1) ≈In(1-e) k≈1/nln k2-k≈n1n E 1313 Ideal hash functions • If we denote this probability by , then we can solve for k as a function of n and  • If we ignore the term -k, then we estimate