BranchesHistoryHelpLogin
Welcome guest
You're not logged in.
277 users online, thereof 0 logged in

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

| | | | | created: 2019-05-11 19:54:19 | modified: 2019-06-22 08:49:15 | by: bookofproofs | references: [1272]

1.Proof: (related to "Wilson's Condition for an Integer to be Prime")

Edit or AddNotationAxiomatic Method

This work was contributed under CC BY-SA 3.0 by:

This work is a derivative of:

(none)

Bibliography (further reading)

[1272] Landau, Edmund: “Vorlesungen ├╝ber Zahlentheorie, Aus der Elementaren Zahlentheorie”, S. Hirzel, Leipzig, 1927