On strong pseudoprimes to several bases
HTML articles powered by AMS MathViewer
- by Gerhard Jaeschke PDF
- Math. Comp. 61 (1993), 915-926 Request permission
Abstract:
With ${\psi _k}$ denoting the smallest strong pseudoprime to all of the first k primes taken as bases we determine the exact values for ${\psi _5},{\psi _6},{\psi _7},{\psi _8}$ and give upper bounds for ${\psi _9},{\psi _{10}},{\psi _{11}}$. We discuss the methods and underlying facts for obtaining these results.References
- J. Brillhart, J. Tonascia, and P. Weinberger, On the Fermat quotient, Computers in number theory (Proc. Sci. Res. Council Atlas Sympos. No. 2, Oxford, 1969) Academic Press, London, 1971, pp. 213–222. MR 0314736
- Richard D. Jenks and Robert S. Sutor, AXIOM, Numerical Algorithms Group, Ltd., Oxford; Springer-Verlag, New York, 1992. The scientific computation system; With a foreword by David V. Chudnovsky and Gregory V. Chudnovsky. MR 1179424
- Carl Pomerance, J. L. Selfridge, and Samuel S. Wagstaff Jr., The pseudoprimes to $25\cdot 10^{9}$, Math. Comp. 35 (1980), no. 151, 1003–1026. MR 572872, DOI 10.1090/S0025-5718-1980-0572872-7
Additional Information
- © Copyright 1993 American Mathematical Society
- Journal: Math. Comp. 61 (1993), 915-926
- MSC: Primary 11A41; Secondary 11Y11
- DOI: https://doi.org/10.1090/S0025-5718-1993-1192971-8
- MathSciNet review: 1192971