A search for Wilson primes
Number Theory
2012-12-06 v3 Data Structures and Algorithms
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.
Keywords
Cite
@article{arxiv.1209.3436,
title = {A search for Wilson primes},
author = {Edgar Costa and Robert Gerbicz and David Harvey},
journal= {arXiv preprint arXiv:1209.3436},
year = {2012}
}
Comments
24 pages, simplified notation and space analysis