The algorithm is an algebraic equation where a modulus division operation is performed to generate a random number.
function linearCongruentialGenerator(X,a,c,m) {
X = (a * X + c) % m;
return X;
}
Parameters descriptions X is the seed number (i.e. base number to start the algorithm)
a – multiplier
c – increment
m – modulus (number to do modulus division operation)

Log in or sign up for Devpost to join the conversation.