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:

$$(n-1)!\equiv -1\mod n.$$

Notes

Proofs: 1

Persons: 1


Thank you to the contributors under CC BY-SA 4.0!

Github:
bookofproofs


References

Bibliography

  1. Landau, Edmund: "Vorlesungen ├╝ber Zahlentheorie, Aus der Elementaren Zahlentheorie", S. Hirzel, Leipzig, 1927