State Fermat’s little theorem.

if p is a prime (and \(a \equiv 0(\bmod p)\) with \(a \in \mathbb{Z}\)) then     A1

\({a^{p - 1}} \equiv 1(\bmod p)\)     A1

[2 marks] 

Note: Accept \({a^p} \equiv a(\bmod p)\) .

Fermat’s little theorem was reasonably well known. Some candidates forgot to mention that p was a prime. Not all candidates took the hint to use this in the next part.