Pseudoprimes - PDFSEARCH.IO - Document Search Engine

Pseudoprimes
Results: 18

#	Item
1	Pseudoprimes and Carmichael Numbers Emily Riemer MATH0420 May 3, Add to Reading List Source URL: davidlowryduda.com Language: English Pseudoprimes Mathematics Number theory Integer sequences Discrete mathematics Fermat pseudoprime Carmichael number MillerRabin primality test Prime number Primality test Mersenne prime Unique prime
2	PDF Document Add to Reading List Source URL: www.kurims.kyoto-u.ac.jp Language: English - Date: 2002-11-25 14:55:27 Modular arithmetic Carmichael number Pseudoprimes Prime number Primality test Coprime Mathematics Integer sequences Number theory
3	This is a Chapter from the Handbook of Applied Cryptography, by A. Menezes, P. van Oorschot, and S. Vanstone, CRC Press, 1996. For further information, see www.cacr.math.uwaterloo.ca/hac CRC Press has granted the followi Add to Reading List Source URL: cacr.uwaterloo.ca Language: English - Date: 2011-07-10 02:35:13 Pseudoprimes Modular arithmetic Abstract algebra Miller–Rabin primality test Solovay–Strassen primality test Probable prime Fermat primality test Prime number Strong pseudoprime Mathematics Number theory Primality tests
4	PDF Document Add to Reading List Source URL: www.kurims.kyoto-u.ac.jp Language: English - Date: 2007-08-14 10:56:58 Integer sequences Lucas pseudoprime Modular arithmetic Recurrence relations Derrick Henry Lehmer Prime number Lucas sequence Lehmer Primality test Mathematics Number theory Pseudoprimes
5	[removed]Eric Kimball* ([removed]). Frobenius Pseudoprimes and a Cubic Primality Test. Preliminary report. An integer, n, is called a Frobenius probable prime with respect to a polynomial when it passes the F Add to Reading List Source URL: www.ams.org - Date: 2013-03-01 00:34:04
6	Carmichael numbers and pseudoprimes Notes by G.J.O. Jameson Introduction Recall that Fermat’s “little theorem” says that if p is prime and a is not a multiple of p, then ap−1 ≡ 1 mod p. Add to Reading List Source URL: www.maths.lancs.ac.uk Language: English - Date: 2010-06-11 07:53:10 Integer sequences Modular arithmetic Fermat number Carmichael number Prime number Coprime Lucas pseudoprime Strong pseudoprime Mathematics Number theory Pseudoprimes
7	ARE THERE COUNTER-EXAMPLES TO THE BAILLIE – PSW PRIMALITY TEST? Carl Pomerance 1984 to Arjen K. Lenstra on the defense of his doctoral thesis Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2014-05-14 13:22:43 Numbers Strong pseudoprime Lucas pseudoprime Primality test Prime number Baillie–PSW primality test Carmichael number Integer factorization Probable prime Pseudoprimes Mathematics Number theory
8	Preliminary thoughts Primality tests Add to Reading List Source URL: www.chalcedon.demon.co.uk Language: English - Date: 2012-09-10 12:34:27 Number theory Fermat pseudoprime Primality test Probable prime Prime number Strong pseudoprime Lucas pseudoprime Pseudoprimes Mathematics Numbers
9	AN EFFICIENT PROBABLE PRIME TEST n FOR NUMBERS OF THE FORM 2 3+1 Add to Reading List Source URL: primenumbers.net Language: English - Date: 2008-10-04 10:11:20 Integer sequences Primality tests Pseudoprimes Modular arithmetic Lucas–Lehmer primality test Mersenne prime Prime number Fermat number Probable prime Mathematics Number theory Numbers
10	201 Add to Reading List Source URL: www.renyi.hu Language: English - Date: 2006-11-05 15:15:44 Pseudoprimes Modular arithmetic Carmichael number Factorial Exponentiation Prime number Chebyshev function Factorization of polynomials over a finite field and irreducibility tests Mathematics Number theory Integer sequences