eja: undo overzealous hack in _all2list; the bug was elsewhere.

[sage.d.git] / mjo / polynomial.py

diff --git a/mjo/polynomial.py b/mjo/polynomial.py
index ca09ebefcf2f02dad8c659f5b1f5938f39fc248c..55ada9a2f5d5ed259277fb8bceeb53f43a1b30e1 100644 (file)
--- a/mjo/polynomial.py
+++ b/mjo/polynomial.py
@@ -140,7 +140,8 @@ def multidiv(f, gs):
         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
@@ -151,10 +152,10 @@ def multidiv(f, gs):
 
         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
@@ -170,7 +171,8 @@ def multidiv(f, gs):
         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