Answered: What sequence of pseudorandom numbers is generated using the linear congruential generator xn+1 =(4xn + 1) mod 7 with seed x0 = 3? | bartleby

Answered: What sequence of pseudorandom numbers is generated using the linear congruential generator xn+1 = (3xn + 515) mod8191 with seed xO =1? | bartleby

SOLVED: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.