معرفی
Carl Pomerance is a Professor in the Department of Mathematics at Dartmouth College. His research spans various areas of number theory, including analytic number theory, cryptography, and computational methods. He is renowned for his work on prime numbers, pseudoprimes, and the distribution of arithmetic functions. Pomerance has authored or co-authored numerous influential books, including Prime Numbers: A Computational Perspective, and has edited volumes on cryptology and computational number theory.
His research interests include the study of arithmetic functions, such as Euler's totient function and Carmichael's function, as well as topics in algebraic number theory, combinatorics, and algorithms. Pomerance has delivered invited talks at major conferences and institutions worldwide, focusing on themes like additive number theory, multiplicative functions, and the interplay between number theory and cryptography.
Key contributions include advancements in primality testing algorithms (e.g., the quadratic sieve), the study of Carmichael numbers, and investigations into pseudoprimes and their distribution. He has also explored topics such as covering congruences, elliptic curves, and the properties of algebraic numbers.
