OptimalK calculates the optimal k value for creating a new Bloom filter maxn is the maximum anticipated number of elements.

OptimalM calculates the optimal m value for creating a new Bloom filter p is the desired false positive probability optimal m = ceiling( - n * ln(p) / ln(2)**2 ).