Carl Bernard Pomerance (born 1944 in Joplin, Missouri) is an American number theorist. He attended college at Brown University and later received his Ph.D. from Harvard University in 1972 with a dissertation proving that any odd perfect number has at least seven distinct prime factors.^[1] He joined the faculty at the University of Georgia, becoming full professor in 1982. He subsequently worked at Lucent Technologies for a number of years, and then became a distinguished Professor at Dartmouth College.

He has over 120 publications, including co-authorship with Richard Crandall of Prime numbers: a computational perspective (Springer-Verlag, first edition 2001, second edition 2005^[2]), and with Paul Erdős.^[3] He is the inventor of one of the integer factorization methods, the quadratic sieve algorithm, which was used in 1994 for the factorization of RSA-129. He is also one of the discoverers of the Adleman–Pomerance–Rumely primality test.

He has won many teaching and research awards, including the Chauvenet Prize in 1985,^[4] the Deborah and Franklin Haimo Award for Distinguished College or University Teaching of Mathematics in 1997,^[5] and the Levi L. Conant Prize in 2001 for "A Tale of Two Sieves".^[6]

In 2012 he became a fellow of the American Mathematical Society.^[7] He also became the John G. Kemeny Parents Professor of Mathematics in the same year.^[8][9]

• Carmichael numbers
• Ruth–Aaron pair

Wikiquote has quotations related to Carl Pomerance.

• Home page
• 2001 Conant Prize, an article in the Bulletin of the AMS, vol 48:4 (2001), 418–419.

This article about an American mathematician is a stub. You can help Wikipedia by expanding it.

• v
• t
• e