Max A. on Fri, 17 Nov 2006 22:47:39 +0100

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

time-limited integer factorization

Dear pari-users,

Is there a way to perform integer factorizations in GP bounded in time?
Say, I want to factor a certain number but spend at most one hour. If
factorization is not finished within this time frame, I want to it to
return all found factors along with a composite co-factor.

P.S. This has to be done without any interaction from my side. My
program is looking for specific factors of a whole bunch of numbers,
some of which may be very hard to factor completely, and I don't want
to spend more than an hour on each number.