The first important case occurs when *m* is a prime number, and *f* is the almost linear recurrence

Here the coefficients (*c*_{1}, . . ., *c _{n}*) must be such that

is a primitive polynomial modulo *m*, in the sense discussed following Eq. 3.2.2–(9). The number of such polynomials is *φ*(*m ^{n}* – 1)

For example, suppose *m* = 2. We can generate binary *n*-tuples with ...

Start Free Trial

No credit card required