Quote:
Originally Posted by totmalone
It's seems running using NFS ? or it's just automatics choose what method to factor an integer ?

Code:
div: primes less than 10000
div: found prime factor = 3
div: found prime factor = 5
It performed trial division and found 3 & 5, completing the factorization. It never went to the more complex factoring algorithms.
For a larger number, it would've performed additional steps like Pollard's rho, P1, ECM, and eventually would've finished it off by either SIQS or NFS (depending on the size of the composite and the qs/nfs crossover points).