Example Factorization
Let n = 8051 and f(x) = (x2 + 1 ) mod 8051.
| i | xi | yi | GCD(|xi − yi|, 8051) |
|---|---|---|---|
| 1 | 5 | 26 | 1 |
| 2 | 26 | 7474 | 1 |
| 3 | 677 | 871 | 97 |
97 is a non-trivial factor of 8051. Other values of c may give the cofactor (83) instead of 97.
Read more about this topic: Pollard's Rho Algorithm