0

In $\mathbb{Z_p}$,compute say $2^{41}\pmod{p}$ using at most group $8$ operations, $p$ is a prime.

I tried using Euler's Theorem and the fact 37 is prime using the gcd $1$ relation with $p-1,$ but how to narrow down to $8.$ or any other given number?

0 Answers0