Carl Pomerance

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Carl Bernard Pomerance (born in 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 7 distinct prime factors.[1] He immediately 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, 2001, 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 honors[edit]

He has won many teaching and research awards, including the Chauvenet Prize in 1985, MAA's distinguished university teaching award in 1997, and the Levi L. Conant Prize in 2001.

In 2012 he became a fellow of the American Mathematical Society.[2] He also became the John G. Kemeny Family Professor of Mathematics in the same year. [3][4]

See also[edit]

Carmichael numbers


  1. ^ Carl Pomerance at the Mathematics Genealogy Project
  2. ^ List of Fellows of the American Mathematical Society, retrieved 2013-05-26.
  3. ^ [1], retrieved 2015-01-23.
  4. ^ [2], retrieved 2015-01-23

External links[edit]