arXiv · 1209.3436
A search for Wilson primes
Abstract
A Wilson prime is a prime p such that (p-1)! = -1 mod p^2. We report on a search for Wilson primes up to 2 * 10^13, and describe several new algorithms that were used in the search. In particular we give the first known algorithm that computes (p-1)! mod p^2 in average polynomial time per prime.
Explore related subjects
Keep this discovery
Edgar Costa, Robert Gerbicz, David Harvey. 2012-12-05. A search for Wilson primes. https://arxiv.org/abs/1209.3436
Cite the original work for its findings. Save a collection to share your selection of sources.