Consider the idea of implementing modular hashing for integer keys with the code (a * k) % M , where a is an arbitrary fixed prime. Does this change mix up the bits sufficiently well that you can use nonprime M?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.