Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.


On the periods of generalized Fibonacci recurrences
HTML articles powered by AMS MathViewer

by Richard P. Brent PDF
Math. Comp. 63 (1994), 389-401 Request permission


We give a simple condition for a linear recurrence $\pmod {2^w}$ of degree r to have the maximal possible period ${2^{w - 1}}({2^r} - 1)$. It follows that the period is maximal in the cases of interest for pseudorandom number generation, i.e., for three-term linear recurrences defined by trinomials which are primitive $\pmod 2$ and of degree $r > 2$. We consider the enumeration of certain exceptional polynomials which do not give maximal period, and list all such polynomials of degree less than 15.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 11B37, 11B39
  • Retrieve articles in all journals with MSC: 11B37, 11B39
Additional Information
  • © Copyright 1994 American Mathematical Society
  • Journal: Math. Comp. 63 (1994), 389-401
  • MSC: Primary 11B37; Secondary 11B39
  • DOI:
  • MathSciNet review: 1216256