Hart_AnalyzeSquareCongruences

java.lang.Object

de.tilman_neumann.jml.factor.hart.Hart_AnalyzeSquareCongruences

public class Hart_AnalyzeSquareCongruences
extends java.lang.Object

Analyze until which s we obtain test == "some square" (mod 2^s).

Constructor Summary

Constructors

Constructor Description

Hart_AnalyzeSquareCongruences(boolean doTDivFirst)
Full constructor.

Method Summary

Modifier and Type	Method	Description
`long`	`findSingleFactor(long N)`	Find a factor of long N.
`java.math.BigInteger`	`findSingleFactor(java.math.BigInteger N)`
`java.lang.String`	`getName()`
`static void`	`main(java.lang.String[] args)`	Test.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details
- Hart_AnalyzeSquareCongruences
  
  public Hart_AnalyzeSquareCongruences(boolean doTDivFirst)
  
  Full constructor.
  
  Parameters:
  
  doTDivFirst - If true then trial division is done before the Lehman loop. This is recommended if arguments N are known to have factors < cbrt(N) frequently.
Method Details
- getName
  
  public java.lang.String getName()
- findSingleFactor
  
  public java.math.BigInteger findSingleFactor(java.math.BigInteger N)
- findSingleFactor
  
  public long findSingleFactor(long N)
  
  Find a factor of long N.
  
  Parameters:
  
  N -
  
  Returns:
  
  factor of N
- main
  
  public static void main(java.lang.String[] args)
  
  Test.
  
  Parameters:
  
  args - ignored