
In previous posts, we have learned about modulo for rational numbers. To show its application, today, we will use the language of modulo of rationals to give another proof of Wilson's Theorem.
Wilson's theorem is a well known theorem in number theory. It is stated as follows.
Wilson's Theorem. If $p$ is a prime number then $$(p-1)! = -1 \pmod{p}.$$