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

sage/tests/books/computational-mathematics-with-sagemath/sol/linsolve_doctest.py

@@ -0,0 +1,25 @@
+# sage_setup: distribution = sagemath-repl
+"""
+This file (./sol/linsolve_doctest.sage) was *autogenerated* from ./sol/linsolve.tex,
+with sagetex.sty version 2011/05/27 v2.3.1.
+It contains the contents of all the sageexample environments from this file.
+You should be able to doctest this file with:
+sage -t ./sol/linsolve_doctest.sage
+It is always safe to delete this file; it is not used in typesetting your
+document.
+
+Sage example in ./sol/linsolve.tex, line 72::
+
+  sage: m = random_matrix(RDF,4)
+  sage: a = transpose(m)*m
+  sage: c = a.cholesky()
+  sage: U,S,V = c.SVD()
+  sage: X = U*S*transpose(U)
+
+Sage example in ./sol/linsolve.tex, line 84::
+
+  sage: M = (X*X-a)
+  sage: all(abs(M[i,j]) < 10^-13
+  ....:     for i in range(4) for j in range(4) )
+  True
+"""

sage/tests/books/computational-mathematics-with-sagemath/sol/lp_doctest.py

@@ -0,0 +1,47 @@
+# sage_setup: distribution = sagemath-repl
+"""
+This file (./sol/lp_doctest.sage) was *autogenerated* from ./sol/lp.tex,
+with sagetex.sty version 2011/05/27 v2.3.1.
+It contains the contents of all the sageexample environments from this file.
+You should be able to doctest this file with:
+sage -t ./sol/lp_doctest.sage
+It is always safe to delete this file; it is not used in typesetting your
+document.
+
+Sage example in ./sol/lp.tex, line 1::
+
+  sage: sage.numerical.backends.generic_backend.default_solver = "Glpk"
+
+Sage example in ./sol/lp.tex, line 28::
+
+  sage: l = [28, 10, -89, 69, 42, -37, 76, 78, -40, 92, -93, 45]
+  sage: p = MixedIntegerLinearProgram()
+  sage: b = p.new_variable(binary = True)
+  sage: p.add_constraint(p.sum([ v*b[v] for v in l ]) == 0)
+  sage: p.add_constraint(p.sum([ b[v] for v in l ]) >= 1)
+  sage: p.solve()
+  0.0
+  sage: b = p.get_values(b, convert=ZZ, tolerance=1e-3)
+  sage: len([v for v in b if b[v] == 1])
+  5
+  sage: sum([v for v in b if b[v] == 1])
+  0
+
+Sage example in ./sol/lp.tex, line 64::
+
+  sage: g = graphs.PetersenGraph()
+  sage: p = MixedIntegerLinearProgram(maximization = False)
+  sage: b = p.new_variable(binary = True)
+  sage: for v in g:
+  ....:     p.add_constraint( p.sum([b[u] for u in g.neighbors(v)])
+  ....:                       + b[v] >= 1)
+  sage: p.set_objective( p.sum([ b[v] for v in g ]) )
+  sage: p.solve()
+  3.0
+  sage: b = p.get_values(b, convert=ZZ, tolerance=1e-3)
+  sage: dom = [v for v in b if b[v] == 1]
+  sage: len(dom)
+  3
+  sage: all((v in dom or any(g.has_edge(x,v) for x in dom)) for v in g)
+  True
+"""

sage/tests/books/computational-mathematics-with-sagemath/sol/mpoly_doctest.py

@@ -0,0 +1,115 @@
+# sage_setup: distribution = sagemath-repl
+"""
+This file (./sol/mpoly_doctest.sage) was *autogenerated* from ./sol/mpoly.tex,
+with sagetex.sty version 2011/05/27 v2.3.1.
+It contains the contents of all the sageexample environments from this file.
+You should be able to doctest this file with:
+sage -t ./sol/mpoly_doctest.sage
+It is always safe to delete this file; it is not used in typesetting your
+document.
+
+Sage example in ./sol/mpoly.tex, line 27::
+
+  sage: ring = QQ['x,y,z']; deg = 2
+  sage: tmp1 = [(x,)*deg for x in (1,) + ring.gens()]; tmp1
+  [(1, 1), (x, x), (y, y), (z, z)]
+  sage: tmp2 = flatten(tmp1); tmp2
+  [1, 1, x, x, y, y, z, z]
+  sage: monomials = Subsets(tmp2, deg, submultiset=True); monomials
+  SubMultiset of [1, 1, x, x, y, y, z, z] of size 2
+  sage: monomials.list()
+  [[1, 1], [1, x], [1, y], [1, z], [x, x], [x, y], [x, z], [y, y], [y, z], [z, z]]
+
+Sage example in ./sol/mpoly.tex, line 98::
+
+  sage: ['x%d' % n for n in [2,3,5,7]]
+  ['x2', 'x3', 'x5', 'x7']
+  sage: R = PolynomialRing(QQ, ['x%d' % n for n in primes(40)])
+  sage: R.inject_variables()
+  Defining x2, x3, x5, x7, x11, x13, x17, x19, x23, x29, x31, x37
+
+Sage example in ./sol/mpoly.tex, line 116::
+
+  sage: R.<x,y,z> = QQ[]
+  sage: J = R.ideal(x^2*y*z-18, x*y^3*z-24, x*y*z^4-6)
+  sage: J.variety(AA)
+  [{z: 1, y: 2, x: 3}]
+
+Sage example in ./sol/mpoly.tex, line 124::
+
+  sage: V = J.variety(QQbar)
+  sage: [u for u in V if all(a in AA for a in u.values())]
+  [{z: 1, y: 2, x: 3}]
+
+Sage example in ./sol/mpoly.tex, line 137::
+
+  sage: M = matrix([ [p.degree(v) for v in (x,y,z)]
+  ....:              for p in J.gens()]); M
+  [2 1 1]
+  [1 3 1]
+  [1 1 4]
+
+Sage example in ./sol/mpoly.tex, line 146::
+
+  sage: M.det()
+  17
+
+Sage example in ./sol/mpoly.tex, line 154::
+
+  sage: M.change_ring(GF(17)).right_kernel()
+  Vector space of degree 3 and dimension 1 over Finite Field of size 17
+  Basis matrix:
+  [1 9 6]
+
+Sage example in ./sol/mpoly.tex, line 166::
+
+  sage: L.<a> = QQ[sqrt(2-sqrt(3))]; L
+    Number Field in a with defining polynomial x^4 - 4*x^2 + 1 with a = 0.5176380902050415?
+  sage: R.<x,y> = QQ[]
+  sage: J1 = (x^2 + y^2 - 1, 16*x^2*y^2 - 1)*R
+  sage: sorted(J1.variety(L), key=str)
+  [{y: -1/2*a, x: -1/2*a^3 + 2*a},
+   {y: -1/2*a, x: 1/2*a^3 - 2*a},
+   {y: -1/2*a^3 + 2*a, x: -1/2*a},
+   {y: -1/2*a^3 + 2*a, x: 1/2*a},
+   {y: 1/2*a, x: -1/2*a^3 + 2*a},
+   {y: 1/2*a, x: 1/2*a^3 - 2*a},
+   {y: 1/2*a^3 - 2*a, x: -1/2*a},
+   {y: 1/2*a^3 - 2*a, x: 1/2*a}]
+
+Sage example in ./sol/mpoly.tex, line 191::
+
+  sage: R.<x,y> = QQ[]; J2 = (x^2+y^2-1, 4*x^2*y^2-1)*R
+  sage: basis = J2.normal_basis(); basis
+  [x*y^3, y^3, x*y^2, y^2, x*y, y, x, 1]
+
+Sage example in ./sol/mpoly.tex, line 200::
+
+  sage: xbasis = [(x*p).reduce(J2) for p in basis]; xbasis
+  [1/4*y, x*y^3, 1/4, x*y^2, -y^3 + y, x*y, -y^2 + 1, x]
+  sage: mat = matrix([ [xp[q] for q in basis]
+  ....:                       for xp in xbasis])
+  sage: mat
+  [  0   0   0   0   0 1/4   0   0]
+  [  1   0   0   0   0   0   0   0]
+  [  0   0   0   0   0   0   0 1/4]
+  [  0   0   1   0   0   0   0   0]
+  [  0  -1   0   0   0   1   0   0]
+  [  0   0   0   0   1   0   0   0]
+  [  0   0   0  -1   0   0   0   1]
+  [  0   0   0   0   0   0   1   0]
+
+Sage example in ./sol/mpoly.tex, line 219::
+
+  sage: charpoly = mat.characteristic_polynomial(); charpoly
+  x^8 - 2*x^6 + 3/2*x^4 - 1/2*x^2 + 1/16
+  sage: solve(SR(charpoly), SR(x))
+  [x == -1/2*sqrt(2), x == 1/2*sqrt(2)]
+
+Sage example in ./sol/mpoly.tex, line 278::
+
+  sage: R.<s, c, u, v> = PolynomialRing(QQ, order='lex')
+  sage: Rel = ideal(u-(s+c), v-(2*s*c+c^2-s^2), s^2+c^2-1)
+  sage: Rel.reduce(s^6)
+  1/16*u^2*v^2 - 3/8*u^2*v + 7/16*u^2 + 1/8*v^2 - 1/8*v - 1/8
+"""

sage/tests/books/computational-mathematics-with-sagemath/sol/nonlinear_doctest.py

@@ -0,0 +1,111 @@
+# sage_setup: distribution = sagemath-repl
+"""
+This file (./sol/nonlinear_doctest.sage) was *autogenerated* from ./sol/nonlinear.tex,
+with sagetex.sty version 2011/05/27 v2.3.1.
+It contains the contents of all the sageexample environments from this file.
+You should be able to doctest this file with:
+sage -t ./sol/nonlinear_doctest.sage
+It is always safe to delete this file; it is not used in typesetting your
+document.
+
+Sage example in ./sol/nonlinear.tex, line 17::
+
+  sage: def intervalgen(f, phi, s, t):
+  ....:     assert (f(s) * f(t) < 0), \
+  ....:            'Wrong arguments: f(%s) * f(%s) >= 0)'%(s, t)
+  ....:     yield s
+  ....:     yield t
+  ....:     while 1:
+  ....:         u = phi(s, t)
+  ....:         yield u
+  ....:         fu = f(u)
+  ....:         if fu == 0:
+  ....:             return
+  ....:         if fu * f(s) < 0:
+  ....:             t = u
+  ....:         else:
+  ....:             s = u
+
+Sage example in ./sol/nonlinear.tex, line 40::
+
+  sage: f(x) = 4 * x - 1
+  sage: a, b = 0, 1
+  sage: phi(s, t) = (s + t) / 2
+  sage: list(intervalgen(f, phi, a, b))
+  [0, 1, 1/2, 1/4]
+
+Sage example in ./sol/nonlinear.tex, line 49::
+
+  sage: from types import GeneratorType, FunctionType
+  sage: def checklength(u, v, w, prec):
+  ....:     return abs(v - u) < 2 * prec
+  sage: def iterate(series, check=checklength, prec=10^-5, maxit=100):
+  ....:     assert isinstance(series, GeneratorType)
+  ....:     assert isinstance(check, FunctionType)
+  ....:     niter = 2
+  ....:     v, w = next(series), next(series)
+  ....:     while (niter <= maxit):
+  ....:         niter += 1
+  ....:         u, v, w = v, w, next(series)
+  ....:         if check(u, v, w, prec):
+  ....:             print('After {0} iterations: {1}'.format(niter, w))
+  ....:             return
+  ....:     print('Failed after {0} iterations'.format(maxit))
+
+Sage example in ./sol/nonlinear.tex, line 76::
+
+  sage: f(x) = 4 * sin(x) - exp(x) / 2 + 1
+  sage: a, b = RR(-pi), RR(pi)
+  sage: def phi(s, t): return RR.random_element(s, t)
+  sage: random = intervalgen(f, phi, a, b)
+  sage: iterate(random, maxit=10000) # random
+  After 19 iterations: 2.15848379485564
+
+Sage example in ./sol/nonlinear.tex, line 93::
+
+  sage: basering.<x> = PolynomialRing(SR, 'x')
+  sage: p = x^2 + x
+  sage: p.roots(multiplicities=False)
+  [-1, 0]
+
+Sage example in ./sol/nonlinear.tex, line 101::
+
+  sage: from collections import deque
+  sage: basering = PolynomialRing(SR, 'x')
+  sage: q, method = None, None
+  sage: def quadraticgen(f, r, s):
+  ....:     global q, method
+  ....:     t = r - f(r) / f.derivative()(r)
+  ....:     method = 'newton'
+  ....:     yield t
+  ....:     pts = deque([(p, f(p)) for p in (r, s, t)], maxlen=3)
+  ....:     while True:
+  ....:         q = basering.lagrange_polynomial(pts)
+  ....:         roots = [r for r in q.roots(multiplicities=False) \
+  ....:                          if CC(r).is_real()]
+  ....:         approx = None
+  ....:         for root in roots:
+  ....:             if (root - pts[2][0]) * (root - pts[1][0]) < 0:
+  ....:                 approx = root
+  ....:                 break
+  ....:             elif (root - pts[0][0]) * (root - pts[1][0]) < 0:
+  ....:                 pts.pop()
+  ....:                 approx = root
+  ....:                 break
+  ....:         if approx:
+  ....:             method = 'quadratic'
+  ....:         else:
+  ....:             method = 'dichotomy'
+  ....:             approx = (pts[1][0] + pts[2][0]) / 2
+  ....:         pts.append((approx, f(approx)))
+  ....:         yield pts[2][0]
+
+Sage example in ./sol/nonlinear.tex, line 141::
+
+  sage: basering = PolynomialRing(SR, 'x')
+  sage: a, b = pi/2, pi
+  sage: f(x) = 4 * sin(x) - exp(x) / 2 + 1
+  sage: generator = quadraticgen(f, a, b)
+  sage: next(generator)
+  1/2*pi - (e^(1/2*pi) - 10)*e^(-1/2*pi)
+"""

sage/tests/books/computational-mathematics-with-sagemath/sol/numbertheory_doctest.py

@@ -0,0 +1,167 @@
+# sage_setup: distribution = sagemath-repl
+"""
+This file (./sol/numbertheory_doctest.sage) was *autogenerated* from ./sol/numbertheory.tex,
+with sagetex.sty version 2011/05/27 v2.3.1.
+It contains the contents of all the sageexample environments from this file.
+You should be able to doctest this file with:
+sage -t ./sol/numbertheory_doctest.sage
+It is always safe to delete this file; it is not used in typesetting your
+document.
+
+Sage example in ./sol/numbertheory.tex, line 9::
+
+  sage: def enum_carmichael(N, verbose=True):
+  ....:    p = 3; s = 0
+  ....:    while p^3 <= N:
+  ....:       s += enum_carmichael_p(N, p, verbose); p = next_prime(p)
+  ....:    return s
+
+Sage example in ./sol/numbertheory.tex, line 26::
+
+  sage: def enum_carmichael_p (n, p, verbose):
+  ....:    a = p; m = p*(p-1); q = p; s = 0
+  ....:    while p*q^2 <= n:
+  ....:       q = next_prime(q)
+  ....:       s += enum_carmichael_pq(n, a, m, p, q, verbose)
+  ....:    return s
+
+Sage example in ./sol/numbertheory.tex, line 52::
+
+  sage: def enum_carmichael_pq(n, a, m, p, q, verbose):
+  ....:    if (a-q) % gcd(m,q*(q-1)) != 0: return 0
+  ....:    s = 0
+  ....:    a = crt (a, q, m, q*(q-1)); m = lcm(m,q*(q-1))
+  ....:    while a <= p*q^2: a += m
+  ....:    for t in range(a, n+1, m):
+  ....:       r = t // (p*q)
+  ....:       if is_prime(r) and t % (r-1) == 1:
+  ....:          if verbose:
+  ....:             print((p*q*r, factor(p*q*r)))
+  ....:          s += 1
+  ....:    return s
+
+Sage example in ./sol/numbertheory.tex, line 68::
+
+  sage: enum_carmichael(10^4)
+  (561, 3 * 11 * 17)
+  (1105, 5 * 13 * 17)
+  (2465, 5 * 17 * 29)
+  (1729, 7 * 13 * 19)
+  (2821, 7 * 13 * 31)
+  (8911, 7 * 19 * 67)
+  (6601, 7 * 23 * 41)
+  7
+  sage: enum_carmichael(10^5, False)
+  12
+  sage: enum_carmichael(10^6, False)
+  23
+  sage: enum_carmichael(10^7, False)
+  47
+
+Sage example in ./sol/numbertheory.tex, line 94::
+
+  sage: def aliq(n):
+  ....:    l = [n]
+  ....:    while n != 1:
+  ....:       n = sigma(n) - n
+  ....:       if n in l: break
+  ....:       l.append(n)
+  ....:    return l
+  sage: l = aliq(840)  # long time
+  sage: len(l), l[:5], l[-5:]  # long time
+  (748, [840, 2040, 4440, 9240, 25320], [2714, 1606, 1058, 601, 1])
+
+Sage example in ./sol/numbertheory.tex, line 106::
+
+  sage: p = points([(i, log(l[i])/log(10)) for i in range(len(l))])  # long time
+
+Sage example in ./sol/numbertheory.tex, line 173::
+
+  sage: def rk_aux(xc, yc, d, r2):
+  ....:     s = 0
+  ....:     xmin = ceil((xc - sqrt(r2))/d)
+  ....:     xmax = floor((xc + sqrt(r2))/d)
+  ....:     for x in range(xmin,xmax+1):
+  ....:         r3 = r2 - (d*x-xc)^2 # (d*y-yc)^2 <= r2 - (d*x-xc)^2
+  ....:         ymin = ceil((yc - sqrt(r3))/d)
+  ....:         ymax = floor((yc + sqrt(r3))/d)
+  ....:         s += ymax + 1 - ymin
+  ....:     return s
+
+Sage example in ./sol/numbertheory.tex, line 219::
+
+  sage: def rk(k): # returns (r_k^2, xc, yc)
+  ....:     if k == 2: return 1/4, 1/2, 0
+  ....:     dmax = (2*sqrt(k/pi)).n(); xamax = (sqrt(2*k/pi)).n()
+  ....:     sol = (dmax/2)^2, 0, 0, 0
+  ....:     for xa in range(0, floor(xamax)+1):
+  ....:         # if xa=0, ya > 0 since A should differ from O
+  ....:         yamin = max(xa, 1)
+  ....:         for ya in range(yamin, floor(sqrt(dmax^2-xa^2))+1):
+  ....:             xbmin = 0 # we want xb*ya <= xa^2+ya^2
+  ....:             if xa == 0:
+  ....:                 xbmin = 1 # O, A, B should not be aligned
+  ....:             xbmax = min(floor(dmax), floor((xa*xa+ya*ya)/ya))
+  ....:             for xb in range(xbmin, xbmax+1):
+  ....:                 ybmax = floor(sqrt(dmax^2-xb^2))
+  ....:                 if xa > 0: # we want xb*ya+yb*xa <= xa^2+ya^2
+  ....:                     tmp = floor((xa*xa+ya*ya-xb*ya)/xa)
+  ....:                     ybmax = min(ybmax, tmp)
+  ....:                 # if xb=0, yb > 0 since B should differ from O
+  ....:                 ybmin = 0
+  ....:                 if xb == 0:
+  ....:                     ybmin = 1
+  ....:                 for yb in range(ybmin,ybmax+1):
+  ....:                     d = 2*abs(xb*ya - xa*yb)
+  ....:                     if d != 0:
+  ....:                         ra2 = xa^2+ya^2; rb2 = xb^2+yb^2
+  ....:                         xc = abs(ra2*yb - rb2*ya)
+  ....:                         yc = abs(rb2*xa - ra2*xb)
+  ....:                         r2 = ra2*rb2*((xa-xb)^2+(ya-yb)^2)
+  ....:                         m = rk_aux(xc,yc,d,r2)
+  ....:                         if m >= k and r2/d^2 < sol[0]:
+  ....:                             sol = r2/d^2, xc/d, yc/d
+  ....:     return sol
+
+Sage example in ./sol/numbertheory.tex, line 253::
+
+  sage: for k in range(2,10): print((k, rk(k)))
+  (2, (1/4, 1/2, 0))
+  (3, (1/2, 1/2, 1/2))
+  (4, (1/2, 1/2, 1/2))
+  (5, (1, 0, 1))
+  (6, (5/4, 1/2, 1))
+  (7, (25/16, 3/4, 1))
+  (8, (2, 1, 1))
+  (9, (2, 1, 1))
+
+Sage example in ./sol/numbertheory.tex, line 283::
+
+  sage: def plotrk(k):
+  ....:    r2, x0, y0 = rk(k); r = n(sqrt(r2))
+  ....:    var('x, y')
+  ....:    c = implicit_plot((x-x0)^2+(y-y0)^2-r2,
+  ....:        (x, x0-r-1/2, x0+r+1/2),(y, y0-r-1/2, y0+r+1/2))
+  ....:    center = points([(x0,y0)], pointsize=50, color='black')
+  ....:    # we want (i-x0)^2+(j-y0)^2 <= r2
+  ....:    # thus |i-x0| <= r and |j-y0| <= r2 - (i-x0)^2
+  ....:    l = [(i, j) for i in range(ceil(x0-r), floor(x0+r)+1)
+  ....:                for j in range(ceil(y0-sqrt(r^2-(i-x0)^2)),
+  ....:                               floor(y0+sqrt(r2-(i-x0)^2))+1)]
+  ....:    d = points(l, pointsize=100)
+  ....:    return (c+center+d).show(aspect_ratio=1, axes=True)
+
+Sage example in ./sol/numbertheory.tex, line 377::
+
+  sage: x1, x2, s2 = var('x1, x2, s2')
+  sage: n1 = 9; C1 = integrate(x1^n1, x1, x2, s2); C1
+  1/10*s2^10 - 1/10*x2^10
+
+Sage example in ./sol/numbertheory.tex, line 390::
+
+  sage: x3, s3 = var('x3, s3')
+  sage: n2 = 7; C2 = integrate(C1.subs(s2=s3-x2)*x2^n2, x2, x3, s3/2); C2
+  44923/229417943040*s3^18 - 1/80*s3^10*x3^8 + 1/9*s3^9*x3^9 - 9/20*s3^8*x3^10
+  + 12/11*s3^7*x3^11 - 7/4*s3^6*x3^12 + 126/65*s3^5*x3^13 - 3/2*s3^4*x3^14
+  + 4/5*s3^3*x3^15 - 9/32*s3^2*x3^16 + 1/17*s3*x3^17
+"""

sage/tests/books/computational-mathematics-with-sagemath/sol/polynomes_doctest.py

@@ -0,0 +1,107 @@
+# sage_setup: distribution = sagemath-repl
+"""
+This file (./sol/polynomes_doctest.sage) was *autogenerated* from ./sol/polynomes.tex,
+with sagetex.sty version 2011/05/27 v2.3.1.
+It contains the contents of all the sageexample environments from this file.
+You should be able to doctest this file with:
+sage -t ./sol/polynomes_doctest.sage
+It is always safe to delete this file; it is not used in typesetting your
+document.
+
+Sage example in ./sol/polynomes.tex, line 10::
+
+  sage: x = polygen(QQ, 'y'); y = polygen(QQ, 'x')
+
+Sage example in ./sol/polynomes.tex, line 78::
+
+  sage: T = sage.symbolic.function_factory.function('T', nargs=2)
+  sage: def to_chebyshev_basis(pol):
+  ....:     (x,) = pol.variables()
+  ....:     res = 0
+  ....:     for n in range(pol.degree(), -1, -1):
+  ....:         quo, pol = pol.quo_rem(chebyshev_T(n, x))
+  ....:         res += quo * T(n, x)
+  ....:     return res
+
+Sage example in ./sol/polynomes.tex, line 105::
+
+  sage: x = polygen(QQ)
+  sage: p = 4*x^6 + 4*x^5 + 1/9*x^4 - 2*x^3 + 2/19*x^2 + 1
+  sage: p_cheb = to_chebyshev_basis(p); p_cheb
+  1/8*T(6, x) + 1/4*T(5, x) + 55/72*T(4, x) + 3/4*T(3, x) +
+  2713/1368*T(2, x) + T(1, x) + 1069/456*T(0, x)
+  sage: p_cheb.substitute_function(T, chebyshev_T).expand()
+  4*x^6 + 4*x^5 + 1/9*x^4 - 2*x^3 + 2/19*x^2 + 1
+
+Sage example in ./sol/polynomes.tex, line 131::
+
+  sage: def mydiv(u, v, n):
+  ....:     v0 = v.constant_coefficient()
+  ....:     quo = 0; rem = u
+  ....:     for k in range(n+1):
+  ....:         c = rem[0]/v0
+  ....:         rem = (rem - c*v) >> 1  # shifting the coefficients
+  ....:         quo += c*x^k
+  ....:     return quo, rem
+
+Sage example in ./sol/polynomes.tex, line 161::
+
+  sage: def mydiv2(u, v, n):
+  ....:     x = u.parent().gen()
+  ....:     quo = (u / (v + O(x^(n+1)))).polynomial()
+  ....:     rem = (u - quo*v) >> (n+1)
+  ....:     return quo, rem
+
+Sage example in ./sol/polynomes.tex, line 179::
+
+  sage: x = polygen(QQ)
+  sage: u = -5*x^10 + 7/2*x^9 + 3*x^8 - x^6 - 1/3*x^5 - x^4 - 1/2*x^3 + 15*x^2 - 1/42*x + 2
+  sage: v = 3*x^4 + 3/8*x^3 - 1/2*x^2 + x + 5/2
+  sage: n = 8
+  sage: q, r = mydiv(u, v, n)
+  sage: u - q*v - x^(n+1)*r
+  0
+  sage: q, r = mydiv2(u, v, n)
+  sage: u - q*v - x^(n+1)*r
+  0
+
+Sage example in ./sol/polynomes.tex, line 296::
+
+  sage: Poly.<x> = Integers(10^5)[]
+  sage: P = x^1000 - 23*x^729 + 5*x^2 - 12*x - 7
+  sage: Quo.<s> = Poly.quo(P)
+  sage: op = s^(10^10000)  # long time
+  sage: add(op[n]*(n+7) for n in range(1000))  # long time
+  63477
+
+Sage example in ./sol/polynomes.tex, line 383::
+
+  sage: from sage.matrix.berlekamp_massey import berlekamp_massey
+  sage: berlekamp_massey([1, 1, 2, 3, 8, 11, 34, 39, 148, 127])
+  x^3 - 5*x + 2
+
+Sage example in ./sol/polynomes.tex, line 408::
+
+  sage: R.<x> = GF(17)[]
+  sage: pairs = [(0,-1), (1,0), (2,7), (3,5)]
+  sage: s = R(QQ['x'].lagrange_polynomial(pairs)); s
+  6*x^3 + 2*x^2 + 10*x + 16
+  sage: [s(i) for i in range(4)]
+  [16, 0, 7, 5]
+
+Sage example in ./sol/polynomes.tex, line 428::
+
+  sage: s.rational_reconstruction(mul(x-i for i in range(4)), 1, 2)
+  (15*x + 2, x^2 + 11*x + 15)
+
+Sage example in ./sol/polynomes.tex, line 454::
+
+  sage: S.<x> = PowerSeriesRing(QQ)
+  sage: t = S(0)
+  sage: for i in range(7): # here t is correct up to degree 2i+1
+  ....:     # with O(x^15) we prevent the truncation order to grow
+  ....:     t = (1+t^2).integral() + O(x^15)
+  sage: t
+  x + 1/3*x^3 + 2/15*x^5 + 17/315*x^7 + 62/2835*x^9 + 1382/155925*x^11
+  + 21844/6081075*x^13 + O(x^15)
+"""

sage/tests/books/computational-mathematics-with-sagemath/sol/recequadiff_doctest.py

@@ -0,0 +1,58 @@
+# sage_setup: distribution = sagemath-repl
+"""
+This file (./sol/recequadiff_doctest.sage) was *autogenerated* from ./sol/recequadiff.tex,
+with sagetex.sty version 2011/05/27 v2.3.1.
+It contains the contents of all the sageexample environments from this file.
+You should be able to doctest this file with:
+sage -t ./sol/recequadiff_doctest.sage
+It is always safe to delete this file; it is not used in typesetting your
+document.
+
+Sage example in ./sol/recequadiff.tex, line 16::
+
+  sage: x = var('x')
+  sage: y = function('y')(x)
+  sage: ed = (desolve(y*diff(y,x)/sqrt(1+y^2) == sin(x),y)); ed
+  sqrt(y(x)^2 + 1) == _C - cos(x)
+
+Sage example in ./sol/recequadiff.tex, line 27::
+
+  sage: c = ed.variables()[0]
+  sage: assume(c-cos(x) > 0)
+  sage: sol = solve(ed,y) ; sol
+  [y(x) == -sqrt(_C^2 - 2*_C*cos(x) + cos(x)^2 - 1),
+   y(x) == sqrt(_C^2 - 2*_C*cos(x) + cos(x)^2 - 1)]
+
+Sage example in ./sol/recequadiff.tex, line 34::
+
+  sage: P = Graphics()
+  sage: for j in [0,1]:
+  ....:   for k in range(0,20,2):
+  ....:     P += plot(sol[j].substitute(c==2+0.25*k).rhs(),x,-3,3)
+  sage: P
+  Graphics object consisting of 20 graphics primitives
+
+Sage example in ./sol/recequadiff.tex, line 52::
+
+  sage: sol = desolve(diff(y,x)==sin(x)/cos(y), y, show_method=True)
+  sage: sol
+  [sin(y(x)) == _C - cos(x), 'separable']
+  sage: solve(sol[0],y)
+  [y(x) == -arcsin(-_C + cos(x))]
+
+Sage example in ./sol/recequadiff.tex, line 80::
+
+  sage: x = var('x')
+  sage: y = function('y')(x)
+  sage: id(x) = x
+  sage: u = function('u')(x)
+  sage: d = diff(u*id,x)
+  sage: DE = (x*y*d == x**2+y**2).substitute(y == u*id)
+  sage: eq = desolve(DE,u)
+  sage: sol = solve(eq,u)
+  sage: sol
+  [u(x) == -sqrt(2*_C + 2*log(x)), u(x) == sqrt(2*_C + 2*log(x))]
+  sage: Y = [x*sol[0].rhs() , x*sol[1].rhs()]
+  sage: Y[0]
+  -sqrt(2*_C + 2*log(x))*x
+"""

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

@@ -0,0 +1 @@
+# sage_setup: distribution = sagemath-repl

sage/tests/books/judson-abstract-algebra/actions-sage-exercises.py

@@ -0,0 +1,51 @@
+# 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
+##
+## Exercises 14.8 Sage Exercises
+##
+r"""
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = Graph([(1,2), (2,3), (3,1)])
+    sage: G.plot()   # not tested
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = graphs.CycleGraph(8)
+    sage: G.add_edges([(0,2),(1,3),(4,6),(5,7)])
+    sage: G.plot()   # not tested
+"""