The RandomTools[QuadraticCongruence] subpackage contains functions for creating pseudo-random number generators using the Quadratic Congruence algorithm.  The integers , ... are generated using the quadratic recurrence

where  is a product of two primes and , the seed, may be specified by the user.  They use the least significant bits of the x's to form the random numbers.

The Quadratic Congruential Generator creates generators using primes of length either 10, 12, 15 or 16 digits. These generators can be used for every day scientific applications.

Each command in the RandomTools[QuadraticCongruence] subpackage can be accessed by using either the long form or the short form of the command name in the command calling sequence.

As the underlying implementation of the RandomTools[QuadraticCongruence] subpackage is a module, it is also possible to use the form RandomTools:-QuadraticCongruence:-command to access a command from the package. For more information, see Module Members.

To display the help page for a particular QuadraticCongruence command, see Getting Help with a Command in a Package.