Class TDiv_CF63_02
java.lang.Object
de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF63_02
- All Implemented Interfaces:
TDiv_CF63
public class TDiv_CF63_02 extends java.lang.Object implements TDiv_CF63
Auxiliary factor algorithm to find smooth decompositions of Q's.
Version 02:
Uses trial division first, complete factorization if Q is considered sufficiently smooth.
-
Constructor Summary
Constructors Constructor Description TDiv_CF63_02()
-
Method Summary
Modifier and Type Method Description java.lang.String
getName()
void
initialize(java.math.BigInteger N, double smoothBound)
Initialize for a new N.void
initialize(java.math.BigInteger kN, int primeBaseSize, int[] primesArray)
Initialize this factorizer for a new k; in particular set the prime base to be used for trial division.AQPair
test(java.math.BigInteger A, long Q)
Check if Q is smooth (factors completely over the prime base) or "sufficiently smooth" (factors almost over the prime base).Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
-
Constructor Details
-
TDiv_CF63_02
public TDiv_CF63_02()
-
-
Method Details
-
getName
public java.lang.String getName() -
initialize
public void initialize(java.math.BigInteger N, double smoothBound)Description copied from interface:TDiv_CF63
Initialize for a new N.- Specified by:
initialize
in interfaceTDiv_CF63
-
initialize
public void initialize(java.math.BigInteger kN, int primeBaseSize, int[] primesArray)Description copied from interface:TDiv_CF63
Initialize this factorizer for a new k; in particular set the prime base to be used for trial division.- Specified by:
initialize
in interfaceTDiv_CF63
primeBaseSize
- the true prime base size (the arrays are preallocated with a bigger length)primesArray
- prime base in ints
-
test
Description copied from interface:TDiv_CF63
Check if Q is smooth (factors completely over the prime base) or "sufficiently smooth" (factors almost over the prime base).
-