Wolfram Library Archive

Courseware Demos MathSource Technical Notes
All Collections Articles Books Conference Proceedings

Accelerating Wilson's Primality Test

D. Naccache
M. Donio
Journal / Anthology

Revue Technique Thomson-CSF
Year: 1991
Volume: 23
Issue: 3
Page range: 595-599

One of the most known deterministic prime number testing methods is due to Wilson [1]. Wilson's theorem states that p is prime iff (p-1)!= -1 mod p. Here we derive from both his result and a little trick about factories a faster criterion: (((p-1)/2)!)2= plus or minus 1 mod p.

*Mathematics > Number Theory