Re: [sage-devel] Re: bug gcd of polynomials over numberfield

2010-11-16 Thread Niels
Thanks :-) On Tue, Nov 16, 2010 at 1:02 PM, luisfe wrote: > > > On Nov 16, 12:28 pm, Niels wrote: > > Hi, > > > > I would like to compute the gcd of two bi-variate polynomials over a > number > > field: > > > > sage: R = PolynomialRing( QQ, var( 't' ), order = 'lex' ) > > sage: t = R.ge

[sage-devel] Re: bug gcd of polynomials over numberfield

2010-11-16 Thread Niels
Hi, Just realized that gcd( [( a0 + 1 ) * x , ( a0 + 1 ) * x * y] )=x is correct. This makes me wonder whether to exception of the second gcd (after adjoining a1) is a bug, or whether my construction of the numberfield is incorrect. Maybe i should have asked this question at sage-support Kind

[sage-devel] Re: bug gcd of polynomials over numberfield

2010-11-16 Thread luisfe
On Nov 16, 12:28 pm, Niels wrote: > Hi, > > I would like to compute the gcd of two bi-variate polynomials over a number > field: > > sage: R = PolynomialRing( QQ, var( 't' ), order = 'lex' ) > sage: t = R.gens()[0] > sage: T = NumberFieldTower( [t ** 2 - t + 1], 'a0' ) > sage: a0