passagemath-repl 10.5.27__py3-none-any.whl → 10.5.29__py3-none-any.whl

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

@@ -0,0 +1,170 @@
+# sage_setup: distribution = sagemath-repl
+##          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 6.5 Sage
+##
+r"""
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = SymmetricGroup(3)
+    sage: a = G("(1,2)")
+    sage: H = G.subgroup([a])
+    sage: rc = G.cosets(H, side='right'); rc
+    [[(), (1,2)], [(2,3), (1,3,2)], [(1,2,3), (1,3)]]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: lc = G.cosets(H, side='left'); lc
+    [[(), (1,2)], [(2,3), (1,2,3)], [(1,3,2), (1,3)]]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = SymmetricGroup(3)
+    sage: b = G("(1,2,3)")
+    sage: H = G.subgroup([b])
+    sage: rc = G.cosets(H, side='right'); rc
+    [[(), (1,2,3), (1,3,2)], [(2,3), (1,3), (1,2)]]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: lc = G.cosets(H, side='left'); lc
+    [[(), (1,2,3), (1,3,2)], [(2,3), (1,2), (1,3)]]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: rc == lc
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: rc_sorted = sorted([sorted(coset) for coset in rc])
+    sage: rc_sorted
+    [[(), (1,2,3), (1,3,2)], [(2,3), (1,2), (1,3)]]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: lc_sorted = sorted([sorted(coset) for coset in lc])
+    sage: lc_sorted
+    [[(), (1,2,3), (1,3,2)], [(2,3), (1,2), (1,3)]]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: rc_sorted == lc_sorted
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = SymmetricGroup(3)
+    sage: sg = G.subgroups(); sg
+    [Subgroup generated by [()] of (Symmetric group of order 3! as a permutation group),
+     Subgroup generated by [(2,3)] of (Symmetric group of order 3! as a permutation group),
+     Subgroup generated by [(1,2)] of (Symmetric group of order 3! as a permutation group),
+     Subgroup generated by [(1,3)] of (Symmetric group of order 3! as a permutation group),
+     Subgroup generated by [(1,2,3)] of (Symmetric group of order 3! as a permutation group),
+     Subgroup generated by [(1,2,3), (2,3)] of (Symmetric group of order 3! as a permutation group)]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: H = sg[4]; H
+    Subgroup generated by [(1,2,3)] of (Symmetric group of order 3! as a permutation group)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: H.order()
+    3
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: H.list()
+    [(), (1,2,3), (1,3,2)]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: H.is_cyclic()
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = AlternatingGroup(4)
+    sage: sg = G.subgroups()
+    sage: [H.order() for H in sg]
+    [1, 2, 2, 2, 3, 3, 3, 3, 4, 12]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = SymmetricGroup(4)
+    sage: sg = G.subgroups()
+    sage: [H.order() for H in sg]
+    [1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4,
+     6, 6, 6, 6, 8, 8, 8, 12, 24]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: len(sg)
+    30
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = CyclicPermutationGroup(20)
+    sage: [H.order() for H in G.subgroups()]
+    [1, 2, 4, 5, 10, 20]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = CyclicPermutationGroup(19)
+    sage: [H.order() for H in G.subgroups()]
+    [1, 19]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: n = 8
+    sage: G = CyclicPermutationGroup(n)
+    sage: [H.order() for H in G.subgroups()]
+    [1, 2, 4, 8]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: euler_phi(345)
+    176
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: m = random_prime(10000)
+    sage: n = random_prime(10000)
+    sage: m, n, euler_phi(m*n) == euler_phi(m)*euler_phi(n)   # random
+    (5881, 1277, True)
+"""

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

@@ -0,0 +1,151 @@
+# sage_setup: distribution = sagemath-repl
+##          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 7.6 Sage
+##
+r"""
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: p_a = next_prime(10^10)
+    sage: q_a = next_prime(p_a)
+    sage: p_b = next_prime((3/2)*10^10)
+    sage: q_b = next_prime(p_b)
+    sage: n_a = p_a * q_a
+    sage: n_b = p_b * q_b
+    sage: n_a, n_b
+    (100000000520000000627, 225000000300000000091)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: m_a = euler_phi(n_a)
+    sage: m_b = euler_phi(n_b)
+    sage: m_a, m_b
+    (100000000500000000576, 225000000270000000072)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: factor(m_a)
+    2^6 * 3 * 11 * 17 * 131 * 521 * 73259 * 557041
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: E_a = 5*23
+    sage: D_a = inverse_mod(E_a, m_a)
+    sage: D_a
+    20869565321739130555
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: factor(m_b)
+    2^3 * 3^4 * 107 * 1298027 * 2500000001
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: E_b = 7*29
+    sage: D_b = inverse_mod(E_b, m_b)
+    sage: D_b
+    24384236482463054195
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: print("Alice's public key, n:", n_a, "E:", E_a)
+    Alice's public key, n: 100000000520000000627 E: 115
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: print("Alice's private key, D:", D_a)
+    Alice's private key, D: 20869565321739130555
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: print("Bob's public key, n:", n_b, "E:", E_b)
+    Bob's public key, n: 225000000300000000091 E: 203
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: print("Bob's private key, D:", D_b)
+    Bob's private key, D: 24384236482463054195
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: word = 'Sage'
+    sage: digits = [ord(letter) for letter in word]
+    sage: digits
+    [83, 97, 103, 101]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: message = ZZ(digits, 128)
+    sage: message
+    213512403
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: signed = power_mod(message, D_a, n_a)
+    sage: signed
+    47838774644892618423
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: encrypted = power_mod(signed, E_b, n_b)
+    sage: encrypted
+    111866209291209840488
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: decrypted = power_mod(encrypted, D_b, n_b)
+    sage: decrypted
+    47838774644892618423
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: received = power_mod(decrypted, E_a, n_a)
+    sage: received
+    213512403
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: digits = received.digits(base=128)
+    sage: letters = [chr(ascii) for ascii in digits]
+    sage: letters
+    ['S', 'a', 'g', 'e']
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: ''.join(letters)
+    'Sage'
+"""