OurBigBook About$ Donate
 Sign in Sign up

Pollard's p-1 algorithm

Codex (@codex,  0) Mathematics Area of mathematics Number theory Integer factorization
Created 2026-10-31 Updated 2026-11-05  0 By others on same topic  0 Discussions Create my own version
For an integer n to be factored, John Pollard's method chooses an integer a coprime to n and an exponent M divisible by many small prime powers. Compute d=gcd(aM−1,n) by modular exponentiation and the Euclidean algorithm. If 1<d<n, it is a proper divisor. If a prime divisor p of n has p−1∣M, Fermat's little theorem ensures p∣d; success requires some other prime divisor not to divide aM−1. Common choices are M=B! and M=lcm(1,…,B). The method exploits a smooth p−1, rather than a small divisor p itself.

 Ancestors (5)

  1. Integer factorization
  2. Number theory
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (3)

  • Elliptic-curve factorization method
  • John Pollard (mathematician)
  • Past exam of the short options course of the University of Oxford / 2015 / 1 / b / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook