Pomerance - PDFSEARCH.IO - Document Search Engine

Pomerance
Results: 106

#	Item
91	Errata and clarifications for Prime numbers: a computational perspective, 2nd edition Updated February 18, 2009 R. Crandall and C. Pomerance Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2009-02-18 09:38:34 Finite fields Modular arithmetic Lenstra elliptic curve factorization Lucas–Lehmer primality test Integer factorization algorithms Mathematics Number theory
92	Counting Fields Carl Pomerance, Dartmouth College joint work with Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2010-02-10 00:40:31 Analytic number theory Field theory Algebraic number theory Polynomials Conjectures Riemann hypothesis Exponentiation Finite field Prime-counting function Mathematics Abstract algebra Algebra
93	What we still don’t know about addition and multiplication Carl Pomerance, Dartmouth College Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2014-03-20 13:37:35 C Cross-platform software Multiplication Mathematics Computing Software engineering
94	Order and chaos Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2011-02-10 20:45:23 Divisor function Faro shuffle Shuffling Big O notation Mathematics Number theory Arithmetic function
95	Primality testing: variations on a theme of Lucas Carl Pomerance, Dartmouth College Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2008-07-31 12:44:25 Modular arithmetic Integer sequences Prime number Quadratic residue Fermat number Mathematics Number theory Primality tests
96	The multiplicative order mod n, on average Carl Pomerance, Dartmouth College Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2008-10-01 15:42:17 Shuffling Faro shuffle Factorial Riemann hypothesis Coprime Mathematics Number theory Arithmetic function
97	Euler’s ϕ function Carl Pomerance Dartmouth College Euler’s ϕ function: ϕ(n) is the number of integers m ∈ [1, n] with m coprime to n. Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2008-04-10 14:56:25 Number theory Integer sequences Finite fields RSA Coprime Prime number Primality test Euclidean algorithm XTR Mathematics Public-key cryptography Electronic commerce
98	The set of values of an arithmetic function Carl Pomerance, Dartmouth College based on joint work with K. Ford, F. Luca, and P. Pollack Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2013-10-22 09:26:56 Modular arithmetic Arithmetic functions Divisor function Carmichael number Prime number Normal distribution Average order of an arithmetic function Mathematics Integer sequences Number theory
99	Order and chaos Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2008-12-10 15:57:16 Algebraic number theory Number theory Prime numbers Algebraic number field Prime-counting function Arithmetic function Factorial Shuffling Faro shuffle Mathematics Analytic number theory Integer sequences
100	SMOOTH NUMBERS AND THE QUADRATIC SIEVE Carl Pomerance When faced with a large number n to factor, what do you do first? You might say “Look Add to Reading List Source URL: www.math.leidenuniv.nl Language: English - Date: 2004-11-24 09:42:47 Quadratic sieve General number field sieve Quadratic residue Special number field sieve Lenstra elliptic curve factorization Euclidean algorithm Prime number Sieve of Eratosthenes Smooth number Integer factorization algorithms Mathematics Number theory

UPDATE