Re: time-limited integer factorization

["Karim Belabas" <Karim.Belabas@math.u-bordeaux1.fr>]

* Bill Allombert [2008-01-18 10:15]:
> On Thu, Jan 17, 2008 at 06:03:03PM -0800, Max Alekseyev wrote:
> > factor_add_primes in your script does not always work as expected. For example:
[...]
> > It seems that in this example the primes 1245683 and 3722183 were not
> > recorded with addprimes(), but I have no idea why. The
> > factor_add_primes documentation does not explain what criterion is
> > used to decide which primes it adds with addprimes().
> 
> factor_add_primes only record primes that are hard to find to avoid
> filling up the memory.

I have expanded the ??factor_add_primes documentation (svn/CVS version)

Cheers,

    K.B.
-- 
Karim Belabas                  Tel: (+33) (0)5 40 00 26 17
IMB, Universite Bordeaux 1     Fax: (+33) (0)5 40 00 69 50
351, cours de la Liberation    http://www.math.u-bordeaux.fr/~belabas/
F-33405 Talence (France)       http://pari.math.u-bordeaux.fr/  [PARI/GP]