Finding the least prime factor of a positive integer

This is based on a primitive factoring program which uses the Brent-Pollard algorithm and Pollard's p-1 algorithm. It should work on integers with no more than 25 digits.
Enter n (1 < n < 1025):

Last modified 29th May 2016
Return to primes page
Return to number-theoretic functions page