Maple Professional
Maple Academic
Maple Student Edition
Maple Personal Edition
Maple Player
Maple Player for iPad
MapleSim Professional
MapleSim Academic
Maple T.A. - Testing & Assessment
Maple T.A. MAA Placement Test Suite
Möbius - Online Courseware
Machine Design / Industrial Automation
Aerospace
Vehicle Engineering
Robotics
Power Industries
System Simulation and Analysis
Model development for HIL
Plant Modeling for Control Design
Robotics/Motion Control/Mechatronics
Other Application Areas
Mathematics Education
Engineering Education
High Schools & Two-Year Colleges
Testing & Assessment
Students
Financial Modeling
Operations Research
High Performance Computing
Physics
Live Webinars
Recorded Webinars
Upcoming Events
MaplePrimes
Maplesoft Blog
Maplesoft Membership
Maple Ambassador Program
MapleCloud
Technical Whitepapers
E-Mail Newsletters
Maple Books
Math Matters
Application Center
MapleSim Model Gallery
User Case Studies
Exploring Engineering Fundamentals
Teaching Concepts with Maple
Maplesoft Welcome Center
Teacher Resource Center
Student Help Center
RandomTools[QuadraticCongruence][NewGenerator] - Quadratic Congruence Pseudo Random Number Generator
Calling Sequence
NewGenerator( opt1, opt2, ... )
Parameters
opt1, opt2, ...
-
(optional) argument of the form option=value where option is one of primes, range, or seed
Description
The NewGenerator command outputs a Maple procedure, a pseudo-random number generator, which when called outputs one pseudo-random integer. The output of the generator depends on the options described below. The default is to output integers on the range , i.e., a random 12 digit integer.
The generator is a Quadratic Congruence (QC) generator. A QC generator uses the quadratic recurrence which generates a sequence of integers where n is a product of two primes p and q and is determined from the seed of the generator. The pseudo-random integers are extracted from the sequence by using the least significant half of the digits of the 's.
The quality of the pseudo-random numbers generated is expected to be good because the least significant bits of the are cryptographically secure. See RandomTools[BlumBlumShub].
The primes p and q are chosen to be of the form and where s and t are prime and 2 is a primitive element in the Z mod s and in Z mod t. The initial value is chosen as a function of the seed so that the period of the generator is maximal where the maximal period is lcm(s-1,t-1) which about n/8. We have precomputed random primes p and q satisfying these requirements of lengths 10, 12, 15 and 16 decimal digits in length. They are
p
q
(9999948359)
(9999854759)
(999999911447)
(999999811607)
(999999999847799)
(999999999771959)
(9999999999716999)
(9999999999691319)
Thus there are four choices of n available which have lengths 20, 24, 30, and 32 digits respectively with periods > 10^19, 10^23, 10^29 and 10^31, respectively. The larger primes will give ``better'' pseudo-random numbers and provide a longer the period. For most applications the smallest choice, the default, will be fine and it will be slightly faster than the larger choices.
The following optional arguments are supported. They are input as equations in any order.
seed=integer
The given integer is the seed of the generator. The value used for is computed from the value of the seed argument It will be a quadratic residue in Z mod n of maximal period and will be larger than the sqrt(n). The default value for seed is .
range=integer..integer or integer
If the value of the range argument is a range, then the integer will be chosen from that range. If the value of the range argument is an integer, then the integer will be take from the range [0..value). The default range is .
primes=, , or
The integer l, which must be one of 10, 12, 15 and 16 specifies the choice of the length of the primes p and q in decimal digits. The default value for primes in .
Examples
See Also
rand, RandomTools, RandomTools[Generate], RandomTools[QuadraticCongruence]
Download Help Document