Linear Congruent Number Generator Model The method generates a sequence of integers xi over the interval [0, m-1] by the recurrence relation:
x[i+1] = (ax[i]+c) mod m
where the modulus m is outstandinger than zero, the multiplier a is outstandinger than zero and less than m, and the increment c is outstandinger than zero and less than m. All numbers are integers and all arithmetic is integer arithmetic. The initial value x0 is known as the seed.

Requirements:
* Java

The license of this software is Freeware, you can free download and free use this graphing software.