List of questions
Related questions
Question 137 - 212-81 discussion
Created by D. H. Lehmer. It is a classic example of a Linear congruential generator. A PRNG type of linear congruential generator (LCG) that operates in multiplicative group of integers modulo n. The basic algorithm is Xi+1=(aXi + c) mod m, with 0 Xi m.
A.
Lehmer Random Number Generator
B.
Lagged Fibonacci Generator
C.
Linear Congruential Generator
D.
Blum Blum Shub
Your answer:
0 comments
Sorted by
Leave a comment first