The aim of this paper is to provide some results that

are useful when monomial dynamical systems are used for pseudorandom number generation. We prove that if we choose the seed to be a primitive root modulo $p^k$ then we get

the longest possible period of the random sequence modulo

$p^k$. An explicit expression for the length of the longest period is

also provided.