Anonymous user
Random number generator (included): Difference between revisions
m
→{{header|PARI/GP}}
(→BSD rand(): n bits can contain only 2^n states whatever you do: it's the repeat length that matters) |
|||
Line 205:
=={{header|PARI/GP}}==
<code>random</code> uses Richard Brent's [http://wwwmaths.anu.edu.au/~brent/random.html xorgens]. It's a member of the xorshift class of PRNGs and provides good, fast pseudorandomness (passing the big crush test, unlike the Mersenne twister), but it is not cryptographically strong. As implemented in Pari, its period is "at least <math>2^{4096}-1
=={{header|Perl}}==
| |||