X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=mjo%2Fpolynomial.py;h=9ef2902320318141d4089e3a27ff12e8b94e4de2;hb=16dfa403c6eb709d3a5188a0f19919652b6a225d;hp=2b8dc2aa4cb825c06c6e0e09dc8582da0533817b;hpb=e0b910b5ab926b37605a8f606fce3f13bbf827ab;p=sage.d.git

diff --git a/mjo/polynomial.py b/mjo/polynomial.py
index 2b8dc2a..9ef2902 100644
--- a/mjo/polynomial.py
+++ b/mjo/polynomial.py
@@ -151,7 +151,6 @@ 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())
@@ -162,6 +161,19 @@ def multidiv(f, gs):
         ....:                     for g in gs ))
         True
 
+    Exercise 8 in Section 2.4 of Cox, Little, and O'Shea says that we
+    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: (qs, r) = multidiv(f, gs)
+        sage: r.is_zero()
+        True
+
     """
     R = f.parent()
     s = len(gs)