Innumber theory, a Wolstenholme prime is a special type of prime number satisfying a stronger version of Wolstenholme's theorem. Wolstenholme's theorem is a congruence relation satisfied by all prime numbers greater than 3. Wolstenholme primes are named after mathematician Joseph Wolstenholme, who first described this theorem in the 19th century.
Wolstenholme primes: primes p such that binomial(2p-1,p-1) == 1 (mod p^4)
Interest in these primes first arose due to their connection with Fermat's Last Theorem. Wolstenholme primes are also related to other special classes of numbers, studied in the hope to be able to generalize a proof for the truth of the theorem to all positive integers greater than two.
The only two known Wolstenholme primes are 16843 and 2124679 (sequence A088164 in the OEIS). There are no other Wolstenholme primes less than 109.[2]
A Wolstenholme prime is a prime p that divides the numerator of the Bernoulli numberBp−3.[4][5][6] The Wolstenholme primes therefore form a subset of the irregular primes.
The search for Wolstenholme primes began in the 1960s and continued over the following decades, with the latest results published in 2007. The first Wolstenholme prime 16843 was found in 1964, although it was not explicitly reported at that time.[10] The 1964 discovery was later independently confirmed in the 1970s. This remained the only known example of such a prime for almost 20 years, until the discovery announcement of the second Wolstenholme prime 2124679 in 1993.[11] Up to 1.2×107, no further Wolstenholme primes were found.[12] This was later extended to 2×108 by McIntosh in 1995 [5] and Trevisan & Weber were able to reach 2.5×108.[13] The latest result as of 2007 is that there are only those two Wolstenholme primes up to 109.[14]
It is conjectured that infinitely many Wolstenholme primes exist. It is conjectured that the number of Wolstenholme primes ≤ x is about ln ln x, where ln denotes the natural logarithm. For each prime p ≥ 5, the Wolstenholme quotient is defined as
Clearly, p is a Wolstenholme prime if and only if Wp ≡ 0 (mod p). Empirically one may assume that the remainders of Wp modulo p are uniformly distributed in the set {0, 1, ..., p–1}. By this reasoning, the probability that the remainder takes on a particular value (e.g., 0) is about 1/p.[5]
Ribenboim, P. (2004), "Chapter 2. How to Recognize Whether a Natural Number is a Prime", The Little Book of Bigger Primes, New York: Springer-Verlag New York, Inc., ISBN978-0-387-20169-6
Selfridge, J. L.; Pollack, B. W. (1964), "Fermat's last theorem is true for any exponent up to 25,000", Notices of the American Mathematical Society, 11: 97
