English

Cycles in Repeated Exponentiation Modulo $p^n$

Number Theory 2010-06-15 v1

Abstract

Given a number rr, we consider the dynamical system generated by repeated exponentiations modulo rr, that is, by the map ufg(u)u \mapsto f_g(u), where fg(u)gu(modr)f_g(u) \equiv g^u \pmod r and 0fg(u)r10 \le f_g(u) \le r-1. The number of cycles of the defined above dynamical system is considered for r=pnr=p^n.

Keywords

Cite

@article{arxiv.1006.2500,
  title  = {Cycles in Repeated Exponentiation Modulo $p^n$},
  author = {Lev Glebsky},
  journal= {arXiv preprint arXiv:1006.2500},
  year   = {2010}
}

Comments

4 pages

R2 v1 2026-06-21T15:35:28.374Z