Abstract
A prime is a Wolstenholme prime if mod , or, equivalently, if divides the numerator of the Bernoulli number ; a Vandiver prime is one that divides the Euler number . Only two Wolstenholme primes and eight Vandiver primes are known. We increase the search range in the first case by a factor of , and show that no additional Wolstenholme primes exist up to , and in the second case by a factor of , 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 that are favorable for computation, and we implement some highly parallel searches using GPUs.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.