A search for Wilson primes
Abstract
A Wilson prime is a prime p such that (p-1)! = -1 mod p2. We report on a search for Wilson primes up to 2 * 1013, and describe several new algorithms that were used in the search. In particular we give the first known algorithm that computes (p-1)! mod p2 in average polynomial time per prime.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.