Re: polredabs failure

[Igor Schein <igor@txc.com>]

On Tue, Oct 14, 2003 at 08:29:29PM +0200, Karim BELABAS wrote:
> I've changed this part of the algorithm. So this example should be slightly
> faster than it used to be: the field generated by the first 14 elements
> of the basis is a strict subfield. Previously, only the first 8 ones were
> tested since the check was (deemed) too expensive otherwise.
> 
> Any glitches ?

? polredabs(x^8-2*x^7-34*x^6+78*x^5+265*x^4-628*x^3-389*x^2+1237*x-449)
x^8 - 2*x^7 - 34*x^6 + 78*x^5 + 265*x^4 - 628*x^3 - 389*x^2 + 1237*x - 449

Failure to reduce.

The correct answer is 

x^8 - 2*x^7 - 22*x^6 + 46*x^5 + 73*x^4 - 102*x^3 - 19*x^2 + 25*x + 5

Thanks

Igor