References
Eric Bach (1985)Analytic Methods in the Analysis and Design of Number-Theoretic Algorithms, ACM Distinguished Dissertations, Cambridge: MIT Press.
H. Cohen and H. W. Lenstra, Jr. (1984) Primality testing and Jacobi sums,Mathematics of Computation, 42, pp. 297–330.
Martin Davis (1973) Hilbert’s Tenth Problem is unsolvable,American Mathematical Monthly, 80, pp. 233–269.
John Dixon (1984) Factorization and primality tests,American Mathematical Monthly, 91, pp. 333–352.
A. K. Head (1980) Multiplication modulon, BIT, 20, pp. 115–116.
James P. Jones (1982) Universal Diophantine equation,Journal of Symbolic Logic, 47, pp. 549–571.
D. H. Lehmer, Emma Lehmer and Daniel Shanks (1970) Integer sequences having prescribed quadratic character,Mathematics of Computation, 24, pp. 433–451.
H. W. Lenstra (1979) Miller’s primality test,Information Processing Letters, 8, pp. 86–88.
Gary Miller (1976) Riemann’s Hypothesis and tests for primality,Journal of Computer and System Sciences, 13, pp. 300–317.
Jean Louis Nicolas (1984) Tests de primalité,Expositiones Mathematicae, 2, pp. 223–234.
Carl Pomerance (1981) Recent developments in primality testing,The Mathematical Intelligencer, 3, pp. 97–105.
Carl Pomerance (1981) The distribution of pseudoprimes,Mathematics of Computation, 37, pp. 587–593.
Carl Pomerance, J. L. Selfridge and Samuel S. Wagstaff, Jr. (1980) The pseudoprimes to 25 · 109,Mathematics of Computation, 35, pp. 1003–1026.
Rights and permissions
About this article
Cite this article
Wagon, S. The evidence. The Mathematical Intelligencer 8, 58–62 (1986). https://doi.org/10.1007/BF03025793
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03025793