| ▲ | pama a day ago | |||||||
Even without a formal proof you could test it empirically if you generate a large number of samples and run regular tests for pseudorandom number generators. [Edit: a quick test on a million samples and relatively simple RNG tests suggests that this is indeed good enough; maybe worth working out a proof if this hasn't been done already. Edit2: I guess the main problem you'd hit in practice with short sequences of digits would be to avoid accidental recurrences with too short a period, but it should be possible to make it statistically unlikely in practice with enough compute/digits.] | ||||||||
| ▲ | AlotOfReading a day ago | parent [-] | |||||||
Passes dieharder and PractRand, so it's pretty dang good. | ||||||||
| ||||||||