Thread: prime number

please help. thank you.

Let p be a prime number

a) Prove that p divides (PLZ SEE IMAGE) if 1<= k <= p-1
b) Porve that (n^p)-n is divisble by p for every n ε (exists) N

(b) This is Fermat's little theorem stated in a strange way.