@@ -2309,15 +2309,6 @@ cdef class Polynomial(CommutativePolynomial):
2309
2309
used for polynomials over finite fields. If not ``None`` only returns
2310
2310
irreducible factors of ``self`` whose degree divides ``ext_degree``.
2311
2311
2312
- .. NOTE::
2313
-
2314
- Any root is non-deterministic when finding linear roots of a
2315
- polynomial over the base ring. However, if ``degree`` is greater
2316
- than one, or ``ring`` is an extension of the base ring, then
2317
- eventually the root is found by returning a single root after
2318
- factorisation. Roots found in this way are deterministic.
2319
- This may change in the future.
2320
-
2321
2312
EXAMPLES::
2322
2313
2323
2314
sage: # needs sage.rings.finite_rings
@@ -2482,6 +2473,17 @@ cdef class Polynomial(CommutativePolynomial):
2482
2473
Negative degree input will be deprecated. Instead use
2483
2474
``assume_equal_deg``.
2484
2475
2476
+ .. NOTE::
2477
+
2478
+ For finite fields, ``any_root()`` is non-deterministic when
2479
+ finding linear roots of a polynomial over the base ring.
2480
+ However, if ``degree`` is greater than one, or ``ring`` is an
2481
+ extension of the base ring, then eventually the root is found
2482
+ by returning a single root after factorisation. Roots found
2483
+ in this way are deterministic. This may change in the future.
2484
+ For all other rings or fields, roots are found by first
2485
+ fully-factoring the polynomial and the output is deterministic.
2486
+
2485
2487
EXAMPLES::
2486
2488
2487
2489
sage: # needs sage.rings.finite_rings
0 commit comments