X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=mjo%2Fpolynomial.py;h=e50fece270e78be01904872cbd3d3571698325ea;hb=HEAD;hp=ca09ebefcf2f02dad8c659f5b1f5938f39fc248c;hpb=deb1e9c381606b637dac0f8948703fb4c27502b5;p=sage.d.git diff --git a/mjo/polynomial.py b/mjo/polynomial.py index ca09ebe..e50fece 100644 --- a/mjo/polynomial.py +++ b/mjo/polynomial.py @@ -135,12 +135,12 @@ def multidiv(f, gs): If we get a zero remainder, then the numerator should belong to the ideal generated by the denominators:: - sage: set_random_seed() sage: R = PolynomialRing(QQ, 'x,y,z') sage: x,y,z = R.gens() sage: s = ZZ.random_element(1,5).abs() sage: gs = [ R.random_element() for idx in range(s) ] - sage: f = R.random_element(ZZ.random_element(10).abs()) + sage: # hack for SageMath Trac #28855 + sage: f = R(R.random_element(ZZ.random_element(10).abs())) sage: (qs, r) = multidiv(f,gs) sage: r != 0 or f in R.ideal(gs) True @@ -149,12 +149,11 @@ def multidiv(f, gs): times the denominators, and the remainder's monomials aren't divisible by the leading term of any denominator:: - sage: set_random_seed() sage: R = PolynomialRing(QQ, 'x,y,z') - sage: x,y,z = R.gens() sage: s = ZZ.random_element(1,5).abs() sage: gs = [ R.random_element() for idx in range(s) ] - sage: f = R.random_element(ZZ.random_element(10).abs()) + sage: # hack for SageMath Trac #28855 + sage: f = R(R.random_element(ZZ.random_element(10).abs())) sage: (qs, r) = multidiv(f,gs) sage: r + sum( qs[i]*gs[i] for i in range(len(gs)) ) == f True @@ -166,11 +165,11 @@ def multidiv(f, gs): should always get a zero remainder if we divide an element of a monomial ideal by its generators:: - sage: set_random_seed() sage: R = PolynomialRing(QQ,'x,y,z') sage: gs = R.random_element().monomials() sage: I = R.ideal(gs) - sage: f = I.random_element(ZZ.random_element(5).abs()) + sage: # hack for SageMath Trac #28855 + sage: f = R(I.random_element(ZZ.random_element(5).abs())) sage: (qs, r) = multidiv(f, gs) sage: r.is_zero() True