Notice that if m devides n, then for any positive integer a, we have .

(1) is a common divisor of m and ,since .

thus .

(2) if we show that p divides , then the proposition is proved.

since p-1 divides n!, there exist positive integer k such that n!=(p-1)k.

and

combined with Fermat's theorem " " gives " ".