Carl Pomerance

Carl Pomerance is an American mathematician known for his significant contributions to number theory and cryptography. His work on primality testing algorithms, particularly the quadratic sieve method, has been influential in both theoretical mathematics and applied cryptography. As a professor at the University of Georgia (1982-1999) and later at Dartmouth College, Pomerance developed several important algorithms including the Quadratic Sieve and, with Hendrik Lenstra and Leonard Adleman, the widely-used LLL algorithm. The Quadratic Sieve remained the fastest known factoring algorithm until the development of the General Number Field Sieve. Pomerance received multiple awards for his research and teaching, including a Guggenheim Fellowship and the Chauvenet Prize from the Mathematical Association of America. His book "Prime Numbers: A Computational Perspective," co-authored with Richard Crandall, has become a standard reference in computational number theory. Beyond his technical contributions, Pomerance's work on recreational mathematics and mathematical games has helped make number theory accessible to broader audiences. His research on Erdős numbers and perfect numbers demonstrates the intersection between serious mathematical research and engaging mathematical puzzles.

Students and researchers comment frequently on Pomerance's textbook "Prime Numbers: A Computational Perspective," praising its clear explanations of complex algorithms and comprehensive coverage of computational number theory. What readers liked: - Clear presentation of advanced mathematical concepts - Practical implementation details for algorithms - Balance between theory and computation - Extensive bibliography and historical notes What readers disliked: - Dense mathematical notation that can be challenging for beginners - Some sections require significant background knowledge - High price point for the textbook Ratings: - Goodreads: 4.5/5 (12 ratings) - Amazon: 4.7/5 (8 reviews) One graduate student noted: "The sections on primality testing are exceptional - they break down complex algorithms into digestible steps." A researcher commented: "The historical context helps connect theoretical concepts to practical applications." Readers particularly value the exercises and computational examples that accompany theoretical discussions.

The Theory of Numbers: A Text and Source Book of Problems (1975) A textbook covering elementary number theory through quadratic reciprocity, with extensive problem sets derived from historical sources.

Number Theory in Spirit of Ramanujan (1988) A mathematical text exploring number theory topics connected to Ramanujan's work, including partitions, q-series, and arithmetic functions.

Cryptology and Computational Number Theory (1990) A collection of papers focusing on the intersection of number theory with cryptography and computational methods.

Prime Numbers: A Computational Perspective (2001) A comprehensive examination of computational methods for working with prime numbers, including primality testing and factorization algorithms.

Mathematics and Mathematicians (2002) A collection of biographical essays about mathematicians and their contributions to number theory and related fields.

The First 50 Years of Cryptography (2004) A historical overview of modern cryptography's development from the 1950s through the early 21st century.

Topics in the Theory of Numbers (2009) An advanced undergraduate text covering classical number theory topics and their connections to modern research areas.

Paul Erdős wrote hundreds of papers in number theory and combinatorics, with many focusing on prime numbers and probabilistic methods. He collaborated extensively with other mathematicians and developed foundational concepts that influenced Pomerance's work.

Harold Davenport specialized in number theory and wrote seminal papers on distribution of prime numbers and Diophantine equations. His work on multiplicative number theory connects directly to areas Pomerance studied.

Donald Knuth writes about algorithms and computational mathematics, including extensive coverage of number theoretic algorithms. His publications examine the computational aspects of prime numbers and factorization that complement Pomerance's research interests.

Peter Sarnak focuses on analytic number theory and connections between prime numbers and other mathematical structures. His research on prime number gaps and arithmetic functions builds on some of the same foundations as Pomerance's work.

Richard Guy wrote extensively about unsolved problems in number theory and computational mathematics. His work catalogs open questions about prime numbers and integer sequences that relate to Pomerance's areas of research.