◀ ▲ ▶Branches / Numbertheory / Proposition: Wilson's Condition for an Integer to be Prime
The following proposition provides also a very inefficient method of prooving if an integer is a prime number.
Proposition: Wilson's Condition for an Integer to be Prime
An integer $n > 1$ is a prime number if and only if the following congruence holds:
$$(n1)!\equiv 1\mod n.$$
Notes
 In this equation, $(n1)!$ denotes the factorial of $(n1).$
 This proposition is also known as Wilson's theorem, called after its discoverer, John Wilson (1741  1793).
Table of Contents
Proofs: 1
Mentioned in:
Persons: 1
Thank you to the contributors under CC BYSA 4.0!
 Github:

References
Bibliography
 Landau, Edmund: "Vorlesungen über Zahlentheorie, Aus der Elementaren Zahlentheorie", S. Hirzel, Leipzig, 1927