Honey, I sped up the associated array

[Georg Wrede]

Walter Bright wrote:
> taking the remainder of
> division by a prime number gives the most even 'spread' across the 
> array, minimizing collisions for a given array size.

If I understand the problem correctly, the entire point of having a hash 
in the first place is minimizing the collisions. And the _best_ way to 
achieve this is having a prime to divide them with.