Question

About involving of Prime Numbers in Hash Function

Answer 1

Answer:

By choosing m to be a number that has very few factors: a prime number. Whether a collision is less likely using primes depends on the distribution of your keys. If many of your keys have the form a+k⋅b and your hash function is H(n)=nmodm, then these keys go to a small subset of the buckets iff b divides n.