Write an algorithm in pseudocode for generating a sequence of pseudorandom numbers using a linear congruential generator.
The middle-square method for generating pseudorandom numbers begins with an n-digit integer. This number is squared, initial zeros are appended to ensure that the result has 2n digits, and its middle n digits are used to form the next number in the sequence. This process is repeated to generate additional terms.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.