e.g. for a range 1-6, pick from 100-250 instead and modulo 6 plus 1.
There are of course brand new biases at play (is your new range cleanly divisible by X?) But it's enough to tamp down the original biases you're worried about
e.g. for a range 1-6, pick from 100-250 instead and modulo 6 plus 1.
There are of course brand new biases at play (is your new range cleanly divisible by X?) But it's enough to tamp down the original biases you're worried about
Reminds me of the Buttered Toast Ig Noble Prize:
https://gizmodo.com/an-experiment-that-solves-the-worlds-mos...
How is this different from opening up my JavaScript console and doing Math.random() several times?
https://www.nature.com/articles/s41598-021-95388-7
> "The presented above examples clearly show that classic random number generators may be exposed to various attacks, or may have the so-called backdoors. This justifies the need to develop alternative technologies that could replace the classic generators on a large scale. The most promising, because they have a fundamental justification for the randomness in the formalism of quantum mechanics, are quantum random number generators."
"Cracking the code" can have quite high stakes, and so some of the smartest humans who ever lived have thought about it. See, for example, this article on Shannon entropy https://en.wikipedia.org/wiki/Entropy_(information_theory)
This would mean someone asks you to pick a random (integer) number between 0 and 1. That's just a coin flip, there's different/better methods for that.
I can't tell what integer `0x4C mod 10` is off the top of my head. Turns out it's 6.
If someone asks me to "pick a random digit in [0x0, 0xF]", then I'll use base-10 as my start. 284. I have no idea which hex digit this will result in after I mod it by 16. It's 0xC, but I didn't know that going into it.
Oh, wait. I think I do see what you're getting at. I would still know if it's even or odd, because 10 and 16 share 2 as a divisor, right?