Irregular primes to two billion
classification
🧮 math.NT
keywords
irregularprimesadaptingalgorithmbillioncheckclasscompute
read the original abstract
We compute all irregular primes less than 2^31 = 2 147 483 648. We verify the Kummer-Vandiver conjecture for each of these primes, and we check that the p-part of the class group of Q(zeta_p) has the simplest possible structure consistent with the index of irregularity of p. Our method for computing the irregular indices saves a constant factor in time relative to previous methods, by adapting Rader's algorithm for evaluating discrete Fourier transforms.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.