View Single Post
Old 2020-09-30, 20:05   #3
jshort
 
"James Short"
Mar 2019
Canada

17 Posts
Default

What your describing is something completely different altogether and it isn't the Pollard rho factoring algorithm;

This is the Pollard-rho factoring algorithm;

rho(n)=
{
local(x,y);

x=2; y=5;
while(gcd(y-x,n)==1,
x=(x^2+1)%n;
y=(y^2+1)%n; y=(y^2+1)%n
);
gcd(n,y-x)
}
jshort is offline   Reply With Quote