diff --git a/src/main/java/org/apache/commons/collections4/bloomfilter/Shape.java b/src/main/java/org/apache/commons/collections4/bloomfilter/Shape.java index f1a240da4d..e801ac5b7d 100644 --- a/src/main/java/org/apache/commons/collections4/bloomfilter/Shape.java +++ b/src/main/java/org/apache/commons/collections4/bloomfilter/Shape.java @@ -160,7 +160,7 @@ public int getNumberOfHashFunctions() { /** * Calculates the probability of false positives ({@code p}) given * numberOfItems ({@code n}), numberOfBits ({@code m}) and numberOfHashFunctions ({@code k}). - *
p = pow(1 - exp(-k / (m / n)), k)
+ *
p = pow(1 - exp(-kn/m)), k)
* *

This is the probability that a Bloom filter will return true for the presence of an item * when it does not contain the item.