mathlesstraveled.com
The Fermat primality test and the GCD test
In my previous post we proved that if $latex a$ shares a nontrivial common factor with $latex n$, then $latex a^{n-1} \not\equiv 1 \pmod n$, and this in turn proves that $latex n$ is not prime (by …