Mathematician:Carl Bernard Pomerance
(Redirected from Mathematician:Carl Pomerance)
American mathematician specialising in number theory.
- Born: 1944
Theorems and Definitions
- Proved the Sheldon Conjecture (with Chris Spicer)
- Quadratic Sieve Algorithm
- Adleman-Pomerance-Rumely Primality Test (with Leonard Max Adleman and Robert Scott Rumely)
Definitions of concepts named for Carl Bernard Pomerance can be found here.
- December 1975: On an Interesting Property of 11234955056179752809 (The Fibonacci Quarterly Vol. 13, no. 4: 331 – 334) (with J.L. Hunsucker)
- July 1980: The Pseudoprimes to $25 \cdot 10^9$ (Math. Comp. Vol. 35, no. 151: 1003 – 1026) (with J.L. Selfridge and Samuel S. Wagstaff, Jr.) www.jstor.org/stable/2006210
- Dec. 1982: The Search for Prime Numbers (Scientific American Vol. 247, no. 6
- On Distinguishing Prime Numbers from Composite Numbers (Ann. Math. Ser. 2 Vol. 117, no. 1: 173 – 206) (with Leonard M. Adleman and Robert S. Rumely) www.jstor.org/stable/2006975
- July 1993: An Upper Bound in Goldbach's Problem (Math. Comp. Vol. 61, no. 203: 209 – 213) (with Jean-Marc Deshouillers, Andrew Granville and Wladyslaw Narkiewicz) www.jstor.org/stable/2152947
- 1994: There are infinitely many Carmichael numbers (Ann. Math. Vol. 139, no. 3: 703 – 722) (with W.R. Alford and Andrew Granville) www.jstor.org/stable/2118576
- 2001: Prime numbers: a computational perspective (with Richard Crandall)