Package: pari Version: 2.4.4 (development svn-12706M) This was reported by Niels Lubbes as Sage bug on sage-devel@googlegroups.com:
gp> t; nf = nfinit(a^4 - a^2 + 1); gp> poly = t^3 + (-4*a^3 + 2*a)*t^2 - 11/3*a^2*t + 2/3*a^3 - 4/3*a %1 = t^3 + (-4*a^3 + 2*a)*t^2 - 11/3*a^2*t + (2/3*a^3 - 4/3*a) gp> F = nffactor(nf, poly) %2 = [t + Mod(-2*a^3 + a, a^4 - a^2 + 1) 1] [t^2 + Mod(-2*a^3 + a, a^4 - a^2 + 1)*t + Mod(-2/3*a^2, a^4 - a^2 + 1) 1] However, the second factor is reducible: gp> nffactor(nf, F[2,1]) %3 = [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] Cheers, 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
