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

java.lang.Object
- de.tilman_neumann.jml.factor.FactorAlgorithm
- - de.tilman_neumann.jml.factor.pollardRho.PollardRhoBrent31

```
public class PollardRhoBrent31
extends FactorAlgorithm
```
Brents's improvement of Pollard's Rho algorithm, following [Richard P. Brent: An improved Monte Carlo Factorization Algorithm, 1980]. 31 bit version.

Author:

Tilman Neumann

Field Summary
- Fields inherited from class de.tilman_neumann.jml.factor.FactorAlgorithm
  DEFAULT, NUM_PRIMES_FOR_31_BIT_TDIV, tdivLimit

Constructor Summary

Constructors
Constructor Description

PollardRhoBrent31()

Method Summary

All Methods Static Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`int`	`findSingleFactor(int N)`
`BigInteger`	`findSingleFactor(BigInteger N)`	Find a single factor of the given N, which is composite and odd.
`String`	`getName()`
`static void`	`main(String[] args)`	Test.

Methods inherited from class de.tilman_neumann.jml.factor.FactorAlgorithm
factor, factor, searchFactors

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

- Constructor Detail
  - PollardRhoBrent31
```
public PollardRhoBrent31()
```
- Method Detail
  - getName
```
public String getName()
```
    Specified by:
    
    getName in class FactorAlgorithm
    
    Returns:
    
    The name of the algorithm, possibly including important parameters.
  - findSingleFactor
```
public BigInteger findSingleFactor(BigInteger N)
```
    Description copied from class: FactorAlgorithm
    
    Find a single factor of the given N, which is composite and odd.
    
    Specified by:
    
    findSingleFactor in class FactorAlgorithm
    
    Returns:
    
    factor
  - findSingleFactor
```
public int findSingleFactor(int N)
```
  - main
```
public static void main(String[] args)
```
    Test.
    
    Parameters:
    
    args - ignored