[sage-devel] Re: Polynomial Factoring Content Problem

2009-10-03 Thread Robert Bradshaw
On Oct 3, 2009, at 4:08 PM, rjf wrote: > Then would factoring 2*x-2 also reveal the bug? Or maybe factoring > 2 ? Nope. > It seems to me that for Pari to remove and then ignore the content > (in Z?) is a bug. Yep, I consider that strange too (though it does solve the "more interesting" p

[sage-devel] Re: Polynomial Factoring Content Problem

2009-10-03 Thread rjf
Then would factoring 2*x-2 also reveal the bug? Or maybe factoring 2 ? It seems to me that for Pari to remove and then ignore the content (in Z?) is a bug. It would make some sense to optionally not factor such a content unless you want to also do integer factorization. On Oct 3, 11:51 

[sage-devel] Re: Polynomial Factoring Content Problem

2009-10-03 Thread Robert Bradshaw
On Oct 2, 2009, at 9:30 PM, rjf wrote: > hey, factoring-testing guys.. > If you make up factoring problems this way, you are probably not doing > much testing of the real factoring algorithms. Actually, given this bug has been in Sage for so long, the real issue is that for several years no on

[sage-devel] Re: Polynomial Factoring Content Problem

2009-10-02 Thread William Stein
On Fri, Oct 2, 2009 at 9:30 PM, rjf wrote: > > hey, factoring-testing guys.. > If you make up factoring problems this way, you are probably not doing > much testing of the real factoring algorithms. Repeated factors like I for one am very grateful for this bug report. Andy is doing a superb jo

[sage-devel] Re: Polynomial Factoring Content Problem

2009-10-02 Thread rjf
hey, factoring-testing guys.. If you make up factoring problems this way, you are probably not doing much testing of the real factoring algorithms. Repeated factors like this of different degree are detected by so-called square-free factorization. The time to factor F in Maxima is, to the resoluti

[sage-devel] Re: Polynomial Factoring Content Problem

2009-10-01 Thread Andy Novocin
By the way, last October I made a patch for NTL which makes NTL's factoring significantly faster than even MAGMA's in some cases. I think that the degree flags < 30 and > 300 for NTL's factoring (provided my patch went in) needs to be revisited anyway. On Oct 1, 8:37 am, Robert Bradshaw wrote:

[sage-devel] Re: Polynomial Factoring Content Problem

2009-09-30 Thread Robert Bradshaw
On Sep 30, 2009, at 8:25 PM, William Stein wrote: > > On Wed, Sep 30, 2009 at 7:13 PM, Marshall Hampton > wrote: >> >> Wow, that's quite disturbing. Did you make a trac ticket for this? >> > > I've made this: > > http://trac.sagemath.org/sage_trac/ticket/7088 > > and made it a 4.1.2 blocker,

[sage-devel] Re: Polynomial Factoring Content Problem

2009-09-30 Thread William Stein
On Wed, Sep 30, 2009 at 7:13 PM, Marshall Hampton wrote: > > Wow, that's quite disturbing.  Did you make a trac ticket for this? > I've made this: http://trac.sagemath.org/sage_trac/ticket/7088 and made it a 4.1.2 blocker, since it a serious bug. The problem is in the _factor_pari method in S

[sage-devel] Re: Polynomial Factoring Content Problem

2009-09-30 Thread Marshall Hampton
Wow, that's quite disturbing. Did you make a trac ticket for this? -Marshall Hampton On Sep 30, 7:32 pm, AndyNovo wrote: > Hi all, > > Found this simple bug in a simple Z[x] factoring example. > > R.=PolynomialRing(ZZ) > f = 12*x^10 + x^9 + 432*x^3 + 9011 > g = 13*x^11 + 89*x^3 + 1 > F = f^2 *