asked on

Alter 32bit to 64bit in Gwenforweb's snippet

Gwenforweb helped me earlier (here), she gave me a code snippets for 32bit integers. It solved my problem and work perfectly, but as Gwenforweb mentioned, the snippet was for 32 bit integers.

My specs changed, now I need 64bit. Can someone alter her snippets to work using 64-bit integers?

seed=15239;
for (i=0;i<1000;i++){
 seed =(86028157*seed + 142501)%1299689; 
 rand=seed/1299689; 
 print(rand);
}

Open in new window

ASKER CERTIFIED SOLUTION

GwynforWeb

membership

This solution is only available to members.

To access this solution, you must be a member of Experts Exchange.

Start Free Trial

ozo

Here are some guidelines for choosing decent parameters for this type of PRNG
http://dl.acm.org/citation.cfm?id=63042
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.99.6553&rep=rep1&type=pdf
http://www.ics.uci.edu/~smyth/courses/ics178/random_number_generators_article.pdf

GwynforWeb

The Hull-Dobell Theorem states that for the generator

seed = (a*seed +c) mod m

Then the random numbers generated will have a full period for all seed values if and only if

c and m are relatively prime,
a - 1 is divisible by all prime factors of m,
a - 1 is a multiple of 4 if m is a multiple of 4

The scheme

seed =(86028157*seed + 142501)%1299689;

satisfies these conditions and is the one I have given you.

Examples
Products that use generators of this form and are easily applicable to 64 bits include:-

Numerical Recipes:-

seed = (1664525 *seed +1013904223) mod 2³²

Older versions of Visual Basic:-

seed = (1140671485*seed +12820163) mod 2^24

Vax's MTH$RANDOM from glibc:-

seed = (69069*seed + 1) mod 2³²

ozo

Full period isn't the only desideratum for a PRNG.
(a=0 satisfies the full period requirement)
You may also want to avoid correlations between numbers separated by lags
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC285899/pdf/pnas00123-0038.pdf
or small periods in the low order bits.

GwynforWeb

Ozo, If we want a World class Random Number generator then we should using a completely different scheme all together. The user wants a reasonable and easily implementable scheme that gives repeatable numbers. The scheme I have suggested satisfies Hull-Dobell and gives a reasonable distribution.

These simple linear congruence schemes are know to be a bit of an art form and most of the literature on the subject gives values that are know to work well from experience and testing. The three other schemes I have given are from professional products that clearly have proven their worth, and are easily implemented without bit operations.

If the questioner wants a professional high end simulation standard random generator, then we can have a discussion on that as well. But my guess is the generators been given here are of the form the OP is looking for. These still are really really good generators even if they are not world class.

When answering a question I feel it is important to pay attention to what the OP wants and gauge what level they are operating at; and as such respond with mathematics and discussion that is not unnecessary or confusing.

ozo

I don't know everything the questioner wants.
Perhaps the full period generator with a=1, c=1 would suffice.
Perhaps duplicating a particular professional product is desireable. (although some professional products have had notoriously poor PRNG qualities)
Or the full period generators with a=86028157 c=142501 m=1299689
or a=5171 c=142501 m=34421satisfy the requirement of working using 64 bit integers,
so if those didn't satisfy the changed specs, it seems at least conceivable that improved spectral properties could be a consideration.

GwynforWeb

"Perhaps the full period generator with a=1, c=1 would suffice."

I am gathering that is humor.

volking

ASKER

Thanks for staying on topic and answering the question. Sometimes, experts are so smart, they want to educate the world. I'm just a simple ol'redneck with a HS diploma who enjoys playing programmer. Your little snippet makes that possible.

Thanks Gwenforweb

GwynforWeb

Your welcome. :-)