micromass said:What did you try already?? If you tell us where you're stuck, then we'll know how to help...
stringy said:We know n^{13} \equiv n \ ( mod \ 13), right? That's the theorem.
But we also know that if a' \equiv a \ ( mod \ m ) and b' \equiv b \ ( mod \ m ), then a'b' \equiv ab \ ( mod \ m ). This implies
n^{39} \equiv n^3 \ (mod \ 13).
But then what's another way to express this congruence? To say that n^{39} is congruent to n^3 means 13 divides what?