Abstract

A prime pp is a Wolstenholme prime if (2pp)≡2\binom{2p}{p}\equiv2 mod p4p^4, or, equivalently, if pp divides the numerator of the Bernoulli number Bp−3B_{p-3}; a Vandiver prime pp is one that divides the Euler number Ep−3E_{p-3}. Only two Wolstenholme primes and eight Vandiver primes are known. We increase the search range in the first case by a factor of 1010, and show that no additional Wolstenholme primes exist up to 101110^{11}, and in the second case by a factor of 2020, proving that no additional Vandiver primes occur up to this same bound. To facilitate this, we develop a number of new congruences for Bernoulli and Euler numbers mod pp that are favorable for computation, and we implement some highly parallel searches using GPUs.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.