Wow, that's quite disturbing. Did you make a trac ticket for this? -Marshall Hampton
On Sep 30, 7:32 pm, AndyNovo <a...@novocin.com> wrote: > Hi all, > > Found this simple bug in a simple Z[x] factoring example. > > R.<x>=PolynomialRing(ZZ) > f = 12*x^10 + x^9 + 432*x^3 + 9011 > g = 13*x^11 + 89*x^3 + 1 > F = f^2 * g^3 > G = F.factor() > should_be_zero = F - G.prod() > should_be_zero == 0 > > The problem was that F.factor returns > > 2028 * (12*x^10 + x^9 + 432*x^3 + 9011)^2 * (13*x^11 + 89*x^3 + 1)^3 > > Not 1 * (12*x^10 + x^9 + 432*x^3 + 9011)^2 * (13*x^11 + 89*x^3 + 1)^3 > > This is in the pari degree range. Anyway thought I would post it. > > We'll have a very fast polynomial factoring algorithm in FLINT before > too much longer, promise. --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
