XOR the initial state with this new partial state and take the most significant bit from it (state ^ (state > 1)) & 1.As the following: var rand1 = new Random(0) But instead of letting it choose the seed, I provided the start seed instead. Well, I created two distinct objects e.g.
I couldn’t wait that long for it to generate all the numbers and verify when the pattern starts to repeat… since it uses 48 bits that make it a period of 2 48-1 something around quadrillion.īut there’s another easy way to verify that it produces the same sequence if provided the same seed. And if you keep generating the numbers, eventually, at some point the pattern will start to repeat itself. But the next number that’s going to come out of that black box could be anything. You can only generate 2 n-1 unique numbers e.g. This function is capable of generating any integer between the range of 2 32.įor example – let’s say you have a finite set of memory consisting of 4 bits. In essence, a random number is an unknown number generated from the finite set.įor example – In java, we can generate random numbers using Random.nextInt().
