<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2014-05-14 13:22:43Numbers Strong pseudoprime Lucas pseudoprime Primality test Prime number Baillie–PSW primality test Carmichael number Integer factorization Probable prime Pseudoprimes Mathematics Number theory |
Add to Reading List |
ARE THERE COUNTER-EXAMPLES TO THE BAILLIE – PSW PRIMALITY TEST? Carl Pomerance 1984 to Arjen K. Lenstra on the defense of his doctoral thesis | Pseudoprimes and Carmichael Numbers Emily Riemer MATH0420 May 3,DocID: 1mNn0 - View Document |
 | PDF DocumentDocID: Rg7b - View Document |
 | 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 followiDocID: Ra8O - View Document |
 | PDF DocumentDocID: QzU1 - View Document |
![[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](https://www.pdfsearch.io/img/463e9f8fa441130408b61035df0bb8a4.jpg "[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") | [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 FDocID: NVNI - View Document |