Hi all,
Today I started to implement methods to calculate the divisors of a number efficiently, and the only working algorithm I could implement was trial Division(after I red pseudo code that basically was vb). It worked fine, but now I'm trying to find the divisors of a big number and seeing how BigInteger doesn't have a Sqrt function, my little trial division function was left out in the dark.

I did a bit of Research and found Msieve and It works pretty well, but it give's the output in Prime Factors, and I really only need Divisors, is there some way to derive the divisors from prime factors ?