Proof

p|n^3-1=(n-1)(n^2+n+1), since p is prime and n < p, we have p | n^2+n+1. On the other hand, n | p - 1.

So there are integers k and x such that p-1=kn and n^2+n+1=p x= knx + x. Take (mod n), x=1