Notes: - NOT RECOMENDED FOR SERIOUS APPLICATIONS.
                 Just use it for comparison purposes, etc.
            
                    - This generator is fast
            
                    - "Minimal" random number generator of Park and Miller.
                     x(n) = 16807 * x(n-1) mod (2^31-1)
                      also known as GGL.
            
               - Set seed to any integer value (except the unlikely value mask) to
                 initialize the sequence.
            
                    - The period is 2^31-2 = 2.1*10^9. If your application needs
                 more numbers in sequence than 1% of the random generators period,
                 i.e. 10^7, then use a more elaborate random generator.
            
                    - At least 32 bit long int is required.
            
                    - References:
                       o Algorithm from CACM 31 no. 10, pp. 1192-1201, October 1988.
                       o Algorithm "ran0" from "Portable Random Number Generators",
                         William H. Press and Saul A Teukolsky
                         Computers in Phyics, Vol. 6, No. 5, Sep/Oct 1992
                       o According to a posting by Ed Taft on comp.lang.postscript,
                         Level 2 (Adobe) PostScript interpreters use this algorithm too.
            
             ----------------------------------------------------------------------------//