Pollard p-1 Factorization Method
A Prime Factorization Algorithm which can be implemented in a single-stepor double-step form. In the single-step version, Primes 
are found if 
is a product of small Primesby finding an 
such that
where
, with 
a large number and 
. Then since , 
, so 
. There istherefore a good chance that 
, in which case 
(where GCD is the Greatest CommonDivisor) will be a nontrivial divisor of 
.In the double-step version, a Primes can be factored if is a product of small Primes and a singlelarger Prime.
References
Bressoud, D. M. Factorization and Prime Testing. New York: Springer-Verlag, pp. 67-69, 1989. Pollard, J. M. ``Theorems on Factorization and Primality Testing.'' Proc. Cambridge Phil. Soc. 76, 521-528, 1974.
- Berry-Osseen Inequality
- Berry Paradox
- Bertelsen's Number
- Bertini's Theorem
- Bertrand Curves
- Bertrand's Paradox
- Bertrand's Postulate
- Bertrand's Problem
- Bertrand's Test
- Bertrand's Theorem
- Besov Space
- Bessel Differential Equation
- Bessel Function
- Bessel Function Fourier Expansion
- Bessel Function of the First Kind
- Bessel Function of the Second Kind
- Bessel Function of the Third Kind
- Bessel Polynomial
- Bessel's Correction
- Bessel's Finite Difference Formula
- Bessel's First Integral
- Bessel's Formula
- Bessel's Inequality
- Bessel's Interpolation Formula
- Bessel's Second Integral