# Math Help - Divisibility

1. ## Divisibility

So I have the following problem: Prove that if $x$ is prime and $n$ is not an integer multiple of $x$, then $n^{x-1} \equiv 1 \mod{x}$. I could really use some help getting this problem started and would appreciate a nudge in the correct direction. Thanks for any help.

2. Originally Posted by jgensler
So I have the following problem: Prove that if $x$ is prime and $n$ is not an integer multiple of $x$, then $n^{x-1} \equiv 1 \mod{x}$. I could really use some help getting this problem started and would appreciate a nudge in the correct direction. Thanks for any help.
Proofs of Fermat's little theorem - Wikipedia, the free encyclopedia