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

java.lang.Object
- de.tilman_neumann.jml.factor.cfrac.tdiv.TDiv_CF02

All Implemented Interfaces:

TDiv_CF
```
public class TDiv_CF02
extends Object
implements TDiv_CF
```
Auxiliary factor algorithm to find smooth decompositions of Q's. Version 02: Uses trial division first, complete factorization if Q is considered sufficiently smooth.

Author:

Tilman Neumann

Constructor Summary

Constructors
Constructor Description

TDiv_CF02()

Method Summary

All Methods Instance Methods Concrete 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, BigInteger 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 Detail
  - TDiv_CF02
```
public TDiv_CF02()
```
- Method Detail
  - getName
```
public String getName()
```
    Specified by:
    
    getName in interface TDiv_CF
    
    Returns:
    
    the name of this algorithm
  - initialize
```
public void initialize(BigInteger N,
                       double maxQRest)
```
    Description copied from interface: TDiv_CF
    
    Initialize for a new N.
    
    Specified by:
    
    initialize in interface TDiv_CF
  - initialize
```
public void initialize(BigInteger kN,
                       int primeBaseSize,
                       int[] primesArray)
```
    Description copied from interface: TDiv_CF
    
    Initialize this factorizer for a new k; in particular set the prime base to be used for trial division.
    
    Specified by:
    
    initialize in interface TDiv_CF
    
    primeBaseSize - the true prime base size (the arrays are preallocated with a bigger length)
    
    primesArray - prime base in ints
  - test
```
public AQPair test(BigInteger A,
                   BigInteger Q)
```
    Description copied from interface: TDiv_CF
    
    Check if Q is smooth (factors completely over the prime base) or "sufficiently smooth" (factors almost over the prime base).
    
    Specified by:
    
    test in interface TDiv_CF
    
    Returns:
    
    an AQ-pair if Q is at least "sufficiently smooth", null else