Cycles in repeated exponentiation modulo pn Chapter uri icon

abstract

  • We consider a dynamical system generated by exponentiation modulo r, that is, by the map u ↦ fq(u), where fq(u) ≡ qu (mod r) and 0 ≤ fg(u) ≤ r − 1. The number of cycles is estimated from above in the case when r = pn with a prime integer p and gcd(q, p) = 1. Also a more general class of functions is considered. © 2014 Walter de Gruyter GmbH, Berlin/Boston.

publication date

  • 2014-01-01