How many hash functions does my bloom filter need?
Wikipedia says: An empty Bloom filter is a bit array of m bits, all set to 0. There must also be k different hash functions defined, each of which maps or hashes some set element to one of the m array positions with a uniform random distribution. I read the article, but what I don't understand is how k is determined. Is it a functi...