A search for Wieferich and Wilson primes

Mathematics of Computation

Volumn 66, Issue 217, 1997, Pages 433-449

  Crandall, Richard ^a   Dilcher, Karl ^b   Pomerance, Carl ^c  

^a REED COLLEGE   (United States)

^b DALHOUSIE UNIVERSITY   (Canada)

^c UNIVERSITY OF GEORGIA   (United States)

Author keywords

Factorial evaluation; Fermat quotients; Wieferich primes; Wilson primes; Wilson quotients

Indexed keywords

EID: 0042632392     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/s0025-5718-97-00791-6     Document Type: Article

References (28)

1. T. Agoh, K. Dilcher and L. Skula, Fermat and Wilson quotients for composite moduli, Preprint (1995).
2. 2), The Messenger of Mathematics 43 (1913-1914), 72-84.
3. B. Berndt, R. Evans and K. Williams, Gauss and Jacobi sums, Wiley-Interscience, to appear.
4. J. M. Borwein and P. B. Borwein, Pi and the AGM. John Wiley & Sons, Inc., 1987. MR 89a:11134
5. 2 determination of ((p-1)/2 (p-1)/4), J. Number Theory 24 (1986), 188-196. MR 88a:11130
6. D. Clark, Private communication.
7. M. Coster, Generalisation of a congruence of Gauss, J. Number Theory 29 (1988), 300-310. MR 89i:11005
8. R. Crandall and B. Fagin, Discrete weighted transforms and large-integer arithmetic. Math. Comp. 62 (1994), 305-324. MR 94c:11123
9. R. Crandall, Projects in Scientific Computation. TELOS/Springer-Verlag, Santa Clara, CA, 1994. MR 95d:65001
10. _, Topics in Advanced Scientific Computation. TELOS/Springer-Verlag, Santa Clara, CA, 1995.
11. R. Evans, Congruences for binomial coefficients, Unpublished manuscript (1985).
12. Z. Franco and C. Pomerance, On a conjecture of Crandall concerning the qx + 1 problem, Math. Comp. 64 (1995), 1333-1336. MR 95j:11019
13. R. H. Gonter and E. G. Kundert, All prime numbers up to 18,876.041 have been tested without finding a new Wilson prime. Preprint (1994).
14. A. Granville, Binomial coefficients modulo prime powers, Preprint.
15. D. E. Knuth, The art of computer programming, Vol.2, Addison-Wesley. Reading, Massachusetts, 2nd ed. 1973. MR 44:3531
16. D. H. Lehmer, On Fermat's quotient, base two. Math. Comp. 36 (1981), 289-290. MR 82e:10004
17. E. Lehmer, On congruences involving Bernoulli numbers and the quotients of Fermat and Wilson. Ann. of Math. 39 (1938), 350-360.
18. R. McIntosh, Private communication.
19. 2). Math. Comp. 61 (1991), 361-363. MR 94d:11003
20. J. Pollard, Theorems on factorization and primality testing, Proc. Cambridge Phil. Soc. 76 (1974). 521-528. MR 50:6992
21. P. Ribenboim, 13 lectures on Fermat's last theorem, Springer-Verlag, New York, 1979. MR 81f:10023
22. _, The book of prime number records. Springer-Verlag, New York, 1988. MR 89e:11052
23. V. Strassen, Einige Resultate, über Berechnungskomplexität. Jahresber, Deutsch. Math.-Verein. 78 (1976/77), 1-8. MR 55:11713
24. Zhi-Hong Sun and Zhi-Wei Sun, Fibonacci numbers and Fermat's last theorem, Acta Arith. 60 (1992), 371-388. MR 93e:11025
25. D. D. Wall, Fibonacci series modulo m. Amer. Math. Monthly 67 (1960), 525-532. MR 22:10945
26. A. Wieferich, Zum letzten Fermat'sehen Theorem. J. Reine Angew. Math. 136 (1909), 293-302.
27. H. C. Williams, The influence of computers in the development of number theory. Comput. Math. Appl. 8 (1982), 75-93. MR 83c:10002
28. K. M. Yeving, On congruences for binomial coefficients, J. Number Theory 33 (1989), 1-17. MR 90i:11143