New Congruences for the Bernoulli Numbers
- 1 January 1987
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 48 (177) , 341-350
- https://doi.org/10.2307/2007895
Abstract
We prove a new congruence for computing Bernoulli numbers modulo a prime. Since it is similar to Vandiver’s congruences but has fewer terms, it may be used to test primes for regularity efficiently. We have programmed this test on a CYBER 205 computer. Fermat’s "Last Theorem" has been proved for all exponents up to 150000.Keywords
This publication has 3 references indexed in Scilit:
- The Irregular Primes to 125000Mathematics of Computation, 1978
- On Bernoulli’s numbers and Fermat’s last theoremDuke Mathematical Journal, 1937
- Lacunary Recurrence Formulas for The Numbers of Bernoulli and EulerAnnals of Mathematics, 1935