2011/01/18 by Min Sha, Sha, Min · 1 citation
Computer Science · Mathematics · #Analytic Number Theory Research #Coding theory and cryptography #Cryptography and Residue Arithmetic #FOS: Mathematics #Number Theory (math.NT) #math.NT
paper · pdf · doi:10.48550/arxiv.1101.3482
Accepted by The Fibonacci Quarterly.(SCI)
openalex publication_date 2011/01/18 · arxiv created 2011/08/22 · arxiv updated 2011/08/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We obtain some results about the repeated exponentiation modulo a prime power from the viewpoint of arithmetic dynamical systems. Especially, we extend two asymptotic formulas about periodic points and tails in the case of modulo a prime to the case of modulo a prime power.