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. 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). 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.
Awards and honorsEdit
He has won many teaching and research awards, including the Chauvenet Prize in 1985, MAA's Deborah and Franklin Haimo Distinguished Teaching Award in 1997, and the Levi L. Conant Prize in 2001.
- Carl Pomerance at the Mathematics Genealogy Project
- Crandall, R.; Pomerance, C. (2005). Prime numbers: a computational perspective (second ed.). Springer-Verlag, New York. doi:10.1007/0-387-28979-8. ISBN 978-0-387-25282-7.
- "List of Fellows of the American Mathematical Society". www.ams.org. 2017. Retrieved 2017-06-30.
- Blumberg, Joseph (2012-11-08). "Dartmouth Mathematicians Honored by Preeminent Professional Society | Dartmouth News". Dartmouth News. Retrieved 2017-06-30.
- Pomerance, Carl. "Curriculum Vitae" (PDF). Retrieved 30 June 2017.