Newbie questions about hash

[Lucas_Malor]

@tim.one

a more common design is to use hash tables with a prime P number of slots, and use hash_code % P for the first stab, and then every bit of the hash code affects the result. Division is much slower, though

What if an initial size of 7 is used? 7 is 0b111, and you said in the other thread:

@tim.one

The modulus is both a prime and a solid string of 1 bits. The latter allows fast computation of the mod without using division (akin to “casting out 9s” in decimal via addition).

even if I miss the mathematical competences here.