Abstract
The list of primitive binary trinomials with a degree equal to a Mersenne exponent is extended. The newly found primitive trinomials have a degree equal to the 29th and 30th Mersenne exponent. These trinomials enable the construction of new, high-performance random-number generators for use in large-scale Monte Carlo simulations.
Keywords
Affiliated Institutions
Related Publications
The average distances in random graphs with given expected degrees
Random graph theory is used to examine the “small-world phenomenon”; any two strangers are connected through a short chain of mutual acquaintances. We will show that for certain...
The small world of human language
Words in human language interact in sentences in non-random ways, and allow humans to construct an astronomic variety of sentences from a limited number of discrete units. This ...
A high‐performance parallel‐generalized born implementation enabled by tabulated interaction rescaling
Abstract Implicit solvent representations, in general, and generalized Born models, in particular, provide an attractive way to reduce the number of interactions and degrees of ...
Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition
This paper develops the separating capacities of families of nonlinear decision surfaces by a direct application of a theorem in classical combinatorial geometry. It is shown th...
Numerical recipes in C: the art of scientific computing
From the Publisher: This is the revised and greatly expanded Second Edition of the hugely popular Numerical Recipes: The Art of Scientific Computing. The product of a unique co...
Publication Info
- Year
- 1992
- Type
- article
- Volume
- 03
- Issue
- 03
- Pages
- 561-564
- Citations
- 38
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1142/s0129183192000361