Results 1 -
3 of
3
Random Number Generators with Period Divisible by a Mersenne Prime
- Proc. ICCSA 2003
, 2003
"... Pseudo-random numbers with long periods and good statistical properties are often required for applications in computational finance. We consider the requirements for good uniform random number generators, and describe a class of generators whose period is a Mersenne prime or a small multiple of ..."
Abstract
-
Cited by 13 (5 self)
- Add to MetaCart
Pseudo-random numbers with long periods and good statistical properties are often required for applications in computational finance. We consider the requirements for good uniform random number generators, and describe a class of generators whose period is a Mersenne prime or a small multiple of a Mersenne prime. These generators are based on "almost primitive" trinomials, that is trinomials having a large primitive factor. They enable very fast vector/parallel implementations with excellent statistical properties.
A Primitive Trinomial of Degree 6972593
- Mathematics of Computation
, 2003
"... We describe a search for primitive trinomials of degree 6972593 over GF(2). The only primitive trinomials found were x + 1 and its reciprocal. This completes the search for primitive trinomials whose degree is a Mersenne exponent less than ten million. ..."
Abstract
-
Cited by 12 (8 self)
- Add to MetaCart
We describe a search for primitive trinomials of degree 6972593 over GF(2). The only primitive trinomials found were x + 1 and its reciprocal. This completes the search for primitive trinomials whose degree is a Mersenne exponent less than ten million.
