TDiv_CF63 (org.matheclipse:matheclipse-gpl 3.0.0 API)

All Known Implementing Classes:

TDiv_CF63_01, TDiv_CF63_02
```
public interface TDiv_CF63
```
Interface for auxiliary factor algorithms to find smooth decompositions of Q's.

Author:

Tilman Neumann

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method	Description
`String`	`getName()`
`void`	`initialize(BigInteger N, double maxQRest)`	Initialize for a new N.
`void`	`initialize(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(BigInteger A, long Q)`	Check if Q is smooth (factors completely over the prime base) or "sufficiently smooth" (factors almost over the prime base).

- Method Detail
  - getName
```
String getName()
```
    Returns:
    
    the name of this algorithm
  - initialize
```
void initialize(BigInteger N,
                double maxQRest)
```
    Initialize for a new N.
    
    Parameters:
    
    N -
    
    maxQRest -
  - initialize
```
void initialize(BigInteger kN,
                int primeBaseSize,
                int[] primesArray)
         throws FactorException
```
    Initialize this factorizer for a new k; in particular set the prime base to be used for trial division.
    
    Parameters:
    
    kN -
    
    primeBaseSize - the true prime base size (the arrays are preallocated with a bigger length)
    
    primesArray - prime base in ints
    
    Throws:
    
    FactorException
  - test
```
AQPair test(BigInteger A,
            long Q)
```
    Check if Q is smooth (factors completely over the prime base) or "sufficiently smooth" (factors almost over the prime base).
    
    Parameters:
    
    A -
    
    Q -
    
    Returns:
    
    an AQ-pair if Q is at least "sufficiently smooth", null else