Re: idealprimedec() bug

[Igor Schein <igor@txc.com>]

On Mon, Mar 10, 2003 at 07:29:22PM +0100, Karim BELABAS wrote:
> 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.

Please pardon my persistence :=)

? idealprimedec(nfinit(x^16-44*x^14+686*x^12-4908*x^10+17039*x^8-28164*x^6+19214*x^4-2720*x^2+25),4);
  ***   bug in GP (Segmentation Fault), please report

Thanks

Igor