BloomFilter

Returns the optimal number of buckets (m) and hash functions (k)

The formula is:

val m = ceil(-(n * log(p)) / log(pow(2.0, log(2.0))))
val k = round(log(2.0) * m / n)

Returns a BloomFilter that is optimally sized for the expected number of inputs and false positive rate