$a \in \mathbb{N}$ and $p \in \mathbb{P}$ with $gcd(a, p-1)=1$, then for every integer $b$, then $x^a \equiv b$ mod $p$ has a solution
Proof of Unique Solution for Modular Exponentiation In Cryptography