On Tue, 27 Jul 2010 19:59:01 + john gilmore john_w_gilm...@msn.com
wrote:
:Worth trying first is von Neumann's classical scheme. Divide the value
obtained using the z/Architecture machine instruction CKSUM. Then use its
remainder mod(s), where s is any convenient small prime. The result
On Tue, 27 Jul 2010 22:06:18 +, john gilmore wrote:
Yes, 61, which is prime, is better than 64 = 2^6, which is composite.
...
If division-method hashing is used a prime divisor/modulus is highly
desirable. Clustering at the prime divisors of a composite modulus does
occur. I dislike
Paul Gilmartin wrote:
On Tue, 27 Jul 2010 22:06:18 +, john gilmore wrote:
Yes, 61, which is prime, is better than 64 = 2^6, which is composite.
...
If division-method hashing is used a prime divisor/modulus is highly desirable.
Clustering at the prime divisors of a composite modulus
3 matches
Mail list logo
