Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
1997
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 1997

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

Search the Archive

Re: Random[..]

  • To: mathgroup at smc.vnet.net
  • Subject: [mg7348] Re: Random[..]
  • From: Lars Hohmuth <larsh>
  • Date: Tue, 27 May 1997 22:27:37 -0400 (EDT)
  • Organization: Wolfram Research Inc.
  • Sender: owner-wri-mathgroup at wolfram.com

mcleod wrote:
> 
> What algorithm does Random[..] use?
> Maybe if it is kept secret the numbers will be more
> random!
> Ian McLeod (aim at uwo.ca)

Actually, the 'Implementation Notes' (Appendix 9.4 in the 3rd release of
the Mathematica book or look in the Help Browser) give the algorithms:

Random uses the Wolfram rule 30 cellular automaton generator for
integers.
(see: Advances in Applied Mathematics, volume 7, pp 123-169 (June 1986))
It uses a Marsaglia­Zaman subtract­with­borrow generator for real
numbers. 
I don't have a reference for that one handy, but it should be quite easy
to find.

You can try out Wolfram rule 30 cellular automaton yourself in the
cellular automata demo notebook in the Demo section of the Help Browser.


Lars Hohmuth
Wolfram Research


  • Prev by Date: All involutions of a permutation
  • Next by Date: Re: Plot3D error
  • Previous by thread: Re: Random[..]
  • Next by thread: Plot3D error