Don't bail out of the rho computation until 2^32 tries, since the

cycle size is based on the square root of the prime factors, bailing
after 2^16 would mean we would be unlikely to find any factors larger
than 32 bits.

1 files changed, 3 insertions, 3 deletions

diff --git a/doc/examples/factor.cpp b/doc/examples/factor.cpp
index 163d83fe0..bdd6319b7 100644
--- a/doc/examples/factor.cpp
+++ b/doc/examples/factor.cpp
@@ -28,15 +28,15 @@ BigInt rho(const BigInt& n)
       {
       i++;
 
+      if(i == 0) // overflow, bail out
+         break;
+
       x = mod_n.multiply((x + 1), x);
 
       d = gcd(y - x, n);
       if(d != 1 && d != n)
          return d;
 
-      if(i == 65536) // bail
-         break;
-
       if(i == k)
          {
          y = x;