Irregular primes and cyclotomic invariants to four million

@article{Buhler1993IrregularPA,
  title={Irregular primes and cyclotomic invariants to four million},
  author={J. Buhler and R. Crandall and R. Ernvall and T. Mets{\"a}nkyl{\"a}},
  journal={Mathematics of Computation},
  year={1993},
  volume={61},
  pages={151-153}
}
Recent computations of irregular primes, and associated cyclotomic invariants, were extended to all primes below four million using an enhanced multisectioning/convolution method. Fermat's "Last Theorem" and Vandiver's conjecture were found to be true for those primes, and the cyclotomic invariants behaved as expected. There is exactly one prime less than four million whose index of irregularity is equal to seven. An irregular pair (p, t) consists of an odd prime p and an even integer t such… Expand
64 Citations

Tables from this paper

Irregular Primes and Cyclotomic Invariants to 12 Million
  • 63
  • PDF
Irregular primes to 163 million
  • 33
  • PDF
Computation of Irregular Primes up to Eight Million (preliminary Report)
  • 3
First-hit analysis of algorithms for computing quadratic irregularity
  • 1
  • PDF
Irregularity of Prime Numbers over Real Quadratic Fields
  • 6
  • PDF
On a Fermat-Type Diophantine Equation
  • 4
  • PDF
Distribution of values of real quadratic zeta functions
  • Joshua Holden
  • Mathematics, Computer Science
  • Unusual Applications of Number Theory
  • 2000
  • Highly Influenced
  • PDF
Irregular primes to two billion
  • 9
  • PDF
Wolstenholme and Vandiver primes
  • PDF
On the converse of Wolstenholme's Theorem
  • 39
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 10 REFERENCES
Irregular primes and cyclotomic invariants
  • 38
  • PDF
IRREGULAR PRIMES TO ONE MILLION
  • 25
  • PDF
New congruences for the Bernoulli numbers
  • 26
  • PDF
Sompolski, Irregular primes to one million
  • Math. Comp
  • 1992
The Art of Computer Programming, Vol. 2
  • 550
AN APPLICATION OF HIGH-SPEED COMPUTING TO FERMAT'S LAST THEOREM.
  • 22
  • PDF
E-mail address: jpb@reed.edu Scientific Computation Group, NeXT Computer, Inc., 900 Chesapeake Drive
  • E-mail address: jpb@reed.edu Scientific Computation Group, NeXT Computer, Inc., 900 Chesapeake Drive
Multidigit multiplication, the F FT, and Nussbaumer's algorithm, manuscript
  • Multidigit multiplication, the F FT, and Nussbaumer's algorithm, manuscript