Class PowerOfSmallPrimesFinder
java.lang.Object
de.tilman_neumann.jml.factor.siqs.powers.SomePowerFinder
de.tilman_neumann.jml.factor.siqs.powers.PowerOfSmallPrimesFinder
- All Implemented Interfaces:
PowerFinder
public class PowerOfSmallPrimesFinder extends SomePowerFinder
Algorithm to find the first powers of all p
-
Constructor Summary
Constructors Constructor Description PowerOfSmallPrimesFinder()
-
Method Summary
Modifier and Type Method Description java.util.TreeSet<PowerEntry>
findPowers(java.math.BigInteger kN, int[] primes, int[] tArray, int primeBaseSize, SieveParams sieveParams)
Find the first powers > pMin.java.lang.String
getName()
Methods inherited from class de.tilman_neumann.jml.factor.siqs.powers.SomePowerFinder
addPowers
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
-
Constructor Details
-
PowerOfSmallPrimesFinder
public PowerOfSmallPrimesFinder()
-
-
Method Details
-
getName
public java.lang.String getName()- Returns:
- algorithm name
-
findPowers
public java.util.TreeSet<PowerEntry> findPowers(java.math.BigInteger kN, int[] primes, int[] tArray, int primeBaseSize, SieveParams sieveParams)Find the first powers > pMin.- Parameters:
kN
-primes
-tArray
-primeBaseSize
-sieveParams
-- Returns:
- powers sorted bottom-up by p
-