2013 - Fellow of the American Mathematical Society
2004 - Fellow of the American Association for the Advancement of Science (AAAS)
Carl Pomerance spends much of his time researching Discrete mathematics, Combinatorics, Prime number, Prime factor and Function. His Discrete mathematics research incorporates themes from Algorithm and Carmichael number. His work deals with themes such as Upper and lower bounds, Distribution and Euler's formula, which intersect with Combinatorics.
His study on Miller–Rabin primality test, Primality test and Lucas primality test is often connected to Higher education as part of broader study in Prime number. The concepts of his Prime factor study are interwoven with issues in General number field sieve, Multiplicative function, Arithmetic function and Normal number. His work in Function addresses issues such as Natural number, which are connected to fields such as Binary logarithm.
Carl Pomerance mainly investigates Combinatorics, Discrete mathematics, Integer, Function and Prime. His Combinatorics research is multidisciplinary, relying on both Upper and lower bounds and Distribution. His work on Discrete mathematics is being expanded to include thematically relevant topics such as Order.
Carl Pomerance has researched Conjecture in several fields, including Riemann hypothesis, Congruence relation and Coprime integers. His study of Miller–Rabin primality test is a part of Primality test. His work carried out in the field of Miller–Rabin primality test brings together such families of science as Primality certificate and Solovay–Strassen primality test.
Carl Pomerance mostly deals with Combinatorics, Conjecture, Prime, Upper and lower bounds and Integer. His studies deal with areas such as Riemann hypothesis and Bounded function as well as Combinatorics. His research in Conjecture intersects with topics in Class, Mathematical economics and Distribution.
His studies in Integer integrate themes in fields like Number theory, Hypotenuse, Sequence and Gaussian integer. His research on Gaussian integer concerns the broader Discrete mathematics. His work in the fields of Coin problem, Graph and Miller–Rabin primality test overlaps with other areas such as Gaussian.
His main research concerns Combinatorics, Conjecture, Elliptic curve, Prime and Order. His work carried out in the field of Combinatorics brings together such families of science as Function and Distribution. His Conjecture research includes elements of Prime number, Upper and lower bounds, Connection and Bounded function.
His Elliptic curve research is multidisciplinary, relying on both Rational number and Degree. The various areas that Carl Pomerance examines in his Order study include Prime number theorem, Term and Riemann hypothesis. His Prime factor research is multidisciplinary, incorporating perspectives in Interval, Square-free integer, Applied mathematics and Euclidean geometry.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Prime Numbers: A Computational Perspective
Richard E. Crandall;Carl Pomerance.
(2012)
Prime Numbers: A Computational Perspective
Richard E. Crandall;Carl Pomerance.
(2012)
There are infinitely many Carmichael numbers
William Robert Alford;Andrew Granville;Carl Pomerance.
Annals of Mathematics (1994)
There are infinitely many Carmichael numbers
William Robert Alford;Andrew Granville;Carl Pomerance.
Annals of Mathematics (1994)
On a problem of Oppenheim concerning “factorisatio numerorum”
E.R Canfield;Paul Erdös;Carl Pomerance.
Journal of Number Theory (1983)
On a problem of Oppenheim concerning “factorisatio numerorum”
E.R Canfield;Paul Erdös;Carl Pomerance.
Journal of Number Theory (1983)
On distinguishing prime numbers from composite numbers
Leonard M. Adleman;Carl Pomerance;Robert S. Rumely.
Annals of Mathematics (1983)
On distinguishing prime numbers from composite numbers
Leonard M. Adleman;Carl Pomerance;Robert S. Rumely.
Annals of Mathematics (1983)
Advances in Cryptology — CRYPTO ’87
Carl Pomerance.
(1988)
Advances in Cryptology — CRYPTO ’87
Carl Pomerance.
(1988)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of New South Wales
Hungarian Academy of Sciences
Texas A&M University
University of Michigan–Ann Arbor
University of Toronto
University of Montreal
Leiden University
University of Newcastle Australia
University of California, Davis
University of Waterloo
University of Luxembourg
University of Konstanz
Oak Ridge National Laboratory
Pennsylvania State University
INRAE : Institut national de recherche pour l'agriculture, l'alimentation et l'environnement
University of Zaragoza
University of Las Palmas de Gran Canaria
University of Liverpool
University of North Carolina at Chapel Hill
Curtin University
Helmholtz Centre for Environmental Research
University of Houston
University of Copenhagen
University of Rome Tor Vergata
Simon Fraser University
University of Maryland, College Park