ifactor problem with new update

[Helge Gabert]

This might not be a bug. Depends on how the quadratic sieve factoring algorithm was implemented in the Prime, what the cutoff is for the running time, what primes are selected to be in the factor base, etc. Not all integers of comparable length can be expected to be factored in the same amount of time.