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.
- Picard's Theorem
- Picard Variety
- Pick's Formula
- Pick's Theorem
- Picone's Theorem
- Piecewise Circular Curve
- Pie Cutting
- Pigeonhole Principle
- Pi Heptomino
- Pillai's Conjecture
- Pilot Vector
- Pinching Theorem
- Pinch Point
- Pine Cone Number
- Piriform
- Pisot-Vijayaraghavan Constants
- Pistol
- Pitchfork Bifurcation
- Pivoting
- Pivot Theorem
- Pizza Theorem
- Place (Digit)
- Place (Field)
- Place (Game)
- Planar Bubble Problem