January 2024
Intermediate to advanced
408 pages
13h 21m
English
High quality random numbers are critical in large-scale simulations such as data synthetization. I discuss a new test of randomness for pseudorandom number generators (PRNG), to detect subtle patterns in binary sequences. The test shows that congruential PRNGs, even the best ones, have flaws that can be exacerbated by the choice of the seed. This includes the Mersenne twister used in many programming languages including Python. I also show that the digits of some numbers such as
, conjectured to be perfectly random, fail this new test, despite the fact that they pass all ...
Read now
Unlock full access