-
-
Notifications
You must be signed in to change notification settings - Fork 646
Open
Description
this.getBigRandom = function (limit) {
return new BigInteger(limit.bitLength(), rng)
.mod(limit.subtract(BigInteger.ONE))
.add(BigInteger.ONE)
;
};
The above will unfairly privilege low numbers at the expense of high numbers. The initial BigInteger object is equally likely to be any number with the same bit length as “limit”. The modulo operation, then, makes for at least two separate ways by which the result of the operation can be a low number, while leaving only one path for the highest.
Example:
var r_int = Math.floor( 10 * Math.random() );
var r_int2 = r_int % 8;
r_int is equally likely to be any of the integers 0 to 9, inclusive; i.e., each integer has a 0.1 probability.
r_int2, however, has a .2 probability of being 0 and a .2 probability of being 1, while the probability of other possible r_int2 values is still 0.1.
Metadata
Metadata
Assignees
Labels
No labels