passagemath-repl 10.5.28__py3-none-any.whl → 10.5.30__py3-none-any.whl

sage/tests/books/judson-abstract-algebra/integers-sage.py

@@ -0,0 +1,198 @@
+# sage_setup: distribution = sagemath-repl
+# sage.doctest: needs sage.libs.pari
+##          Sage Doctest File         ##
+#**************************************#
+#*    Generated from PreTeXt source   *#
+#*    on 2017-08-24T11:43:34-07:00    *#
+#*                                    *#
+#*   http://mathbook.pugetsound.edu   *#
+#*                                    *#
+#**************************************#
+##
+"""
+Please contact Rob Beezer (beezer@ups.edu) with
+any test failures here that need to be changed
+as a result of changes accepted into Sage.  You
+may edit/change this file in any sensible way, so
+that development work may procede.  Your changes
+may later be replaced by the authors of "Abstract
+Algebra: Theory and Applications" when the text is
+updated, and a replacement of this file is proposed
+for review.
+"""
+##
+## To execute doctests in these files, run
+##   $ $SAGE_ROOT/sage -t <directory-of-these-files>
+## or
+##   $ $SAGE_ROOT/sage -t <a-single-file>
+##
+## Replace -t by "-tp n" for parallel testing,
+##   "-tp 0" will use a sensible number of threads
+##
+## See: http://www.sagemath.org/doc/developer/doctesting.html
+##   or run  $ $SAGE_ROOT/sage --advanced  for brief help
+##
+## Generated at 2017-08-24T11:43:34-07:00
+## From "Abstract Algebra"
+## At commit 26d3cac0b4047f4b8d6f737542be455606e2c4b4
+##
+## Section 2.6 Sage
+##
+r"""
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: r = 14 % 3
+    sage: r
+    2
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: q = (14 - r)/3
+    sage: q
+    4
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: a = 14
+    sage: b = 3
+    sage: a.quo_rem(b)
+    (4, 2)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: (20 % 5) == 0
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: (17 % 4) == 0
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: c = 5
+    sage: c.divides(20)
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: d = 4
+    sage: d.divides(17)
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: gcd(2776, 2452)
+    4
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: a = 31049
+    sage: b = 2105
+    sage: gcd(a, b) == 1
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: a = 3563
+    sage: b = 2947
+    sage: gcd(a, b) == 1
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: xgcd(633,331)
+    (1, -137, 262)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: a = 633
+    sage: b = 331
+    sage: extended = xgcd(a, b)
+    sage: g = extended[0]
+    sage: r = extended[1]
+    sage: s = extended[2]
+    sage: g == r*a + s*b
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: a = 117371
+    sage: a.is_prime()
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: b = 14547073
+    sage: b.is_prime()
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: b == 1597 * 9109
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: a = random_prime(10^21, proof=True)
+    sage: a   # random
+    424729101793542195193
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: a.is_prime()
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: prime_range(500, 550)
+    [503, 509, 521, 523, 541, 547]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: a = 2600
+    sage: a.factor()
+    2^3 * 5^2 * 13
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: a = 2600
+    sage: factored = a.factor()
+    sage: first_term = factored[0]
+    sage: first_term
+    (2, 3)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: second_term = factored[1]
+    sage: second_term
+    (5, 2)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: third_term = factored[2]
+    sage: third_term
+    (13, 1)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: first_prime = first_term[0]
+    sage: first_prime
+    2
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: first_exponent = first_term[1]
+    sage: first_exponent
+    3
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: list(factored)
+    [(2, 3), (5, 2), (13, 1)]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: len(factored)
+    3
+"""

sage/tests/books/judson-abstract-algebra/isomorph-sage.py

@@ -0,0 +1,173 @@
+# sage_setup: distribution = sagemath-repl
+# sage.doctest: needs sage.groups sage.libs.pari
+##          Sage Doctest File         ##
+#**************************************#
+#*    Generated from PreTeXt source   *#
+#*    on 2017-08-24T11:43:34-07:00    *#
+#*                                    *#
+#*   http://mathbook.pugetsound.edu   *#
+#*                                    *#
+#**************************************#
+##
+"""
+Please contact Rob Beezer (beezer@ups.edu) with
+any test failures here that need to be changed
+as a result of changes accepted into Sage.  You
+may edit/change this file in any sensible way, so
+that development work may procede.  Your changes
+may later be replaced by the authors of "Abstract
+Algebra: Theory and Applications" when the text is
+updated, and a replacement of this file is proposed
+for review.
+"""
+##
+## To execute doctests in these files, run
+##   $ $SAGE_ROOT/sage -t <directory-of-these-files>
+## or
+##   $ $SAGE_ROOT/sage -t <a-single-file>
+##
+## Replace -t by "-tp n" for parallel testing,
+##   "-tp 0" will use a sensible number of threads
+##
+## See: http://www.sagemath.org/doc/developer/doctesting.html
+##   or run  $ $SAGE_ROOT/sage --advanced  for brief help
+##
+## Generated at 2017-08-24T11:43:34-07:00
+## From "Abstract Algebra"
+## At commit 26d3cac0b4047f4b8d6f737542be455606e2c4b4
+##
+## Section 9.4 Sage
+##
+r"""
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: m = 12
+    sage: n = 7
+    sage: gcd(m, n)
+    1
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = CyclicPermutationGroup(m)
+    sage: H = CyclicPermutationGroup(n)
+    sage: dp = direct_product_permgroups([G, H])
+    sage: K = CyclicPermutationGroup(m*n)
+    sage: K.is_isomorphic(dp)
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: m = 15
+    sage: n = 21
+    sage: gcd(m, n)
+    3
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = CyclicPermutationGroup(m)
+    sage: H = CyclicPermutationGroup(n)
+    sage: dp = direct_product_permgroups([G, H])
+    sage: K = CyclicPermutationGroup(m*n)
+    sage: K.is_isomorphic(dp)
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: m = 6
+    sage: n = 5
+    sage: r = 7
+    sage: G = CyclicPermutationGroup(m)
+    sage: H = CyclicPermutationGroup(n)
+    sage: L = CyclicPermutationGroup(r)
+    sage: dp = direct_product_permgroups([G, H, L])
+    sage: K = CyclicPermutationGroup(m*n*r)
+    sage: K.is_isomorphic(dp)
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: [CyclicPermutationGroup(p) for p in [1, 2, 3, 5, 7, 11, 13]]
+    [Cyclic group of order 1 as a permutation group,
+     Cyclic group of order 2 as a permutation group,
+     Cyclic group of order 3 as a permutation group,
+     Cyclic group of order 5 as a permutation group,
+     Cyclic group of order 7 as a permutation group,
+     Cyclic group of order 11 as a permutation group,
+     Cyclic group of order 13 as a permutation group]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = CyclicPermutationGroup(4)
+    sage: H = KleinFourGroup()
+    sage: T1 = CyclicPermutationGroup(2)
+    sage: T2 = CyclicPermutationGroup(2)
+    sage: K = direct_product_permgroups([T1, T2])
+    sage: G.is_isomorphic(H)
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: H.is_isomorphic(K)
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = CyclicPermutationGroup(6)
+    sage: H = SymmetricGroup(3)
+    sage: G.is_isomorphic(H)
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = DihedralGroup(3)
+    sage: H = SymmetricGroup(3)
+    sage: G.is_isomorphic(H)
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: Z36 = Integers(36)
+    sage: U = [x for x in Z36 if gcd(ZZ(x), 36) == 1]
+    sage: U
+    [1, 5, 7, 11, 13, 17, 19, 23, 25, 29, 31, 35]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: [x.multiplicative_order() for x in U]
+    [1, 6, 6, 6, 3, 2, 2, 6, 3, 6, 6, 2]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: a = U[1]
+    sage: A = [a^i for i in srange(6)]
+    sage: A
+    [1, 5, 25, 17, 13, 29]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: b = U[11]
+    sage: B = [b^i for i in srange(2)]
+    sage: B
+    [1, 35]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: [x for x in A if x in B]
+    [1]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: all(x*y == y*x for x in A for y in B)
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: T = sorted(x*y for x in A for y in B)
+    sage: T
+    [1, 5, 7, 11, 13, 17, 19, 23, 25, 29, 31, 35]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: T == U
+    True
+"""

sage/tests/books/judson-abstract-algebra/normal-sage.py

@@ -0,0 +1,134 @@
+# sage_setup: distribution = sagemath-repl
+# sage.doctest: needs sage.groups
+##          Sage Doctest File         ##
+#**************************************#
+#*    Generated from PreTeXt source   *#
+#*    on 2017-08-24T11:43:34-07:00    *#
+#*                                    *#
+#*   http://mathbook.pugetsound.edu   *#
+#*                                    *#
+#**************************************#
+##
+"""
+Please contact Rob Beezer (beezer@ups.edu) with
+any test failures here that need to be changed
+as a result of changes accepted into Sage.  You
+may edit/change this file in any sensible way, so
+that development work may procede.  Your changes
+may later be replaced by the authors of "Abstract
+Algebra: Theory and Applications" when the text is
+updated, and a replacement of this file is proposed
+for review.
+"""
+##
+## To execute doctests in these files, run
+##   $ $SAGE_ROOT/sage -t <directory-of-these-files>
+## or
+##   $ $SAGE_ROOT/sage -t <a-single-file>
+##
+## Replace -t by "-tp n" for parallel testing,
+##   "-tp 0" will use a sensible number of threads
+##
+## See: http://www.sagemath.org/doc/developer/doctesting.html
+##   or run  $ $SAGE_ROOT/sage --advanced  for brief help
+##
+## Generated at 2017-08-24T11:43:34-07:00
+## From "Abstract Algebra"
+## At commit 26d3cac0b4047f4b8d6f737542be455606e2c4b4
+##
+## Section 10.4 Sage
+##
+r"""
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = DihedralGroup(8)
+    sage: quarter_turn = G('(1,3,5,7)(2,4,6,8)')
+    sage: S = G.subgroup([quarter_turn])
+    sage: C = G.cosets(S)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: p = C[1][0]*C[3][0]
+    sage: [i for i in srange(len(C)) if p in C[i]]
+    [2]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: p = C[1][2]*C[3][1]
+    sage: [i for i in srange(len(C)) if p in C[i]]
+    [2]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: def coset_product(i, j, C):
+    ....:    p = C[i][0]*C[j][0]
+    ....:    c = [k for k in srange(len(C)) if p in C[k]]
+    ....:    return c[0]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: coset_product(1, 3, C)
+    2
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = AlternatingGroup(4)
+    sage: face_turn = G("(1,2,3)")
+    sage: S = G.subgroup([face_turn])
+    sage: C = G.cosets(S)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: p = C[1][0]*C[3][0]
+    sage: [i for i in srange(len(C)) if p in C[i]]
+    [0]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: p = C[1][0]*C[3][1]
+    sage: [i for i in srange(len(C)) if p in C[i]]
+    [2]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = DihedralGroup(8)
+    sage: quarter_turn = G('(1,3,5,7)(2,4,6,8)')
+    sage: S = G.subgroup([quarter_turn])
+    sage: S.is_normal(G)
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = AlternatingGroup(4)
+    sage: face_turn = G("(1,2,3)")
+    sage: S = G.subgroup([face_turn])
+    sage: S.is_normal(G)
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = AlternatingGroup(5)
+    sage: G.is_simple()
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = DihedralGroup(8)
+    sage: quarter_turn = G('(1,3,5,7)(2,4,6,8)')
+    sage: S = G.subgroup([quarter_turn])
+    sage: Q = G.quotient(S)
+    sage: Q
+    Permutation Group with generators [(1,2)(3,4), (1,3)(2,4)]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: Q.is_isomorphic(KleinFourGroup())
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = DihedralGroup(8)
+    sage: N = G.normal_subgroups()
+    sage: l=[H.order() for H in N]; l.sort(); l
+    [1, 2, 4, 8, 8, 8, 16]
+"""