passagemath-repl 10.5.1__py3-none-any.whl

sage/tests/functools_partial_src.py

@@ -0,0 +1,27 @@
+# sage_setup: distribution = sagemath-repl
+r"""
+Ensure that ``functools.partial`` is correctly handled by
+:func:`~sage.misc.sageinspect.sage_getsourcelines`.
+"""
+from functools import partial
+
+
+def base(x):
+    """
+    Test function to make sure
+    :func:`~sage.misc.sageinspect.sage_getsourcelines` can get
+    the code of a function created by ``functools.partial``.
+
+    EXAMPLES::
+
+        sage: from sage.tests.functools_partial_src import base, test_func
+        sage: base(3)
+        21
+        sage: test_func()
+        42
+    """
+    x = x * 7
+    return x
+
+
+test_func = partial(base, 6)

sage/tests/gosper-sum.py

@@ -0,0 +1,218 @@
+# sage_setup: distribution = sagemath-repl
+# sage.doctest: needs sage.symbolic
+"""
+Some tests about Gosper sums.
+
+References
+==========
+
+- [PWZ1997]_
+
+TESTS::
+
+    sage: _ = var('a b k m n r')
+    sage: SR(1).gosper_sum(k)
+    k
+    sage: SR(1).gosper_sum(k,0,n)
+    n + 1
+    sage: SR(1).gosper_sum(k, a, b)
+    -a + b + 1
+    sage: a.gosper_sum(k)
+    a*k
+    sage: a.gosper_sum(k,0,n)
+    a*(n + 1)
+    sage: a.gosper_sum(k,a,b)
+    -(a - b - 1)*a
+    sage: k.gosper_sum(k)
+    1/2*(k - 1)*k
+    sage: k.gosper_sum(k,0,n)
+    1/2*(n + 1)*n
+    sage: k.gosper_sum(k, a, b)
+    -1/2*(a + b)*(a - b - 1)
+    sage: k.gosper_sum(k, a+1, b)
+    -1/2*(a + b + 1)*(a - b)
+    sage: k.gosper_sum(k, a, b+1)
+    -1/2*(a + b + 1)*(a - b - 2)
+    sage: (k^3).gosper_sum(k)
+    1/4*(k - 1)^2*k^2
+    sage: (k^3).gosper_sum(k, a, b)
+    -1/4*(a^2 + b^2 - a + b)*(a + b)*(a - b - 1)
+
+    sage: (1/k).gosper_sum(k)
+    Traceback (most recent call last):
+    ...
+    ValueError: expression not Gosper-summable
+    sage: x = (1/k/(k+1)/(k+2)/(k+3)/(k+5)/(k+7)).gosper_sum(k,a,b)
+    sage: y = sum(1/k/(k+1)/(k+2)/(k+3)/(k+5)/(k+7) for k in range(5,500))
+    sage: assert x.subs(a==5,b==499) == y
+
+The following are from A==B, p.78 ff. Since the resulting expressions
+get more and more complicated with many correct representations that
+may differ depending on future capabilities, we check correctness by
+doing random summations::
+
+    sage: def check(ex, var, val1, val2from, val2to):
+    ....:     import random
+    ....:     symb = SR.var('symb')
+    ....:     s1 = ex.gosper_sum(var, val1, symb)
+    ....:     R = random.SystemRandom
+    ....:     val2 = R().randint(val2from, val2to)
+    ....:     s2 = sum(ex.subs(var==i) for i in range(val1, val2+1))
+    ....:     assert s1.subs(symb==val2) == s2
+
+    sage: def check_unsolvable(ex, *args):
+    ....:     try:
+    ....:         SR(ex).gosper_sum(*args)
+    ....:         raise AssertionError
+    ....:     except ValueError:
+    ....:         pass
+
+    sage: check((4*n+1) * factorial(n)/factorial(2*n+1), n, 0, 10, 20)
+    sage: check_unsolvable(factorial(k), k,0,n)
+    sage: (k * factorial(k)).gosper_sum(k,1,n)
+    n*factorial(n) + factorial(n) - 1
+    sage: (k * factorial(k)).gosper_sum(k)
+    factorial(k)
+    sage: check_unsolvable(binomial(n,k), k,0,n)
+    sage: ((-1)^k*binomial(n,k)).gosper_sum(k,0,n)
+    0
+    sage: ((-1)^k*binomial(n,k)).gosper_sum(k,0,a)
+    -(-1)^a*(a - n)*binomial(n, a)/n
+    sage: (binomial(1/2,a-k+1)*binomial(1/2,a+k)).gosper_sum(k,1,b)
+    (2*a + 2*b - 1)*(a - b + 1)*b*binomial(1/2, a + b)*binomial(1/2, a - b + 1)/((2*a + 1)*a)
+    sage: t = (binomial(2*k,k)/4^k).gosper_sum(k,0,n); t
+    (2*n + 1)*binomial(2*n, n)/4^n
+    sage: t = t.gosper_sum(n,0,n); t
+    1/3*(2*n + 3)*(2*n + 1)*binomial(2*n, n)/4^n
+    sage: t = t.gosper_sum(n,0,n); t
+    1/15*(2*n + 5)*(2*n + 3)*(2*n + 1)*binomial(2*n, n)/4^n
+    sage: t = t.gosper_sum(n,0,n); t
+    1/105*(2*n + 7)*(2*n + 5)*(2*n + 3)*(2*n + 1)*binomial(2*n, n)/4^n
+    sage: (binomial(2*k+2*a,2*a)*binomial(2*k,k)/binomial(k+a,a)/4^k).gosper_sum(k,0,n)
+    (2*a + 2*n + 1)*binomial(2*a + 2*n, 2*a)*binomial(2*n, n)/(4^n*(2*a + 1)*binomial(a + n, a))
+    sage: (4^k/binomial(2*k,k)).gosper_sum(k,0,n)
+    1/3*(2*4^n*n + 2*4^n + binomial(2*n, n))/binomial(2*n, n)
+
+    # The following are from A==B, 5.7 Exercises
+    sage: for k in range(1,5): (n^k).gosper_sum(n,0,m)
+    1/2*(m + 1)*m
+    1/6*(2*m + 1)*(m + 1)*m
+    1/4*(m + 1)^2*m^2
+    1/30*(3*m^2 + 3*m - 1)*(2*m + 1)*(m + 1)*m
+    sage: for k in range(1,4): (n^k*2^n).gosper_sum(n,0,m)
+    2*2^m*m - 2*2^m + 2
+    2*2^m*m^2 - 4*2^m*m + 6*2^m - 6
+    2*2^m*m^3 - 6*2^m*m^2 + 18*2^m*m - 26*2^m + 26
+    sage: (1 / (n^2 + sqrt(5)*n - 1)).gosper_sum(n,0,m) # known bug
+    ....:                            # TODO: algebraic solutions
+    sage: check((n^4 * 4^n / binomial(2*n, n)), n, 0, 10, 20)
+    sage: check((factorial(3*n) / (factorial(n) * factorial(n+1) * factorial(n+2) * 27^n)), n,0,10,20)
+    sage: (binomial(2*n, n)^2 / (n+1) / 4^(2*n)).gosper_sum(n,0,m)
+    (2*m + 1)^2*binomial(2*m, m)^2/(4^(2*m)*(m + 1))
+    sage: (((4*n-1) * binomial(2*n, n)^2) / (2*n-1)^2 / 4^(2*n)).gosper_sum(n,0,m)
+    -binomial(2*m, m)^2/4^(2*m)
+    sage: check(n * factorial(n-1/2)^2 / factorial(n+1)^2, n,0,10,20)
+
+    sage: (n^2 * a^n).gosper_sum(n,0,m)
+    (a^2*a^m*m^2 - 2*a*a^m*m^2 - 2*a*a^m*m + a^m*m^2 + a*a^m + 2*a^m*m + a^m - a - 1)*a/(a - 1)^3
+    sage: ((n - r/2)*binomial(r, n)).gosper_sum(n,0,m)
+    1/2*(m - r)*binomial(r, m)
+    sage: x = var('x')
+    sage: (factorial(n-1)^2 / factorial(n-x) / factorial(n+x)).gosper_sum(n,1,m)
+    (m^2*factorial(m - 1)^2*factorial(x + 1)*factorial(-x + 1) + x^2*factorial(m + x)*factorial(m - x) - factorial(m + x)*factorial(m - x))/(x^2*factorial(m + x)*factorial(m - x)*factorial(x + 1)*factorial(-x + 1))
+    sage: ((n*(n+a+b)*a^n*b^n)/factorial(n+a)/factorial(n+b)).gosper_sum(n,1,m).simplify_full()  # long time
+    -(a^(m + 1)*b^(m + 1)*factorial(a - 1)*factorial(b - 1) - factorial(a + m)*factorial(b + m))/(factorial(a + m)*factorial(a - 1)*factorial(b + m)*factorial(b - 1))
+
+    sage: check_unsolvable(1/n, n,1,m)
+    sage: check_unsolvable(1/n^2, n,1,m)
+    sage: check_unsolvable(1/n^3, n,1,m)
+    sage: ((6*n + 3) / (4*n^4 + 8*n^3 + 8*n^2 + 4*n + 3)).gosper_sum(n,1,m)
+    (m + 2)*m/(2*m^2 + 4*m + 3)
+    sage: (2^n * (n^2 - 2*n - 1)/(n^2 * (n+1)^2)).gosper_sum(n,1,m)
+    -2*(m^2 - 2^m + 2*m + 1)/(m + 1)^2
+    sage: ((4^n * n^2)/((n+2) * (n+1))).gosper_sum(n,1,m)
+    2/3*(2*4^m*m - 2*4^m + m + 2)/(m + 2)
+    sage: check_unsolvable(2^n / (n+1), n,0,m-1)
+    sage: check((4*(1-n) * (n^2-2*n-1) / n^2 / (n+1)^2 / (n-2)^2 / (n-3)^2), n, 4, 10, 20)
+    sage: check(((n^4-14*n^2-24*n-9) * 2^n / n^2 / (n+1)^2 / (n+2)^2 / (n+3)^2), n, 1, 10, 20)
+
+Exercises 3 (h), (i), (j) require symbolic product support so we leave
+them out for now.
+
+::
+
+    sage: _ = var('a b k m n r')
+    sage: check_unsolvable(binomial(2*n, n) * a^n, n)
+    sage: (binomial(2*n,n)*(1/4)^n).gosper_sum(n)
+    2*(1/4)^n*n*binomial(2*n, n)
+    sage: ((k-1) / factorial(k)).gosper_sum(k)
+    -k/factorial(k)
+    sage: F(n, k) = binomial(n, k) / 2^n
+    sage: check_unsolvable(F(n, k), k)
+    sage: _ = (F(n+1,k)-F(n,k)).gosper_term(k)
+    sage: F(n,k).WZ_certificate(n,k)
+    1/2*k/(k - n - 1)
+    sage: F(n, k) = binomial(n, k)^2 / binomial(2*n, n)
+    sage: check_unsolvable(F(n, k), k)
+    sage: _ =(F(n+1, k) - F(n, k)).gosper_term(k)
+    sage: F(n,k).WZ_certificate(n,k)
+    1/2*(2*k - 3*n - 3)*k^2/((k - n - 1)^2*(2*n + 1))
+    sage: F(n, k) = binomial(n,k) * factorial(n) / factorial(k) / factorial(a-k) / factorial(a+n)
+    sage: check_unsolvable(F(n, k), k)
+    sage: _ = (F(n+1, k) - F(n, k)).gosper_term(k)
+    sage: F(n,k).WZ_certificate(n,k)
+    k^2/((a + n + 1)*(k - n - 1))
+
+    sage: (1/n/(n+1)/(n+2)/(n+5)).gosper_sum(n)
+    1/720*(55*n^5 + 550*n^4 + 1925*n^3 + 2510*n^2 - 1728)/((n + 4)*(n + 3)*(n + 2)*(n + 1)*n)
+    sage: (1/n/(n+1)/(n+2)/(n+7)).gosper_sum(n)
+    1/1050*(91*n^7 + 1911*n^6 + 15925*n^5 + 66535*n^4 + 142534*n^3 + 132104*n^2 - 54000)/((n + 6)*(n + 5)*(n + 4)*(n + 3)*(n + 2)*(n + 1)*n)
+    sage: (1/n/(n+1)/(n+2)/(n+5)/(n+7)).gosper_sum(n)
+    1/10080*(133*n^7 + 2793*n^6 + 23275*n^5 + 97755*n^4 + 213472*n^3 + 206892*n^2 - 103680)/((n + 6)*(n + 5)*(n + 4)*(n + 3)*(n + 2)*(n + 1)*n)
+
+The following are from A=B, 7.2 WZ Proofs of the hypergeometric database::
+
+    sage: _ = var('a b c i j k m n r')
+    sage: F(n,k) = factorial(n+k)*factorial(b+k)*factorial(c-n-1)*factorial(c-b-1)/factorial(c+k)/factorial(n-1)/factorial(c-n-b-1)/factorial(k+1)/factorial(b-1)
+    sage: F(n,k).WZ_certificate(n,k)
+    -(c + k)*(k + 1)/((c - n - 1)*n)
+    sage: F(n,k)=(-1)^(n+k)*factorial(2*n+c-1)*factorial(n)*factorial(n+c-1)/factorial(2*n+c-1-k)/factorial(2*n-k)/factorial(c+k-1)/factorial(k)
+    sage: F(n,k).WZ_certificate(n,k)
+    1/2*(c^2 - 2*c*k + k^2 + 7*c*n - 6*k*n + 10*n^2 + 4*c - 3*k + 10*n + 2)*(c + k - 1)*k/((c - k + 2*n + 1)*(c - k + 2*n)*(k - 2*n - 1)*(k - 2*n - 2))
+    sage: F(n,k)=factorial(a+k-1)*factorial(b+k-1)*factorial(n)*factorial(n+c-b-a-k-1)*factorial(n+c-1)/factorial(k)/factorial(n-k)/factorial(k+c-1)/factorial(n+c-a-1)/factorial(n+c-b-1)
+    sage: F(n,k).WZ_certificate(n,k)
+    -(a + b - c + k - n)*(c + k - 1)*k/((a - c - n)*(b - c - n)*(k - n - 1))
+    sage: F(n,k)=(-1)^k*binomial(n+b,n+k)*binomial(n+c,c+k)*binomial(b+c,b+k)/factorial(n+b+c)*factorial(n)*factorial(b)*factorial(c)
+    sage: F(n,k).WZ_certificate(n,k)
+    1/2*(b + k)*(c + k)/((b + c + n + 1)*(k - n - 1))
+    sage: phi(t) = factorial(a+t-1)*factorial(b+t-1)/factorial(t)/factorial(-1/2+a+b+t)
+    sage: psi(t) = factorial(t+a+b-1/2)*factorial(t)*factorial(t+2*a+2*b-1)/factorial(t+2*a-1)/factorial(t+a+b-1)/factorial(t+2*b-1)
+    sage: F(n,k) = phi(k)*phi(n-k)*psi(n)
+    sage: F(n,k).WZ_certificate(n,k)
+    (2*a + 2*b + 2*k - 1)*(2*a + 2*b - 2*k + 3*n + 2)*(a - k + n)*(b - k + n)*k/((2*a + 2*b - 2*k + 2*n + 1)*(2*a + n)*(a + b + n)*(2*b + n)*(k - n - 1))
+
+The following are also from A=B, 7 The WZ Phenomenon::
+
+    sage: F(n,k) = factorial(n-i)*factorial(n-j)*factorial(i-1)*factorial(j-1)/factorial(n-1)/factorial(k-1)/factorial(n-i-j+k)/factorial(i-k)/factorial(j-k)
+    sage: F(n,k).WZ_certificate(n,k)
+    (k - 1)/n
+    sage: F(n,k) = binomial(3*n,k)/8^n
+    sage: F(n,k).WZ_certificate(n,k)
+    1/8*(4*k^2 - 30*k*n + 63*n^2 - 22*k + 93*n + 32)*k/((k - 3*n - 1)*(k - 3*n - 2)*(k - 3*n - 3))
+
+Example 7.5.1 gets a different but correct certificate (the certificate
+in the book fails the proof)::
+
+    sage: F(n,k) = 2^(k+1)*(k+1)*factorial(2*n-k-2)*factorial(n)/factorial(n-k-1)/factorial(2*n)
+    sage: c = F(n,k).WZ_certificate(n,k); c
+    -1/2*(k - 2*n + 1)*k/((k - n)*(2*n + 1))
+    sage: G(n,k) = c*F(n,k)
+    sage: t = (F(n+1,k) - F(n,k) - G(n,k+1) + G(n,k))
+    sage: t.simplify_full().is_trivial_zero()  # long time
+    True
+    sage: c = k/2/(-1+k-n)
+    sage: GG(n,k) = c*F(n,k)
+    sage: t = (F(n+1,k) - F(n,k) - GG(n,k+1) + GG(n,k))
+    sage: t.simplify_full().is_trivial_zero()  # long time
+    False
+"""

sage/tests/lazy_imports.py

@@ -0,0 +1,28 @@
+# sage_setup: distribution = sagemath-repl
+# sage.doctest: needs sage.all
+r"""
+TESTS:
+
+Check that all non deprecated lazy imports resolve correctly. We avoid libgiac
+on purpose because it does print stuff, see :issue:`31655`.::
+
+    sage: from sage.misc.lazy_import import LazyImport
+    sage: G = globals()
+    sage: for name, obj in sorted(G.items()):
+    ....:     if name == 'libgiac':
+    ....:          continue
+    ....:     if type(obj) is LazyImport and obj._get_deprecation_issue() == 0:
+    ....:         try:
+    ....:             _ = obj._get_object()
+    ....:         except Exception as e:
+    ....:             print('{} does not resolve: {}'.format(name, e))
+
+Check that all deprecated lazy imports resolve correctly::
+
+    sage: import warnings
+    sage: for name, obj in sorted(G.items()):
+    ....:     if type(obj) is LazyImport and obj._get_deprecation_issue() != 0:
+    ....:         with warnings.catch_warnings(record=True) as w:
+    ....:             _ = obj._get_object()
+    ....:             assert w[0].category == DeprecationWarning
+"""

sage/tests/modular_group_cohomology.py

@@ -0,0 +1,80 @@
+# sage_setup: distribution = sagemath-repl
+# sage.doctest: optional - p_group_cohomology
+r"""
+Tests for the optional ``p_group_cohomology`` package.
+
+AUTHOR:
+
+- Simon King
+
+TESTS::
+
+    sage: from pGroupCohomology import CohomologyRing
+
+Computation of a modular cohomology ring of a prime power group in
+characteristic 2, and comparison with stored result in a database::
+
+    sage: CohomologyRing.set_workspace(tmp_dir())
+    sage: H = CohomologyRing(64,14,from_scratch=True)
+    sage: H.make()
+    sage: CohomologyRing.set_workspace(tmp_dir())
+    sage: H0 = CohomologyRing(64,14)
+    sage: H.is_isomorphic(H0)
+    ('1*a_2_1', '1*c_2_2', '1*c_4_4', '1*a_1_0', '1*a_1_1', '1*a_3_3')
+
+Computation of a modular cohomology ring of a prime power group in odd
+characteristic, and some algebraic constructions in the cohomology
+ring::
+
+    sage: H = CohomologyRing(27,4)
+    sage: H.make()
+    sage: print(H)
+    <BLANKLINE>
+    Cohomology ring of Extraspecial 3-group of order 27
+    and exponent 9 with coefficients in GF(3)
+    <BLANKLINE>
+    Computation complete
+    Minimal list of generators:
+    [b_2_1: 2-Cocycle in H^*(M27; GF(3)),
+     c_6_2: 6-Cocycle in H^*(M27; GF(3)),
+     a_1_0: 1-Cocycle in H^*(M27; GF(3)),
+     a_1_1: 1-Cocycle in H^*(M27; GF(3)),
+     a_3_1: 3-Cocycle in H^*(M27; GF(3)),
+     a_5_1: 5-Cocycle in H^*(M27; GF(3))]
+    Minimal list of algebraic relations:
+    [b_2_1*a_1_0,
+     a_1_0*a_3_1,
+     b_2_1*a_3_1,
+     a_1_0*a_5_1,
+     a_3_1*a_5_1]
+    sage: H.5.massey_power()
+    <a_3_1; 1>: 8-Cocycle in H^*(M27; GF(3))
+    sage: H.5.massey_power().as_polynomial()
+    '-c_6_2*a_1_0*a_1_1'
+    sage: H.essential_ideal()
+    a_1_0*a_1_1,
+    a_1_1*a_3_1
+    sage: ascii_art(H.bar_code('LowerCentralSeries')[2])        # known bug
+        *
+      *-*
+      *-*
+    *
+
+Computation of a modular cohomology ring of a non prime power group in
+characteristic 2::
+
+    sage: H = CohomologyRing(libgap.AlternatingGroup(6),
+    ....:                    GroupName='A(6)', prime=2,
+    ....:                    from_scratch=True)
+    sage: H.make()
+    sage: print(H)
+    Cohomology ring of A(6) with coefficients in GF(2)
+    <BLANKLINE>
+    Computation complete
+    Minimal list of generators:
+    [c_2_0: 2-Cocycle in H^*(A(6); GF(2)),
+     b_3_0: 3-Cocycle in H^*(A(6); GF(2)),
+     b_3_1: 3-Cocycle in H^*(A(6); GF(2))]
+    Minimal list of algebraic relations:
+    [b_3_0*b_3_1]
+"""

sage/tests/numpy.py

@@ -0,0 +1,21 @@
+# sage_setup: distribution = sagemath-repl
+# sage.doctest: needs numpy
+r"""
+TESTS:
+
+Sage integers can index NumPy matrices (see :issue:`10928`)::
+
+    sage: import numpy as np
+    sage: m = np.matrix(np.arange(4).reshape(2, 2))
+    sage: a = m[:, int(0)]
+    sage: b = m[:, Integer(0)]
+    sage: a.shape, b.shape
+    ((2, 1), (2, 1))
+    sage: print('{}\n{}\n{}'.format(m, a, b))
+    [[0 1]
+     [2 3]]
+    [[0]
+     [2]]
+    [[0]
+     [2]]
+"""

sage/tests/parigp.py

@@ -0,0 +1,76 @@
+# sage_setup: distribution = sagemath-repl
+# sage.doctest: needs sage.libs.pari sage.modules
+r"""
+This file is meant to catch errors in the PARI/GP package which are not
+caught by any other tests.
+
+Check that :issue:`9876` has been fixed, this test comes from PARI's
+self-test :pari:`rnfkummer` but was modified such that the answer is
+canonical::
+
+    sage: pari('K = bnfinit(y^4-52*y^2+26,1); pol = rnfkummer(bnrinit(K,3,1),Mat(5)); L = rnfinit(K, [pol, 10^6]); polredabs(polredbest(L.polabs))')  # long time
+    x^20 - 112*x^18 + 5108*x^16 - 123460*x^14 + 1724337*x^12 - 14266996*x^10 + 69192270*x^8 - 188583712*x^6 + 260329852*x^4 - 141461008*x^2 + 19860776
+
+Check that :issue:`10195` (PARI bug 1153) has been fixed::
+
+    sage: print(gp.eval("mathnf([0,0,0,0,0,0,0,0,0,13;0,0,0,0,0,0,0,0,23,6;0,0,0,0,0,0,0,23,-4,-7;0,0,0,0,0,0,17,-3,5,-5;0,0,0,0,0,56,16,-16,-15,-17;0,0,0,0,57,24,-16,-25,2,-21;0,0,0,114,9,56,51,-52,25,-55;0,0,113,-31,-11,24,0,28,34,-16;0,50,3,2,16,-6,-2,7,-19,-21;118,43,51,23,37,-52,18,38,51,28],0)"))
+    [787850171872400 32189386376004 356588299060422 742392731867995 282253457851430 665185047494955 664535243562463 744564809133574 113975061998590 527459013372200]
+    [0 12 6 11 5 3 7 6 6 0]
+    [0 0 3 1 2 1 1 0 0 0]
+    [0 0 0 1 0 0 0 0 0 0]
+    [0 0 0 0 1 0 0 0 0 0]
+    [0 0 0 0 0 1 0 0 0 0]
+    [0 0 0 0 0 0 1 0 0 0]
+    [0 0 0 0 0 0 0 1 0 0]
+    [0 0 0 0 0 0 0 0 1 0]
+    [0 0 0 0 0 0 0 0 0 1]
+
+Check that :issue:`11604` (PARI bug 1154) has been fixed::
+
+    sage: A = Matrix(ZZ,4,4,[32982266684193100, 1368614777139719, 224591013270052693, 276460184982223238,1368614777139719,  56791380087354, 9319512049770279, 11471848267545007,224591013270052693, 9319512049770279,1529340971891522140, 1882541434053596358,276460184982223238, 11471848267545007, 1882541434053596358, 2317313350044091414])
+    sage: pari(A).qfminim(2,0)
+    [0, 0, [;]]
+
+Check :issue:`13314`, the following should not give a
+Segmentation Fault::
+
+    sage: x = polygen(ComplexField(128))
+    sage: p = x^84 + (16*x^4 - 1)^20 * (2^48*x^4 - 2049^4)
+    sage: len(pari(p).polroots(precision=128))
+    84
+
+Check that the optional PARI databases work::
+
+    sage: # optional - pari_elldata
+    sage: gp.ellinit('"299998a1"')
+    [1, 0, 1, 110, -3660, ...]
+    sage: E = EllipticCurve("1728ba1")                                                  # needs sage.schemes
+    sage: gp(E).ellidentify()                                                           # needs sage.schemes
+    [["1728ba1", [0, 0, 0, -6, 6], [[1, 1]]], [1, 0, 0, 0]]
+
+    sage: pari("ellmodulareqn(211)")                            # optional - pari_seadata
+    [x^212 + (-y^7 + 5207*y^6 - 10241606*y^5 + 9430560101*y^4 - 4074860204015*y^3
+      + 718868274900397*y^2 - 34897101275826114*y + 104096378056356968)*x^211...
+
+The following requires the modular polynomials up to degree 223, while
+only those up to degree 199 come standard in Sage::
+
+    sage: p = next_prime(2^328)
+    sage: E = EllipticCurve(GF(p), [6,1])                                               # needs sage.schemes
+    sage: E.cardinality()  # long time (108s on sage.math, 2013), optional - pari_seadata, needs sage.schemes
+    546812681195752981093125556779405341338292357723293496548601032930284335897180749997402596957976244
+
+Create a number field with Galois group `A4`. Group `A4` corresponds to
+transitive group `(12,3)` in GAP::
+
+    sage: # optional - pari_galpol
+    sage: R.<x> = PolynomialRing(ZZ)
+    sage: pol = pari("galoisgetpol(12,3)[1]")
+    sage: K.<a> = NumberField(R(pol))
+    sage: factor(K.discriminant())
+    163^8
+    sage: [F.degree() for F,a,b in K.subfields()]
+    [1, 3, 4, 4, 4, 4, 6, 6, 6, 12]
+    sage: sorted([12/H.cardinality() for H in AlternatingGroup(4).subgroups()])
+    [1, 3, 4, 4, 4, 4, 6, 6, 6, 12]
+"""

sage/tests/startup.py

@@ -0,0 +1,27 @@
+# sage_setup: distribution = sagemath-repl
+r"""
+Ensure that certain modules are not loaded on startup.
+
+Check that IPython is not imported at startup (:issue:`18726`). It is
+imported by the doctest framework, so the simple test like above would
+not work. Instead, we test this by starting a new Python process::
+
+    sage: from sage.tests.cmdline import test_executable
+    sage: environment = "sage.all"
+    sage: cmd = f"from {environment} import *\nprint('IPython' in sys.modules)\n"
+    sage: print(test_executable(["sage", "--python"], cmd)[0])  # long time
+    False
+
+Check that numpy (:issue:`11714`) and pyparsing are not imported on startup
+as they increase the startup time. Since :issue:`23696` those are imported
+by the doctest framework via a matplotlib import. Again the simple test
+would not work (but we don't have to avoid loading IPython)::
+
+    sage: from sage.tests.cmdline import test_executable
+    sage: cmd = "print('numpy' in sys.modules)\n"
+    sage: print(test_executable(["sage", "-c", cmd])[0])  # long time
+    False
+    sage: cmd = "print('pyparsing' in sys.modules)\n"
+    sage: print(test_executable(["sage", "-c", cmd])[0])  # long time
+    False
+"""

sage/tests/symbolic-series.py

@@ -0,0 +1,76 @@
+# sage_setup: distribution = sagemath-repl
+# sage.doctest: needs sage.symbolic
+"""
+Tests for the fast univariate series expansion in Pynac
+-------------------------------------------------------
+
+This is a transcription of part of a testsuite that was
+originally written for Symengine. Instead of matching
+the first few terms of the expansion we pick specific
+coefficients and compare to known values.
+
+AUTHORS
+-------
+(c) 2016 Ralf Stephan <ralf@ark.in-berlin.de>
+
+See https://github.com/symengine/symengine/blob/master/symengine/tests/basic/
+
+TESTS::
+
+    sage: def test(ex, coeff, value):
+    ....:     assert(ex.series(x, coeff+3).coefficient(x,coeff) == value)
+
+    sage: test(sin(x), 9, 1/362880)
+    sage: test(sin(x)+cos(x), 8, 1/40320)
+    sage: test(sin(x)*cos(x), 11, -4/155925)
+    sage: test(sin(atan(x)), 27, -1300075/8388608)
+    sage: test(cos(x/(1-x)), 11, -125929/362880)
+    sage: test(1/(1-x), 99, 1)
+    sage: test(x/(1-x-x^2), 35, 9227465)
+    sage: test(x^3/(1-2*x^2), 49, 8388608)
+    sage: test(1/(1-sin(x)), 10, 1382/14175)
+    sage: test(1/x, -1, 1)
+    sage: test(1/x/(1-x), 0, 1)
+    sage: test(sqrt(4-x), 6, -21/2097152)
+    sage: test((1-x)^(-2/3), 10, 1621477/4782969)
+    sage: test(sqrt(1-x), 10, -2431/262144)
+    sage: test(sqrt(cos(x)), 8, -559/645120)
+    sage: test(cos(x)^(-2/3), 10, 701/127575)
+    sage: test(log(1+x), 98, -1/98)
+    sage: test(log(cos(x)), 12, -691/935550)
+    sage: test(log(1/(1-x)), 48, 1/48)
+    sage: test(exp(x), 9, 1/362880)
+    sage: test(exp(log(1+x)), 0, 1)
+    sage: test(exp(log(1+x)), 1, 1)
+    sage: test(log(exp(x)), 1, 1)
+    sage: test(exp(sin(x)), 10, -2951/3628800)
+    sage: test(cos(x)^sin(x), 16, 1381/2661120)
+    sage: test(tan(x), 13, 21844/6081075)
+    sage: test(tan(x/(1-x)), 12, 1303712/14175)
+    sage: test(cot(x), 13, -4/18243225)
+    sage: test(cot(log(1+x)), 8, 4399/41472)
+    sage: test(sec(x), 14, 199360981/87178291200)
+    sage: test(sec(x*sqrt(1-x)), 11, -21463/103680)
+    sage: test(csc(x), 13, 8191/37362124800)
+    sage: test(csc(x/(1-x)), 14, 355857510913/100590336000)
+    sage: test(asin(x), 15, 143/10240)
+    sage: test(asin(x/(1-x)), 16, 1259743/2048)
+    sage: test(atan(x), 19, -1/19)
+    sage: test(atan(x/(1-x)), 33, 65536/33)
+    sage: test(sinh(x), 9, 1/362880)
+    sage: test(sinh(x/(1-x)), 10, 325249/40320)
+    sage: test(cosh(x), 10, 1/3628800)
+    sage: test(cosh(x/(1-x)), 11, 3756889/362880)
+    sage: test(tanh(x), 13, 21844/6081075)
+    sage: test(tanh(x/(1-x)), 14, 225979/66825)
+    sage: test(coth(x), 13, 4/18243225)
+    sage: test(coth(x/(1-x)), 14, -3651803/16372125)
+    sage: test(sech(x), 16, 3878302429/4184557977600)
+    sage: test(sech(x/(1-x)), 16, -34746888589811/4184557977600)
+    sage: test(csch(x), 13, -8191/37362124800)
+    sage: test(csch(x/(1-x)), 14, 2431542527/11176704000)
+    sage: test(atanh(x), 99, 1/99)
+    sage: test(atanh(x/(1-x)), 16, 2048)
+    sage: test(asinh(x), 15, -143/10240)
+    sage: test(asinh(x/(1-x)), 16, -3179/2048)
+"""

sage/tests/sympy.py

@@ -0,0 +1,16 @@
+# sage_setup: distribution = sagemath-repl
+# sage.doctest: optional - sympy
+r"""
+TESTS:
+
+Checking that sympy handles correctly Sage real numbers as
+coefficients of polynomials (see :issue:`24380`)::
+
+    sage: import sympy, sympy.polys
+    sage: x = sympy.Symbol('x')
+    sage: p = sympy.polys.Poly(x**2 - 2.0)
+    sage: p
+    Poly(1.0*x**2 - 2.0, x, domain='RR')
+    sage: p.coeffs()
+    [1.00000000000000, -2.00000000000000]
+"""

sage/tests/test_deprecation.py

@@ -0,0 +1,31 @@
+# sage_setup: distribution = sagemath-repl
+"""
+Tests Deprecation
+
+EXAMPLES::
+
+    sage: import sage.tests.test_deprecation
+    sage: sage.tests.test_deprecation.function_old()
+    doctest:...: DeprecationWarning: function_old is deprecated. Please
+    use sage.tests.test_deprecation.function_new instead.
+    See https://github.com/sagemath/sage/issues/12345 for details.
+"""
+from sage.misc.superseded import deprecated_function_alias
+
+
+def function_new():
+    """
+    New function, deprecating ``old_function``.
+
+    EXAMPLES::
+
+        sage: from sage.tests.test_deprecation import function_old
+        sage: function_old()
+        doctest:...: DeprecationWarning: function_old is deprecated. Please
+        use sage.tests.test_deprecation.function_new instead.
+        See https://github.com/sagemath/sage/issues/12345 for details.
+    """
+    pass
+
+
+function_old = deprecated_function_alias(12345, function_new)