Two versions of Pollard's rho factorization algorithm

one version with Brent's style cycle detection, one without but using vectors and matrices

The algorithm finds only one factor. More factors can be found by dividing by the found one and recursively applying the function again. Works with symbolic and double.

Example:

x = sym("2");

y = nextprime(x^20);

z = nextprime(y+10000);

PollardsRho(y*z)

ans =

1058591

OR:

PollardsRho(1517)

ans =

37