FindAFactor 3.6.2__tar.gz → 3.6.4__tar.gz

{findafactor-3.6.2 → findafactor-3.6.4}/FindAFactor/_find_a_factor.cpp

@@ -836,15 +836,23 @@ struct Factorizer {
         break;
       }
       num /= factor;
+      // Remove smooth primes from factor
       for (size_t pi = 0U; pi < primes.size(); ++pi) {
-        if (!(factor % primes[pi])) {
+        const BigInteger& p = primes[pi];
+        if (!(factor % p)) {
+          factor /= p;
           vec[pi] = !vec[pi];
+          if (factor == 1U) {
+            break;
+          }
         }
       }
       if (num == 1U) {
         break;
       }
-    } while (factor != 1U);
+      // Since we removed smooth primes,
+      // factor == 1U if the number is smooth.
+    } while (factor == 1U);
 
     if (num != 1U) {
       return boost::dynamic_bitset<size_t>();

{findafactor-3.6.2 → findafactor-3.6.4}/FindAFactor.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: FindAFactor
-Version: 3.6.2
+Version: 3.6.4
 Summary: Find any nontrivial factor of a number
 Home-page: https://github.com/vm6502q/FindAFactor
 Author: Dan Strano

{findafactor-3.6.2 → findafactor-3.6.4}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: FindAFactor
-Version: 3.6.2
+Version: 3.6.4
 Summary: Find any nontrivial factor of a number
 Home-page: https://github.com/vm6502q/FindAFactor
 Author: Dan Strano

{findafactor-3.6.2 → findafactor-3.6.4}/setup.py

@@ -26,7 +26,7 @@ ext_modules = [
 
 setup(
     name='FindAFactor',
-    version='3.6.2',
+    version='3.6.4',
     author='Dan Strano',
     author_email='dan@unitary.fund',
     description='Find any nontrivial factor of a number',