Class SquFoF31Preload


  • public class SquFoF31Preload
    extends FactorAlgorithm
    Shanks' SQUFOF algorithm, 31-bit version. This version works without fail for N <= 2^52 and is faster than SquFoF63 for N <= 2^51. This version preloads the square-free sequence, but that makes hardly a difference.
    Author:
    Tilman Neumann
    • Constructor Detail

      • SquFoF31Preload

        public SquFoF31Preload()
    • Method Detail

      • getName

        public String getName()
        Specified by:
        getName in class FactorAlgorithm
        Returns:
        The name of the algorithm, possibly including important parameters.
      • findSingleFactor

        public long findSingleFactor​(long N)
        Find a factor of the given composite N.

        Warning: This method will not return when called with a prime argument.
        Parameters:
        N - composite integer
        Returns:
        factor of N
      • test

        protected Long test​(int Q_ip1)
      • main

        public static void main​(String[] args)
        Test.
        Parameters:
        args - ignored