Number Theory/32-bit Linear congruential generator/2,147,483,561

The following table shows the sequence of pseudorandom numbers using the 32-bit linear congruential generator starting with seed value 2,147,483,561. This number is congruent to −2 modulo 2,147,483,563.

In this table, m = 2,147,483,563, and s = 2,147,483,561.

n	${40,014}^n\times s(\mathrm{mod}m)$	RAND
1	2,147,403,535	0.999962734
2	1,092,726,734	0.508840558
3	1,602,191,596	0.746078631
4	1,267,716,105	0.590326337
5	682,983,847	0.318039150
6	39,831,120	0.018547811
7	369,631,934	0.172123289
8	732,908,695	0.341287220
9	572,985,402	0.266817130
10	903,357,040	0.420658419