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

java.lang.Object
- de.tilman_neumann.jml.factor.base.matrixSolver.FactorTest01

All Implemented Interfaces:

FactorTest
```
public class FactorTest01
extends Object
implements FactorTest
```
Factor test using modular reduction (mod N).

Author:

Tilman Neumann

Constructor Summary

Constructors
Constructor Description

FactorTest01(BigInteger N)

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`String`	`getName()`
`void`	`testForFactor(Set<AQPair> aqPairs)`	Test if a square congruence A^2 == Q (mod kN) gives a factor of N.

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Constructor Detail
  - FactorTest01
```
public FactorTest01(BigInteger N)
```
- Method Detail
  - getName
```
public String getName()
```
    Specified by:
    
    getName in interface FactorTest
    
    Returns:
    
    the algorithm name
  - testForFactor
```
public void testForFactor(Set<AQPair> aqPairs)
                   throws FactorException
```
    Test if a square congruence A^2 == Q (mod kN) gives a factor of N. Reducing both A and sqrt(Q) (mod N) means a great speed gain. Otherwise these products can become huge, like a 1.000.000 bit number for N having 250 bit.
    
    Specified by:
    
    testForFactor in interface FactorTest
    
    Parameters:
    
    aqPairs -
    
    Throws:
    
    FactorException