Better wheel factorization

Author: WrathfulSpatula

FindAFactor/_find_a_factor.cpp

@@ -769,10 +769,10 @@ struct Factorizer {
 
   // Sieving function
   BigInteger sievePolynomials(const BigInteger& low, const BigInteger& high) {
-    const BigInteger maxLcv = toFactorSqrt + high;
-    for (BigInteger y = toFactorSqrt + 1U + low; isIncomplete && (y < maxLcv); ++y) {
+    const BigInteger maxLcv = backwardFn(toFactorSqrt + high);
+    for (BigInteger y = backwardFn(toFactorSqrt + 1U + low); isIncomplete && (y < maxLcv); ++y) {
       // Make the candidate NOT a multiple on the wheels.
-      const BigInteger z = forwardFn(backwardFn(y));
+      const BigInteger z = forwardFn(y);
       // This actually just goes ahead and FORCES
       // the number into a "close-by" smooth perfect square.
       const BigInteger candidate = makeSmooth(z * z);

pyproject.toml

@@ -8,7 +8,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "FindAFactor"
-version = "5.2.3"
+version = "5.2.4"
 requires-python = ">=3.8"
 description = "Find any nontrivial factor of a number"
 readme = {file = "README.txt", content-type = "text/markdown"}

setup.py

@@ -40,7 +40,7 @@ def build_extension(self, ext):
 
 setup(
     name='FindAFactor',
-    version='5.2.3',
+    version='5.2.4',
     author='Dan Strano',
     author_email='stranoj@gmail.com',
     description='Find any nontrivial factor of a number',