Cover: Additive generation of pseudorandom numbers [by] O. Gross and S.M. Johnson.

Additive generation of pseudorandom numbers [by] O. Gross and S.M. Johnson.

by Oliver Alfred Gross

Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback15 pages $20.00 $16.00 20% Web Discount

The calculation of the cycle lengths of sequences of certain special cases of pseudorandom vectors generated by a new addition technique. These cycle lengths are comparable to those obtained by the established multiplicative methods, and relevant theorems are included. A pseudorandom sequence of numbers is defined as a completely determined sequence having some of the more easily tested statistical properties of truly random sequences.

This report is part of the RAND Corporation Research memorandum series. The Research Memorandum was a product of the RAND Corporation from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit

The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.