We study the distribution of linear recurrent sequences modulo p nfor prime pwhen the auxiliary polynomial is irreducible and the period is maximal. We show that such a sequence takes each possible value equally often up to an error of order pn/2.
CITATION STYLE
Pinch, R. G. E. (1995). Distribution of recurrent sequences modulo prime powers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1025, pp. 188–189). Springer Verlag. https://doi.org/10.1007/3-540-60693-9_21
Mendeley helps you to discover research relevant for your work.