#### Using Fermat's Little Theorem

Enter your answer in the field below.

Click "refresh" or "reload" to see another problem like this one.

Click here to get a clue

In a nutshell: to find *a*^{n} mod *p* where *p* is prime and *a* is not divisible by *p*, we find *a*^{r} mod *p*, where *r* is the remainder when *n* is divided by φ(*p*). The detailed solution below shows why/how this works.

Copyright (c) 2017, James Wooland, all rights reserved.