5. Wilson’s Theorem #

Created Sunday 02 August 2020

If p is a prime number, then (p-1)! mod§ = -1 or p-1

• This is used if we need to solve quickly for a given case of (n!)mod§ when n is p-1