Lev Glebsky. Cycles in Repeated Exponentiation Modulo p^n
Natural Sciences / Mathematics / Number theory
Submitted on: Jul 12, 2012, 11:56:38
Description: Given a number r, we consider the dynamical system generated by repeated exponentiations modulo r, that is, by the map u -> fg(u), where fg(u) equiv g^u (mod r) and 0<= fg(u) <= r-1. The number of cycles of the defined above dynamical system is considered for r=p^n.