question on possible factor() function for gmp
website.reader3 at gmail.com
Thu Jul 5 17:39:53 UTC 2018
Has someone put together a function for gmp called factor(n) where n is
integer? (output is a list of factors and their powers)
I did play around with the Pollard method but when I was working with
30-40 digit numbers to factor, GP Pari was always faster than gmp in
I understand that a general purpose program will shift algorithm
according to the size of the number, such as the general number field
sieve, when we're around 100 digits or so, but I would like to see some
speed in the region of 20-80 digits.
Thank you for responding.
More information about the gmp-discuss