On Mon, Nov 15, 2010 at 1:59 PM, Jeroen Demeyer <jdeme...@cage.ugent.be> wrote: > On 2010-11-15 14:46, luisfe wrote: >> gp: poly = t^3 + (-4*a^3 + 2*a)*t^2 - 11/3*a^2*t + 2/3*a^3 - 4/3*a >> t^3 + (-4*a^3 + 2*a)*t^2 - 11/3*a^2*t + (2/3*a^3 - 4/3*a) >> gp: factornf(poly, a^4 - a^2 +1) >> >> [t + Mod(-2*a^3 + a, a^4 - a^2 + 1) 1] >> >> [t + Mod(-4/3*a^3 + 2/3*a, a^4 - a^2 + 1) 1] >> >> [t + Mod(-2/3*a^3 + 1/3*a, a^4 - a^2 + 1) 1] >> >> Which is the correct answer. > > True. I never understood why there exists nffactor() and factornf() > which do the same thing (but apparently with different implementations!)
According to Karim, one of these is now obsolete and should not be used. But I can never remember which.... John > > Jeroen. > > -- > To post to this group, send an email to sage-devel@googlegroups.com > To unsubscribe from this group, send an email to > sage-devel+unsubscr...@googlegroups.com > For more options, visit this group at > http://groups.google.com/group/sage-devel > URL: http://www.sagemath.org > -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
