If is the number of bits in the array, is the number of hash functions and we have entries, then the false positive probability upper bound can be approximated as:
It further states in the wiki article that:
"The number of hash functions, , must be a positive integer. Putting this constraint aside, for a given and , the value of that minimizes the false positive probability is:"
How can I find the value that minimizes the false positive function ?