Trac #34557: Fix a doctest error in quo_rem of polynomials

Modify a doctest to fix this failure
{{{
sage -t --long --warn-long 162.9
--random-seed=106591066711905509746265618740333072762
src/sage/rings/polynomial/polynomial_element.pyx
**********************************************************************
File "src/sage/rings/polynomial/polynomial_element.pyx", line 11653, in
sage.rings.polynomial.polynomial_element.Polynomial_generic_dense.quo_re
m
Failed example:
f.quo_rem(g)
Expected:
Traceback (most recent call last):
...
ArithmeticError: division non exact (consider coercing to polynomials
over
the fraction field)
Got:
(-7*y^5 + 1/4*y^2 + (-1/2*x + 1/2)*y,
11/2*y^4 + (-x^2 - 1/3*x + 2/3)*y^3 - 1/3*y^2 - y - 1)
**********************************************************************
}}}
first reported in

https://groups.google.com/g/sage-release/c/lolm_ybMtx8/m/4hcocx_EAAAJ

URL: https://trac.sagemath.org/34557
Reported by: klee
Ticket author(s): Kwankyu Lee
Reviewer(s): Matthias Koeppe

Author: Release Manager

src/sage/rings/polynomial/polynomial_element.pyx

@@ -1,45 +1,50 @@
 # coding: utf-8
 """
-Univariate Polynomial Base Class
+Univariate polynomial base class
+
+TESTS::
+
+    sage: R.<x> = ZZ[]
+    sage: f = x^5 + 2*x^2 + (-1)
+    sage: f == loads(dumps(f))
+    True
+
+    sage: PolynomialRing(ZZ,'x').objgen()
+    (Univariate Polynomial Ring in x over Integer Ring, x)
 
 AUTHORS:
 
--  William Stein: first version.
+- William Stein: first version
 
--  Martin Albrecht: Added singular coercion.
+- Martin Albrecht: added singular coercion
 
--  Robert Bradshaw: Move Polynomial_generic_dense to Cython.
+- Robert Bradshaw: moved Polynomial_generic_dense to Cython
 
--  Miguel Marco: Implemented resultant in the case where PARI fails.
+- Miguel Marco: implemented resultant in the case where PARI fails
 
--  Simon King: Use a faster way of conversion from the base ring.
+- Simon King: used a faster way of conversion from the base ring
 
--  Julian Rueth (2012-05-25,2014-05-09): Fixed is_squarefree() for imperfect
-   fields, fixed division without remainder over QQbar; added ``_cache_key``
-   for polynomials with unhashable coefficients
+- Kwankyu Lee (2013-06-02): enhanced :meth:`quo_rem`
 
--  Simon King (2013-10): Implement copying of :class:`PolynomialBaseringInjection`.
+- Julian Rueth (2012-05-25,2014-05-09): fixed is_squarefree() for imperfect
+  fields, fixed division without remainder over QQbar; added ``_cache_key``
+  for polynomials with unhashable coefficients
 
--  Kiran Kedlaya (2016-03): Added root counting.
+- Simon King (2013-10): implemented copying of :class:`PolynomialBaseringInjection`
 
--  Edgar Costa (2017-07): Added rational reconstruction.
+- Bruno Grenet (2014-07-13): enhanced :meth:`quo_rem`
 
--  Kiran Kedlaya (2017-09): Added reciprocal transform, trace polynomial.
+- Kiran Kedlaya (2016-03): added root counting
 
--  David Zureick-Brown (2017-09): Added is_weil_polynomial.
+- Edgar Costa (2017-07): added rational reconstruction
 
--  Sebastian Oehms (2018-10): made :meth:`roots` and  :meth:`factor` work over more
-   cases of proper integral domains (see :trac:`26421`)
+- Kiran Kedlaya (2017-09): added reciprocal transform, trace polynomial
 
-TESTS::
+- David Zureick-Brown (2017-09): added is_weil_polynomial
 
-    sage: R.<x> = ZZ[]
-    sage: f = x^5 + 2*x^2 + (-1)
-    sage: f == loads(dumps(f))
-    True
+- Sebastian Oehms (2018-10): made :meth:`roots` and  :meth:`factor` work over more
+  cases of proper integral domains (see :trac:`26421`)
 
-    sage: PolynomialRing(ZZ,'x').objgen()
-    (Univariate Polynomial Ring in x over Integer Ring, x)
 """
 
 # ****************************************************************************
@@ -11336,7 +11341,7 @@ cdef class Polynomial_generic_dense(Polynomial):
             sage: class BrokenRational(Rational):
             ....:     def __bool__(self):
             ....:         raise NotImplementedError("cannot check whether number is non-zero")
-            ....:     
+            ....:
             sage: z = BrokenRational()
             sage: R.<x> = QQ[]
             sage: from sage.rings.polynomial.polynomial_element import Polynomial_generic_dense
@@ -11636,18 +11641,12 @@ cdef class Polynomial_generic_dense(Polynomial):
         Raises a ``ZerodivisionError`` if ``other`` is zero. Raises an
         ``ArithmeticError`` if the division is not exact.
 
-        AUTHORS:
-
-        - Kwankyu Lee (2013-06-02)
-
-        - Bruno Grenet (2014-07-13)
-
         EXAMPLES::
 
             sage: P.<x> = QQ[]
             sage: R.<y> = P[]
-            sage: f = R.random_element(10)
-            sage: g = y^5+R.random_element(4)
+            sage: f = y^10 + R.random_element(9)
+            sage: g = y^5 + R.random_element(4)
             sage: q,r = f.quo_rem(g)
             sage: f == q*g + r
             True