FindAFactor 3.6.3__tar.gz → 3.6.4__tar.gz

Sign up to get free protection for your applications and to get access to all the features.
@@ -836,6 +836,7 @@ struct Factorizer {
836
836
  break;
837
837
  }
838
838
  num /= factor;
839
+ // Remove smooth primes from factor
839
840
  for (size_t pi = 0U; pi < primes.size(); ++pi) {
840
841
  const BigInteger& p = primes[pi];
841
842
  if (!(factor % p)) {
@@ -849,7 +850,9 @@ struct Factorizer {
849
850
  if (num == 1U) {
850
851
  break;
851
852
  }
852
- } while (factor != 1U);
853
+ // Since we removed smooth primes,
854
+ // factor == 1U if the number is smooth.
855
+ } while (factor == 1U);
853
856
 
854
857
  if (num != 1U) {
855
858
  return boost::dynamic_bitset<size_t>();
@@ -1,6 +1,6 @@
1
1
  Metadata-Version: 2.1
2
2
  Name: FindAFactor
3
- Version: 3.6.3
3
+ Version: 3.6.4
4
4
  Summary: Find any nontrivial factor of a number
5
5
  Home-page: https://github.com/vm6502q/FindAFactor
6
6
  Author: Dan Strano
@@ -1,6 +1,6 @@
1
1
  Metadata-Version: 2.1
2
2
  Name: FindAFactor
3
- Version: 3.6.3
3
+ Version: 3.6.4
4
4
  Summary: Find any nontrivial factor of a number
5
5
  Home-page: https://github.com/vm6502q/FindAFactor
6
6
  Author: Dan Strano
@@ -26,7 +26,7 @@ ext_modules = [
26
26
 
27
27
  setup(
28
28
  name='FindAFactor',
29
- version='3.6.3',
29
+ version='3.6.4',
30
30
  author='Dan Strano',
31
31
  author_email='dan@unitary.fund',
32
32
  description='Find any nontrivial factor of a number',
File without changes
File without changes
File without changes