Re: idealprimedec() bug

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

On Mon, 10 Mar 2003, Igor Schein wrote:
> 1 more:
>
> ? idealprimedec(nfinit(x^16+17*x^14+119*x^12+442*x^10+935*x^8+1122*x^6+714*x^4+204*x^2+17),4)
>   ***   bug in GP (Segmentation Fault), please report

This one occurs in a completely different place. FpX_normalize couldn't
handle the 0 polynomial: this is actually a bug !

Now, the computation enters an infinite loop, ended by stack overflow.
I don't think I want to go further here: it would require installing counters
in many routines that expect prime numbers, and trigger a pseudo-primality
test whenever the counters grow suspiciously larger.

Overkill.

    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              http://www.math.u-psud.fr/~belabas/
F-91405 Orsay (France)            http://www.parigp-home.de/  [PARI/GP]