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.
For the newest resources, visit Wolfram Repositories and Archives »
