The following proposition provides also a very inefficient method of prooving if an integer is a prime number.
Proposition: A Necessary and Sufficient Condition for an Integer to be Prime
$$(n-1)!\equiv -1\mod n.$$
- In this equation, $(n-1)!$ denotes the factorial of $(n-1).$
- This proposition is also known as Wilson’s theorem, called after its discoverer John Wilson (1741 – 1793).
| | | | | created: 2019-05-11 19:54:19 | modified: 2019-05-12 09:17:37 | by: bookofproofs | references: 
1.Proof: (related to "A Necessary and Sufficient Condition for an Integer to be Prime")
This work is a derivative of:
Bibliography (further reading)
 Landau, Edmund: “Vorlesungen über Zahlentheorie, Aus der Elementaren Zahlentheorie”, S. Hirzel, Leipzig, 1927