I understand the proof and I can use Fermat's little theorem, but I'm having trouble getting an intuition of why this theorem is true. The version I know is this one (I know there are some variations of the theorem that are a bit more general but I'm less interested as they are probably even harder to fully grasp).
If $p$ is a prime and a is any integer not divisible by $p$, then $a^{p − 1} − 1$ is divisible by $p$.
Would anyone have a little drawing in mind or a little explanation that would make me click? I feel it tremendously helps to have an intuition of "why it works". Thanks!