Question: How would you write a C++ function that uses the linear congruential generator method: X_n+1 = (aX_n + c) mod m to produce unsigned pseudo-random

How would you write a C++ function that uses the linear congruential generator method: X_n+1 = (aX_n + c) mod m to produce unsigned pseudo-random 16 bit integers. Using predefined constant values for a = 16807 and b = 2147483647
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
