The Period of Pseudo-Random Numbers Generated by Lehmer's Congruential Method | Zendy

A. T. FULLER | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The Period of Pseudo-Random Numbers Generated by Lehmer's Congruential Method

Author(s) -

A. T. FULLER

Publication year - 1976

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/19.2.173

Subject(s) - period (music) , sequence (biology) , pseudorandom number generator , mathematics , combinatorics , discrete mathematics , computer science , algorithm , physics , genetics , acoustics , biology

Lehmer has given a congruential method for generating a sequence of pseudo-random numbers. A known technique is available for checking whether the period of the sequence is maximal. In the present note it is shown how to calculate the period, whether or not this is maximal. The procedure is applied to various cases of Lehmer's sequences and it is found that, contrary to previous assertions, certain cases do not have maximal period. The theory of Lehmer's sequences is also made more accessible for non-experts in number theory. (Received January 1975)

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research