On the period mod m of polynomially-recursive sequences: a case study
Résumé
Many polynomially-recursive sequences have a periodic behavior mod m. In this paper, we analyze the period mod m of a class of second-order polynomially-recursive sequences. Starting with a problem originally coming from an enumeration of avoiding pattern permutations, we give a generalization which appears to be linked with nice number theory notions (the Carmichael function, algebraic integers, Wieferich primes).
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|---|
| Licence |