Max Alekseyev's profile - activity

Have you tried to use built-in Sage's parallel computing functionality? https://doc.sagemath.org/html/en/reference/paral

Your code works fine in Sagecell

You can perform substitution in each element: M.apply_map(lambda t: t.subs(subsdict))

Function $r(n,k)$ and thus $g(n,k)$ can be computed from $f(n,k)$ as follows: var('k n') f(n,k) = factorial(n)^4 / fact

For a composite, which is not a prime power, one can try to work in the corresponding ring defined via Zmod().

Can you illustrate the issue with an actual code example?

See code for a similar problem at https://ask.sagemath.org/question/59220/

When the number of solutions is finite, you can get them by calling .variety() method of the ideal. Unfortunately, this

There may be infinitely many solutions to your equation. What kind of answer do you expect in that case?

It's https://github.com/sagemath/sage/issues/38298

One can avoid specifying n at all by using InfinitePolynomialRing.

Please update your question with more details, or better ask a new one.

Please update your question with more details, better ask a new one.

That's because your substitutions are inconsistent with each other: multiplying E*E==-1/6, L*L==-1/2, gives E*E*L*L==1/1

That's because your substitutions are inconsistent with each other: multiplying E*E==-1/6, L*L==-1/2, gives E*E*L*L==1/1

That's because your substitutions are "inconsistent": multiplying E*E==-1/6, L*L==-1/2, gives E*E*L*L==1/12; however mul

That's because your substitutions are "inconsistent": multiplying E*E==-1/6, L*L==-1/2, gives E*E*L*L==1/12; however mul

how to display the set of all monomials occurring in a polynomial let $f=x+y+z+xy$, how to display the list of all monom

get the coefficients from the polynomial of several variables I have a polynomial $p(x)=[(x_1-x_2)(x_1-x_3)(x_1-x_4)(x_2

get the coefficients from the polynomial of several variables I have a polynomial $p(x)=\[(x_1-x_2)(x_1-x_3)(x_1-x_4)(x_

get the coefficients from the Polynomial polynomial of several variables I have a polynomial $p(x)=(x_1-x_2)(x_1-x_3)(x_

Like this: K.<x_1,x_2,x_3,x_4> = QQ[] p = (x_1-x_2)*(x_1-x_3)*(x_1-x_4)*(x_2-x_3)*(x_2-x_4)*(x_3-x_4)^18*(x_1^2+x

f % (x*y^2 - z) will do the job: K.<x,y,z> = ZZ[] f = x*y^2 + x + y + z print( f % (x*y^2 - z) )

Yes, they are commutative.

Please report the issue at https://github.com/sagemath/sage/issues

One can have a better control such substitutions using polynomial machinery, reducing a polynomial modulo the ideal gene

It is always a good idea to avoid generic symbolic ring in favor of more specific classes, which typically provide rich

You can use time module for that purpose - like this: import time start_time = time.time() # ...whatever code... end_t

One can have a better control such substitutions using polynomial machinery, reducing a polynomial modulo the ideal gene

One can have a better control such substitutions using polynomial machinery, reducing a polynomial modulo the ideal gene

"==" with symbolics is doing unwanted boolean comparison parameters var('v0 t', domain='positive') generic funtions

Lexicographic order is the default one for tuples. So, you can simply use sorted() function or .sort() method on your li

It is convenient to keep equations in the form expression == 0 and furthermore functions dealing with equations will typ

The thing is that group-theoretic functionality is implemented at large for permutation groups only (via GAP). So, you m

The thing is that group-theoric functionality is implemented at large for permutation groups only (via GAP). So, you may

This question has nothing to do with Sage, and furthermore what is asked is impossible. We have $\log_N(2^{58}) \leq \al

It depends on the type of condition. Any modular condition can be treated similarly to what's done in my answer.

What specific condition?

$3e\equiv 1\pmod5$ means that $e=5k+2$ for some $k$. Then $e$ having $n=71$ bits means $e\in[2^{n-1},2^n-1]$, which tran