This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
According to Wilson,s theorem is (n-1) ≡ -1 mod p where p is prime and if p is composite (n-1) ≡ 0 mod p (except for p = 4 which is special case)as proved here
Wiki link
(n-2)(\equiv) 0 mod p