What is a 'Bloom Filter' false positive rate?

What is a 'Bloom Filter' false positive rate?

Approach: Define the mathematical probability of an incorrect membership test.

The probability depends on the size of the bit array (m), the number of hash functions (k), and the number of elements inserted (n). It is approximately (1 - e^(-kn/m))^k.

Follow-up: What is the optimal number of hash functions for a given m and n?

Key concepts: hash functions, bits, elements.