Bits and pieces of number theory Theorem (continually updated)

Wilson's Theorem: for any prime p, there are (p-1) ≡-1 (mod p);!

      If (p-1)! ≡-1 (mod p), p is a prime number it certainly has.

Guess you like

Origin www.cnblogs.com/St-Lovaer/p/11767105.html