Finding the divisors of a positive integer

The underlying BC program was devised by Alan Offer on 28th December 2011.
It steps through the exponent vectors arising from the canonical factorization of each divisor.
We use 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 20 digits.
E = 0 prints the divisors, E = 1 also prints the canonical factorizations of each divisor

Enter n (> 1):
Enter E (0 or 1):

Last modified 9th January 2012
Return to number-theoretic functions page