The Self Power Map and its Image Modulo a Prime
The self-power map is the function from the set of natural numbers to itself which sends the number $n$ to $n^n$. Motivated by applications to cryptography, we consider the image of this map modulo a prime $p$. We study the question of how large $x$ must be so that $n^n \equiv a \bmod p$ has a sol...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_ca |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1807/35765 |