Class SmoothCandidate
java.lang.Object
de.tilman_neumann.jml.factor.siqs.sieve.SmoothCandidate
public class SmoothCandidate
extends java.lang.Object
A sieve hit that is a candidate to yield a smooth relation.
-
Field Summary
Fields Modifier and Type Field Description java.math.BigInteger
A
A(x) = d*a*x + bdouble
logPSum
the logP sum from trial dividing unsieved base elementsjava.math.BigInteger
QRest
The rest of Q(x)/(da) that still needs to get factorized, where a is the a-parameter of the polynomial and d==2 for kN==1 (mod 8), 2 elseSortedIntegerArray
smallFactors
Small factors found by trial dividing small primesint
x
The sieve location -
Constructor Summary
Constructors Constructor Description SmoothCandidate(int x)
SmoothCandidate(int x, java.math.BigInteger QRest, java.math.BigInteger A)
SmoothCandidate(int x, java.math.BigInteger QRest, java.math.BigInteger A, SortedIntegerArray smallFactors)
-
Method Summary
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
-
Field Details
-
x
public int xThe sieve location -
logPSum
public double logPSumthe logP sum from trial dividing unsieved base elements -
QRest
public java.math.BigInteger QRestThe rest of Q(x)/(da) that still needs to get factorized, where a is the a-parameter of the polynomial and d==2 for kN==1 (mod 8), 2 else -
A
public java.math.BigInteger AA(x) = d*a*x + b -
smallFactors
Small factors found by trial dividing small primes
-
-
Constructor Details
-
SmoothCandidate
public SmoothCandidate(int x) -
SmoothCandidate
public SmoothCandidate(int x, java.math.BigInteger QRest, java.math.BigInteger A) -
SmoothCandidate
public SmoothCandidate(int x, java.math.BigInteger QRest, java.math.BigInteger A, SortedIntegerArray smallFactors)
-