Re: [sage-support] Sage crash report

Hi On 21 December 2016 at 21:00, leonel torres salinas < lionhydroanaximan...@gmail.com> wrote: > Hello, i just wanted to try Sagemath in my computer > > Toshiba satellite l745d runing Fedora 25 with LXDE desktop > > I tried to execute it from the binaries but it wasn't enough for it > > Thank

Re: [sage-support] Sage crash report

Hello Leonel, the bottom of the report indicates your laptop is missing the fortran libraries (libgfortran). I'm not sure how to go about finding those for your distribution though. hth adil On Wed, Dec 21, 2016 at 01:00:24PM -0600, leonel torres salinas wrote: > Hello, i just wanted to try

[sage-support] Sage crash report

Hello, i just wanted to try Sagemath in my computer Toshiba satellite l745d runing Fedora 25 with LXDE desktop I tried to execute it from the binaries but it wasn't enough for it Thank you for the support, i really enjoy your work -- You received this message because you are subscribed to the

[sage-support] Re: Grobner bases of ideals

On Wednesday, 21 December 2016 07:14:51 UTC-5, NITIN DARKUNDE wrote: > > Respected Sir, > I am trying to find Groebner basis of an ideal in > polynomial ring in 35 variables over GF(2)(As per suggestions earlier, I am > working over GF(2) instead of GF(3)) but I am not

Re: [sage-support] Solutions are retrieved with the symbol

You can at least obtain the solutions via sage: Eq = -1/2*sqrt(-4*p^2 + 4*p + 1)*p + 1/2*p == 1/2 sage: (((2*Eq -p)/p)**2) -4*p^2 + 4*p + 1 == (p - 1)^2/p^2 sage: (((2*Eq -p)/p)**2).solve(p) [p == -1/4*sqrt(5) - 1/2*sqrt(-1/2*sqrt(5) - 1/2) + 1/4, p == -1/4*sqrt(5) + 1/2*sqrt(-1/2*sqrt(5) -

[sage-support] Re: Grobner bases of ideals

On Wed, Dec 21, 2016 at 7:14 AM, NITIN DARKUNDE wrote: > Respected Sir, > I am trying to find Groebner basis of an ideal in > polynomial ring in 35 variables over GF(2)(As per suggestions earlier, I am > working over GF(2) instead of GF(3)) but I am

[sage-support] Re: Grobner bases of ideals

On Wed, Dec 21, 2016 at 7:28 AM, David Joyner wrote: > On Wed, Dec 21, 2016 at 7:14 AM, NITIN DARKUNDE > wrote: >> Respected Sir, >> I am trying to find Groebner basis of an ideal in >> polynomial ring in 35 variables over

[sage-support] Solutions are retrieved with the symbol

I am trying to solve the following equation: -1/2*sqrt(-4*p^2 + 4*p + 1)*p + 1/2*p = 1/2 I was trying the following: sage: var('p') p sage: solve(-1/2*sqrt(-4*p^2 + 4*p + 1)*p + 1/2*p == 1/2, p) [p == -1/(sqrt(-4*p^2 + 4*p + 1) - 1)] So the solution is p = some expression of p. Not very

Re: [sage-support] Initializing a matrix using the entries keyword, but with a partial function

True, there is no such keyword in the (relatively complicated) signature def __call__(self, *Args, ring=None, nrows=None, ncols=None, sparse=None): However, it is the kind of argument you really want to input to the function! Note the equivalence of the output of sage: matrix(QQ, 3, 3,

Re: [sage-support] Initializing a matrix using the entries keyword, but with a partial function

Hi Vincent, Great, thanks! I'd say that the docstring should be amended as well, don't you think? (As the keyword argument `entries` does not exist) Peleg. On Wednesday, 21 December 2016 14:42:00 UTC+2, vdelecroix wrote: > > Hi Peleg, > > It would be better if matrix would do a type check

Re: [sage-support] Initializing a matrix using the entries keyword, but with a partial function

Hi Peleg, It would be better if matrix would do a type check for partial function. Currently it does not, the relevant line is {{{ if isinstance(arg, (types.FunctionType, types.LambdaType, types.MethodType)): }}} in sage/matrix/constructor.pyx the function MatrixFactory. Concerning a

[sage-support] Initializing a matrix using the entries keyword, but with a partial function

The matrix (or Matrix) documentation reads: INPUT: * "ring" -- the base ring for the entries of the matrix. * "nrows" -- the number of rows in the matrix. * "ncols" -- the number of columns in the matrix. * "sparse" -- create a sparse matrix. This defaults to "True" when

[sage-support] Re: Grobner bases of ideals

On Wed, Dec 21, 2016 at 7:14 AM, NITIN DARKUNDE wrote: > Respected Sir, > I am trying to find Groebner basis of an ideal in > polynomial ring in 35 variables over GF(2)(As per suggestions earlier, I am > working over GF(2) instead of GF(3)) but I am

[sage-support] Grobner bases of ideals

Respected Sir, I am trying to find Groebner basis of an ideal in polynomial ring in 35 variables over GF(2)(As per suggestions earlier, I am working over GF(2) instead of GF(3)) but I am not able to see the output using sage. Even it do not shows any error in it. So,how to get