Irregular Primes to One Million
- 1 October 1992
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 59 (200) , 717-722
- https://doi.org/10.2307/2153086
Abstract
Using "fast" algorithms for power series inversion (based on the fast Fourier transform and multisectioning of power series), we have calculated all irregular primes up to one million, including their indices of irregularity and associated irregular pairs. Using this data, we verified that Fermat's "Last Theorem" and Vandiver's conjecture are true for these primes. Two primes with index of irregularity five were already known; we find that there are nine other primes less than one million with index five and that the prime 527377 is the unique prime less than one million with index six.Keywords
This publication has 8 references indexed in Scilit:
- Cyclotomic Invariants for Primes Between 125000 and 150000Mathematics of Computation, 1991
- On modular representations of $$(\bar Q/Q)$$ arising from modular formsInventiones Mathematicae, 1990
- Quintic Polynomials and Real Cyclotomic Fields with Large Class NumberMathematics of Computation, 1988
- Accélération de calcul de nombres de BernoulliJournal of Number Theory, 1988
- New Congruences for the Bernoulli NumbersMathematics of Computation, 1987
- Introduction to Cyclotomic FieldsPublished by Springer Nature ,1982
- The Irregular Primes to 125000Mathematics of Computation, 1978
- Combinatorial IdentitiesMathematics of Computation, 1969