sage.rings.finite_rings: More # optional

Author: Matthias Koeppe

src/sage/rings/finite_rings/finite_field_prime_modn.py

@@ -47,7 +47,7 @@ class FiniteField_prime_modn(FiniteField_generic, integer_mod_ring.IntegerModRin
         sage: FiniteField(3)
         Finite Field of size 3
 
-        sage: FiniteField(next_prime(1000))
+        sage: FiniteField(next_prime(1000))                                             # optional - sage.rings.finite_rings
         Finite Field of size 1009
     """
     def __init__(self, p, check=True, modulus=None):
@@ -104,7 +104,7 @@ def _coerce_map_from_(self, S):
             5
             sage: 12 % 7
             5
-            sage: ZZ.residue_field(7).hom(GF(7))(1)  # See trac 11319
+            sage: ZZ.residue_field(7).hom(GF(7))(1)  # See trac 11319                   # optional - sage.rings.finite_rings
             1
             sage: K.<w> = QuadraticField(337)  # See trac 11319
             sage: pp = K.ideal(13).factor()[0][0]
@@ -117,12 +117,12 @@ def _coerce_map_from_(self, S):
 
         Check that :trac:`19573` is resolved::
 
-            sage: Integers(9).hom(GF(3))
+            sage: Integers(9).hom(GF(3))                                                # optional - sage.rings.finite_rings
             Natural morphism:
               From: Ring of integers modulo 9
               To:   Finite Field of size 3
 
-            sage: Integers(9).hom(GF(5))
+            sage: Integers(9).hom(GF(5))                                                # optional - sage.rings.finite_rings
             Traceback (most recent call last):
             ...
             TypeError: natural coercion morphism from Ring of integers modulo 9 to Finite Field of size 5 not defined
@@ -201,7 +201,7 @@ def is_prime_field(self):
             sage: k.is_prime_field()
             True
 
-            sage: k.<a> = GF(3^2)
+            sage: k.<a> = GF(3^2)                                                       # optional - sage.rings.finite_rings
             sage: k.is_prime_field()
             False
         """
@@ -271,7 +271,7 @@ def gen(self, n=0):
             sage: k = GF(13)
             sage: k.gen()
             1
-            sage: k = GF(1009, modulus="primitive")
+            sage: k = GF(1009, modulus="primitive")                                     # optional - sage.rings.finite_rings
             sage: k.gen()  # this gives a primitive element
             11
             sage: k.gen(1)
@@ -304,7 +304,7 @@ def __iter__(self):
         We can even start iterating over something that would be too big
         to actually enumerate::
 
-            sage: K = GF(next_prime(2^256))
+            sage: K = GF(next_prime(2^256))                                             # optional - sage.rings.finite_rings
             sage: all = iter(K)
             sage: next(all)
             0