I'm trying to implement the formula for max utilization for my hash function with d=2 (2 buckets for every hash value to choose "less loaded" one) using the following formula:
$$ \frac{m}{n} + \frac{log(log(n))}{log(d)} + \theta(1) $$ But the results don't make sense... Does someone have an implementation of this? Thanks