Hi i must write one program using the Blomm Filter. Unfortunately i don't understand the formulas. Here there are (Python):
m = -(n*math.log(p))/(math.log(2)**2)
k = (m/n)*math.log(2)
p = (1 - ( 1-1/m)**kn)**k, where k is the number of hash functions, m is the size the bit array, n the expected number of elements und p the rate of false positive.
To find p it must be known m and n, but to find m I need p. Can someone explain how it works, when len() of my dictionary is 258.200 words?
