The factoring methods are used to implement a fast sumOfDivisors() function. Another prominent subject in this library is prime generation and testing. For example, you can find a port of Kim ...

I noticed that the prime factorization of large integers that have many small prime factors seems to be quite slow, but I think we can do better. Length of n = 16875 bigomega(n) = 4175 Factorization ...