No such thing as a small change  
PerlMonks 
Re^3: [OT] The statistics of hashing.by moritz (Cardinal) 
on Apr 01, 2012 at 15:31 UTC ( #962888=note: print w/replies, xml )  Need Help?? 
You'd need a floatingpoint number with a mantissa of about 128 bits to hold the value of (11/2**128) Luckily there are other ways to evaluate the expression. If we set x = 1/2**128, we can do a taylor series to evaluate (1x)**n around x = 0 (and since x is very small, it's a good approximation:
Where higher orders can be neglected. If you chose an n that is high enough, you can get non1 values as the result. Though I'm not sure if that's really helpful. What you'd really need is the expectation value of the number of collisions (the lambda symbol in Poisson Distribution, then you could easily calculate everything you wanted.
In Section
Seekers of Perl Wisdom

