> When, on the other hand, n is prime, o is always 1 so you won't need > to worry about this (you'll just need to worry that no single value > from hash(A) occurs more often than others).
Erm, o is always 1 or n. I'll leave it up to you to figure out what happens when o is n. Alejo. http://azul.freaks-unidos.net/ ---=( Comunidad de Usuarios de Software Libre en Colombia )=--- ---=( http://bachue.com/colibri )=--=( [EMAIL PROTECTED] )=---
signature.asc
Description: Digital signature
_______________________________________________ Chicken-users mailing list [email protected] http://lists.nongnu.org/mailman/listinfo/chicken-users
