|Bill Allombert on Wed, 01 May 2013 19:29:49 +0200|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
|Re: Recovering partial factorizations when using trap() and alarm() to abort factorint()|
On Wed, May 01, 2013 at 06:05:10PM +0100, Richard in Reading wrote: > Thanks again Max! > > I saw that this was part of the code you posted but I didn't try it as I > thought it was doing something completely different. If you're doing lots of > factoring then factor(N,0) will presumably slow down a lot as the list of > stored factors grows... For that reason factor_add_primes only keeps primes larger than 2^24. This reduces the number of primes stored. > I think I'm catching on to the way things are done > round here... I presume if I change primelimit then the stored factors are > forgotten and the memory is freed? No. You have to do removeprimes(addprimes()) Cheers, Bill.