Re: segmentation fault: bug in GP (please report).

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

> gp > a=nextprime(10^40)
> %15 = 10000000000000000000000000000000000000121
> gp > b=nextprime(a+1)
> %16 = 10000000000000000000000000000000000000139
> gp > c=nextprime(b+1)
> %17 = 10000000000000000000000000000000000000301
> gp > issquare(Mod(-a*b,c))
>   ***   segmentation fault: bug in GP (please report).
> 
> It would be helpful to know if this is really due to a bug or not, and
> if so whether it is known and/or fixed in 2.0.11/12.  Or is there
> really an upper bound for (prime) p such that issquare(Mod(a,p)) can
> be answered?

It was a (stupid) bug, fixed in 2.0.11.beta

Done for version 2.0.11 beta (released 30/07/98):
  Fixed
    ...
    2- stack corruption in gcarreparfait (t_INTMOD)

Karim.

P.S: Don't rush to get 2.0.11, version 2.0.12 is forthcoming...
--
Karim Belabas                    email: Karim.Belabas@math.u-psud.fr
Dep. de Mathematiques, Bat. 425
Universite Paris-Sud             Tel: (00 33) 1 69 15 57 48
F-91405 Orsay (France)           Fax: (00 33) 1 69 15 60 19
--
PARI/GP Home Page: http://pari.home.ml.org