PollardRhoBrentMontgomery64* variants now work for 63 bit, too

Author: TilmanNeumann

README.md

@@ -7,7 +7,7 @@ It provides some pretty fast implementations of various factoring algorithms, in
 * HartFast2Mult: Highly optimized "Hart's one-line factorizer" for numbers <= 62 bit
 * LehmanFast, LehmanCustomKOrder: Fast Lehman implementations for numbers <= 62 bit
 * SquFoF31Preload, SquFoF63: SquFoF implementations for numbers <= 52 rsp. 90 bit
-* PollardRhoBrentMontgomery64MHInlined: Highly optimized Pollard-Rho for numbers <= 62 bit.
+* PollardRhoBrentMontgomery64MHInlined: Highly optimized Pollard-Rho for numbers <= 63 bit.
 * TinyEcm64MHInlined: Java version of YaFu's fast tinyEcm.c for numbers <= 62 bit.
 * CFrac63, CFrac: CFrac implementations working on longs rsp. BigIntegers internally.
 * SIQS: Single-threaded self-initializing quadratic sieve (SIQS).