MathGroup Archive 2002

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

Search the Archive

Random bits (generation)

  • To: mathgroup at
  • Subject: [mg35045] Random bits (generation)
  • From: "DIAMOND Mark R." <dot at>
  • Date: Thu, 20 Jun 2002 23:54:45 -0400 (EDT)
  • Organization: The University of Western Australia
  • Sender: owner-wri-mathgroup at

I am not sure whether anyone other than a Wolfram guru will know the answer
to this. ...

(1) If I wish to generate a large number of random bits, what is the fastest
(2) What is the safest way in the sense of being able to expect the bit
sequence to pass Marsaglia's Diehard battery of tests Maurer's Universal
Statistical Test.? or is this requirement impossible to meet with Random?

More specifically, to be sure that they are independent and random, should I
use something like Random[Integer, {0,1}] or can one use *all the bits* of,
say, Random[Integer, {0,2^32-1}] ... or even something  larger.


Mark Diamond

  • Prev by Date: RE: Table as Graphics Object?
  • Next by Date: Re: Varying color in ParametricPlot
  • Previous by thread: Re: Mathematica and AMPL
  • Next by thread: Re: Random bits (generation)