In addition to the things others have pointed out, note that "universality" is a well-defined concept w.r.t. hash functions: <a href="https://en.wikipedia.org/wiki/Universal_hashing" rel="nofollow">https://en.wikipedia.org/wiki/Universal_hashing</a> - you should probably not use it to describe your hash function if you can't show universality.
> Novel: using division, or using floating point division, and discarding the high-order-bits ( as we do here ) is not used nor studied so much, if at all, in hash construction<p>Is that because division is slow compared to bit operations?
This is connected with a truly amazing website that does not make my eyes bleed in any way.<p><a href="https://dosaygo.com/" rel="nofollow">https://dosaygo.com/</a>