MathGroup Archive 1996

[Date Index] [Thread Index] [Author Index]

Search the Archive

Random Number Generator of large period

  • To: mathgroup at smc.vnet.net
  • Subject: [mg3335] Random Number Generator of large period
  • From: ross at mpce.mq.edu.au
  • Date: Wed, 28 Feb 1996 03:35:33 -0500
  • Sender: owner-wri-mathgroup at wolfram.com

Here is a request for information.

Does anyone know of the whereabout of (code for) 
a Random-Number Generator (Linear-Congruential or otherwise) 
that produces output ``uniformally distributed''
amongst at least 2^96 objects?
i.e. integers: {1, ..., 2^96 }  

The code can be in any language: Mathematica, C, APL, Maple, ....


Concerning Mathematica...

What are the technical specs on the RNG used by Mathematica?
What is its period?
How many distinct ``seeds'' are accepted by  SeedRandom[] 
and/or how many distinct starting-points for Random[]
are generated by seeding?

Indeed, does Mathematica even provide an RNG distinct from that
which may be built-in to the host-computer's operating system?



Please email replies to myself and  timbourk at spirit.com.au,
posting to the group only if you think there is general interest.

Thanks,

	Ross


~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Ross Moore                         Internet: ross at mpce.mq.edu.au
Mathematics Department                Work:       +61 2 850-8955
Macquarie University                   Home:   please do not try
North Ryde, Sydney                     Fax:       +61 2 850-8114
Australia  2109			http://www.mpce.mq.edu.au/~ross/
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

==== [MESSAGE SEPARATOR] ====


  • Prev by Date: Path find algorithm for undirected graph
  • Next by Date: Random Number Generator of large period
  • Previous by thread: Path find algorithm for undirected graph
  • Next by thread: Random Number Generator of large period