Reference Database
(references for the Prime Pages)
The Prime Pages

Search Site

How Many?


Prime Curios!
e-mail list

Prime Lists

Submit primes
This is the Prime Pages' interface to our BibTeX database.  Rather than being an exhaustive database, it just lists the references we cite on these pages.  Please let me know of any errors you notice.
References: [ Home | Author index | Key index | Search ]

All items with author Pomerance (sorted by date)

C. Pomerance, J. L. Selfridge and Wagstaff, Jr., S. S., "The pseudoprimes to 25 · 109," Math. Comp., 35:151 (1980) 1003-1026.  MR 82g:10030 [See Richard Pinch's lists of pseudoprimes and [Jaeschke93].]
C. Pomerance, "Recent developments in primality testing," Math. Intelligencer, 3:3 (1980/81) 97--105.  MR 83h:10015
C. Pomerance, "The search for prime numbers," Scientific American, 247:6 (December 1982) 136-147,178.
L. M. Adleman, C. Pomerance and R. S. Rumely, "On distinguishing prime numbers from composite numbers," Ann. Math., 117:1 (1983) 173--206.  MR 84e:10008 [The first of the modern primality tests.]
C. Pomerance, Lecture notes on primality testing and factoring (notes by G. M. Gagola Jr.), Notes Vol, 4, Mathematical Association of America, 1984.  pp. 34 pages,
C. Pomerance, Lecture notes in primality testing and factoring--a short course at Kent State University, MAA Notes Vol, 4, MAA, 1984. [ISBN 0-88358-054-0]
P. Erdös and C. Pomerance, "On the number of false witnesses for a composite number," Math. Comp., 46 (1986) 259--279.  MR 87i:11183
C. Pomerance, "On primitive divisors of Mersenne numbers," Acta Arith., 46:4 (1986) 355--367.  MR871278
P. Beauchemin, G. Brassard, C. Crépeau, C. Goutier and C. Pomerance, "The generation of random numbers that are probably prime," J. Cryptology, 1 (1988) 53--64.  MR 89g:11126
S. H. Kim and C. Pomerance, "The probability that a random probable prime is composite," Math. Comp., 53 (1989) 721-741.  MR 90e:11190 [First good bounds on the probability that probable primes are composite. We reproduce part of their Table 1 in our notes.]
C. Pomerance editor, Cryptology and computational number theory--an introduction, Proc. Symp. Appl. Math. Vol, 42, Amer. Math. Soc., Providence, RI, 1990.  pp. 1--12, MR 92e:94023
P. Erdös, P. Kiss and C. Pomerance, "On prime divisors of Mersenne numbers," Acta. Arith., 57 (1991) 267--281.  MR 92d:11104
D. M. Gordon and C. Pomerance, "The distribution of lucas and elliptic pseudoprimes," Math. Comp., 51:196 (1991) 825--838.  Corrigendum: 60:202 (1993) 877.  MR 92h:11081
I. Damgård, P. Landrock and C. Pomerance, "Average case error estimates for the strong probable prime test," Math. Comp., 61:203 (1993) 177--194.  MR 94b:11124
W. R. Alford, A. Granville and C. Pomerance, "There are infinitely many Carmichael numbers," Ann. of Math. (2), 139 (1994) 703--722.  MR 95k:11114
W. R. Alford, A. Granville and C. Pomerance, On the difficulty of finding reliable witnesses.  In "Algorithmic Number Theory, First International Symposium, ANTS-I," L. M. Adleman and M. D. Huang editors, Lecture Notes in Computer Science Vol, 877, Springer-Verlag, Berlin, 1994.  pp. 1--16, MR 96d:11136
Z. Franco and C. Pomerance, "On a conjecture of Crandall concerning the qx+1 problem," Math. Comp., 64 (1995) 1333--1336.  MR 95j:11019
S. Konyagin and C. Pomerance, On primes recognizable in deterministic polynomial time.  In "The Mathematics of Paul Erd{\"o}s," Algorithms Combin. Vol, 13, Springer-Verlag, Berlin, 1996.  pp. 176--198, MR 98a:11184
R. Crandall, K. Dilcher and C. Pomerance, "A search for Wieferich and Wilson primes," Math. Comp., 66:217 (1997) 433--449.  MR 97c:11004 (Abstract available)
R. Crandall and C. Pomerance, Prime numbers: a computational perspective, Springer-Verlag, New York, NY, 2001.  pp. xvi+545, ISBN 0-387-94777-9. MR 2002a:11007 (Abstract available) (Annotation available)
A. Granville and C. Pomerance, "Two contradictory conjectures concerning Carmichael numbers," Math. Comp., 71 (2002) 883--908.  MR 1 885 636 (Abstract available)
R. Crandall and C. Pomerance, Prime numbers--a computational approach, Second edition, Springer, New York, 2005.  pp. xvi+597, ISBN 978-0-387-25282-7; 0-387-25282-7. MR2156291
Prime Pages' Home
Another prime page by Chris K. Caldwell <>