Question 86
Determine all pairs $(a, p)$ of strictly positive integers, with $p$ prime, such that for every pair $(m, n)$ of strictly positive integers, the remainder of the Euclidean division of $a^{2^{n}}$ by $p^{n}$ is nonzero and is the same as that of $a^{2^{m}}$ by $p^{m}$.