On Thursday, December 18, 2014 12:09:33 PM UTC-8, John H Palmieri wrote:
>
>
>
> On Thursday, December 18, 2014 7:54:08 AM UTC-8, Volker Braun wrote:
>>
>> As usual, get the "develop" branch or download the self-contained source
>> tarball from http://www.sagemath.org/download-latest.html
>>
>
> On two OS X machines (one is running 10.9, the other 10.11):
>
Sorry, I meant one running 10.9, the other 10.10.
John
>
> sage -t --long --warn-long 35.9 src/sage/data_structures/bitset.pyx # 1
> doctest failed
> sage -t --long --warn-long 35.9 src/sage/libs/singular/polynomial.pyx # 1
> doctest failed
> sage -t --long src/sage/interfaces/maxima.py # Timed out
>
>
> sage -t --warn-long 35.1 src/sage/data_structures/bitset.pyx
> **********************************************************************
> File "src/sage/data_structures/bitset.pyx", line 1998, in
> sage.data_structures.bitset.test_bitset
> Failed example:
> test_bitset('00'*64, '01'*64, 127)
> Expected:
> a
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> list a []
> a.size 128
> len(a) 0
> a.limbs ...
> b
> 01010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101
> a.in(n) False
> a.not_in(n) True
> a.add(n)
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001
> a.discard(n)
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> a.set_to(n)
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001
> a.flip(n)
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001
> a.set_first_n(n)
> 11111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111110
> a.first_in_complement() 127
> a.isempty() True
> a.eq(b) False
> a.cmp(b) -1
> a.lex_cmp(b) -1
> a.issubset(b) True
> a.issuperset(b) False
> a.copy()
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> r.clear()
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> complement a
> 11111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111
> a intersect b
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> a union b
> 01010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101
> a minus b
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> a symmetric_difference b
> 01010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101
> a.rshift(n)
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> a.lshift(n)
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> a.first() -1
> a.next(n) -1
> a.first_diff(b) 1
> a.next_diff(b, n) 127
> a.hamming_weight() 0
> a.map(m)
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> a == loads(dumps(a)) True
> rshifts add True
> lshifts add True
> intersection commutes True
> union commutes True
> not not = id True
> flipped bit 127
> add bit 127
> discard bit 127
> lshift add unset ok True
> rshift set unset ok True
> reallocating a
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> to size 127
> 0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> to size 254
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> to original size
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> Got:
> a
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> list a []
> a.size 128
> len(a) 0
> a.limbs 2
> b
> 01010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101
> a.in(n) False
> a.not_in(n) True
> a.add(n)
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001
> a.discard(n)
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> a.set_to(n)
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001
> a.flip(n)
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001
> a.set_first_n(n)
> 11111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111110
> a.first_in_complement() 127
> a.isempty() True
> a.eq(b) False
> a.cmp(b) -1
> a.lex_cmp(b) -1
> a.issubset(b) True
> a.issuperset(b) False
> a.copy()
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> r.clear()
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> complement a
> 11111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111
> a intersect b
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> a union b
> 01010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101
> a minus b
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> a symmetric_difference b
> 01010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101
> a.rshift(n)
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> a.lshift(n)
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> a.first() -1
> a.next(n) -1
> a.first_diff(b) 1
> a.next_diff(b, n) 127
> a.hamming_weight() 0
> a.map(m)
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> a == loads(dumps(a)) True
> rshifts add False
> lshifts add True
> intersection commutes True
> union commutes True
> not not = id True
> flipped bit 127
> add bit 127
> discard bit 127
> lshift add unset ok True
> rshift set unset ok False
> reallocating a
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> to size 127
> 0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> to size 254
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> to original size
> 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
> **********************************************************************
> 1 item had failures:
> 1 of 6 in sage.data_structures.bitset.test_bitset
> [424 tests, 1 failure, 0.21 s]
> sage -t --warn-long 35.1 src/sage/libs/singular/polynomial.pyx
> **********************************************************************
> File "src/sage/libs/singular/polynomial.pyx", line 166, in
> sage.libs.singular.polynomial.singular_polynomial_call
> Failed example:
> leak(10000)
> Expected:
> 0
> Got:
> 71303168
> **********************************************************************
> 1 item had failures:
> 1 of 12 in sage.libs.singular.polynomial.singular_polynomial_call
> [51 tests, 1 failure, 1.34 s]
> sage -t --warn-long 35.1 src/sage/interfaces/maxima.py
> Timed out
> **********************************************************************
> Tests run before process (pid=65641) timed out:
> sage: type(maxima) ## line 34 ##
> <class 'sage.interfaces.maxima.Maxima'>
> sage: maxima('3 * 5') ## line 44 ##
> 15
> sage: F = maxima.factor('x^5 - y^5') ## line 52 ##
> sage: F ## line 53 ##
> -(y-x)*(y^4+x*y^3+x^2*y^2+x^3*y+x^4)
> sage: type(F) ## line 55 ##
> <class 'sage.interfaces.maxima.MaximaElement'>
> sage: print F ## line 64 ##
> 4 3 2 2 3 4
> - (y - x) (y + x y + x y + x y + x )
> sage: repr(F) ## line 74 ##
> '-(y-x)*(y^4+x*y^3+x^2*y^2+x^3*y+x^4)'
> sage: F.str() ## line 76 ##
> '-(y-x)*(y^4+x*y^3+x^2*y^2+x^3*y+x^4)'
> sage: print maxima.eval('factor(x^5 - y^5)') ## line 84 ##
> -(y-x)*(y^4+x*y^3+x^2*y^2+x^3*y+x^4)
> sage: f = maxima('x^5 - y^5') ## line 94 ##
> sage: f^2 ## line 95 ##
> (x^5-y^5)^2
> sage: f.factor() ## line 97 ##
> -(y-x)*(y^4+x*y^3+x^2*y^2+x^3*y+x^4)
> sage: maxima('sum(1/x^2, x, 1, 10)') ## line 106 ##
> 1968329/1270080
> sage: maxima('1/100 + 1/101') ## line 117 ##
> 201/10100
> sage: a = maxima('(1 + sqrt(2))^5'); a ## line 122 ##
> (sqrt(2)+1)^5
> sage: a.expand() ## line 124 ##
> 29*sqrt(2)+41
> sage: a = maxima('(1 + sqrt(2))^5') ## line 129 ##
> sage: float(a) ## line 130 ##
> 82.01219330881975
> sage: a.numer() ## line 132 ##
> 82.01219330881975
> sage: maxima.eval('fpprec : 100') ## line 137 ##
> '100'
> sage: a.bfloat() ## line 139 ##
>
> 8.20121933088197564152489730020812442785204843859314941221237124017312418754011041266612384955016056b1
> sage: maxima('100!') ## line 144 ##
>
> 93326215443944152681699238856266700490715968264381621468592963895217599993229915608941463976156518286253697920827223758251185210916864000000000000000000000000
> sage: f = maxima('(x + 3*y + x^2*y)^3') ## line 149 ##
> sage: f.expand() ## line 150 ##
>
> x^6*y^3+9*x^4*y^3+27*x^2*y^3+27*y^3+3*x^5*y^2+18*x^3*y^2+27*x*y^2+3*x^4*y+9*x^2*y+x^3
> sage: f.subst('x=5/z') ## line 152 ##
> (5/z+25*y/z^2+3*y)^3
> sage: g = f.subst('x=5/z') ## line 154 ##
> sage: h = g.ratsimp(); h ## line 155 ##
>
> (27*y^3*z^6+135*y^2*z^5+(675*y^3+225*y)*z^4+(2250*y^2+125)*z^3+(5625*y^3+1875*y)*z^2+9375*y^2*z+15625*y^3)/z^6
> sage: h.factor() ## line 157 ##
> (3*y*z^2+5*z+25*y)^3/z^6
> sage: eqn = maxima(['a+b*c=1', 'b-a*c=0', 'a+b=5']) ## line 162 ##
> sage: s = eqn.solve('[a,b,c]'); s ## line 163 ##
>
> [[a=(25*sqrt(79)*%i+25)/(6*sqrt(79)*%i-34),b=(5*sqrt(79)*%i+5)/(sqrt(79)*%i+11),c=(sqrt(79)*%i+1)/10],[a=(25*sqrt(79)*%i-25)/(6*sqrt(79)*%i+34),b=(5*sqrt(79)*%i-5)/(sqrt(79)*%i-11),c=-(sqrt(79)*%i-1)/10]]
> sage: maxima('x^2+y^2=1').solve('y') ## line 168 ##
> [y=-sqrt(1-x^2),y=sqrt(1-x^2)]
> sage: maxima('x^2 + y^2 = (x^2 - y^2)/sqrt(x^2 + y^2)').solve('y') ## line
> 170 ##
>
> [y=-sqrt((-y^2-x^2)*sqrt(y^2+x^2)+x^2),y=sqrt((-y^2-x^2)*sqrt(y^2+x^2)+x^2)]
> sage: latex(s) ## line 175 ##
> \left[ \left[ a={{25\,\sqrt{79}\,i+25}\over{6\,\sqrt{79}\,i-34}} ,
> b={{5\,\sqrt{79}\,i+5}\over{\sqrt{79}\,i+11}} , c={{\sqrt{79}\,i+1
> }\over{10}} \right] , \left[ a={{25\,\sqrt{79}\,i-25}\over{6\,
> \sqrt{79}\,i+34}} , b={{5\,\sqrt{79}\,i-5}\over{\sqrt{79}\,i-11}} ,
> c=-{{\sqrt{79}\,i-1}\over{10}} \right] \right]
> sage: e = maxima('sin(u + v) * cos(u)^3'); e ## line 184 ##
> cos(u)^3*sin(v+u)
> sage: f = e.trigexpand(); f ## line 186 ##
> cos(u)^3*(cos(u)*sin(v)+sin(u)*cos(v))
> sage: f.trigreduce() ## line 188 ##
> (sin(v+4*u)+sin(v-2*u))/8+(3*sin(v+2*u)+3*sin(v))/8
> sage: w = maxima('3 + k*%i') ## line 190 ##
> sage: f = w^2 + maxima('%e')^w ## line 191 ##
> sage: f.realpart() ## line 192 ##
> %e^3*cos(k)-k^2+9
> sage: f = maxima('x^3 * %e^(k*x) * sin(w*x)'); f ## line 197 ##
> x^3*%e^(k*x)*sin(w*x)
> sage: f.diff('x') ## line 199 ##
> k*x^3*%e^(k*x)*sin(w*x)+3*x^2*%e^(k*x)*sin(w*x)+w*x^3*%e^(k*x)*cos(w*x)
> sage: f.integrate('x') ## line 201 ##
>
> (((k*w^6+3*k^3*w^4+3*k^5*w^2+k^7)*x^3+(3*w^6+3*k^2*w^4-3*k^4*w^2-3*k^6)*x^2+(-18*k*w^4-12*k^3*w^2+6*k^5)*x-6*w^4+36*k^2*w^2-6*k^4)*%e^(k*x)*sin(w*x)+((-w^7-3*k^2*w^5-3*k^4*w^3-k^6*w)*x^3+(6*k*w^5+12*k^3*w^3+6*k^5*w)*x^2+(6*w^5-12*k^2*w^3-18*k^4*w)*x-24*k*w^3+24*k^3*w)*%e^(k*x)*cos(w*x))/(w^8+4*k^2*w^6+6*k^4*w^4+4*k^6*w^2+k^8)
> sage: f = maxima('1/x^2') ## line 206 ##
> sage: f.integrate('x', 1, 'inf') ## line 207 ##
> 1
> sage: g = maxima('f/sinh(k*x)^4') ## line 209 ##
> sage: g.taylor('x', 0, 3) ## line 210 ##
> f/(k^4*x^4)-2*f/(3*k^2*x^2)+11*f/45-62*k^2*f*x^2/945
> sage: maxima.taylor('asin(x)','x',0, 10) ## line 215 ##
> x+x^3/6+3*x^5/40+5*x^7/112+35*x^9/1152
> sage: f = maxima.eval('f[i,j] := i/j') ## line 226 ##
> sage: A = maxima('genmatrix(f,4,4)'); A ## line 227 ##
> matrix([1,1/2,1/3,1/4],[2,1,2/3,1/2],[3,3/2,1,3/4],[4,2,4/3,1])
> sage: A.determinant() ## line 229 ##
> 0
> sage: A.echelon() ## line 231 ##
> matrix([1,1/2,1/3,1/4],[0,0,0,0],[0,0,0,0],[0,0,0,0])
> sage: A.eigenvalues() ## line 233 ##
> [[0,4],[3,1]]
> sage: A.eigenvectors() ## line 235 ##
> [[[0,4],[3,1]],[[[1,0,0,-4],[0,1,0,-2],[0,0,1,-4/3]],[[1,2,3,4]]]]
> sage: B = matrix(QQ, A) ## line 240 ##
> sage: B.echelon_form() ## line 241 ##
> [ 1 1/2 1/3 1/4]
> [ 0 0 0 0]
> [ 0 0 0 0]
> [ 0 0 0 0]
> sage: B.charpoly('x').factor() ## line 246 ##
> (x - 4) * x^3
> sage: _ = maxima.eval("f(t) := t*sin(t)") ## line 254 ##
> sage: maxima("laplace(f(t),t,s)") ## line 255 ##
> 2*s/(s^2+1)^2
> sage: maxima("laplace(delta(t-3),t,s)") #Dirac delta function ## line 260
> ##
> %e^-(3*s)
> sage: _ = maxima.eval("f(t) := exp(t)*sin(t)") ## line 265 ##
> sage: maxima("laplace(f(t),t,s)") ## line 266 ##
> 1/(s^2-2*s+2)
> sage: _ = maxima.eval("f(t) := t^5*exp(t)*sin(t)") ## line 271 ##
> sage: maxima("laplace(f(t),t,s)") ## line 272 ##
>
> 360*(2*s-2)/(s^2-2*s+2)^4-480*(2*s-2)^3/(s^2-2*s+2)^5+120*(2*s-2)^5/(s^2-2*s+2)^6
> sage: print maxima("laplace(f(t),t,s)") ## line 274 ##
> 3 5
> 360 (2 s - 2) 480 (2 s - 2) 120 (2 s - 2)
> --------------- - --------------- + ---------------
> 2 4 2 5 2 6
> (s - 2 s + 2) (s - 2 s + 2) (s - 2 s + 2)
> sage: maxima("laplace(diff(x(t),t),t,s)") ## line 283 ##
> s*'laplace(x(t),t,s)-x(0)
> sage: maxima("laplace(diff(x(t),t,2),t,s)") ## line 288 ##
> -%at('diff(x(t),t,1),t=0)+s^2*'laplace(x(t),t,s)-x(0)*s
> sage: print maxima("laplace(diff(x(t),t,2),t,s)") ## line 294 ##
> !
> d ! 2
> - -- (x(t))! + s laplace(x(t), t, s) - x(0) s
> dt !
> !t = 0
> sage: maxima("cf((1 + sqrt(5))/2)") ## line 313 ##
> [1,1,1,1,2]
> sage: maxima("cf ((1 + sqrt(341))/2)") ## line 315 ##
> [9,1,2,1,2,1,17,1,2,1,2,1,17,1,2,1,2,1,17,2]
> sage: f = maxima('2*x^(n+4) - x^(n+2)') ## line 330 ##
> sage: g = maxima('4*x^(n+1) + 3*x^n') ## line 331 ##
> sage: f.gcd(g) ## line 332 ##
> x^n
> sage: S = maxima('nusum(exp(1+2*i/n),i,1,n)') ## line 343 ##
> sage: print S ## line 344 ##
> 2/n + 3 2/n + 1
> %e %e
> ----------------------- - -----------------------
> 1/n 1/n 1/n 1/n
> (%e - 1) (%e + 1) (%e - 1) (%e + 1)
> sage: T = S*maxima('2/n') ## line 354 ##
> sage: T.tlimit('n','inf') ## line 355 ##
> %e^3-%e
> sage: maxima.eval('fpprec : 100') ## line 363 ##
> '100'
> sage: maxima(pi).bfloat() ## line 365 ##
>
> 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342117068b0
> sage: maxima.eval('fun[a] := a^2') ## line 370 ##
> 'fun[a]:=a^2'
> sage: maxima('fun[10]') ## line 372 ##
> 100
> sage: latex(maxima('sin(u) + sinh(v^2)')) ## line 391 ##
> \sinh v^2+\sin u
> sage: g = maxima('exp(3*%i*x)/(6*%i) + exp(%i*x)/(2*%i) + c') ## line 396
> ##
> sage: latex(g) ## line 397 ##
> -{{i\,e^{3\,i\,x}}\over{6}}-{{i\,e^{i\,x}}\over{2}}+c
> sage: t = '"%s"'%10^10000 # ten thousand character string. ## line 413 ##
> sage: a = maxima(t) ## line 414 ##
> sage: f = maxima.function('x','gamma(x)') ## line 418 ##
> sage: g = f(1/7) ## line 419 ##
> sage: g ## line 420 ##
> gamma(1/7)
> sage: del f ## line 422 ##
> sage: maxima(sin(x)) ## line 423 ##
> sin(_SAGE_VAR_x)
> sage: var('Ax,Bx,By') ## line 431 ##
> (Ax, Bx, By)
> sage: t = -Ax*sin(sqrt(Ax^2)/2)/(sqrt(Ax^2)*sqrt(By^2 + Bx^2)) ## line 433
> ##
> sage: t.limit(Ax=0, dir='+') ## line 434 ##
> 0
> sage: maxima._eval_line('((((((((((0) + ((1) / ((n0) ^ (0)))) + ((1) /
> ((n1) ^ (1)))) + ((1) / ((n2) ^ (2)))) + ((1) / ((n3) ^ (3)))) + ((1) /
> ((n4) ^ (4)))) + ((1) / ((n5) ^ (5)))) + ((1) / ((n6) ^ (6)))) + ((1) /
> ((n7) ^ (7)))) + ((1) / ((n8) ^ (8)))) + ((1) / ((n9) ^ (9)));') ## line
> 439 ##
> '1/n9^9+1/n8^8+1/n7^7+1/n6^6+1/n5^5+1/n4^4+1/n3^3+1/n2^2+1/n1+1'
> sage: sig_on_count() ## line 441 ##
> 0
> sage: m = Maxima() ## line 484 ##
> sage: m == maxima ## line 485 ##
> False
> sage: sig_on_count() ## line 487 ##
> 0
> sage: Maxima == loads(dumps(Maxima)) ## line 495 ##
> True
> sage: maxima == loads(dumps(maxima)) ## line 497 ##
> True
> sage: m = Maxima() ## line 502 ##
> sage: maxima == loads(dumps(m)) ## line 503 ##
> True
> sage: 'nolabels : true' in maxima._Expect__init_code ## line 508 ##
> True
> sage: sig_on_count() ## line 510 ##
> 0
> sage: m = Maxima() ## line 576 ##
> sage: m.is_running() ## line 577 ##
> False
> sage: m._start() ## line 579 ##
> sage: m.is_running() ## line 580 ##
> True
> sage: a = maxima(10)^(10^5) ## line 585 ##
> sage: sig_on_count() ## line 588 ##
> 0
> sage: maxima.__reduce__() ## line 606 ##
> (<function reduce_load_Maxima at 0x10ca9de60>, ())
> sage: sig_on_count() ## line 608 ##
> 0
> sage: maxima._sendline('t : 9;') ## line 617 ##
> sage: maxima.get('t') ## line 618 ##
> '9'
> sage: sig_on_count() ## line 620 ##
> 0
> sage: maxima('2+2') ## line 638 ##
> 4
> sage: maxima('integrate(1/(x^3*(a+b*x)^(1/3)),x)') ## line 640 ##
> sage: maxima.assume('a>0') ## line 647 ##
> [a>0]
> sage: maxima('integrate(1/(x^3*(a+b*x)^(1/3)),x)') ## line 649 ##
>
> -b^2*log((b*x+a)^(2/3)+a^(1/3)*(b*x+a)^(1/3)+a^(2/3))/(9*a^(7/3))+2*b^2*atan((2*(b*x+a)^(1/3)+a^(1/3))/(sqrt(3)*a^(1/3)))/(3^(3/2)*a^(7/3))+2*b^2*log((b*x+a)^(1/3)-a^(1/3))/(9*a^(7/3))+(4*b^2*(b*x+a)^(5/3)-7*a*b^2*(b*x+a)^(2/3))/(6*a^2*(b*x+a)^2-12*a^3*(b*x+a)+6*a^4)
> sage: maxima('integrate(x^n,x)') ## line 651 ##
> sage: maxima.assume('n+1>0') ## line 658 ##
> [n>-1]
> sage: maxima('integrate(x^n,x)') ## line 660 ##
> x^(n+1)/(n+1)
> sage: maxima.forget([fact for fact in maxima.facts()]) ## line 662 ##
> [[a>0,n>-1]]
> sage: maxima.facts() ## line 664 ##
> []
> sage: var('a') ## line 666 ##
> a
> sage: maxima('limit(x^a,x,0)') ## line 668 ##
> sage: sig_on_count() ## line 675 ##
> 0
> sage: maxima._eval_line('1+1;') ## line 729 ##
> '2'
> sage: maxima._eval_line('sage0: x == x;') ## line 731 ##
>
> **********************************************************************
>
>
>
>
>>
>> d66547a Updated Sage version to 6.5.beta3
>> fd493d9 Trac #9440: document more environment variables
>> 404fcf2 Trac #17483: improve constructions/interface_issues.rst
>> f149453 Trac #17357: Document patches in the patch, not in SPKG.txt
>> 00b8d72 Trac #17486: Remove src/sage/server/misc.py
>> f46ffb0 Trac #17444: Clarify what plot is in tour of sage
>> 3f02fc4 Trac #17514: Upgrade Maxima to 5.35.1
>> c118695 Trac #17465: Remove sage-crap script
>> 1081a79 Trac #17451: Deprecate pari() function from
>> sage/libs/pari/gen_py.py
>> e83b85b Trac #17441: Change ring fails for SchemeMorphism_polynomial
>> defined with fraction field elements
>> e6c857c Trac #17420: when building, check that user isn't root
>> 6e479de Trac #17325: clear denominators for projective points does not
>> always work
>> 0e332dd Trac #17206: var and latex_name
>> 4cd8753 Trac #16895: residue_field() for orders in number fields does not
>> take 'names' parameter
>> c6cc006 Trac #16507: Better handling of subspace construction in pushout
>> 0ea303c Trac #15514: adding option for computing a total dominating set
>> dff7bc6 Trac #17508: Reformat the developer's manual's page about
>> docstrings
>> 30b1c3e Trac #17495: Fix refine_embedding when some but not all
>> embeddings are real
>> d6e35c9 Trac #17475: missing sympy binding for two symbolic functions
>> 10a6ab4 Trac #17158: Remove some functions from sage/misc/functional.py
>> a4efdde Trac #9824: improve desolve_system initial condition documentation
>> d78f4e9 Trac #7401: Derivative at a point is not translated into Maxima
>> 0600d28 Trac #17501: Add is_unique_factorization_domain to IntegerMod
>> rings and Polynomial Rings
>> c4a8251 Trac #17424: Index of poset constructors
>> a9cd1ec Trac #17408: Faster transitive_reduction (=> faster Poset
>> creation)
>> 65f0298 Trac #17389: Remove simplify_radical/canonicalize_radical from
>> test_relation_maxima
>> 53e1f95 Trac #17382: Show Cython code in IPython tracebacks
>> b419b3c Trac #17368: Make pip a standard package
>> 95f8058 Trac #17134: Remove deprecated code
>> 978f623 Trac #15618: Use the correct categories for coercion and
>> conversion maps
>> 3536a4d Trac #14766: Fix Python int problem with exp_integral
>> cd0bcc7 Trac #14630: Add `simplify_real` method to symbolic expressions
>> 8e3e586 Trac #11284: Document all options of Poset.show and Poset.plot
>> 62bf706 Trac #2891: Don't use globals() to initialize InlineFortran
>> f623074 Trac #17466: Use fixed tarball for IML 1.0.4
>> 8703a1c Trac #17458: import_statements should ignore lazy imports with
>> deprecation
>> 21c7a07 Trac #17456: Speedup TIDES interface
>> 510547f Trac #17450: Fix category for quotients of polynomial rings
>> 7961b2b Trac #17443: abs(matrix) should not be a shortcut for det
>> 4e8629c Trac #17429: projective point equality returns false positive for
>> ComplexIntervalField
>> 6910ffc Trac #17364: Homset categories should be subcategories of the
>> category of all homsets
>> b7251d1 Trac #17210: Random failure in LLL
>> fbc8bc7 Trac #17146: Random failure in doctest/test.py
>> 99ffd2b Trac #17122: bessel_Y is off by 3 ulps
>> 609a92d Trac #16958: MPolynomial eval mem leak
>> 2b1f63b Trac #16301: bug in quotient() over integer coefficient ring
>> 92940fa Trac #16256: Reorganize the documentation indexes into
>> src/sage/combinat
>> bd0df0e Trac #15820: Implement sequences of bounded integers
>> c929d47 Trac #15706: Graph built from their edges are simple by default
>> 2b03016 Trac #10133: Make sin(0), log(1) and similar expressions return
>> Sage integers, not Python ints
>> 95cefcc Trac #9465: Update to FriCAS 1.2.4
>>
>>
--
You received this message because you are subscribed to the Google Groups
"sage-release" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-release.
For more options, visit https://groups.google.com/d/optout.
