Skip Navigation

The Computer Journal 1979 22(1):80-85; doi:10.1093/comjnl/22.1.80
© 1979 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Hill, G. W.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Cyclic properties of pseudo-random sequences of Mersenne prime residues

G. W. Hill *

CSIRO, Division of Mineral Chemistry, P.O. Box 124, Port Melbourne, Australia

In Lehmer's multiplicative congruential procedure for generating a sequence of pseudo-random numbers, the modulus may be chosen as a Mersenne prime of the form, Mp = 2p – 1, and one of its primitive roots used as the constant multiplier to ensure a maximal sequence. Cyclic properties of the sequence entail perfect negative correlation between halves of the sequence and other relationships which limit the useful sequence length.

A primitive root is shown to be characterised by a set of non-trivial roots of unity (mod Mp), which is used to identify a primitive root, and properties of finite rings of such roots are used to generate further primitive roots. Computer procedures to facilitate these operations are indicated and applied to production of pseudo-random n-tuples designed to overcome the restrictions on randomness of single generator n-tuples, notes in the literature.

Received August 1977.

* CSIRO, Division of Mineral Chemistry, P.O. Box 124, Port Melbourne, Australia, 3207


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.