Editing Linear congruential generator
Revision as of 18:26, 20 February 2007 by Carl McBride (talk | contribs) (New page: The Lehmer algorithm can be written as <math>y_{n+1}\equiv ay_n + b~~~(\mod ~m),</math> where the user chooses <math>a</math>, <math>b</math>, <math>m</math>, and a seed value to initiat...)
Warning: You are editing an out-of-date revision of this page.
If you publish it, any changes made since this revision will be lost.
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.