Re: Pari

[Karim BELABAS <Karim.Belabas@math.u-psud.fr>]

On Wed, 11 Dec 2002 traser@isn.net wrote:
[ note to pari-dev: personal e-mail, Cc-ed to the list ]
> ? factorint((2^257)-1)
> MPQS: the combination of the relations is a nonsquare
>   ***   bug in factoring (MPQS), please report
>
> I was running this from a gp prompt(obviously) with 1E8 precomputed primes
> and 128 megabytes allocated to PARI.

I can't reproduce your problem with the current development version 2.2.5 on
ix86 + GNU/Linux [ finds the 3 factors in ~ 5 minutes, 1GHz machine ].

1) Which version of GP was this, on which architecture ? (please copy-paste
the GP header) ?

2) Is it deterministic ? (can you reproduce it at will?).  [ The
implementation is deterministic, but disk caches and memory layouts are not ]

Thanks,

    Karim.
-- 
Karim Belabas                    Tel: (+33) (0)1 69 15 57 48
Dép. de Mathématiques, Bât. 425  Fax: (+33) (0)1 69 15 60 19
Université Paris-Sud             Email: Karim.Belabas@math.u-psud.fr
F-91405 Orsay (France)           http://www.math.u-psud.fr/~belabas/
--
PARI/GP Home Page: http://www.parigp-home.de/