Computing σk(n)

σk(n) is the sum of the k-th powers of the divisors of n.
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 20 digits.

Enter k (1 ≤ k):
Enter n (1 ≤ n):

Last modified 16th August 2006
Return to main page