Class Lehman_AnalyzeCongruences


  • public class Lehman_AnalyzeCongruences
    extends 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".
    Author:
    Tilman Neumann
    • Constructor Detail

      • Lehman_AnalyzeCongruences

        public Lehman_AnalyzeCongruences()
    • Method Detail

      • findSingleFactor

        public long findSingleFactor​(long N)
      • main

        public static void main​(String[] args)