I have to show that if p is a prime number, then the congruence x² ≡ 1 (mod p) has only the solutions x ≡ 1 and x ≡ -1.
Assume . That is, p divides . This is a difference of two squares, and so split it up and realise that divides one of the two factors, because is prime...