Class Lehman_AnalyzeCongruences
java.lang.Object
de.tilman_neumann.jml.factor.lehman.Lehman_AnalyzeCongruences
public class Lehman_AnalyzeCongruences
extends java.lang.Object
Analyze the moduli of a-values that help the Lehman algorithm to find factors.
Congruences a == kN (mod 2^s) are slightly more discriminative
than Lehman's original congruences a == (k+N) (mod 2^s), s = 1, 2, 3, ...
Version 1 shows that all successful (a0, adjust) pairs represent the same "a".
-
Constructor Summary
Constructors Constructor Description Lehman_AnalyzeCongruences()
-
Method Summary
Modifier and Type Method Description long
findSingleFactor(long N)
static void
main(java.lang.String[] args)
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
-
Constructor Details
-
Lehman_AnalyzeCongruences
public Lehman_AnalyzeCongruences()
-
-
Method Details
-
findSingleFactor
public long findSingleFactor(long N) -
main
public static void main(java.lang.String[] args)
-