Using Fermat's Little theorem to prove that $12\mid n^2-1$ when $(n,6)=1$

70 Views Asked by At

enter image description here

I need help proving the first one via Fermat's little theorem.

I need a hint, or a good starter!

1

There are 1 best solutions below

3
On

Just notice that if it works for $n$ it also works for $n+6$ and $n-6$, so it is enough to prove the theorem for $n \in \{0,1,2,3,4,5\}$.