Wilson's theorem
Sign in to savenecessary and sufficient condition for a number to be prime
Wikidata facts
- Instance of
- theorem
- Part of
- list of theorems
- Named after
- John Wilson
Show 2 more facts
- maintained by WikiProject
- WikiProject Mathematics
- studied by
- number theory
Sources (1)
via Wikidata · CC0
~11 min read
Encyclopedic overview
In algebra and number theory, Wilson's theorem states that a natural number n > 1 is a prime number if and only if the product of all the positive integers less than n is one less than a multiple of n. That is (using the notations of modular arithmetic), the factorial
( n − 1 ) ! = 1 × 2 × 3 × ⋯ × ( n − 1 )
Excerpted from Wikipedia’s “Wilson's theorem” article, available under the CC BY-SA 4.0 licence.