Questions - ASKSAGE: Sage Q&A Forum

1k

views

2

answers

no

votes

2024-03-04 19:53:49 +0100 Max Alekseyev

How to solve system of equations in polynomial ring over GF with a different variables

866

views

1

answer

1

vote

2024-04-03 03:45:37 +0100 grhkm

Lazily solving equations in powerseries rings over finite fields

250

views

1

answer

no

votes

2024-04-30 11:58:41 +0100 snowch

Issue porting solve utility from sympy to sagemath

509

views

1

answer

no

votes

2024-09-11 20:37:29 +0100 Max Alekseyev

Splitting of a (1,-1) square matrix into (0,1) and (0,-1) summands satisfying certain conditions

554

views

1

answer

1

vote

2024-10-02 19:48:47 +0100 Afandi_MohAlsh

Change of Coords. in Symbolic Comp.

423

views

1

answer

no

votes

2024-12-27 15:04:54 +0100 dan_fulea

Solving a system by resultant computations

resultant

16k

views

1

answer

no

votes

2025-08-31 19:13:52 +0100 Periodic_1_6

How does sagemath solve Xab+Ya+Yb+Z mod N = 0 knowing X,Y,Z,N without factoring N? Is there a computationally efficient way to solve this?

modular_equation

217 questions

How to solve system of equations in polynomial ring over GF with a different variables

Lazily solving equations in powerseries rings over finite fields

Issue porting solve utility from sympy to sagemath

Splitting of a (1,-1) square matrix into (0,1) and (0,-1) summands satisfying certain conditions

Change of Coords. in Symbolic Comp.

Solving a system by resultant computations

How does sagemath solve Xab+Ya+Yb+Z mod N = 0 knowing X,Y,Z,N without factoring N? Is there a computationally efficient way to solve this?

Contributors

Tags

217 questions

How to solve system of equations in polynomial ring over GF with a different variables

Lazily solving equations in powerseries rings over finite fields

Issue porting solve utility from sympy to sagemath

Splitting of a (1,-1) square matrix into (0,1) and (0,-1) summands satisfying certain conditions

Change of Coords. in Symbolic Comp.

Solving a system by resultant computations

How does sagemath solve X*a*b+Y*a+Y*b+Z mod N = 0 knowing X,Y,Z,N without factoring N? Is there a computationally efficient way to solve this?

Contributors

Tags

How does sagemath solve Xab+Ya+Yb+Z mod N = 0 knowing X,Y,Z,N without factoring N? Is there a computationally efficient way to solve this?