Wilson's theorem


Also found in: Wikipedia.

Wilson's theorem

[′wil·sənz ‚thir·əm]
(mathematics)
The number (n - 1)! + 1 is divisible by n if and only if n is a prime.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
References in periodicals archive ?
Unlike the Fermat probabilistic primality test method, the Wilson's theorem is not only necessary but also sufficient for the primality test.
In fact from the Wilson's Theorem we know that for any prime p,
Abstract In this note I prove using an algebraic identity and Wilson's Theorem that if [a.sup.2] + 1 is an odd prime, thus this prime must has the form [4k.sup.2] + 1, then 5 + 2k - 3.