Prime numbers and computer methods for factorization
Prime numbers and computer methods for factorization
H. Riesel
1985 · DOI: 10.2307/2007903
528 Citations
TLDR
The Recognition of Primes.- Tests of Primality and of Compositeness.- Factorization Methods as Tests of ComposIteness.- Fermat's Theorem as ComposITeness Test.- FerMat's theorem as Primality Test.- Pseudoprimes and Probable Primes
