Re:Math.random in V8 is broken
by emcq on Saturday November 21, 2015 @11:13PM
(#10609058)
I'm not sure about their numbers, but with a little trick it can be estimated as 1-e^(-2^(n-x-1)), where x is the number of bits and n is log_2 of the number of random draws. When n and x are relatively close, you should be able to calculate this without numbers getting too big or too small.
[ Parent
| on HN ]
There are no comments on this comment yet.