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

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

@@ -0,0 +1,405 @@
+# sage_setup: distribution = sagemath-repl
+"""
+This file (./polynomes_doctest.sage) was *autogenerated* from ./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 ./polynomes_doctest.sage
+It is always safe to delete this file; it is not used in typesetting your
+document.
+
+Sage example in ./polynomes.tex, line 97::
+
+  sage: x = var('x'); p = (2*x+1)*(x+2)*(x^4-1)
+  sage: print("{} is of degree {}".format(p, p.degree(x)))
+  (x^4 - 1)*(2*x + 1)*(x + 2) is of degree 6
+
+Sage example in ./polynomes.tex, line 123::
+
+  sage: x = polygen(QQ, 'x'); p = (2*x+1)*(x+2)*(x^4-1)
+  sage: print("{} is of degree {}".format(p, p.degree()))
+  2*x^6 + 5*x^5 + 2*x^4 - 2*x^2 - 5*x - 2 is of degree 6
+
+Sage example in ./polynomes.tex, line 167::
+
+  sage: R = PolynomialRing(QQ, 'x')
+  sage: x = R.gen()
+
+Sage example in ./polynomes.tex, line 182::
+
+  sage: x.parent()
+  Univariate Polynomial Ring in x over Rational Field
+
+Sage example in ./polynomes.tex, line 223::
+
+  sage: x = polygen(QQ, 'y'); y = polygen(QQ, 'x')
+
+Sage example in ./polynomes.tex, line 226::
+
+  sage: x^2 + 1
+  y^2 + 1
+  sage: (y^2 + 1).parent()
+  Univariate Polynomial Ring in x over Rational Field
+
+Sage example in ./polynomes.tex, line 233::
+
+  sage: Q.<x> = QQ[]; p = x + 1; x = 2; p = p + x
+
+Sage example in ./polynomes.tex, line 268::
+
+  sage: R.<x,y,z,t> = QQ[]; p = (x+y+z*t)^2
+  sage: p.polynomial(t).reverse()
+  (x^2 + 2*x*y + y^2)*t^2 + (2*x*z + 2*y*z)*t + z^2
+
+Sage example in ./polynomes.tex, line 281::
+
+  sage: x = polygen(QQ); y = polygen(QQ[x], 'y')
+  sage: p = x^3 + x*y + y + y^2; p
+  y^2 + (x + 1)*y + x^3
+  sage: q = QQ['x,y'](p); q
+  x^3 + x*y + y^2 + y
+  sage: QQ['x']['y'](q)
+  y^2 + (x + 1)*y + x^3
+
+Sage example in ./polynomes.tex, line 355::
+
+  sage: def rook_polynomial(n, var='x'):
+  ....:     return ZZ[var]([binomial(n, k)^2 * factorial(k)
+  ....:                                    for k in (0..n) ])
+
+Sage example in ./polynomes.tex, line 452::
+
+  sage: x = polygen(QQ)
+  sage: p = x^2 - 16*x + 3
+  sage: p.factor()
+  x^2 - 16*x + 3
+  sage: p.change_ring(RDF).factor()  # abs tol 2e-15
+  (x - 15.810249675906654) * (x - 0.18975032409334563)
+
+Sage example in ./polynomes.tex, line 476::
+
+  sage: p.change_ring(GF(3))
+  x^2 + 2*x
+
+Sage example in ./polynomes.tex, line 511::
+
+  sage: QQi.<myI> = QQ[I]    # myI is the i of QQi, I that of SR
+  sage: R.<x> = QQi[]; p = (x + 2*myI)^3; p
+  x^3 + 6*I*x^2 - 12*x - 8*I
+  sage: p.map_coefficients(lambda z: z.conjugate())
+  x^3 - 6*I*x^2 - 12*x + 8*I
+
+Sage example in ./polynomes.tex, line 536::
+
+  sage: list(GF(2)['x'].polynomials(of_degree=2))
+  [x^2, x^2 + 1, x^2 + x, x^2 + x + 1]
+
+Sage example in ./polynomes.tex, line 551::
+
+  sage: A = QQ['x']
+  sage: A in Rings() and A.is_noetherian()
+  True
+
+Sage example in ./polynomes.tex, line 559::
+
+  sage: ZZ.is_subring(A)
+  True
+  sage: [n for n in range(20)
+  ....:     if Integers(n)['x'].is_integral_domain()]
+  [0, 2, 3, 5, 7, 11, 13, 17, 19]
+
+Sage example in ./polynomes.tex, line 646::
+
+  sage: R.<t> = Integers(42)[]; (t^20-1) % (t^5+8*t+7)
+  22*t^4 + 14*t^3 + 14*t + 6
+
+Sage example in ./polynomes.tex, line 666::
+
+  sage: ((t^2+t)//t).parent()
+  Univariate Polynomial Ring in t over Ring of integers modulo 42
+  sage: (t^2+t)/t
+  Traceback (most recent call last):
+  ...
+  TypeError: unsupported operand parent(s) for /: 'Univariate Polynomial Ring in t over Ring of integers modulo 42' and 'Univariate Polynomial Ring in t over Ring of integers modulo 42'
+
+Sage example in ./polynomes.tex, line 685::
+
+  sage: x = polygen(QQ); [chebyshev_T(n, x) for n in (0..4)]
+  [1, x, 2*x^2 - 1, 4*x^3 - 3*x, 8*x^4 - 8*x^2 + 1]
+
+Sage example in ./polynomes.tex, line 712::
+
+  sage: S.<x> = ZZ[]; p = 2*(x^10-1)*(x^8-1)
+  sage: p.gcd(p.derivative())
+  2*x^2 - 2
+
+Sage example in ./polynomes.tex, line 736::
+
+  sage: R.<x> = QQ[]; p = x^5-1; q = x^3-1
+  sage: print("the gcd is %s = (%s)*p + (%s)*q" % p.xgcd(q))
+  the gcd is x - 1 = (-x)*p + (x^3 + 1)*q
+
+Sage example in ./polynomes.tex, line 773::
+
+  sage: R.<x> = QQ[]
+  sage: J1 = (x^2 - 2*x + 1, 2*x^2 + x - 3)*R; J1
+  Principal ideal (x - 1) of Univariate Polynomial Ring in x
+  over Rational Field
+
+Sage example in ./polynomes.tex, line 782::
+
+  sage: J2 = R.ideal(x^5 + 2)
+  sage: ((3*x+5)*J1*J2).reduce(x^10)
+  421/81*x^6 - 502/81*x^5 + 842/81*x - 680/81
+
+Sage example in ./polynomes.tex, line 800::
+
+  sage: B = R.quo((3*x+5)*J1*J2) # quo automatically names 'xbar' which is
+  sage: B(x^10)                  #   the generator of B image of x
+  421/81*xbar^6 - 502/81*xbar^5 + 842/81*xbar - 680/81
+  sage: B(x^10).lift()
+  421/81*x^6 - 502/81*x^5 + 842/81*x - 680/81
+
+Sage example in ./polynomes.tex, line 920::
+
+  sage: R.<x> = QQ[]; p = 3*x^2 - 6
+  sage: p.is_irreducible(), p.change_ring(ZZ).is_irreducible()
+  (True, False)
+
+Sage example in ./polynomes.tex, line 976::
+
+  sage: x = polygen(ZZ); p = 54*x^4+36*x^3-102*x^2-72*x-12
+  sage: p.factor()
+  2 * 3 * (3*x + 1)^2 * (x^2 - 2)
+
+Sage example in ./polynomes.tex, line 997::
+
+  sage: for A in [QQ, ComplexField(16), GF(5), QQ[sqrt(2)]]:
+  ....:     print(str(A) + ":")
+  ....:     print(A['x'](p).factor())
+  Rational Field:
+  (54) * (x + 1/3)^2 * (x^2 - 2)
+  Complex Field with 16 bits of precision:
+  (54.00) * (x - 1.414) * (x + 0.3333)^2 * (x + 1.414)
+  Finite Field of size 5:
+  (4) * (x + 2)^2 * (x^2 + 3)
+  Number Field in sqrt2 with defining polynomial x^2 - 2 with sqrt2 = 1.414213562373095?:
+  (54) * (x - sqrt2) * (x + sqrt2) * (x + 1/3)^2
+
+Sage example in ./polynomes.tex, line 1100::
+
+  sage: R.<x> = ZZ[]; p = (2*x^2-5*x+2)^2 * (x^4-7); p.roots()
+  [(2, 2)]
+
+Sage example in ./polynomes.tex, line 1113::
+
+  sage: p.roots(QQ)
+  [(2, 2), (1/2, 2)]
+  sage: p.roots(Zp(19, print_max_terms=3))
+  [(7 + 16*19 + 17*19^2 + ... + O(19^20), 1),
+   (12 + 2*19 + 19^2 + ... + O(19^20), 1),
+   (10 + 9*19 + 9*19^2 + ... + O(19^20), 2),
+   (2 + O(19^20), 2)]
+
+Sage example in ./polynomes.tex, line 1137::
+
+  sage: roots = p.roots(AA); roots
+  [(-1.626576561697786?, 1), (0.500000000000000?, 2),
+  (1.626576561697786?, 1), (2.000000000000000?, 2)]
+
+Sage example in ./polynomes.tex, line 1153::
+
+  sage: a = roots[0][0]^4; a.simplify(); a
+  7
+
+Sage example in ./polynomes.tex, line 1208::
+
+  sage: x = polygen(ZZ); (x-12).resultant(x-20)
+  -8
+
+Sage example in ./polynomes.tex, line 1295::
+
+  sage: R.<a,b,c,d> = QQ[]; x = polygen(R); p = a*x^2+b*x+c
+  sage: p.resultant(p.derivative())
+  -a*b^2 + 4*a^2*c
+  sage: p.discriminant()
+  b^2 - 4*a*c
+  sage: (a*x^3 + b*x^2 + c*x + d).discriminant()
+  b^2*c^2 - 4*a*c^3 - 4*b^3*d + 18*a*b*c*d - 27*a^2*d^2
+
+Sage example in ./polynomes.tex, line 1399::
+
+  sage: x = polygen(RR); r = (1 + x)/(1 - x^2); r.parent()
+  Fraction Field of Univariate Polynomial Ring in x over Real
+  Field with 53 bits of precision
+  sage: r
+  (x + 1.00000000000000)/(-x^2 + 1.00000000000000)
+
+Sage example in ./polynomes.tex, line 1416::
+
+ % for the doctests
+  sage: r.reduce(); repr(r) in ['1.00000000000000/(-x + 1.00000000000000)', '-1.00000000000000/(x - 1.00000000000000)']
+  True
+
+Sage example in ./polynomes.tex, line 1492::
+
+  sage: R.<x> = QQ[]; r = x^10 / ((x^2-1)^2 * (x^2+3))
+  sage: poly, parts = r.partial_fraction_decomposition()
+  sage: poly
+  x^4 - x^2 + 6
+  sage: for part in parts: part.factor()
+  (17/32) * (x - 1)^-1
+  (1/16) * (x - 1)^-2
+  (-17/32) * (x + 1)^-1
+  (1/16) * (x + 1)^-2
+  (-243/16) * (x^2 + 3)^-1
+
+Sage example in ./polynomes.tex, line 1531::
+
+  sage: C = ComplexField(15)
+  sage: Frac(C['x'])(r).partial_fraction_decomposition() #abs tol 2e-4
+  (x^4 - x^2 + 6.000, [0.5312/(x - 1.000), 0.06250/(x^2 - 2.000*x + 1.000),
+  4.385*I/(x - 1.732*I), (-4.385*I)/(x + 1.732*I),
+  (-0.5312)/(x + 1.000), 0.06250/(x^2 + 2.000*x + 1.000)])
+
+Sage example in ./polynomes.tex, line 1600::
+
+  sage: A = Integers(101); R.<x> = A[]
+  sage: f6 = sum( (i+1)^2 * x^i for i in (0..5) ); f6
+  36*x^5 + 25*x^4 + 16*x^3 + 9*x^2 + 4*x + 1
+  sage: num, den = f6.rational_reconstruction(x^6, 1, 3); num/den
+  (100*x + 100)/(x^3 + 98*x^2 + 3*x + 100)
+
+Sage example in ./polynomes.tex, line 1611::
+
+  sage: S = PowerSeriesRing(A, 'x', 7); S(num)/S(den)
+  1 + 4*x + 9*x^2 + 16*x^3 + 25*x^4 + 36*x^5 + 49*x^6 + O(x^7)
+
+Sage example in ./polynomes.tex, line 1672::
+
+  sage: x = var('x'); s = tan(x).taylor(x, 0, 20)
+  sage: p = previous_prime(2^30); ZpZx = Integers(p)['x']
+  sage: Qx = QQ['x']
+
+Sage example in ./polynomes.tex, line 1677::
+
+  sage: num, den = ZpZx(s).rational_reconstruction(ZpZx(x)^10,4,5)
+  sage: num/den
+  (1073741779*x^3 + 105*x)/(x^4 + 1073741744*x^2 + 105)
+
+Sage example in ./polynomes.tex, line 1685::
+
+  sage: def lift_sym(a):
+  ....:     m = a.parent().defining_ideal().gen()
+  ....:     n = a.lift()
+  ....:     if n <= m // 2: return n
+  ....:     else: return n - m
+
+Sage example in ./polynomes.tex, line 1694::
+
+  sage: Qx(list(map(lift_sym, num)))/Qx(list(map(lift_sym, den)))
+  (-10*x^3 + 105*x)/(x^4 - 45*x^2 + 105)
+
+Sage example in ./polynomes.tex, line 1713::
+
+  sage: def mypade(pol, n, k):
+  ....:     x = ZpZx.gen();
+  ....:     n,d = ZpZx(pol).rational_reconstruction(x^n, k-1, n-k)
+  ....:     return Qx(list(map(lift_sym, n)))/Qx(list(map(lift_sym, d)))
+
+Sage example in ./polynomes.tex, line 1813::
+
+  sage: R.<x> = PowerSeriesRing(QQ)
+
+Sage example in ./polynomes.tex, line 1845::
+
+  sage: R.<x> = QQ[[]]
+  sage: f = 1 + x + O(x^2); g = x + 2*x^2 + O(x^4)
+  sage: f + g
+  1 + 2*x + O(x^2)
+  sage: f * g
+  x + 3*x^2 + O(x^3)
+
+Sage example in ./polynomes.tex, line 1857::
+
+  sage: (1 + x^3).prec()
+  +Infinity
+
+Sage example in ./polynomes.tex, line 1865::
+
+  sage: R.<x> = PowerSeriesRing(Reals(24), default_prec=4)
+  sage: 1/(1 + RR.pi() * x)^2
+  1.00000 - 6.28319*x + 29.6088*x^2 - 124.025*x^3 + O(x^4)
+
+Sage example in ./polynomes.tex, line 1877::
+
+  sage: R.<x> = QQ[[]]
+  sage: 1 + x + O(x^2) == 1 + x + x^2 + O(x^3)
+  True
+
+Sage example in ./polynomes.tex, line 1893::
+
+  sage: (1/(1+x)).sqrt().integral().exp() / x^2 + O(x^4)
+  x^-2 + x^-1 + 1/4 + 1/24*x - 1/192*x^2 + 11/1920*x^3 + O(x^4)
+
+Sage example in ./polynomes.tex, line 1940::
+
+  sage: (1+x^2).sqrt().solve_linear_de(prec=6, b=x.exp())
+  1 + 2*x + 3/2*x^2 + 5/6*x^3 + 1/2*x^4 + 7/30*x^5 + O(x^6)
+
+Sage example in ./polynomes.tex, line 1957::
+
+  sage: S.<x> = PowerSeriesRing(QQ, default_prec=5)
+  sage: f = S(1)
+  sage: for i in range(5):
+  ....:     f = (x*f).exp()
+  ....:     print(f)
+  1 + x + 1/2*x^2 + 1/6*x^3 + 1/24*x^4 + O(x^5)
+  1 + x + 3/2*x^2 + 5/3*x^3 + 41/24*x^4 + O(x^5)
+  1 + x + 3/2*x^2 + 8/3*x^3 + 101/24*x^4 + O(x^5)
+  1 + x + 3/2*x^2 + 8/3*x^3 + 125/24*x^4 + O(x^5)
+  1 + x + 3/2*x^2 + 8/3*x^3 + 125/24*x^4 + O(x^5)
+
+Sage example in ./polynomes.tex, line 2028::
+
+  sage: L.<x> = LazyPowerSeriesRing(QQ)
+  sage: lazy_exp = x.exp(); lazy_exp
+  1 + x + 1/2*x^2 + 1/6*x^3 + 1/24*x^4 + 1/120*x^5 + 1/720*x^6 + O(x^7)
+
+Sage example in ./polynomes.tex, line 2039::
+
+  sage: lazy_exp[5]
+  1/120
+  sage: lazy_exp
+  1 + x + 1/2*x^2 + 1/6*x^3 + 1/24*x^4 + 1/120*x^5 + 1/720*x^6 + O(x^7)
+
+Sage example in ./polynomes.tex, line 2062::
+
+  sage: f = L(1)  # the constant lazy series 1
+  sage: for i in range(5):
+  ....:     f = (x*f).exp()
+  ....:     print(f)                  # of the first coefficients
+  1 + x + 1/2*x^2 + 1/6*x^3 + 1/24*x^4 + 1/120*x^5 + 1/720*x^6 + O(x^7)
+  1 + x + 3/2*x^2 + 5/3*x^3 + 41/24*x^4 + 49/30*x^5 + 1057/720*x^6 + O(x^7)
+  1 + x + 3/2*x^2 + 8/3*x^3 + 101/24*x^4 + 63/10*x^5 + 6607/720*x^6 + O(x^7)
+  1 + x + 3/2*x^2 + 8/3*x^3 + 125/24*x^4 + 49/5*x^5 + 12847/720*x^6 + O(x^7)
+  1 + x + 3/2*x^2 + 8/3*x^3 + 125/24*x^4 + 54/5*x^5 + 16087/720*x^6 + O(x^7)
+
+Sage example in ./polynomes.tex, line 2091::
+
+  sage: f[7]
+  28673/630
+
+Sage example in ./polynomes.tex, line 2105::
+
+  sage: f = L.undefined(valuation=0)
+  sage: f.define((x*f).exp())
+  sage: f[:8]
+  [1, 1, 3/2, 8/3, 125/24, 54/5, 16807/720, 16384/315]
+
+Sage example in ./polynomes.tex, line 2158::
+
+  sage: R = PolynomialRing(ZZ, 'x', sparse=True)
+  sage: p = R.cyclotomic_polynomial(2^50); p, p.derivative()
+  (x^562949953421312 + 1, 562949953421312*x^562949953421311)
+"""

sage/tests/books/computational-mathematics-with-sagemath/premierspas_doctest.py

@@ -0,0 +1,180 @@
+# sage_setup: distribution = sagemath-repl
+"""
+This file (./premierspas_doctest.sage) was *autogenerated* from ./premierspas.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 ./premierspas_doctest.sage
+It is always safe to delete this file; it is not used in typesetting your
+document.
+
+Sage example in ./premierspas.tex, line 589::
+
+  sage: 1+1
+  2
+
+Sage example in ./premierspas.tex, line 645::
+
+  sage: ( 1 + 2 * (3 + 5) ) * 2
+  34
+
+Sage example in ./premierspas.tex, line 656::
+
+  sage: 2^3
+  8
+  sage: 2**3
+  8
+
+Sage example in ./premierspas.tex, line 664::
+
+  sage: 20/6
+  10/3
+
+Sage example in ./premierspas.tex, line 700::
+
+  sage: 20.0 / 14
+  1.42857142857143
+
+Sage example in ./premierspas.tex, line 724::
+
+  sage: numerical_approx(20/14, digits=60)
+  1.42857142857142857142857142857142857142857142857142857142857
+
+Sage example in ./premierspas.tex, line 792::
+
+  sage: 20 // 6
+  3
+  sage: 20 % 6
+  2
+
+Sage example in ./premierspas.tex, line 818::
+
+  sage: factor(2^(2^5)+1)
+  641 * 6700417
+
+Sage example in ./premierspas.tex, line 952::
+
+  sage: sin(pi)
+  0
+  sage: tan(pi/3)
+  sqrt(3)
+  sage: arctan(1)
+  1/4*pi
+  sage: exp(2 * I * pi)
+  1
+
+Sage example in ./premierspas.tex, line 967::
+
+  sage: arccos(sin(pi/3))
+  arccos(1/2*sqrt(3))
+  sage: sqrt(2)
+  sqrt(2)
+  sage: exp(I*pi/7)
+  e^(1/7*I*pi)
+
+Sage example in ./premierspas.tex, line 987::
+
+  sage: simplify(arccos(sin(pi/3)))
+  1/6*pi
+
+Sage example in ./premierspas.tex, line 1000::
+
+  sage: numerical_approx(6*arccos(sin(pi/3)), digits=60)
+  3.14159265358979323846264338327950288419716939937510582097494
+  sage: numerical_approx(sqrt(2), digits=60)
+  1.41421356237309504880168872420969807856967187537694807317668
+
+Sage example in ./premierspas.tex, line 1139::
+
+  sage: y = 1 + 2
+
+Sage example in ./premierspas.tex, line 1144::
+
+  sage: y
+  3
+  sage: (2 + y) * y
+  15
+
+Sage example in ./premierspas.tex, line 1156::
+
+  sage: y = 1 + 2; y
+  3
+
+Sage example in ./premierspas.tex, line 1168::
+
+  sage: y = 3 * y + 1; y
+  10
+  sage: y = 3 * y + 1; y
+  31
+  sage: y = 3 * y + 1; y
+  94
+
+Sage example in ./premierspas.tex, line 1208::
+
+  sage: pi = -I/2
+  sage: exp(2*I*pi)
+  e
+
+Sage example in ./premierspas.tex, line 1217::
+
+  sage: from sage.symbolic.constants import pi
+
+Sage example in ./premierspas.tex, line 1224::
+
+  sage: restore()
+
+Sage example in ./premierspas.tex, line 1267::
+
+  sage: z = SR.var('z')
+  sage: 2*z + 3
+  2*z + 3
+
+Sage example in ./premierspas.tex, line 1290::
+
+  sage: y = SR.var('z')
+  sage: 2*y + 3
+  2*z + 3
+
+Sage example in ./premierspas.tex, line 1306::
+
+  sage: c = 2 * y + 3
+  sage: z = 1
+  sage: 2*y + 3
+  2*z + 3
+  sage: c
+  2*z + 3
+
+Sage example in ./premierspas.tex, line 1318::
+
+  sage: x = SR.var('x')
+  sage: expr = sin(x); expr
+  sin(x)
+  sage: expr(x=1)
+  sin(1)
+
+Sage example in ./premierspas.tex, line 1332::
+
+  sage: u = SR.var('u')
+  sage: u = u+1
+  sage: u = u+1
+  sage: u
+  u + 2
+
+Sage example in ./premierspas.tex, line 1347::
+
+  sage: x = SR.var('x', 100)
+  sage: (x[0] + x[1])*x[99]
+  (x0 + x1)*x99
+
+Sage example in ./premierspas.tex, line 1357::
+
+  sage: var('a, b, c, x, y')
+  (a, b, c, x, y)
+  sage: a * x + b * y + c
+  a*x + b*y + c
+
+Sage example in ./premierspas.tex, line 1380::
+
+  sage: var('bla')
+  bla
+"""