Overview of the RandomTools[QuadraticCongruence] Subpackage
|
Calling Sequence
|
|
RandomTools[QuadraticCongruence][function](arguments)
function(arguments)
|
|
Description
|
|
•
|
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.
|
|
|
List of RandomTools[QuadraticCongruence] Subpackage Commands
|
|
|
|
Examples
|
|
>
|
|
| (1) |
We first create a random number generator for generating random numbers on the range 1..6 and generate two random numbers.
>
|
|
| (2) |
>
|
|
| (3) |
>
|
|
| (4) |
Now we roll the die 10 times.
>
|
|
| (5) |
Now we create a 10 decimal digit random number generator. To form uniformly distributed floating point random numbers with 10 digits of precision on [0,1) we use the command which forms the floating point number .
>
|
|
| (6) |
>
|
|
| (7) |
>
|
|
| (8) |
>
|
|
| (9) |
>
|
|
| (10) |
For further options see help page for the NewGenerator command.
|
|
Download Help Document
Was this information helpful?